{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QMSD5CAQXQG22EBEINZ4C5WI5E","short_pith_number":"pith:QMSD5CAQ","canonical_record":{"source":{"id":"2506.00132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-30T18:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"ea81516a4cf89b3f8a47d91a33d385d88c09a96c999b287ae09478b8fac4a397","abstract_canon_sha256":"438b22943cbc75622f8cb8675e1bdfd786bb43348041cf98e7d1dea2c48f00a7"},"schema_version":"1.0"},"canonical_sha256":"83243e8810bc0dad10244373c176c8e9309fb85318aba7faa5fbb3c3e8c098a4","source":{"kind":"arxiv","id":"2506.00132","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00132","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00132v1","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00132","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"QMSD5CAQXQG2","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"pith_short_16","alias_value":"QMSD5CAQXQG22EBE","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"pith_short_8","alias_value":"QMSD5CAQ","created_at":"2026-07-05T11:13:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QMSD5CAQXQG22EBEINZ4C5WI5E","target":"record","payload":{"canonical_record":{"source":{"id":"2506.00132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-30T18:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"ea81516a4cf89b3f8a47d91a33d385d88c09a96c999b287ae09478b8fac4a397","abstract_canon_sha256":"438b22943cbc75622f8cb8675e1bdfd786bb43348041cf98e7d1dea2c48f00a7"},"schema_version":"1.0"},"canonical_sha256":"83243e8810bc0dad10244373c176c8e9309fb85318aba7faa5fbb3c3e8c098a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:29.467412Z","signature_b64":"Stp4KUQY8gs38ThDH+WPELATSw5wVlBhWqLQZNrJTIiYaHNipHEw3TLLuPRnRBw9Pwmg0gWnmLJBrRI+C6jADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83243e8810bc0dad10244373c176c8e9309fb85318aba7faa5fbb3c3e8c098a4","last_reissued_at":"2026-07-05T11:13:29.466988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:29.466988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.00132","source_version":1,"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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ytGzkR5NmolopYhFt3qm38MC6FHuqCISREV61lPnxqHPJ7TgCO5MHE0HinMLhkHTZWu9BeiLOBq8v9K2xdaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:12:12.598093Z"},"content_sha256":"ad28c8c25bf77afe2cba394e79d5a8e8eceaf861af1974227d536df2ff6bc959","schema_version":"1.0","event_id":"sha256:ad28c8c25bf77afe2cba394e79d5a8e8eceaf861af1974227d536df2ff6bc959"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QMSD5CAQXQG22EBEINZ4C5WI5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Productionizing Quantum Mass Production","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nathan Wiebe, Tanuj Khattar, William J. Huggins","submitted_at":"2025-05-30T18:10:50Z","abstract_excerpt":"For many practical applications of quantum computing, the most costly steps involve coherently accessing classical data. We help address this challenge by applying mass production techniques, which can reduce the cost of applying an operation multiple times in parallel. We combine these techniques with modern approaches for classical data loading based on \"quantum read-only memory\" (QROM). We find that we can polynomially reduce the total number of gates required for data loading, but we find no advantage in cost models that only count the number of non-Clifford gates. Furthermore, for realist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00132","kind":"arxiv","version":1},"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/2506.00132/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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13UMYvh9QtAWYA/CNq6HskMOzj/gh6xbnx+gDA4DfOH2j5nf54ctahqFJ4Jmk+I+yIc4XeTkD32sKMyDBnERDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:12:12.598581Z"},"content_sha256":"024352dac1ced33c975386de75105f2e65b7d547c03fb1002455ed52c67cef94","schema_version":"1.0","event_id":"sha256:024352dac1ced33c975386de75105f2e65b7d547c03fb1002455ed52c67cef94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/bundle.json","state_url":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/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-08-10T03:12:12Z","links":{"resolver":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E","bundle":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/bundle.json","state":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QMSD5CAQXQG22EBEINZ4C5WI5E","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":"438b22943cbc75622f8cb8675e1bdfd786bb43348041cf98e7d1dea2c48f00a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-30T18:10:50Z","title_canon_sha256":"ea81516a4cf89b3f8a47d91a33d385d88c09a96c999b287ae09478b8fac4a397"},"schema_version":"1.0","source":{"id":"2506.00132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00132","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00132v1","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00132","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"QMSD5CAQXQG2","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"pith_short_16","alias_value":"QMSD5CAQXQG22EBE","created_at":"2026-07-05T11:13:29Z"},{"alias_kind":"pith_short_8","alias_value":"QMSD5CAQ","created_at":"2026-07-05T11:13:29Z"}],"graph_snapshots":[{"event_id":"sha256:024352dac1ced33c975386de75105f2e65b7d547c03fb1002455ed52c67cef94","target":"graph","created_at":"2026-07-05T11:13:29Z","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/2506.00132/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For many practical applications of quantum computing, the most costly steps involve coherently accessing classical data. We help address this challenge by applying mass production techniques, which can reduce the cost of applying an operation multiple times in parallel. We combine these techniques with modern approaches for classical data loading based on \"quantum read-only memory\" (QROM). We find that we can polynomially reduce the total number of gates required for data loading, but we find no advantage in cost models that only count the number of non-Clifford gates. Furthermore, for realist","authors_text":"Nathan Wiebe, Tanuj Khattar, William J. Huggins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-30T18:10:50Z","title":"Productionizing Quantum Mass Production"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00132","kind":"arxiv","version":1},"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:ad28c8c25bf77afe2cba394e79d5a8e8eceaf861af1974227d536df2ff6bc959","target":"record","created_at":"2026-07-05T11:13:29Z","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":"438b22943cbc75622f8cb8675e1bdfd786bb43348041cf98e7d1dea2c48f00a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-30T18:10:50Z","title_canon_sha256":"ea81516a4cf89b3f8a47d91a33d385d88c09a96c999b287ae09478b8fac4a397"},"schema_version":"1.0","source":{"id":"2506.00132","kind":"arxiv","version":1}},"canonical_sha256":"83243e8810bc0dad10244373c176c8e9309fb85318aba7faa5fbb3c3e8c098a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83243e8810bc0dad10244373c176c8e9309fb85318aba7faa5fbb3c3e8c098a4","first_computed_at":"2026-07-05T11:13:29.466988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:29.466988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Stp4KUQY8gs38ThDH+WPELATSw5wVlBhWqLQZNrJTIiYaHNipHEw3TLLuPRnRBw9Pwmg0gWnmLJBrRI+C6jADg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:29.467412Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad28c8c25bf77afe2cba394e79d5a8e8eceaf861af1974227d536df2ff6bc959","sha256:024352dac1ced33c975386de75105f2e65b7d547c03fb1002455ed52c67cef94"],"state_sha256":"c790af90a17a79f004568f1719f58acd1e3031b09ed356d2a3e68a60f0b7dc42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMUOht/A9HAdf6DKwP1w84VYxuAoR+0ynBMO1xWGk93ywuNjA22ecY3TP7FIwjGVQMNXR3pHHj735CwgFwAEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:12:12.602527Z","bundle_sha256":"b9497b50f05c19078d36a0ae7b332f9c0ea735f28b7debcf67c95acfe001d2fa"}}