{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z2YZ5HGNJXCW4WBWESIFKIY7O2","short_pith_number":"pith:Z2YZ5HGN","canonical_record":{"source":{"id":"1604.04340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-15T02:54:41Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c91ceb487720f6ca13bd60468addf313004f750bee48b79026a71b4b4e4d0754","abstract_canon_sha256":"cb5789d6c1c1bca003fc6662301d798bf4ee0abe25f8c8d8ecbaec11221a331d"},"schema_version":"1.0"},"canonical_sha256":"ceb19e9ccd4dc56e5836249055231f76abf4ac0b8a72be6866d82f7eff693e36","source":{"kind":"arxiv","id":"1604.04340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04340","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04340v1","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04340","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"Z2YZ5HGNJXCW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z2YZ5HGNJXCW4WBW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z2YZ5HGN","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z2YZ5HGNJXCW4WBWESIFKIY7O2","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-15T02:54:41Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c91ceb487720f6ca13bd60468addf313004f750bee48b79026a71b4b4e4d0754","abstract_canon_sha256":"cb5789d6c1c1bca003fc6662301d798bf4ee0abe25f8c8d8ecbaec11221a331d"},"schema_version":"1.0"},"canonical_sha256":"ceb19e9ccd4dc56e5836249055231f76abf4ac0b8a72be6866d82f7eff693e36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:04.437659Z","signature_b64":"DxMpEhjuVqwpSaeAEaXFYZNCamkUH4Fb+t/HLTUSeCCCV5WAIigtfWwgclFeT+VzbmPk2vegCmL6DmuQ0ZpVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb19e9ccd4dc56e5836249055231f76abf4ac0b8a72be6866d82f7eff693e36","last_reissued_at":"2026-05-18T01:17:04.436897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:04.436897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04340","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-18T01:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grxLqDVjrpMCZht5zTxc1pCk3rRQisvMcsbPUfsmTf1GAA0vmQClLb8ZTBajVE1pOoKZGyDBS0iskN/Qlw2fBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:18:11.502099Z"},"content_sha256":"df743b576ded96c26d4086e83388ce7dbed2e42b2940e275d10067c63c198804","schema_version":"1.0","event_id":"sha256:df743b576ded96c26d4086e83388ce7dbed2e42b2940e275d10067c63c198804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z2YZ5HGNJXCW4WBWESIFKIY7O2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A parallel repetition theorem for all entangled games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Henry Yuen","submitted_at":"2016-04-15T02:54:41Z","abstract_excerpt":"The behavior of games repeated in parallel, when played with quantumly entangled players, has received much attention in recent years. Quantum analogues of Raz's classical parallel repetition theorem have been proved for many special classes of games. However, for general entangled games no parallel repetition theorem was known. We prove that the entangled value of a two-player game $G$ repeated $n$ times in parallel is at most $c_G n^{-1/4} \\log n$ for a constant $c_G$ depending on $G$, provided that the entangled value of $G$ is less than 1. In particular, this gives the first proof that the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04340","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-18T01:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dd4aw8GuCRq9kGmd+OqBDbx+3L2xGWxHV8XYk6g3hDR4pB4TmqYZwLb5UPK2CV4ObDhCNrQ1ZYNuRLW9z7C0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:18:11.502944Z"},"content_sha256":"770f8d6481507f95b6eb9f8ad8590f31877ff38104adce624d29cfa35393cebd","schema_version":"1.0","event_id":"sha256:770f8d6481507f95b6eb9f8ad8590f31877ff38104adce624d29cfa35393cebd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2YZ5HGNJXCW4WBWESIFKIY7O2/bundle.json","state_url":"https://pith.science/pith/Z2YZ5HGNJXCW4WBWESIFKIY7O2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2YZ5HGNJXCW4WBWESIFKIY7O2/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-11T17:18:11Z","links":{"resolver":"https://pith.science/pith/Z2YZ5HGNJXCW4WBWESIFKIY7O2","bundle":"https://pith.science/pith/Z2YZ5HGNJXCW4WBWESIFKIY7O2/bundle.json","state":"https://pith.science/pith/Z2YZ5HGNJXCW4WBWESIFKIY7O2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2YZ5HGNJXCW4WBWESIFKIY7O2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z2YZ5HGNJXCW4WBWESIFKIY7O2","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":"cb5789d6c1c1bca003fc6662301d798bf4ee0abe25f8c8d8ecbaec11221a331d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-15T02:54:41Z","title_canon_sha256":"c91ceb487720f6ca13bd60468addf313004f750bee48b79026a71b4b4e4d0754"},"schema_version":"1.0","source":{"id":"1604.04340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04340","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04340v1","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04340","created_at":"2026-05-18T01:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"Z2YZ5HGNJXCW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z2YZ5HGNJXCW4WBW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z2YZ5HGN","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:770f8d6481507f95b6eb9f8ad8590f31877ff38104adce624d29cfa35393cebd","target":"graph","created_at":"2026-05-18T01:17:04Z","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":"The behavior of games repeated in parallel, when played with quantumly entangled players, has received much attention in recent years. Quantum analogues of Raz's classical parallel repetition theorem have been proved for many special classes of games. However, for general entangled games no parallel repetition theorem was known. We prove that the entangled value of a two-player game $G$ repeated $n$ times in parallel is at most $c_G n^{-1/4} \\log n$ for a constant $c_G$ depending on $G$, provided that the entangled value of $G$ is less than 1. In particular, this gives the first proof that the","authors_text":"Henry Yuen","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-15T02:54:41Z","title":"A parallel repetition theorem for all entangled games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04340","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:df743b576ded96c26d4086e83388ce7dbed2e42b2940e275d10067c63c198804","target":"record","created_at":"2026-05-18T01:17:04Z","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":"cb5789d6c1c1bca003fc6662301d798bf4ee0abe25f8c8d8ecbaec11221a331d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-15T02:54:41Z","title_canon_sha256":"c91ceb487720f6ca13bd60468addf313004f750bee48b79026a71b4b4e4d0754"},"schema_version":"1.0","source":{"id":"1604.04340","kind":"arxiv","version":1}},"canonical_sha256":"ceb19e9ccd4dc56e5836249055231f76abf4ac0b8a72be6866d82f7eff693e36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ceb19e9ccd4dc56e5836249055231f76abf4ac0b8a72be6866d82f7eff693e36","first_computed_at":"2026-05-18T01:17:04.436897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:04.436897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DxMpEhjuVqwpSaeAEaXFYZNCamkUH4Fb+t/HLTUSeCCCV5WAIigtfWwgclFeT+VzbmPk2vegCmL6DmuQ0ZpVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:04.437659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df743b576ded96c26d4086e83388ce7dbed2e42b2940e275d10067c63c198804","sha256:770f8d6481507f95b6eb9f8ad8590f31877ff38104adce624d29cfa35393cebd"],"state_sha256":"310a3a909173f76956232efa75e24b763808cc4910a32e2ce2ffa0e7ccf4c2a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2nNJwpJn6Cx1FkeihHIVKFSlK0+t3FL1NqDH8dc4st4ZQqFIT6rWrBzDAVz/TIeU0XRp/7t6LF95vaFsMKRCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:18:11.515341Z","bundle_sha256":"645421fa1faa629cc924d780a58e45fc956b308c053e9c9ca787804e6ec367f6"}}