{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1995:ZLMNZ6Y6BUIULQEKQMCAXVDMRL","short_pith_number":"pith:ZLMNZ6Y6","canonical_record":{"source":{"id":"quant-ph/9508027","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1995-08-30T14:11:00Z","cross_cats_sorted":[],"title_canon_sha256":"d8fe5f350321096e82ab127d847b069624995d67479f85be05ec041e12360149","abstract_canon_sha256":"245a91909f4fa01e4bf07c0aa587639e46bd0bf67794a41f48cf771356d13d4d"},"schema_version":"1.0"},"canonical_sha256":"cad8dcfb1e0d1145c08a83040bd46c8ae1bdf13852a09ec3c8fb2288dd508875","source":{"kind":"arxiv","id":"quant-ph/9508027","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9508027","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9508027v2","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9508027","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZLMNZ6Y6BUIU","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZLMNZ6Y6BUIULQEK","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZLMNZ6Y6","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1995:ZLMNZ6Y6BUIULQEKQMCAXVDMRL","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9508027","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1995-08-30T14:11:00Z","cross_cats_sorted":[],"title_canon_sha256":"d8fe5f350321096e82ab127d847b069624995d67479f85be05ec041e12360149","abstract_canon_sha256":"245a91909f4fa01e4bf07c0aa587639e46bd0bf67794a41f48cf771356d13d4d"},"schema_version":"1.0"},"canonical_sha256":"cad8dcfb1e0d1145c08a83040bd46c8ae1bdf13852a09ec3c8fb2288dd508875","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:31.503206Z","signature_b64":"+ou4JJKFrivgXP3MnhpvzChcjFdHaucvu0BlcErPvqYLpBMaUE03As7xEkIEt938c3ylf6U+A6PDpPpYwlJEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cad8dcfb1e0d1145c08a83040bd46c8ae1bdf13852a09ec3c8fb2288dd508875","last_reissued_at":"2026-05-18T00:50:31.502398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:31.502398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9508027","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-05-18T00:50:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7UV67q78t/fcSGi5bM0Ytp+TrFGQxeeIHuY3e+iVR1L5WA4Uafwm7gFo7RVhR7+knN5VYVQgqYZrsO80Zb1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:58:03.329577Z"},"content_sha256":"97609d3610cfb7e99643112c441e25f50aa54ed215308efee796cb2e1ebb0355","schema_version":"1.0","event_id":"sha256:97609d3610cfb7e99643112c441e25f50aa54ed215308efee796cb2e1ebb0355"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1995:ZLMNZ6Y6BUIULQEKQMCAXVDMRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter W. Shor (AT&T Research)","submitted_at":"1995-08-30T14:11:00Z","abstract_excerpt":"A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9508027","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":""},"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-05-18T00:50:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+y//Ri4Gt9gVFR2uuxOU9VmdJP3SPMD1deZPHLTJLmb7E6sAwCRRdhEyqrkKUihYV+lW+MxuLvosLXZO6W9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:58:03.330203Z"},"content_sha256":"7526f324a963859003c0f2c4a5bcf6560bf7b8c659db635385bc60f798096874","schema_version":"1.0","event_id":"sha256:7526f324a963859003c0f2c4a5bcf6560bf7b8c659db635385bc60f798096874"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLMNZ6Y6BUIULQEKQMCAXVDMRL/bundle.json","state_url":"https://pith.science/pith/ZLMNZ6Y6BUIULQEKQMCAXVDMRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLMNZ6Y6BUIULQEKQMCAXVDMRL/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-05-26T21:58:03Z","links":{"resolver":"https://pith.science/pith/ZLMNZ6Y6BUIULQEKQMCAXVDMRL","bundle":"https://pith.science/pith/ZLMNZ6Y6BUIULQEKQMCAXVDMRL/bundle.json","state":"https://pith.science/pith/ZLMNZ6Y6BUIULQEKQMCAXVDMRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLMNZ6Y6BUIULQEKQMCAXVDMRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1995:ZLMNZ6Y6BUIULQEKQMCAXVDMRL","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":"245a91909f4fa01e4bf07c0aa587639e46bd0bf67794a41f48cf771356d13d4d","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1995-08-30T14:11:00Z","title_canon_sha256":"d8fe5f350321096e82ab127d847b069624995d67479f85be05ec041e12360149"},"schema_version":"1.0","source":{"id":"quant-ph/9508027","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9508027","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9508027v2","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9508027","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZLMNZ6Y6BUIU","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZLMNZ6Y6BUIULQEK","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZLMNZ6Y6","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:7526f324a963859003c0f2c4a5bcf6560bf7b8c659db635385bc60f798096874","target":"graph","created_at":"2026-05-18T00:50:31Z","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"},"paper":{"abstract_excerpt":"A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical ","authors_text":"Peter W. Shor (AT&T Research)","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1995-08-30T14:11:00Z","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9508027","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:97609d3610cfb7e99643112c441e25f50aa54ed215308efee796cb2e1ebb0355","target":"record","created_at":"2026-05-18T00:50:31Z","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":"245a91909f4fa01e4bf07c0aa587639e46bd0bf67794a41f48cf771356d13d4d","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1995-08-30T14:11:00Z","title_canon_sha256":"d8fe5f350321096e82ab127d847b069624995d67479f85be05ec041e12360149"},"schema_version":"1.0","source":{"id":"quant-ph/9508027","kind":"arxiv","version":2}},"canonical_sha256":"cad8dcfb1e0d1145c08a83040bd46c8ae1bdf13852a09ec3c8fb2288dd508875","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cad8dcfb1e0d1145c08a83040bd46c8ae1bdf13852a09ec3c8fb2288dd508875","first_computed_at":"2026-05-18T00:50:31.502398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:31.502398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ou4JJKFrivgXP3MnhpvzChcjFdHaucvu0BlcErPvqYLpBMaUE03As7xEkIEt938c3ylf6U+A6PDpPpYwlJEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:31.503206Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9508027","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97609d3610cfb7e99643112c441e25f50aa54ed215308efee796cb2e1ebb0355","sha256:7526f324a963859003c0f2c4a5bcf6560bf7b8c659db635385bc60f798096874"],"state_sha256":"fe21be62d1d1dc1b03a8e1ecc0d148b1c8c05c19c6f3b67fb8ce18d54b0b7a88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kFe4TmMmj4BM47C2LYIvZLH5BhffZ5DaDZErdcSI9w0klYhtAL2fTPWPBjSf/8jDoDTfcdLYkepOTLtbFIsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:58:03.333034Z","bundle_sha256":"1e6de849ed3c72390c03012a0f5eb4803b4d77a8a813370b95187f845dadb845"}}