{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:SKWJHZNFWRNZWLSGAS3H474A2C","short_pith_number":"pith:SKWJHZNF","schema_version":"1.0","canonical_sha256":"92ac93e5a5b45b9b2e4604b67e7f80d089ffb6d0421a313653c2606e49174280","source":{"kind":"arxiv","id":"cs/0304020","version":2},"attestation_state":"computed","paper":{"title":"A direct sum theorem in communication complexity via message compression","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jaikumar Radhakrishnan, Pranab Sen, Rahul Jain","submitted_at":"2003-04-12T02:26:26Z","abstract_excerpt":"We prove lower bounds for the direct sum problem for two-party bounded error randomised multiple-round communication protocols. Our proofs use the notion of information cost of a protocol, as defined by Chakrabarti, Shi, Wirth and Yao and refined further by Bar-Yossef, Jayram, Kumar and Sivakumar. Our main technical result is a `compression' theorem saying that, for any probability distribution $\\mu$ over the inputs, a $k$-round private coin bounded error protocol for a function $f$ with information cost $c$ can be converted into a $k$-round deterministic protocol for $f$ with bounded distribu"},"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":"cs/0304020","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2003-04-12T02:26:26Z","cross_cats_sorted":[],"title_canon_sha256":"a529147eea9b78d85289a3369f90d126d3526c2e8bab1406610b298629b85ff4","abstract_canon_sha256":"47dc04e3a07a26ae2110dbf591b91b17975051b37bbf59f0c4d016a97f87049d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:31.460744Z","signature_b64":"Hbljzk4mDrYrchOJ1GXraNPxl6dZI4t8qvXmu2uTqz10gT2gYD2yc/5nFHshjTJb4JIw36VuMa6S0/GULPRNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ac93e5a5b45b9b2e4604b67e7f80d089ffb6d0421a313653c2606e49174280","last_reissued_at":"2026-07-04T14:24:31.460323Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:31.460323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A direct sum theorem in communication complexity via message compression","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jaikumar Radhakrishnan, Pranab Sen, Rahul Jain","submitted_at":"2003-04-12T02:26:26Z","abstract_excerpt":"We prove lower bounds for the direct sum problem for two-party bounded error randomised multiple-round communication protocols. Our proofs use the notion of information cost of a protocol, as defined by Chakrabarti, Shi, Wirth and Yao and refined further by Bar-Yossef, Jayram, Kumar and Sivakumar. Our main technical result is a `compression' theorem saying that, for any probability distribution $\\mu$ over the inputs, a $k$-round private coin bounded error protocol for a function $f$ with information cost $c$ can be converted into a $k$-round deterministic protocol for $f$ with bounded distribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0304020","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0304020/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0304020","created_at":"2026-07-04T14:24:31.460382+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0304020v2","created_at":"2026-07-04T14:24:31.460382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0304020","created_at":"2026-07-04T14:24:31.460382+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKWJHZNFWRNZ","created_at":"2026-07-04T14:24:31.460382+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKWJHZNFWRNZWLSG","created_at":"2026-07-04T14:24:31.460382+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKWJHZNF","created_at":"2026-07-04T14:24:31.460382+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/SKWJHZNFWRNZWLSGAS3H474A2C","json":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C.json","graph_json":"https://pith.science/api/pith-number/SKWJHZNFWRNZWLSGAS3H474A2C/graph.json","events_json":"https://pith.science/api/pith-number/SKWJHZNFWRNZWLSGAS3H474A2C/events.json","paper":"https://pith.science/paper/SKWJHZNF"},"agent_actions":{"view_html":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C","download_json":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C.json","view_paper":"https://pith.science/paper/SKWJHZNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0304020&json=true","fetch_graph":"https://pith.science/api/pith-number/SKWJHZNFWRNZWLSGAS3H474A2C/graph.json","fetch_events":"https://pith.science/api/pith-number/SKWJHZNFWRNZWLSGAS3H474A2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/action/storage_attestation","attest_author":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/action/author_attestation","sign_citation":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/action/citation_signature","submit_replication":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/action/replication_record"}},"created_at":"2026-07-04T14:24:31.460382+00:00","updated_at":"2026-07-04T14:24:31.460382+00:00"}