{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1997:JAHSY5UPEVNATMT77FMSP4EUGI","short_pith_number":"pith:JAHSY5UP","canonical_record":{"source":{"id":"quant-ph/9701001","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-01-01T13:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"5aa86e2e0565265243d17420953d88a7aa938002287aaa1bfc7379ef754f5da9","abstract_canon_sha256":"140e9efb27ba9dd67f916adf6288612abe153d46232548510896ba332d780ee6"},"schema_version":"1.0"},"canonical_sha256":"480f2c768f255a09b27ff95927f0943219d2aecdd32c1e255f987158741c1fd8","source":{"kind":"arxiv","id":"quant-ph/9701001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9701001","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9701001v1","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9701001","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"JAHSY5UPEVNA","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"pith_short_16","alias_value":"JAHSY5UPEVNATMT7","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"pith_short_8","alias_value":"JAHSY5UP","created_at":"2026-07-05T00:50:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1997:JAHSY5UPEVNATMT77FMSP4EUGI","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9701001","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-01-01T13:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"5aa86e2e0565265243d17420953d88a7aa938002287aaa1bfc7379ef754f5da9","abstract_canon_sha256":"140e9efb27ba9dd67f916adf6288612abe153d46232548510896ba332d780ee6"},"schema_version":"1.0"},"canonical_sha256":"480f2c768f255a09b27ff95927f0943219d2aecdd32c1e255f987158741c1fd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:35.718915Z","signature_b64":"74kwaVwquwguGJA11MTCK6kO4e+Xq7XP6PPLZAmU0b25cOmzNJrn/yV/tUS3iAjNOstvv3q6BmAILrgUUm/BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"480f2c768f255a09b27ff95927f0943219d2aecdd32c1e255f987158741c1fd8","last_reissued_at":"2026-07-05T00:50:35.718479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:35.718479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9701001","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-05T00:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Or7Dy4nyoEyhzGybzFIV22PARlwdRftg9eNp/Z9/uUqatVF9pGgIFG17IFsEt5jbptqEM5vSzAl9SGzkuWJBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T04:48:06.572928Z"},"content_sha256":"8607c0b6c8171a25e8a81a0fb9129334504137f4e466e0c8687e6e40a1dbf7f8","schema_version":"1.0","event_id":"sha256:8607c0b6c8171a25e8a81a0fb9129334504137f4e466e0c8687e6e40a1dbf7f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1997:JAHSY5UPEVNATMT77FMSP4EUGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strengths and Weaknesses of Quantum Computing","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh Vazirani","submitted_at":"1997-01-01T13:55:07Z","abstract_excerpt":"Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of NP can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random, with probability 1, the class NP cannot be solved on a quantum Turing machine in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9701001","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/9701001/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-05T00:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+giqe8ZXzLEAK2ZaNEjg3wQpUF2L7ZH3kGukyVl/ymorrEm5vWJDB+VnYJoBPQi8lKQ4X3EwiLlcMp9ml9TBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T04:48:06.573350Z"},"content_sha256":"5dcab9a14d3e7e352812c6ec222ee3396c22f5606de51d1f2fec177dfa5d72c3","schema_version":"1.0","event_id":"sha256:5dcab9a14d3e7e352812c6ec222ee3396c22f5606de51d1f2fec177dfa5d72c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAHSY5UPEVNATMT77FMSP4EUGI/bundle.json","state_url":"https://pith.science/pith/JAHSY5UPEVNATMT77FMSP4EUGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAHSY5UPEVNATMT77FMSP4EUGI/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-13T04:48:06Z","links":{"resolver":"https://pith.science/pith/JAHSY5UPEVNATMT77FMSP4EUGI","bundle":"https://pith.science/pith/JAHSY5UPEVNATMT77FMSP4EUGI/bundle.json","state":"https://pith.science/pith/JAHSY5UPEVNATMT77FMSP4EUGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAHSY5UPEVNATMT77FMSP4EUGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1997:JAHSY5UPEVNATMT77FMSP4EUGI","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":"140e9efb27ba9dd67f916adf6288612abe153d46232548510896ba332d780ee6","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1997-01-01T13:55:07Z","title_canon_sha256":"5aa86e2e0565265243d17420953d88a7aa938002287aaa1bfc7379ef754f5da9"},"schema_version":"1.0","source":{"id":"quant-ph/9701001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9701001","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9701001v1","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9701001","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"JAHSY5UPEVNA","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"pith_short_16","alias_value":"JAHSY5UPEVNATMT7","created_at":"2026-07-05T00:50:35Z"},{"alias_kind":"pith_short_8","alias_value":"JAHSY5UP","created_at":"2026-07-05T00:50:35Z"}],"graph_snapshots":[{"event_id":"sha256:5dcab9a14d3e7e352812c6ec222ee3396c22f5606de51d1f2fec177dfa5d72c3","target":"graph","created_at":"2026-07-05T00:50:35Z","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/quant-ph/9701001/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of NP can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random, with probability 1, the class NP cannot be solved on a quantum Turing machine in","authors_text":"Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh Vazirani","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1997-01-01T13:55:07Z","title":"Strengths and Weaknesses of Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9701001","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:8607c0b6c8171a25e8a81a0fb9129334504137f4e466e0c8687e6e40a1dbf7f8","target":"record","created_at":"2026-07-05T00:50:35Z","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":"140e9efb27ba9dd67f916adf6288612abe153d46232548510896ba332d780ee6","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"1997-01-01T13:55:07Z","title_canon_sha256":"5aa86e2e0565265243d17420953d88a7aa938002287aaa1bfc7379ef754f5da9"},"schema_version":"1.0","source":{"id":"quant-ph/9701001","kind":"arxiv","version":1}},"canonical_sha256":"480f2c768f255a09b27ff95927f0943219d2aecdd32c1e255f987158741c1fd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"480f2c768f255a09b27ff95927f0943219d2aecdd32c1e255f987158741c1fd8","first_computed_at":"2026-07-05T00:50:35.718479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:50:35.718479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"74kwaVwquwguGJA11MTCK6kO4e+Xq7XP6PPLZAmU0b25cOmzNJrn/yV/tUS3iAjNOstvv3q6BmAILrgUUm/BDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:50:35.718915Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9701001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8607c0b6c8171a25e8a81a0fb9129334504137f4e466e0c8687e6e40a1dbf7f8","sha256:5dcab9a14d3e7e352812c6ec222ee3396c22f5606de51d1f2fec177dfa5d72c3"],"state_sha256":"a1241ff77d260aba04f7371bc96d8c99cc7f4c43b2a2da5b276003987c433440"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lOa5nIwdvXPAfWdW79Ka5a4N47EjNjhg+OBXu6WKDs6O9d8WyTzRO2FOhIaVx/Cs6k09fvR3MjmiQfnTFlVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T04:48:06.575671Z","bundle_sha256":"f0a259799c0cc70779ed7296317a47dcb77e02bc1116ae77e37feae47778e172"}}