{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RTZQNDX74PYUVDNURRBQHD326U","short_pith_number":"pith:RTZQNDX7","schema_version":"1.0","canonical_sha256":"8cf3068effe3f14a8db48c43038f7af53d7812906ebc1af9754eab3e74512388","source":{"kind":"arxiv","id":"1010.0846","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.0846","created_at":"2026-05-18T04:34:45.758097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0846v2","created_at":"2026-05-18T04:34:45.758097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0846","created_at":"2026-05-18T04:34:45.758097+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTZQNDX74PYU","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTZQNDX74PYUVDNU","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTZQNDX7","created_at":"2026-05-18T12:26:13.927090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U","json":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U.json","graph_json":"https://pith.science/api/pith-number/RTZQNDX74PYUVDNURRBQHD326U/graph.json","events_json":"https://pith.science/api/pith-number/RTZQNDX74PYUVDNURRBQHD326U/events.json","paper":"https://pith.science/paper/RTZQNDX7"},"agent_actions":{"view_html":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U","download_json":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U.json","view_paper":"https://pith.science/paper/RTZQNDX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0846&json=true","fetch_graph":"https://pith.science/api/pith-number/RTZQNDX74PYUVDNURRBQHD326U/graph.json","fetch_events":"https://pith.science/api/pith-number/RTZQNDX74PYUVDNURRBQHD326U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/action/storage_attestation","attest_author":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/action/author_attestation","sign_citation":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/action/citation_signature","submit_replication":"https://pith.science/pith/RTZQNDX74PYUVDNURRBQHD326U/action/replication_record"}},"created_at":"2026-05-18T04:34:45.758097+00:00","updated_at":"2026-05-18T04:34:45.758097+00:00"}