{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RTZQNDX74PYUVDNURRBQHD326U","short_pith_number":"pith:RTZQNDX7","canonical_record":{"source":{"id":"1010.0846","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-05T11:38:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5a3c63beab7a8c8c1c94bc70567e10f51752a118cda7655ec6ad0f67e3867096","abstract_canon_sha256":"3e79010d1d634936d58683a74d3c51e9d489f22c435ec0e81f75423c8ef878fb"},"schema_version":"1.0"},"canonical_sha256":"8cf3068effe3f14a8db48c43038f7af53d7812906ebc1af9754eab3e74512388","source":{"kind":"arxiv","id":"1010.0846","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0846","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0846v2","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0846","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"RTZQNDX74PYU","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RTZQNDX74PYUVDNU","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RTZQNDX7","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RTZQNDX74PYUVDNURRBQHD326U","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0846","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-05T11:38:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5a3c63beab7a8c8c1c94bc70567e10f51752a118cda7655ec6ad0f67e3867096","abstract_canon_sha256":"3e79010d1d634936d58683a74d3c51e9d489f22c435ec0e81f75423c8ef878fb"},"schema_version":"1.0"},"canonical_sha256":"8cf3068effe3f14a8db48c43038f7af53d7812906ebc1af9754eab3e74512388","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:45.758482Z","signature_b64":"c6UMAcEEvvOABEsklb5JeRYKhLlp03BBDI4O5N7tqK1uiJS99dsBLCxDmeUXshN9l3Wy19KiPVb47FH2JX8oDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cf3068effe3f14a8db48c43038f7af53d7812906ebc1af9754eab3e74512388","last_reissued_at":"2026-05-18T04:34:45.758035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:45.758035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0846","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-18T04:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CpY+unR8xQy5+f0arnLkqE9nQs8xcYEamry4ChKZl1t/dylZEOM8To6j2PIPbSXzjjI1J4tDFaVwtStiCu7JCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:07:21.365781Z"},"content_sha256":"57b0585fc7e777ef17a57c2ccac1e7eed868e79b34f29b46fdd163be14b89d64","schema_version":"1.0","event_id":"sha256:57b0585fc7e777ef17a57c2ccac1e7eed868e79b34f29b46fdd163be14b89d64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RTZQNDX74PYUVDNURRBQHD326U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A strong direct product theorem for two-way public coin communication complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Rahul Jain","submitted_at":"2010-10-05T11:38:19Z","abstract_excerpt":"We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a generalization to non-product distributions of the two-way product subdistribution bound of [J, Klauck and Nayak 08], thereby our result implying their direct product result in terms of the two-way product subdistribution bound.\n  We show that our new complexity measure gives tight lower bound for the set-disjointness problem, as a result we reproduce strong direct product result for this problem, which was previously shown "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0846","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-18T04:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iaVEzgWZAG7PaOltkFH5crEpzVkrGG4bPYTJC2YAHxTB30HrgMylWIJ5BZzpNVHSCaeB0IIIobRxRZUYZP91Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:07:21.366396Z"},"content_sha256":"15cbc1db776bfd462c62f25d707ac13b23b102318a7ffe982267907c628dcf34","schema_version":"1.0","event_id":"sha256:15cbc1db776bfd462c62f25d707ac13b23b102318a7ffe982267907c628dcf34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/bundle.json","state_url":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTZQNDX74PYUVDNURRBQHD326U/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-26T04:07:21Z","links":{"resolver":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U","bundle":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/bundle.json","state":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTZQNDX74PYUVDNURRBQHD326U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RTZQNDX74PYUVDNURRBQHD326U","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":"3e79010d1d634936d58683a74d3c51e9d489f22c435ec0e81f75423c8ef878fb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-05T11:38:19Z","title_canon_sha256":"5a3c63beab7a8c8c1c94bc70567e10f51752a118cda7655ec6ad0f67e3867096"},"schema_version":"1.0","source":{"id":"1010.0846","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0846","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0846v2","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0846","created_at":"2026-05-18T04:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"RTZQNDX74PYU","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RTZQNDX74PYUVDNU","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RTZQNDX7","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:15cbc1db776bfd462c62f25d707ac13b23b102318a7ffe982267907c628dcf34","target":"graph","created_at":"2026-05-18T04:34:45Z","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 show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a generalization to non-product distributions of the two-way product subdistribution bound of [J, Klauck and Nayak 08], thereby our result implying their direct product result in terms of the two-way product subdistribution bound.\n  We show that our new complexity measure gives tight lower bound for the set-disjointness problem, as a result we reproduce strong direct product result for this problem, which was previously shown ","authors_text":"Rahul Jain","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-05T11:38:19Z","title":"A strong direct product theorem for two-way public coin communication complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0846","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:57b0585fc7e777ef17a57c2ccac1e7eed868e79b34f29b46fdd163be14b89d64","target":"record","created_at":"2026-05-18T04:34:45Z","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":"3e79010d1d634936d58683a74d3c51e9d489f22c435ec0e81f75423c8ef878fb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-05T11:38:19Z","title_canon_sha256":"5a3c63beab7a8c8c1c94bc70567e10f51752a118cda7655ec6ad0f67e3867096"},"schema_version":"1.0","source":{"id":"1010.0846","kind":"arxiv","version":2}},"canonical_sha256":"8cf3068effe3f14a8db48c43038f7af53d7812906ebc1af9754eab3e74512388","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cf3068effe3f14a8db48c43038f7af53d7812906ebc1af9754eab3e74512388","first_computed_at":"2026-05-18T04:34:45.758035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:45.758035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c6UMAcEEvvOABEsklb5JeRYKhLlp03BBDI4O5N7tqK1uiJS99dsBLCxDmeUXshN9l3Wy19KiPVb47FH2JX8oDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:45.758482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0846","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57b0585fc7e777ef17a57c2ccac1e7eed868e79b34f29b46fdd163be14b89d64","sha256:15cbc1db776bfd462c62f25d707ac13b23b102318a7ffe982267907c628dcf34"],"state_sha256":"36a08988ea0d619e851e76111cc0fea8ec6d67ee9a2759a7ed2e9ad00c734754"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zpf9lG4nLw62ja8D8PVM0tn5EZrweYImN9d7Ay+NVKWtSuuH1WADXEYe6TOXoD5/G0SKBJSycH1c3/CnY2p5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:07:21.369800Z","bundle_sha256":"b10aa91365b37102fd5af129af69842971b70e0706124dc8be0641592a8e71ce"}}