{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:K6P7BMJIMXIUXHJ7UQF57EA5TS","short_pith_number":"pith:K6P7BMJI","canonical_record":{"source":{"id":"2605.09872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-11T01:58:44Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"43f6712073448e9688011f735262c46b7d7e94e1bd88fa5bdf02040e739b6595","abstract_canon_sha256":"ad40364086ba4d04193562abfcb3552cc8cf3b358ee6af6c16a03c948328f277"},"schema_version":"1.0"},"canonical_sha256":"579ff0b12865d14b9d3fa40bdf901d9cb13d8bb1679c10b1e3b7a1bbe0724c79","source":{"kind":"arxiv","id":"2605.09872","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09872","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09872v2","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09872","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"pith_short_12","alias_value":"K6P7BMJIMXIU","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"pith_short_16","alias_value":"K6P7BMJIMXIUXHJ7","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"pith_short_8","alias_value":"K6P7BMJI","created_at":"2026-05-20T00:03:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:K6P7BMJIMXIUXHJ7UQF57EA5TS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.09872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-11T01:58:44Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"43f6712073448e9688011f735262c46b7d7e94e1bd88fa5bdf02040e739b6595","abstract_canon_sha256":"ad40364086ba4d04193562abfcb3552cc8cf3b358ee6af6c16a03c948328f277"},"schema_version":"1.0"},"canonical_sha256":"579ff0b12865d14b9d3fa40bdf901d9cb13d8bb1679c10b1e3b7a1bbe0724c79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:16.685048Z","signature_b64":"VcSRJgn5wVK+QMe0qRy/IINw0tauZ5EIE3ZZmI/QQWnjBdZL6+Z0L0gKdRQACLK/Oq3y7pNh6SeRdvudLrJoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"579ff0b12865d14b9d3fa40bdf901d9cb13d8bb1679c10b1e3b7a1bbe0724c79","last_reissued_at":"2026-05-20T00:03:16.684239Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:16.684239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.09872","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-20T00:03:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvmS5QOnoJ4j6RrChoL+omqHXj/g9Vg0lQXEz4nV5ks06Wq1ULPSyOUUm7h1nvQchZ8lKhs6pouyXkZON9CDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:35:46.490332Z"},"content_sha256":"573798709b230507dab317947a7a51a093651ba5775c18b923a003662f69899e","schema_version":"1.0","event_id":"sha256:573798709b230507dab317947a7a51a093651ba5775c18b923a003662f69899e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:K6P7BMJIMXIUXHJ7UQF57EA5TS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Prover Interactive Proof Systems with Leakage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Two-prover interactive proof systems can verify NEXP and RE even when the provers leak polynomially many bits to each other.","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Atsuya Hasegawa, Fran\\c{c}ois Le Gall, Vahid R. Asadi","submitted_at":"2026-05-11T01:58:44Z","abstract_excerpt":"It is known that there exist multi-prover interactive protocols ($\\mathsf{MIP}$ protocols) for the complexity class $\\mathsf{NEXP}$, succinct $\\mathsf{MIP}$ protocols for $\\mathsf{NP}$ and multi-prover interactive protocols with shared entanglement ($\\mathsf{MIP}^\\ast$ protocols) for $\\mathsf{RE}$. This extraordinary power of multi-prover interactive proof systems comes from the assumption that provers do not communicate with each other during the protocols. If they are allowed to communicate freely, the setting is the same as in the single-prover case, and the computational power of the syste"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"for any polynomial p, we can construct two-prover one-round MIP and MIP* protocols for NEXP and RE, respectively, that are robust against p(n) bits of leakage.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That existing parallel-repetition theorems continue to hold when the provers are allowed to exchange p(n) bits of information during the repeated rounds.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Two-prover one-round MIP protocols for NEXP and MIP* protocols for RE remain sound against any polynomial bits of leakage between provers.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Two-prover interactive proof systems can verify NEXP and RE even when the provers leak polynomially many bits to each other.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"497098fcc7a43c94d47e6836220bd22f85a6aa10a2f95890adefc94fce620dab"},"source":{"id":"2605.09872","kind":"arxiv","version":2},"verdict":{"id":"d86e12c3-46c7-4fcf-bbfb-57674154f5e0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T05:05:00.675008Z","strongest_claim":"for any polynomial p, we can construct two-prover one-round MIP and MIP* protocols for NEXP and RE, respectively, that are robust against p(n) bits of leakage.","one_line_summary":"Two-prover one-round MIP protocols for NEXP and MIP* protocols for RE remain sound against any polynomial bits of leakage between provers.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That existing parallel-repetition theorems continue to hold when the provers are allowed to exchange p(n) bits of information during the repeated rounds.","pith_extraction_headline":"Two-prover interactive proof systems can verify NEXP and RE even when the provers leak polynomially many bits to each other."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.09872/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T16:34:40.263653Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T12:31:17.380912Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T09:52:03.142167Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e07c44c39f56c824ab87a22397e42a054b2cddcba3c7480fd8193290105d65b1"},"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":"d86e12c3-46c7-4fcf-bbfb-57674154f5e0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBHNTUqaIy76grfpAAPTOhUTVsJL47oOzGU8draQ26hMbsGPjeepvqxMlcBuJsU3TFkzRQNqLXdxceA9Xy1FCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:35:46.490851Z"},"content_sha256":"45dfb381bec7cb4eda085c1b3699b965291f4bdbf97d0e7d4dc9edbc3485de8f","schema_version":"1.0","event_id":"sha256:45dfb381bec7cb4eda085c1b3699b965291f4bdbf97d0e7d4dc9edbc3485de8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6P7BMJIMXIUXHJ7UQF57EA5TS/bundle.json","state_url":"https://pith.science/pith/K6P7BMJIMXIUXHJ7UQF57EA5TS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6P7BMJIMXIUXHJ7UQF57EA5TS/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-05T12:35:46Z","links":{"resolver":"https://pith.science/pith/K6P7BMJIMXIUXHJ7UQF57EA5TS","bundle":"https://pith.science/pith/K6P7BMJIMXIUXHJ7UQF57EA5TS/bundle.json","state":"https://pith.science/pith/K6P7BMJIMXIUXHJ7UQF57EA5TS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6P7BMJIMXIUXHJ7UQF57EA5TS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:K6P7BMJIMXIUXHJ7UQF57EA5TS","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":"ad40364086ba4d04193562abfcb3552cc8cf3b358ee6af6c16a03c948328f277","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-11T01:58:44Z","title_canon_sha256":"43f6712073448e9688011f735262c46b7d7e94e1bd88fa5bdf02040e739b6595"},"schema_version":"1.0","source":{"id":"2605.09872","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09872","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09872v2","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09872","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"pith_short_12","alias_value":"K6P7BMJIMXIU","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"pith_short_16","alias_value":"K6P7BMJIMXIUXHJ7","created_at":"2026-05-20T00:03:16Z"},{"alias_kind":"pith_short_8","alias_value":"K6P7BMJI","created_at":"2026-05-20T00:03:16Z"}],"graph_snapshots":[{"event_id":"sha256:45dfb381bec7cb4eda085c1b3699b965291f4bdbf97d0e7d4dc9edbc3485de8f","target":"graph","created_at":"2026-05-20T00:03:16Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"for any polynomial p, we can construct two-prover one-round MIP and MIP* protocols for NEXP and RE, respectively, that are robust against p(n) bits of leakage."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That existing parallel-repetition theorems continue to hold when the provers are allowed to exchange p(n) bits of information during the repeated rounds."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Two-prover one-round MIP protocols for NEXP and MIP* protocols for RE remain sound against any polynomial bits of leakage between provers."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Two-prover interactive proof systems can verify NEXP and RE even when the provers leak polynomially many bits to each other."}],"snapshot_sha256":"497098fcc7a43c94d47e6836220bd22f85a6aa10a2f95890adefc94fce620dab"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T16:34:40.263653Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T12:31:17.380912Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T09:52:03.142167Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.09872/integrity.json","findings":[],"snapshot_sha256":"e07c44c39f56c824ab87a22397e42a054b2cddcba3c7480fd8193290105d65b1","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is known that there exist multi-prover interactive protocols ($\\mathsf{MIP}$ protocols) for the complexity class $\\mathsf{NEXP}$, succinct $\\mathsf{MIP}$ protocols for $\\mathsf{NP}$ and multi-prover interactive protocols with shared entanglement ($\\mathsf{MIP}^\\ast$ protocols) for $\\mathsf{RE}$. This extraordinary power of multi-prover interactive proof systems comes from the assumption that provers do not communicate with each other during the protocols. If they are allowed to communicate freely, the setting is the same as in the single-prover case, and the computational power of the syste","authors_text":"Atsuya Hasegawa, Fran\\c{c}ois Le Gall, Vahid R. Asadi","cross_cats":["cs.CC"],"headline":"Two-prover interactive proof systems can verify NEXP and RE even when the provers leak polynomially many bits to each other.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-11T01:58:44Z","title":"Multi-Prover Interactive Proof Systems with Leakage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.09872","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T05:05:00.675008Z","id":"d86e12c3-46c7-4fcf-bbfb-57674154f5e0","model_set":{"reader":"grok-4.3"},"one_line_summary":"Two-prover one-round MIP protocols for NEXP and MIP* protocols for RE remain sound against any polynomial bits of leakage between provers.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Two-prover interactive proof systems can verify NEXP and RE even when the provers leak polynomially many bits to each other.","strongest_claim":"for any polynomial p, we can construct two-prover one-round MIP and MIP* protocols for NEXP and RE, respectively, that are robust against p(n) bits of leakage.","weakest_assumption":"That existing parallel-repetition theorems continue to hold when the provers are allowed to exchange p(n) bits of information during the repeated rounds."}},"verdict_id":"d86e12c3-46c7-4fcf-bbfb-57674154f5e0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:573798709b230507dab317947a7a51a093651ba5775c18b923a003662f69899e","target":"record","created_at":"2026-05-20T00:03:16Z","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":"ad40364086ba4d04193562abfcb3552cc8cf3b358ee6af6c16a03c948328f277","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-11T01:58:44Z","title_canon_sha256":"43f6712073448e9688011f735262c46b7d7e94e1bd88fa5bdf02040e739b6595"},"schema_version":"1.0","source":{"id":"2605.09872","kind":"arxiv","version":2}},"canonical_sha256":"579ff0b12865d14b9d3fa40bdf901d9cb13d8bb1679c10b1e3b7a1bbe0724c79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"579ff0b12865d14b9d3fa40bdf901d9cb13d8bb1679c10b1e3b7a1bbe0724c79","first_computed_at":"2026-05-20T00:03:16.684239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:16.684239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VcSRJgn5wVK+QMe0qRy/IINw0tauZ5EIE3ZZmI/QQWnjBdZL6+Z0L0gKdRQACLK/Oq3y7pNh6SeRdvudLrJoBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:16.685048Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.09872","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:573798709b230507dab317947a7a51a093651ba5775c18b923a003662f69899e","sha256:45dfb381bec7cb4eda085c1b3699b965291f4bdbf97d0e7d4dc9edbc3485de8f"],"state_sha256":"8c8ee0fe2e94b8abb8ff4fd7978e37b18ac56522a7fac4e5298f35cb82caff51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dci02Zi8Q1lsXzu0kBTzu16zHzegTT/MIbr0ZgekgxDkTk3e0ArMnhLVoo6N1sIvlCu7qy8c535mfF2um0uDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:35:46.493587Z","bundle_sha256":"498105c0b495121bec0505c6c0fbdeaf3556bb6c9b3c0867d570c04b52cd1057"}}