{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NHJEBIRBARW54XTDSPJFBULYYZ","short_pith_number":"pith:NHJEBIRB","canonical_record":{"source":{"id":"2406.10850","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-06-16T08:42:20Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8c957866698a12af2eea1837da91c242372a4ca76a0363c8cfd03f4537ae6bdf","abstract_canon_sha256":"5640f8124b6c8d8f73eca52e3e3c0ad5399d6fb10f2421c1cc97e566fd5705d0"},"schema_version":"1.0"},"canonical_sha256":"69d240a221046dde5e6393d250d178c659dad7f6a5994a6d92b08bab045f9dc9","source":{"kind":"arxiv","id":"2406.10850","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.10850","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"arxiv_version","alias_value":"2406.10850v2","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10850","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"pith_short_12","alias_value":"NHJEBIRBARW5","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"pith_short_16","alias_value":"NHJEBIRBARW54XTD","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"pith_short_8","alias_value":"NHJEBIRB","created_at":"2026-07-05T11:05:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NHJEBIRBARW54XTDSPJFBULYYZ","target":"record","payload":{"canonical_record":{"source":{"id":"2406.10850","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-06-16T08:42:20Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8c957866698a12af2eea1837da91c242372a4ca76a0363c8cfd03f4537ae6bdf","abstract_canon_sha256":"5640f8124b6c8d8f73eca52e3e3c0ad5399d6fb10f2421c1cc97e566fd5705d0"},"schema_version":"1.0"},"canonical_sha256":"69d240a221046dde5e6393d250d178c659dad7f6a5994a6d92b08bab045f9dc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:33.372142Z","signature_b64":"z0K6dUe/yi1VW/nBepNGd0KpBbMmBUyk7kkc204aV3nCNAKoFvS9bpFo0yeMednFKp75lpsPP5UMJWEYfjsrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69d240a221046dde5e6393d250d178c659dad7f6a5994a6d92b08bab045f9dc9","last_reissued_at":"2026-07-05T11:05:33.371660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:33.371660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.10850","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:05:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcrQK3myZ+22R+LxdXe6xkZdWFGorrlQIr621nQhqs4KkdTTD5jMAOve4/jSPfjaYE6MN81IVzuycSdDqdhdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:25:07.684108Z"},"content_sha256":"04a7f31802a3ade1144391abb772c399eec71c16d67ffca0aa8b0cb6276088cf","schema_version":"1.0","event_id":"sha256:04a7f31802a3ade1144391abb772c399eec71c16d67ffca0aa8b0cb6276088cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NHJEBIRBARW54XTDSPJFBULYYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Column reduced digital nets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Peter Kritzer, Vishnupriya Anupindi","submitted_at":"2024-06-16T08:42:20Z","abstract_excerpt":"Digital nets provide an efficient way to generate integration nodes of quasi-Monte Carlo (QMC) rules. For certain applications, as e.g. in Uncertainty Quantification, we are interested in obtaining a speed-up in computing products of a matrix with the vectors corresponding to the nodes of a QMC rule. In the recent paper \"The fast reduced QMC matrix-vector product\" (J. Comput. Appl. Math. 440, 115642, 2024), a speed up was obtained by using so-called reduced lattices and row reduced digital nets. In this work, we propose a different multiplication algorithm where we exploit the repetitive struc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10850","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.10850/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:05:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qty4+PLlLj6JvWA4RjaTx72oFr+W7afr1Mep6Ra5bZ/w7mAQGZAU7kTxgLa+abI9Z5CmPsBtdTocaWf+Ry9QCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:25:07.684534Z"},"content_sha256":"24a8588b70a1cb2f1dcc95ff9a34bab62766c9345a224c4ac179db1d75ce7973","schema_version":"1.0","event_id":"sha256:24a8588b70a1cb2f1dcc95ff9a34bab62766c9345a224c4ac179db1d75ce7973"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHJEBIRBARW54XTDSPJFBULYYZ/bundle.json","state_url":"https://pith.science/pith/NHJEBIRBARW54XTDSPJFBULYYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHJEBIRBARW54XTDSPJFBULYYZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T17:25:07Z","links":{"resolver":"https://pith.science/pith/NHJEBIRBARW54XTDSPJFBULYYZ","bundle":"https://pith.science/pith/NHJEBIRBARW54XTDSPJFBULYYZ/bundle.json","state":"https://pith.science/pith/NHJEBIRBARW54XTDSPJFBULYYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHJEBIRBARW54XTDSPJFBULYYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NHJEBIRBARW54XTDSPJFBULYYZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5640f8124b6c8d8f73eca52e3e3c0ad5399d6fb10f2421c1cc97e566fd5705d0","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-06-16T08:42:20Z","title_canon_sha256":"8c957866698a12af2eea1837da91c242372a4ca76a0363c8cfd03f4537ae6bdf"},"schema_version":"1.0","source":{"id":"2406.10850","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.10850","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"arxiv_version","alias_value":"2406.10850v2","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10850","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"pith_short_12","alias_value":"NHJEBIRBARW5","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"pith_short_16","alias_value":"NHJEBIRBARW54XTD","created_at":"2026-07-05T11:05:33Z"},{"alias_kind":"pith_short_8","alias_value":"NHJEBIRB","created_at":"2026-07-05T11:05:33Z"}],"graph_snapshots":[{"event_id":"sha256:24a8588b70a1cb2f1dcc95ff9a34bab62766c9345a224c4ac179db1d75ce7973","target":"graph","created_at":"2026-07-05T11:05:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.10850/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Digital nets provide an efficient way to generate integration nodes of quasi-Monte Carlo (QMC) rules. For certain applications, as e.g. in Uncertainty Quantification, we are interested in obtaining a speed-up in computing products of a matrix with the vectors corresponding to the nodes of a QMC rule. In the recent paper \"The fast reduced QMC matrix-vector product\" (J. Comput. Appl. Math. 440, 115642, 2024), a speed up was obtained by using so-called reduced lattices and row reduced digital nets. In this work, we propose a different multiplication algorithm where we exploit the repetitive struc","authors_text":"Peter Kritzer, Vishnupriya Anupindi","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-06-16T08:42:20Z","title":"Column reduced digital nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10850","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:04a7f31802a3ade1144391abb772c399eec71c16d67ffca0aa8b0cb6276088cf","target":"record","created_at":"2026-07-05T11:05:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5640f8124b6c8d8f73eca52e3e3c0ad5399d6fb10f2421c1cc97e566fd5705d0","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-06-16T08:42:20Z","title_canon_sha256":"8c957866698a12af2eea1837da91c242372a4ca76a0363c8cfd03f4537ae6bdf"},"schema_version":"1.0","source":{"id":"2406.10850","kind":"arxiv","version":2}},"canonical_sha256":"69d240a221046dde5e6393d250d178c659dad7f6a5994a6d92b08bab045f9dc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69d240a221046dde5e6393d250d178c659dad7f6a5994a6d92b08bab045f9dc9","first_computed_at":"2026-07-05T11:05:33.371660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:33.371660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z0K6dUe/yi1VW/nBepNGd0KpBbMmBUyk7kkc204aV3nCNAKoFvS9bpFo0yeMednFKp75lpsPP5UMJWEYfjsrBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:33.372142Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.10850","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04a7f31802a3ade1144391abb772c399eec71c16d67ffca0aa8b0cb6276088cf","sha256:24a8588b70a1cb2f1dcc95ff9a34bab62766c9345a224c4ac179db1d75ce7973"],"state_sha256":"345cbbf0463f2d6155231fc9f69aef31bbddde12c973ea3697a915990cbd24ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKRp48Qhwd8h4lYw4TAVQDIHYTkFKxtgoMUOl6iUXTOXP30lm8KE+iAvLJwO4BKYu+WbUhIlXeZdYcCNzx7FBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:25:07.686500Z","bundle_sha256":"a13651fa8802293c35e0e738231b2b0b9df1a04df0e85987e7011b8d7cf93ab9"}}