{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:SKWJHZNFWRNZWLSGAS3H474A2C","short_pith_number":"pith:SKWJHZNF","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"},"canonical_sha256":"92ac93e5a5b45b9b2e4604b67e7f80d089ffb6d0421a313653c2606e49174280","source":{"kind":"arxiv","id":"cs/0304020","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0304020","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0304020v2","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0304020","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"SKWJHZNFWRNZ","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_16","alias_value":"SKWJHZNFWRNZWLSG","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_8","alias_value":"SKWJHZNF","created_at":"2026-07-04T14:24:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:SKWJHZNFWRNZWLSGAS3H474A2C","target":"record","payload":{"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"},"canonical_sha256":"92ac93e5a5b45b9b2e4604b67e7f80d089ffb6d0421a313653c2606e49174280","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"},"source_kind":"arxiv","source_id":"cs/0304020","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-07-04T14:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iL5f0L/2ttz4Eg0XC9ana6NyOjmmeznZmyDfLr95+JCAYEcA+l9q2P5TA/ROHjzsKyYPTE5SIqNUnowm9ERdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:45:19.347921Z"},"content_sha256":"c11a2b3eb4a89c5340c83ee1dd54ba905a4eb8320e1a2d13f8b45381a294b9d3","schema_version":"1.0","event_id":"sha256:c11a2b3eb4a89c5340c83ee1dd54ba905a4eb8320e1a2d13f8b45381a294b9d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:SKWJHZNFWRNZWLSGAS3H474A2C","target":"graph","payload":{"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"},"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-07-04T14:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"feUb5qREH+XmHQuU34AuqQEdHla3kyMoe2YVv9WwHb18izg5a61qFUtcbLCBC+wMbc44yurQKRpnY5TFdbFjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:45:19.348984Z"},"content_sha256":"1569dca506fa38f826f21c245ce1f651649217b160aa1ad0b53970eef5209b5e","schema_version":"1.0","event_id":"sha256:1569dca506fa38f826f21c245ce1f651649217b160aa1ad0b53970eef5209b5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/bundle.json","state_url":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKWJHZNFWRNZWLSGAS3H474A2C/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-08-12T17:45:19Z","links":{"resolver":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C","bundle":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/bundle.json","state":"https://pith.science/pith/SKWJHZNFWRNZWLSGAS3H474A2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKWJHZNFWRNZWLSGAS3H474A2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:SKWJHZNFWRNZWLSGAS3H474A2C","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":"47dc04e3a07a26ae2110dbf591b91b17975051b37bbf59f0c4d016a97f87049d","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2003-04-12T02:26:26Z","title_canon_sha256":"a529147eea9b78d85289a3369f90d126d3526c2e8bab1406610b298629b85ff4"},"schema_version":"1.0","source":{"id":"cs/0304020","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0304020","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0304020v2","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0304020","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"SKWJHZNFWRNZ","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_16","alias_value":"SKWJHZNFWRNZWLSG","created_at":"2026-07-04T14:24:31Z"},{"alias_kind":"pith_short_8","alias_value":"SKWJHZNF","created_at":"2026-07-04T14:24:31Z"}],"graph_snapshots":[{"event_id":"sha256:1569dca506fa38f826f21c245ce1f651649217b160aa1ad0b53970eef5209b5e","target":"graph","created_at":"2026-07-04T14:24:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0304020/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jaikumar Radhakrishnan, Pranab Sen, Rahul Jain","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2003-04-12T02:26:26Z","title":"A direct sum theorem in communication complexity via message compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0304020","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:c11a2b3eb4a89c5340c83ee1dd54ba905a4eb8320e1a2d13f8b45381a294b9d3","target":"record","created_at":"2026-07-04T14:24:31Z","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":"47dc04e3a07a26ae2110dbf591b91b17975051b37bbf59f0c4d016a97f87049d","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2003-04-12T02:26:26Z","title_canon_sha256":"a529147eea9b78d85289a3369f90d126d3526c2e8bab1406610b298629b85ff4"},"schema_version":"1.0","source":{"id":"cs/0304020","kind":"arxiv","version":2}},"canonical_sha256":"92ac93e5a5b45b9b2e4604b67e7f80d089ffb6d0421a313653c2606e49174280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92ac93e5a5b45b9b2e4604b67e7f80d089ffb6d0421a313653c2606e49174280","first_computed_at":"2026-07-04T14:24:31.460323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:31.460323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hbljzk4mDrYrchOJ1GXraNPxl6dZI4t8qvXmu2uTqz10gT2gYD2yc/5nFHshjTJb4JIw36VuMa6S0/GULPRNBg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:31.460744Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0304020","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c11a2b3eb4a89c5340c83ee1dd54ba905a4eb8320e1a2d13f8b45381a294b9d3","sha256:1569dca506fa38f826f21c245ce1f651649217b160aa1ad0b53970eef5209b5e"],"state_sha256":"0831b8a3d392c5280515ad9bb6d84a9d35ea981abcacd02b163959e7f5a8623e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIXIbLft1l6GeVKeVJyD40SsB0W+kQuxUJaPbEQs9sR/8iyN4Vp/W668SVpERWeetdyqhyjkuzhl4eWZ38U4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T17:45:19.360967Z","bundle_sha256":"e5d08fcd7d6aebf39978cf2b24e7645c4285b526a70a1c08461aaf28c0334857"}}