{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V2Z5CUKIIIJ6HNKP275UQIUOR4","short_pith_number":"pith:V2Z5CUKI","canonical_record":{"source":{"id":"1901.11105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-30T21:18:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92a1e9236c8e1384ca08811952f323af692536823d756e18a3e7b77cc4821ef1","abstract_canon_sha256":"894659b111ca269778cebcfb75ada0e32cf961e1cd27d83d475b000ca493d4c9"},"schema_version":"1.0"},"canonical_sha256":"aeb3d151484213e3b54fd7fb48228e8f32ee83023927b7e926a26884b39719c4","source":{"kind":"arxiv","id":"1901.11105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11105","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11105v1","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11105","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"pith_short_12","alias_value":"V2Z5CUKIIIJ6","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V2Z5CUKIIIJ6HNKP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V2Z5CUKI","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V2Z5CUKIIIJ6HNKP275UQIUOR4","target":"record","payload":{"canonical_record":{"source":{"id":"1901.11105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-30T21:18:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92a1e9236c8e1384ca08811952f323af692536823d756e18a3e7b77cc4821ef1","abstract_canon_sha256":"894659b111ca269778cebcfb75ada0e32cf961e1cd27d83d475b000ca493d4c9"},"schema_version":"1.0"},"canonical_sha256":"aeb3d151484213e3b54fd7fb48228e8f32ee83023927b7e926a26884b39719c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:02.639906Z","signature_b64":"V3pvsN+vDBLnIXGCraPesvHDOZJW2IrCZPw9/+2DxKHiqZcyZ72xpi6MZgaRxXVIKcoTUNuAdPi/mZwee93ICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeb3d151484213e3b54fd7fb48228e8f32ee83023927b7e926a26884b39719c4","last_reissued_at":"2026-05-17T23:55:02.639356Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:02.639356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.11105","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-17T23:55:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/7+RZX0HbwfegMa+bqaCwBiMUHQgD2EWWoStWNTT91oe3pC/9e+L6VhGvwpsLi0UqJFd83I5qn/3lhBmy6FBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:27:46.832669Z"},"content_sha256":"3234786fb9ab65e2af18dd65cc864cac951ddfc3ef52907fb11baaf2aaa27251","schema_version":"1.0","event_id":"sha256:3234786fb9ab65e2af18dd65cc864cac951ddfc3ef52907fb11baaf2aaa27251"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V2Z5CUKIIIJ6HNKP275UQIUOR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Himanshu Tyagi, Shun Watanabe","submitted_at":"2019-01-30T21:18:52Z","abstract_excerpt":"We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti type decomposition for strategies. We present a new proof that is based on a technique we introduced recently for proving strong converse results in multiuser information theory and entails a change of measure after replacing hard information constraints with soft ones."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11105","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-17T23:55:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fezfB6TtlXfQC2xy8ePeOD85L254Hd0kLWFCStyV0fLUXZQ/sCmHgCY7yxhocg4NDxg75u4qsAhd0eyk0ENVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:27:46.833096Z"},"content_sha256":"5b02ba146661f3fda442f70661ba2ee922201b986eed99d6b81c33fe6f305436","schema_version":"1.0","event_id":"sha256:5b02ba146661f3fda442f70661ba2ee922201b986eed99d6b81c33fe6f305436"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2Z5CUKIIIJ6HNKP275UQIUOR4/bundle.json","state_url":"https://pith.science/pith/V2Z5CUKIIIJ6HNKP275UQIUOR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2Z5CUKIIIJ6HNKP275UQIUOR4/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-27T11:27:46Z","links":{"resolver":"https://pith.science/pith/V2Z5CUKIIIJ6HNKP275UQIUOR4","bundle":"https://pith.science/pith/V2Z5CUKIIIJ6HNKP275UQIUOR4/bundle.json","state":"https://pith.science/pith/V2Z5CUKIIIJ6HNKP275UQIUOR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2Z5CUKIIIJ6HNKP275UQIUOR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V2Z5CUKIIIJ6HNKP275UQIUOR4","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":"894659b111ca269778cebcfb75ada0e32cf961e1cd27d83d475b000ca493d4c9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-30T21:18:52Z","title_canon_sha256":"92a1e9236c8e1384ca08811952f323af692536823d756e18a3e7b77cc4821ef1"},"schema_version":"1.0","source":{"id":"1901.11105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11105","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11105v1","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11105","created_at":"2026-05-17T23:55:02Z"},{"alias_kind":"pith_short_12","alias_value":"V2Z5CUKIIIJ6","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V2Z5CUKIIIJ6HNKP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V2Z5CUKI","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:5b02ba146661f3fda442f70661ba2ee922201b986eed99d6b81c33fe6f305436","target":"graph","created_at":"2026-05-17T23:55:02Z","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 present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti type decomposition for strategies. We present a new proof that is based on a technique we introduced recently for proving strong converse results in multiuser information theory and entails a change of measure after replacing hard information constraints with soft ones.","authors_text":"Himanshu Tyagi, Shun Watanabe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-30T21:18:52Z","title":"A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11105","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:3234786fb9ab65e2af18dd65cc864cac951ddfc3ef52907fb11baaf2aaa27251","target":"record","created_at":"2026-05-17T23:55:02Z","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":"894659b111ca269778cebcfb75ada0e32cf961e1cd27d83d475b000ca493d4c9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-30T21:18:52Z","title_canon_sha256":"92a1e9236c8e1384ca08811952f323af692536823d756e18a3e7b77cc4821ef1"},"schema_version":"1.0","source":{"id":"1901.11105","kind":"arxiv","version":1}},"canonical_sha256":"aeb3d151484213e3b54fd7fb48228e8f32ee83023927b7e926a26884b39719c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aeb3d151484213e3b54fd7fb48228e8f32ee83023927b7e926a26884b39719c4","first_computed_at":"2026-05-17T23:55:02.639356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:02.639356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V3pvsN+vDBLnIXGCraPesvHDOZJW2IrCZPw9/+2DxKHiqZcyZ72xpi6MZgaRxXVIKcoTUNuAdPi/mZwee93ICA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:02.639906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.11105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3234786fb9ab65e2af18dd65cc864cac951ddfc3ef52907fb11baaf2aaa27251","sha256:5b02ba146661f3fda442f70661ba2ee922201b986eed99d6b81c33fe6f305436"],"state_sha256":"a7267d106b62bbffba8ed0b26f6db634f25406cf1a2e1064e01723c17d07c15e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D1pP2cSmCwqBd1mnQJtmEw/YRW1UBrYK45bgYv3q9BFvzYj9pnOZ4xm7f/5Ley8FveXehq/nk2T6VfVau/cvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:27:46.837012Z","bundle_sha256":"1cc0fe234fe6aa0de497e26bfad99e1cb4dab62b2dc4272b2a886852e07861e5"}}