{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RIEL7GMJJFBTH5G5YUU7F6DGAS","short_pith_number":"pith:RIEL7GMJ","canonical_record":{"source":{"id":"2403.18006","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-26T18:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"43b4af10ec1d5ea66a1248e58abc00280c29657d7bf5c0b7b38f19110ff7e39f","abstract_canon_sha256":"50d95cdddaf1ea5e982d028257697c4cb5e571a91d77299f39d273ef788ca516"},"schema_version":"1.0"},"canonical_sha256":"8a08bf9989494333f4ddc529f2f86604bde0a896bb105993314f09bb2c50a93d","source":{"kind":"arxiv","id":"2403.18006","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.18006","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"arxiv_version","alias_value":"2403.18006v4","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18006","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"pith_short_12","alias_value":"RIEL7GMJJFBT","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"pith_short_16","alias_value":"RIEL7GMJJFBTH5G5","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"pith_short_8","alias_value":"RIEL7GMJ","created_at":"2026-07-05T09:35:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RIEL7GMJJFBTH5G5YUU7F6DGAS","target":"record","payload":{"canonical_record":{"source":{"id":"2403.18006","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-26T18:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"43b4af10ec1d5ea66a1248e58abc00280c29657d7bf5c0b7b38f19110ff7e39f","abstract_canon_sha256":"50d95cdddaf1ea5e982d028257697c4cb5e571a91d77299f39d273ef788ca516"},"schema_version":"1.0"},"canonical_sha256":"8a08bf9989494333f4ddc529f2f86604bde0a896bb105993314f09bb2c50a93d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:09.066257Z","signature_b64":"UaLhG1pkhNkVk9zxedD8kCsv9sAFPM2WPUoZsm1FbBhunfaoX2/SadHZ4qmmy/qm8OdEwTA5pjZk+0nLLBJqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a08bf9989494333f4ddc529f2f86604bde0a896bb105993314f09bb2c50a93d","last_reissued_at":"2026-07-05T09:35:09.065801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:09.065801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.18006","source_version":4,"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-05T09:35:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnPV92ggmrHO05v+K6rD+2FVEStIL4Z8OfyjMUWv9kDV6RDXZ/xJELNiFWVI4sMyyXEcFIylY6ghM6ftzuENDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:49:27.936355Z"},"content_sha256":"866339c9485c56b1ea692cb8f6272413c80dbdb2e6cc03bd97a47f3286cc648f","schema_version":"1.0","event_id":"sha256:866339c9485c56b1ea692cb8f6272413c80dbdb2e6cc03bd97a47f3286cc648f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RIEL7GMJJFBTH5G5YUU7F6DGAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast quantum integer multiplication with zero ancillas","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gregory D. Kahanamoku-Meyer, Norman Y. Yao","submitted_at":"2024-03-26T18:00:03Z","abstract_excerpt":"The multiplication of superpositions of numbers is a core operation in many quantum algorithms. The standard method for multiplication (both classical and quantum) has a runtime quadratic in the size of the inputs. Quantum circuits with asymptotically fewer gates have been developed, but generally exhibit large overheads, especially in the number of ancilla qubits. In this work, we introduce a new paradigm for sub-quadratic-time quantum multiplication with zero ancilla qubits -- the only qubits involved are the input and output registers themselves. Our algorithm achieves an asymptotic gate co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18006","kind":"arxiv","version":4},"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/2403.18006/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-05T09:35:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XL2CNOyjLwWaP9dnp0b2JV3SCqPd1GzN+EIZ/ryCpAC7RPmKw9wI+spIrke4u/bMWRKxedADdfFrWMVky0x3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:49:27.936849Z"},"content_sha256":"43670260c19b77964dea9361782df0afec64b0465913af54b8b10b0c99a55534","schema_version":"1.0","event_id":"sha256:43670260c19b77964dea9361782df0afec64b0465913af54b8b10b0c99a55534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIEL7GMJJFBTH5G5YUU7F6DGAS/bundle.json","state_url":"https://pith.science/pith/RIEL7GMJJFBTH5G5YUU7F6DGAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIEL7GMJJFBTH5G5YUU7F6DGAS/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-11T01:49:27Z","links":{"resolver":"https://pith.science/pith/RIEL7GMJJFBTH5G5YUU7F6DGAS","bundle":"https://pith.science/pith/RIEL7GMJJFBTH5G5YUU7F6DGAS/bundle.json","state":"https://pith.science/pith/RIEL7GMJJFBTH5G5YUU7F6DGAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIEL7GMJJFBTH5G5YUU7F6DGAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RIEL7GMJJFBTH5G5YUU7F6DGAS","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":"50d95cdddaf1ea5e982d028257697c4cb5e571a91d77299f39d273ef788ca516","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-26T18:00:03Z","title_canon_sha256":"43b4af10ec1d5ea66a1248e58abc00280c29657d7bf5c0b7b38f19110ff7e39f"},"schema_version":"1.0","source":{"id":"2403.18006","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.18006","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"arxiv_version","alias_value":"2403.18006v4","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18006","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"pith_short_12","alias_value":"RIEL7GMJJFBT","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"pith_short_16","alias_value":"RIEL7GMJJFBTH5G5","created_at":"2026-07-05T09:35:09Z"},{"alias_kind":"pith_short_8","alias_value":"RIEL7GMJ","created_at":"2026-07-05T09:35:09Z"}],"graph_snapshots":[{"event_id":"sha256:43670260c19b77964dea9361782df0afec64b0465913af54b8b10b0c99a55534","target":"graph","created_at":"2026-07-05T09:35:09Z","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/2403.18006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The multiplication of superpositions of numbers is a core operation in many quantum algorithms. The standard method for multiplication (both classical and quantum) has a runtime quadratic in the size of the inputs. Quantum circuits with asymptotically fewer gates have been developed, but generally exhibit large overheads, especially in the number of ancilla qubits. In this work, we introduce a new paradigm for sub-quadratic-time quantum multiplication with zero ancilla qubits -- the only qubits involved are the input and output registers themselves. Our algorithm achieves an asymptotic gate co","authors_text":"Gregory D. Kahanamoku-Meyer, Norman Y. Yao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-26T18:00:03Z","title":"Fast quantum integer multiplication with zero ancillas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18006","kind":"arxiv","version":4},"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:866339c9485c56b1ea692cb8f6272413c80dbdb2e6cc03bd97a47f3286cc648f","target":"record","created_at":"2026-07-05T09:35:09Z","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":"50d95cdddaf1ea5e982d028257697c4cb5e571a91d77299f39d273ef788ca516","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-26T18:00:03Z","title_canon_sha256":"43b4af10ec1d5ea66a1248e58abc00280c29657d7bf5c0b7b38f19110ff7e39f"},"schema_version":"1.0","source":{"id":"2403.18006","kind":"arxiv","version":4}},"canonical_sha256":"8a08bf9989494333f4ddc529f2f86604bde0a896bb105993314f09bb2c50a93d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a08bf9989494333f4ddc529f2f86604bde0a896bb105993314f09bb2c50a93d","first_computed_at":"2026-07-05T09:35:09.065801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:35:09.065801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UaLhG1pkhNkVk9zxedD8kCsv9sAFPM2WPUoZsm1FbBhunfaoX2/SadHZ4qmmy/qm8OdEwTA5pjZk+0nLLBJqDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:35:09.066257Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.18006","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:866339c9485c56b1ea692cb8f6272413c80dbdb2e6cc03bd97a47f3286cc648f","sha256:43670260c19b77964dea9361782df0afec64b0465913af54b8b10b0c99a55534"],"state_sha256":"08861f3b8cd82a580a09cc8510970aa442492ec5371f0c78825d673ae7ed8fec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlAASShC9xZ2QtyX7F35H3kxa674GFGz/MsvnijahCxqtSEvBnPiYVJTbV27l65wSLkbmtD1BzHuq+yG/2PsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:49:27.940608Z","bundle_sha256":"904bdf04f921bbcafd4fc2bf11ad9a44d7739fdfd3505b1974d5abbdbe05dbbf"}}