{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1999:DAPBFYHZCMV2ZQ5IQKPLWLK7CI","short_pith_number":"pith:DAPBFYHZ","canonical_record":{"source":{"id":"quant-ph/9909094","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-09-30T22:24:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"961d7bca0cc674957deb8dc899a2d3692eed2a0c227eb7c0557011a07ba22697","abstract_canon_sha256":"bffb70c7a3451c22382e6679910087e4b4087d429ec68f5037893d70fcf9fd33"},"schema_version":"1.0"},"canonical_sha256":"181e12e0f9132bacc3a8829ebb2d5f123221481ede6794e9875d43c57cbeafa6","source":{"kind":"arxiv","id":"quant-ph/9909094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9909094","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9909094v1","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9909094","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"pith_short_12","alias_value":"DAPBFYHZCMV2","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"pith_short_16","alias_value":"DAPBFYHZCMV2ZQ5I","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"pith_short_8","alias_value":"DAPBFYHZ","created_at":"2026-07-04T14:47:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1999:DAPBFYHZCMV2ZQ5IQKPLWLK7CI","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9909094","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-09-30T22:24:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"961d7bca0cc674957deb8dc899a2d3692eed2a0c227eb7c0557011a07ba22697","abstract_canon_sha256":"bffb70c7a3451c22382e6679910087e4b4087d429ec68f5037893d70fcf9fd33"},"schema_version":"1.0"},"canonical_sha256":"181e12e0f9132bacc3a8829ebb2d5f123221481ede6794e9875d43c57cbeafa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:28.528047Z","signature_b64":"v6huRcFyQMotw0DsOXujsGrUqsYrVkdy8k44IoqkH9xIMO/HnNZycLMPmz73OobgwcA5PEZX+kvvUx5A+udTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181e12e0f9132bacc3a8829ebb2d5f123221481ede6794e9875d43c57cbeafa6","last_reissued_at":"2026-07-04T14:47:28.527687Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:28.527687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9909094","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:47:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysmoqcM9sMfRZZ2gBWATi+16zhQ0TrJVc8SVT2AwniLG8LvE+eTYNC/RcS9I8zVKtfjD7cT3d2DUe9MSsv76BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:49:37.185808Z"},"content_sha256":"46199ad25ce5c83c76d9c73d740005284bf89436d5751eef19e3c4e8d40b9dd4","schema_version":"1.0","event_id":"sha256:46199ad25ce5c83c76d9c73d740005284bf89436d5751eef19e3c4e8d40b9dd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1999:DAPBFYHZCMV2ZQ5IQKPLWLK7CI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Computation and Quadratically Signed Weight Enumerators","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"E. Knill, R. Laflamme","submitted_at":"1999-09-30T22:24:33Z","abstract_excerpt":"We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be cast in terms of promise problems and has two interesting variants. An oracle for the unconstrained variant may be more powerful than quantum computation, while an oracle for a more constrained variant is efficiently solvable in the one-bit model of quantum computation. Thus, problems involving estimation of quadratically signed weight enumerators yield pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9909094","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/9909094/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:47:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WExvEK+2zkzS8b6EyIJH3Ggkn6jSvwRDyQP5ruF4S7iWu7034SOiCrnVBg08e+IzfbtAlLxyAxg2tzPlooSNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:49:37.186348Z"},"content_sha256":"bba253e16971e90837c4ec5d894a3fb295bb5203356cbe22fc5e16f2c8d02a40","schema_version":"1.0","event_id":"sha256:bba253e16971e90837c4ec5d894a3fb295bb5203356cbe22fc5e16f2c8d02a40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAPBFYHZCMV2ZQ5IQKPLWLK7CI/bundle.json","state_url":"https://pith.science/pith/DAPBFYHZCMV2ZQ5IQKPLWLK7CI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAPBFYHZCMV2ZQ5IQKPLWLK7CI/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-11T06:49:37Z","links":{"resolver":"https://pith.science/pith/DAPBFYHZCMV2ZQ5IQKPLWLK7CI","bundle":"https://pith.science/pith/DAPBFYHZCMV2ZQ5IQKPLWLK7CI/bundle.json","state":"https://pith.science/pith/DAPBFYHZCMV2ZQ5IQKPLWLK7CI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAPBFYHZCMV2ZQ5IQKPLWLK7CI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1999:DAPBFYHZCMV2ZQ5IQKPLWLK7CI","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":"bffb70c7a3451c22382e6679910087e4b4087d429ec68f5037893d70fcf9fd33","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"1999-09-30T22:24:33Z","title_canon_sha256":"961d7bca0cc674957deb8dc899a2d3692eed2a0c227eb7c0557011a07ba22697"},"schema_version":"1.0","source":{"id":"quant-ph/9909094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9909094","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9909094v1","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9909094","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"pith_short_12","alias_value":"DAPBFYHZCMV2","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"pith_short_16","alias_value":"DAPBFYHZCMV2ZQ5I","created_at":"2026-07-04T14:47:28Z"},{"alias_kind":"pith_short_8","alias_value":"DAPBFYHZ","created_at":"2026-07-04T14:47:28Z"}],"graph_snapshots":[{"event_id":"sha256:bba253e16971e90837c4ec5d894a3fb295bb5203356cbe22fc5e16f2c8d02a40","target":"graph","created_at":"2026-07-04T14:47:28Z","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/9909094/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be cast in terms of promise problems and has two interesting variants. An oracle for the unconstrained variant may be more powerful than quantum computation, while an oracle for a more constrained variant is efficiently solvable in the one-bit model of quantum computation. Thus, problems involving estimation of quadratically signed weight enumerators yield pro","authors_text":"E. Knill, R. Laflamme","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1999-09-30T22:24:33Z","title":"Quantum Computation and Quadratically Signed Weight Enumerators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9909094","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:46199ad25ce5c83c76d9c73d740005284bf89436d5751eef19e3c4e8d40b9dd4","target":"record","created_at":"2026-07-04T14:47:28Z","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":"bffb70c7a3451c22382e6679910087e4b4087d429ec68f5037893d70fcf9fd33","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"quant-ph","submitted_at":"1999-09-30T22:24:33Z","title_canon_sha256":"961d7bca0cc674957deb8dc899a2d3692eed2a0c227eb7c0557011a07ba22697"},"schema_version":"1.0","source":{"id":"quant-ph/9909094","kind":"arxiv","version":1}},"canonical_sha256":"181e12e0f9132bacc3a8829ebb2d5f123221481ede6794e9875d43c57cbeafa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"181e12e0f9132bacc3a8829ebb2d5f123221481ede6794e9875d43c57cbeafa6","first_computed_at":"2026-07-04T14:47:28.527687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:47:28.527687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v6huRcFyQMotw0DsOXujsGrUqsYrVkdy8k44IoqkH9xIMO/HnNZycLMPmz73OobgwcA5PEZX+kvvUx5A+udTCA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:47:28.528047Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9909094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46199ad25ce5c83c76d9c73d740005284bf89436d5751eef19e3c4e8d40b9dd4","sha256:bba253e16971e90837c4ec5d894a3fb295bb5203356cbe22fc5e16f2c8d02a40"],"state_sha256":"a969cbfe703ac611a3918e389c54999f0f704588bee6f1ff9ff18efff1cd00bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONW//tc8PTtH+fTfqW0gl1mjc+3WKnYk7EaIp5eqiVNZOQ+uFM5rkMgmiEdWXEsz6Va0gQCOJEL15dR93GoKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T06:49:37.190122Z","bundle_sha256":"d14b840d316e52d982f4d2f5a6fa6b2788561d7ae7b122951b8ba791d00a9970"}}