{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:SC42J4UXRIYSUJK6JGBDVSGV43","short_pith_number":"pith:SC42J4UX","canonical_record":{"source":{"id":"quant-ph/0412187","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-12-23T15:09:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4109c37dc342cdf4346d76e7ddc5ad2283b5aaf0427e33b0696e3b37ae017d16","abstract_canon_sha256":"c28f06b77d8f7f2554dace3bf19d2e43b6d564ecd42f2aa13eee966fefa6a0cc"},"schema_version":"1.0"},"canonical_sha256":"90b9a4f2978a312a255e49823ac8d5e6c9dc4a499abd2f1b36c1e79da43c4603","source":{"kind":"arxiv","id":"quant-ph/0412187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0412187","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0412187v1","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0412187","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"pith_short_12","alias_value":"SC42J4UXRIYS","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"pith_short_16","alias_value":"SC42J4UXRIYSUJK6","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"pith_short_8","alias_value":"SC42J4UX","created_at":"2026-07-04T14:46:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:SC42J4UXRIYSUJK6JGBDVSGV43","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0412187","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-12-23T15:09:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4109c37dc342cdf4346d76e7ddc5ad2283b5aaf0427e33b0696e3b37ae017d16","abstract_canon_sha256":"c28f06b77d8f7f2554dace3bf19d2e43b6d564ecd42f2aa13eee966fefa6a0cc"},"schema_version":"1.0"},"canonical_sha256":"90b9a4f2978a312a255e49823ac8d5e6c9dc4a499abd2f1b36c1e79da43c4603","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:53.547492Z","signature_b64":"Q3QphAjaS1JVXHqkWS+hHO56hBmiKUCRZb/tgAaFo29Yn5pwst6Rj+zeD9D80kGT7njWgykIG9YtuupyxJxXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90b9a4f2978a312a255e49823ac8d5e6c9dc4a499abd2f1b36c1e79da43c4603","last_reissued_at":"2026-07-04T14:46:53.547091Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:53.547091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0412187","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-04T14:46:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmXxQ6RLwpdyMEJli2zP0Jv7qyjOYcImuCt9y0Z0EqzLUSDE3pbYsThtQT0xztqIUJar2tKZtV/sJlmOTLi0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:43:40.031339Z"},"content_sha256":"f9081ae682efbb157b02f55fb811b8d392e572895447e7bbdcb3c2b6824ecbe8","schema_version":"1.0","event_id":"sha256:f9081ae682efbb157b02f55fb811b8d392e572895447e7bbdcb3c2b6824ecbe8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:SC42J4UXRIYSUJK6JGBDVSGV43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Computing, Postselection, and Probabilistic Polynomial-Time","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson","submitted_at":"2004-12-23T15:09:31Z","abstract_excerpt":"I study the class of problems efficiently solvable by a quantum computer, given the ability to \"postselect\" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic Polynomial-Time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. The result also implies, as an easy corollary, a celebrated theorem of Beigel, Reingold, and Spielman that PP is closed under intersection, as well as a generalization of that theorem due to Fortnow and R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0412187","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/0412187/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-04T14:46:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSzEosgaGrXa94E1ynLAeO3fvMGhDGYBitankuNX9mzqCPNtSlVUoqWtpd54iIzo2qSP47u3hnXLnXhynX0hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:43:40.031830Z"},"content_sha256":"1d0910522871ff40c22e6b6f4bf613037f790aa2627b0c6d24d0daaac2ff0252","schema_version":"1.0","event_id":"sha256:1d0910522871ff40c22e6b6f4bf613037f790aa2627b0c6d24d0daaac2ff0252"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/bundle.json","state_url":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SC42J4UXRIYSUJK6JGBDVSGV43/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-04T09:43:40Z","links":{"resolver":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43","bundle":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/bundle.json","state":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SC42J4UXRIYSUJK6JGBDVSGV43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:SC42J4UXRIYSUJK6JGBDVSGV43","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":"c28f06b77d8f7f2554dace3bf19d2e43b6d564ecd42f2aa13eee966fefa6a0cc","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2004-12-23T15:09:31Z","title_canon_sha256":"4109c37dc342cdf4346d76e7ddc5ad2283b5aaf0427e33b0696e3b37ae017d16"},"schema_version":"1.0","source":{"id":"quant-ph/0412187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0412187","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0412187v1","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0412187","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"pith_short_12","alias_value":"SC42J4UXRIYS","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"pith_short_16","alias_value":"SC42J4UXRIYSUJK6","created_at":"2026-07-04T14:46:53Z"},{"alias_kind":"pith_short_8","alias_value":"SC42J4UX","created_at":"2026-07-04T14:46:53Z"}],"graph_snapshots":[{"event_id":"sha256:1d0910522871ff40c22e6b6f4bf613037f790aa2627b0c6d24d0daaac2ff0252","target":"graph","created_at":"2026-07-04T14:46:53Z","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/0412187/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"I study the class of problems efficiently solvable by a quantum computer, given the ability to \"postselect\" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic Polynomial-Time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. The result also implies, as an easy corollary, a celebrated theorem of Beigel, Reingold, and Spielman that PP is closed under intersection, as well as a generalization of that theorem due to Fortnow and R","authors_text":"Scott Aaronson","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2004-12-23T15:09:31Z","title":"Quantum Computing, Postselection, and Probabilistic Polynomial-Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0412187","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:f9081ae682efbb157b02f55fb811b8d392e572895447e7bbdcb3c2b6824ecbe8","target":"record","created_at":"2026-07-04T14:46:53Z","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":"c28f06b77d8f7f2554dace3bf19d2e43b6d564ecd42f2aa13eee966fefa6a0cc","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"2004-12-23T15:09:31Z","title_canon_sha256":"4109c37dc342cdf4346d76e7ddc5ad2283b5aaf0427e33b0696e3b37ae017d16"},"schema_version":"1.0","source":{"id":"quant-ph/0412187","kind":"arxiv","version":1}},"canonical_sha256":"90b9a4f2978a312a255e49823ac8d5e6c9dc4a499abd2f1b36c1e79da43c4603","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90b9a4f2978a312a255e49823ac8d5e6c9dc4a499abd2f1b36c1e79da43c4603","first_computed_at":"2026-07-04T14:46:53.547091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:46:53.547091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q3QphAjaS1JVXHqkWS+hHO56hBmiKUCRZb/tgAaFo29Yn5pwst6Rj+zeD9D80kGT7njWgykIG9YtuupyxJxXDw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:46:53.547492Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0412187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9081ae682efbb157b02f55fb811b8d392e572895447e7bbdcb3c2b6824ecbe8","sha256:1d0910522871ff40c22e6b6f4bf613037f790aa2627b0c6d24d0daaac2ff0252"],"state_sha256":"9c1c8545dfa37c482e85a2145556e1925886c408a76c957c10501e1072ea1877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMQ9Nvo3miQHbCIaijSHNBKK16lfUqjRjBYFQrNxi0kQOiQW00OuxRmUoR1oNdSaEKorvJNfN7TjVL90jWQAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:43:40.035605Z","bundle_sha256":"f440a0effc3591015c52751b65f4fa7c687ba41caf39356fe5f9efeb9b1a9310"}}