{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JR4QAELRP47B53Y5P3YWOP3STK","short_pith_number":"pith:JR4QAELR","canonical_record":{"source":{"id":"1412.8671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-30T16:13:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"76c95cc654854da5dca2230839d2bc7deb35d7f4904711280d017d1397fc3c6f","abstract_canon_sha256":"095333a8877f109a77a0b679ea316f2e2ca04adaed6bc713953a2fcca91dba95"},"schema_version":"1.0"},"canonical_sha256":"4c790011717f3e1eef1d7ef1673f729a95e3338d505579606e240383e2da9730","source":{"kind":"arxiv","id":"1412.8671","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8671","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8671v2","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8671","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"JR4QAELRP47B","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JR4QAELRP47B53Y5","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JR4QAELR","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JR4QAELRP47B53Y5P3YWOP3STK","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-30T16:13:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"76c95cc654854da5dca2230839d2bc7deb35d7f4904711280d017d1397fc3c6f","abstract_canon_sha256":"095333a8877f109a77a0b679ea316f2e2ca04adaed6bc713953a2fcca91dba95"},"schema_version":"1.0"},"canonical_sha256":"4c790011717f3e1eef1d7ef1673f729a95e3338d505579606e240383e2da9730","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:24.261377Z","signature_b64":"DWQNhMAOc7aDczR6+0Afg/bgNE8SLC7gIS9R6zNNzywT4Ol9rOus9IcRsnoGQ/ICRmGtrXmPLPJvJEkIPyj+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c790011717f3e1eef1d7ef1673f729a95e3338d505579606e240383e2da9730","last_reissued_at":"2026-05-18T01:33:24.260853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:24.260853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8671","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-18T01:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9q6yjMo8wCxl8gMxm4mNeDZkenvj1qMoWDeXHWDXgpgBgcT49QPfSqFnREhaRtjFxCPuAbT/6oB49uaD3JwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:53:08.448043Z"},"content_sha256":"f7fa5ba9399babf9498803967733804b755f09d8a54de1ad2f636e04094e0547","schema_version":"1.0","event_id":"sha256:f7fa5ba9399babf9498803967733804b755f09d8a54de1ad2f636e04094e0547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JR4QAELRP47B53Y5P3YWOP3STK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation in generalised probabilistic theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ciar\\'an M. Lee, Jonathan Barrett","submitted_at":"2014-12-30T16:13:30Z","abstract_excerpt":"From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that BQP is in AWPP. This work investigates limits on computational power that are imposed by physical principles. To this end, we define a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and ask: what is the minimal set of physical assumptions under which the above inclusion still holds? "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8671","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-18T01:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2io3pBwrMY5b/0xI4w7z+cVfvwy+ZAu9F2ohQYkym2ItfkKU8NF//LxFHzqS26vqzCVkDaz4KsMF0NDdKChyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:53:08.448740Z"},"content_sha256":"d19e86ac606fbb528b3b11880594661341900abce6e223ce1eab038c1a99bd28","schema_version":"1.0","event_id":"sha256:d19e86ac606fbb528b3b11880594661341900abce6e223ce1eab038c1a99bd28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JR4QAELRP47B53Y5P3YWOP3STK/bundle.json","state_url":"https://pith.science/pith/JR4QAELRP47B53Y5P3YWOP3STK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JR4QAELRP47B53Y5P3YWOP3STK/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-26T00:53:08Z","links":{"resolver":"https://pith.science/pith/JR4QAELRP47B53Y5P3YWOP3STK","bundle":"https://pith.science/pith/JR4QAELRP47B53Y5P3YWOP3STK/bundle.json","state":"https://pith.science/pith/JR4QAELRP47B53Y5P3YWOP3STK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JR4QAELRP47B53Y5P3YWOP3STK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JR4QAELRP47B53Y5P3YWOP3STK","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":"095333a8877f109a77a0b679ea316f2e2ca04adaed6bc713953a2fcca91dba95","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-30T16:13:30Z","title_canon_sha256":"76c95cc654854da5dca2230839d2bc7deb35d7f4904711280d017d1397fc3c6f"},"schema_version":"1.0","source":{"id":"1412.8671","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8671","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8671v2","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8671","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"JR4QAELRP47B","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JR4QAELRP47B53Y5","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JR4QAELR","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:d19e86ac606fbb528b3b11880594661341900abce6e223ce1eab038c1a99bd28","target":"graph","created_at":"2026-05-18T01:33:24Z","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":"From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that BQP is in AWPP. This work investigates limits on computational power that are imposed by physical principles. To this end, we define a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and ask: what is the minimal set of physical assumptions under which the above inclusion still holds? ","authors_text":"Ciar\\'an M. Lee, Jonathan Barrett","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-30T16:13:30Z","title":"Computation in generalised probabilistic theories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8671","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:f7fa5ba9399babf9498803967733804b755f09d8a54de1ad2f636e04094e0547","target":"record","created_at":"2026-05-18T01:33:24Z","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":"095333a8877f109a77a0b679ea316f2e2ca04adaed6bc713953a2fcca91dba95","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-30T16:13:30Z","title_canon_sha256":"76c95cc654854da5dca2230839d2bc7deb35d7f4904711280d017d1397fc3c6f"},"schema_version":"1.0","source":{"id":"1412.8671","kind":"arxiv","version":2}},"canonical_sha256":"4c790011717f3e1eef1d7ef1673f729a95e3338d505579606e240383e2da9730","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c790011717f3e1eef1d7ef1673f729a95e3338d505579606e240383e2da9730","first_computed_at":"2026-05-18T01:33:24.260853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:24.260853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DWQNhMAOc7aDczR6+0Afg/bgNE8SLC7gIS9R6zNNzywT4Ol9rOus9IcRsnoGQ/ICRmGtrXmPLPJvJEkIPyj+Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:24.261377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8671","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7fa5ba9399babf9498803967733804b755f09d8a54de1ad2f636e04094e0547","sha256:d19e86ac606fbb528b3b11880594661341900abce6e223ce1eab038c1a99bd28"],"state_sha256":"8818a3466830c6b2ae86066234d07367330e28abcafaa2939d3efd0db5dff91a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHNrbZiK6osOQeFLWwuouWr3SkcDj0DgMgH211wMRQ3YBxSG7dPWrY3Re4u9JUHcp1C2AurI3How/for9grgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:53:08.452049Z","bundle_sha256":"13f439357f319f0aaaa6f8fca27921a518a415fb872c6ae13dd2ffca62815a52"}}