{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:27NMVCLL64X64P7OIJ262ZDQPF","short_pith_number":"pith:27NMVCLL","schema_version":"1.0","canonical_sha256":"d7daca896bf72fee3fee4275ed6470797785fcacf1cc5ed5abb9081323e769be","source":{"kind":"arxiv","id":"quant-ph/9806084","version":1},"attestation_state":"computed","paper":{"title":"Fast versions of Shor's quantum factoring algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christof Zalka (T-6 LANL)","submitted_at":"1998-06-24T23:51:37Z","abstract_excerpt":"We present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer multiplication. The quick reader can just read the introduction and the ``Results'' section."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/9806084","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1998-06-24T23:51:37Z","cross_cats_sorted":[],"title_canon_sha256":"8890042c3403782968b20029238e444f8f4c63136137061f0b277a3954e74082","abstract_canon_sha256":"b0d75e25fb2be5d40a5c594ccae07130ef5f638d422272f8e6155e81bc0afe8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:13.176059Z","signature_b64":"zmS+ykVHk9lmD6AUwwoEomBmJWuPAOcwS3raBVbESYnetpvmmC/doBg3DDOZbtPcKvC/0P5lVNENEhDQvYINDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7daca896bf72fee3fee4275ed6470797785fcacf1cc5ed5abb9081323e769be","last_reissued_at":"2026-07-04T14:47:13.175645Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:13.175645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast versions of Shor's quantum factoring algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christof Zalka (T-6 LANL)","submitted_at":"1998-06-24T23:51:37Z","abstract_excerpt":"We present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer multiplication. The quick reader can just read the introduction and the ``Results'' section."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9806084","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/quant-ph/9806084/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9806084","created_at":"2026-07-04T14:47:13.175695+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9806084v1","created_at":"2026-07-04T14:47:13.175695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9806084","created_at":"2026-07-04T14:47:13.175695+00:00"},{"alias_kind":"pith_short_12","alias_value":"27NMVCLL64X6","created_at":"2026-07-04T14:47:13.175695+00:00"},{"alias_kind":"pith_short_16","alias_value":"27NMVCLL64X64P7O","created_at":"2026-07-04T14:47:13.175695+00:00"},{"alias_kind":"pith_short_8","alias_value":"27NMVCLL","created_at":"2026-07-04T14:47:13.175695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.01880","citing_title":"Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes","ref_index":73,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF","json":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF.json","graph_json":"https://pith.science/api/pith-number/27NMVCLL64X64P7OIJ262ZDQPF/graph.json","events_json":"https://pith.science/api/pith-number/27NMVCLL64X64P7OIJ262ZDQPF/events.json","paper":"https://pith.science/paper/27NMVCLL"},"agent_actions":{"view_html":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF","download_json":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF.json","view_paper":"https://pith.science/paper/27NMVCLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9806084&json=true","fetch_graph":"https://pith.science/api/pith-number/27NMVCLL64X64P7OIJ262ZDQPF/graph.json","fetch_events":"https://pith.science/api/pith-number/27NMVCLL64X64P7OIJ262ZDQPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF/action/storage_attestation","attest_author":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF/action/author_attestation","sign_citation":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF/action/citation_signature","submit_replication":"https://pith.science/pith/27NMVCLL64X64P7OIJ262ZDQPF/action/replication_record"}},"created_at":"2026-07-04T14:47:13.175695+00:00","updated_at":"2026-07-04T14:47:13.175695+00:00"}