{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AZKC7M3PR3XRWJBTJR422BNDRI","short_pith_number":"pith:AZKC7M3P","canonical_record":{"source":{"id":"1301.2729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-12T23:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"fed9d259192d07f3d88974a0f870913647e24153d5a9b4b6ed10f2d4b7922b5d","abstract_canon_sha256":"3c1e0fb04dffb5fab75fa4fa346336ad93a8e11b02685029c57bee02334b2442"},"schema_version":"1.0"},"canonical_sha256":"06542fb36f8eef1b24334c79ad05a38a008173a774dc7f628b2475d1c88e0216","source":{"kind":"arxiv","id":"1301.2729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2729","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2729v1","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2729","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"pith_short_12","alias_value":"AZKC7M3PR3XR","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AZKC7M3PR3XRWJBT","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AZKC7M3P","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AZKC7M3PR3XRWJBTJR422BNDRI","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-12T23:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"fed9d259192d07f3d88974a0f870913647e24153d5a9b4b6ed10f2d4b7922b5d","abstract_canon_sha256":"3c1e0fb04dffb5fab75fa4fa346336ad93a8e11b02685029c57bee02334b2442"},"schema_version":"1.0"},"canonical_sha256":"06542fb36f8eef1b24334c79ad05a38a008173a774dc7f628b2475d1c88e0216","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:35.423372Z","signature_b64":"mduIJNhnitk/v0FaWy+WeqL9hkCitLbk4MND+BiJsgdcalTaIfEymyMDxNMS50N45deqtQT544x2hZNbj9EDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06542fb36f8eef1b24334c79ad05a38a008173a774dc7f628b2475d1c88e0216","last_reissued_at":"2026-05-18T03:36:35.422643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:35.422643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2729","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-05-18T03:36:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCi9kDX+ZYBYL90X/gNfxgxZRoLVh2Sn+6sd6hWuJADQalxT9pTAn9zRiA4jt/EeA5pPSV532eeXInGuZVOpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:48:29.105372Z"},"content_sha256":"9b9e1ba0b881303d4b1b92512acf479fd3aebf4e87bfab67eab4c8d3ef98beee","schema_version":"1.0","event_id":"sha256:9b9e1ba0b881303d4b1b92512acf479fd3aebf4e87bfab67eab4c8d3ef98beee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AZKC7M3PR3XRWJBTJR422BNDRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Power of Many One-Bit Provers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Johan H{\\aa}stad, Per Austrin, Rafael Pass","submitted_at":"2013-01-12T23:02:05Z","abstract_excerpt":"We study the class of languages, denoted by $\\MIP[k, 1-\\epsilon, s]$, which have $k$-prover games where each prover just sends a \\emph{single} bit, with completeness $1-\\epsilon$ and soundness error $s$. For the case that $k=1$ (i.e., for the case of interactive proofs), Goldreich, Vadhan and Wigderson ({\\em Computational Complexity'02}) demonstrate that $\\SZK$ exactly characterizes languages having 1-bit proof systems with\"non-trivial\" soundness (i.e., $1/2 < s \\leq 1-2\\epsilon$). We demonstrate that for the case that $k\\geq 2$, 1-bit $k$-prover games exhibit a significantly richer structure:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2729","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":""},"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-18T03:36:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLCW1v/Y31nevxqOGor9C/IzZ1IbXHqyjfOyOyGASnUrr+PysHwwWQNtWhcBn74bVjKnfH3wVGM/xEOHCL2PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:48:29.105735Z"},"content_sha256":"817dfbc6f744537718bb0916d58e0d96ab96c56a7bcdcec91da635dcc3296b2c","schema_version":"1.0","event_id":"sha256:817dfbc6f744537718bb0916d58e0d96ab96c56a7bcdcec91da635dcc3296b2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZKC7M3PR3XRWJBTJR422BNDRI/bundle.json","state_url":"https://pith.science/pith/AZKC7M3PR3XRWJBTJR422BNDRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZKC7M3PR3XRWJBTJR422BNDRI/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-06-30T03:48:29Z","links":{"resolver":"https://pith.science/pith/AZKC7M3PR3XRWJBTJR422BNDRI","bundle":"https://pith.science/pith/AZKC7M3PR3XRWJBTJR422BNDRI/bundle.json","state":"https://pith.science/pith/AZKC7M3PR3XRWJBTJR422BNDRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZKC7M3PR3XRWJBTJR422BNDRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AZKC7M3PR3XRWJBTJR422BNDRI","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":"3c1e0fb04dffb5fab75fa4fa346336ad93a8e11b02685029c57bee02334b2442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-12T23:02:05Z","title_canon_sha256":"fed9d259192d07f3d88974a0f870913647e24153d5a9b4b6ed10f2d4b7922b5d"},"schema_version":"1.0","source":{"id":"1301.2729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2729","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2729v1","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2729","created_at":"2026-05-18T03:36:35Z"},{"alias_kind":"pith_short_12","alias_value":"AZKC7M3PR3XR","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AZKC7M3PR3XRWJBT","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AZKC7M3P","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:817dfbc6f744537718bb0916d58e0d96ab96c56a7bcdcec91da635dcc3296b2c","target":"graph","created_at":"2026-05-18T03:36: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"},"paper":{"abstract_excerpt":"We study the class of languages, denoted by $\\MIP[k, 1-\\epsilon, s]$, which have $k$-prover games where each prover just sends a \\emph{single} bit, with completeness $1-\\epsilon$ and soundness error $s$. For the case that $k=1$ (i.e., for the case of interactive proofs), Goldreich, Vadhan and Wigderson ({\\em Computational Complexity'02}) demonstrate that $\\SZK$ exactly characterizes languages having 1-bit proof systems with\"non-trivial\" soundness (i.e., $1/2 < s \\leq 1-2\\epsilon$). We demonstrate that for the case that $k\\geq 2$, 1-bit $k$-prover games exhibit a significantly richer structure:","authors_text":"Johan H{\\aa}stad, Per Austrin, Rafael Pass","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-12T23:02:05Z","title":"On the Power of Many One-Bit Provers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2729","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:9b9e1ba0b881303d4b1b92512acf479fd3aebf4e87bfab67eab4c8d3ef98beee","target":"record","created_at":"2026-05-18T03:36: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":"3c1e0fb04dffb5fab75fa4fa346336ad93a8e11b02685029c57bee02334b2442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-12T23:02:05Z","title_canon_sha256":"fed9d259192d07f3d88974a0f870913647e24153d5a9b4b6ed10f2d4b7922b5d"},"schema_version":"1.0","source":{"id":"1301.2729","kind":"arxiv","version":1}},"canonical_sha256":"06542fb36f8eef1b24334c79ad05a38a008173a774dc7f628b2475d1c88e0216","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06542fb36f8eef1b24334c79ad05a38a008173a774dc7f628b2475d1c88e0216","first_computed_at":"2026-05-18T03:36:35.422643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:35.422643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mduIJNhnitk/v0FaWy+WeqL9hkCitLbk4MND+BiJsgdcalTaIfEymyMDxNMS50N45deqtQT544x2hZNbj9EDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:35.423372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b9e1ba0b881303d4b1b92512acf479fd3aebf4e87bfab67eab4c8d3ef98beee","sha256:817dfbc6f744537718bb0916d58e0d96ab96c56a7bcdcec91da635dcc3296b2c"],"state_sha256":"4d7e47aafe6d3d5f6676021f98521551d5e8e9dbed78d6ca422a72d9e0771116"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i73o4u5mldj2Dg+7sdLqEPomIy1BQ2brlnHNtcSdzEppnbRqNC1EmwGTeztjIMsriVHcAlmeGH6m5ci011jEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T03:48:29.107587Z","bundle_sha256":"115ed9c830c1f6b475729e18efd511e2e912d9d4c4d76261b136ed9f019c7e1d"}}