{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DBEI55QC7RWIMP7SPB2P577FGN","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":"af3274c32c245d4bd59a0a626379c3705f9381a7c5a1fa548dad930cb41736e1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-08-17T10:04:08Z","title_canon_sha256":"1004f3ee00bda0c0e333018ddcea0d3efbe36f2290463df2d5d31868006e30ab"},"schema_version":"1.0","source":{"id":"2008.07188","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.07188","created_at":"2026-07-05T01:32:46Z"},{"alias_kind":"arxiv_version","alias_value":"2008.07188v3","created_at":"2026-07-05T01:32:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07188","created_at":"2026-07-05T01:32:46Z"},{"alias_kind":"pith_short_12","alias_value":"DBEI55QC7RWI","created_at":"2026-07-05T01:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"DBEI55QC7RWIMP7S","created_at":"2026-07-05T01:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"DBEI55QC","created_at":"2026-07-05T01:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:75b04aaa7fe3d631cf3f2c2bcf603656a03ee4cfc85fe7b919babb3de904fafb","target":"graph","created_at":"2026-07-05T01:32:46Z","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/2008.07188/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show a near optimal direct-sum theorem for the two-party randomized communication complexity. Let $f\\subseteq X \\times Y\\times Z$ be a relation, $\\varepsilon> 0$ and $k$ be an integer. We show, $$\\mathrm{R}^{\\mathrm{pub}}_\\varepsilon(f^k) \\cdot \\log(\\mathrm{R}^{\\mathrm{pub}}_\\varepsilon(f^k)) \\ge \\Omega(k \\cdot \\mathrm{R}^{\\mathrm{pub}}_\\varepsilon(f)) \\enspace,$$ where $f^k= f \\times \\ldots \\times f$ ($k$-times) and $\\mathrm{R}^{\\mathrm{pub}}_\\varepsilon(\\cdot)$ represents the public-coin randomized communication complexity with worst-case error $\\varepsilon$. Given a protocol $\\mathcal{P}","authors_text":"Rahul Jain","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-08-17T10:04:08Z","title":"A near-optimal direct-sum theorem for communication complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.07188","kind":"arxiv","version":3},"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:78471e011481786a65756114e166865d44ac38fb96df3aa22017f8a79abcc89c","target":"record","created_at":"2026-07-05T01:32:46Z","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":"af3274c32c245d4bd59a0a626379c3705f9381a7c5a1fa548dad930cb41736e1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-08-17T10:04:08Z","title_canon_sha256":"1004f3ee00bda0c0e333018ddcea0d3efbe36f2290463df2d5d31868006e30ab"},"schema_version":"1.0","source":{"id":"2008.07188","kind":"arxiv","version":3}},"canonical_sha256":"18488ef602fc6c863ff27874feffe53342ee2c1f4c8f1e727356a990e2caeed3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18488ef602fc6c863ff27874feffe53342ee2c1f4c8f1e727356a990e2caeed3","first_computed_at":"2026-07-05T01:32:46.640440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:32:46.640440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"18bGINEGGmhp2Er2e5CjGJuEhTS01IXHpB9LTB9EwSgWEdJC0+Mwb2cOwkaa5t6H1dd9RFx1KH30WJRC/sguCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:32:46.640889Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.07188","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78471e011481786a65756114e166865d44ac38fb96df3aa22017f8a79abcc89c","sha256:75b04aaa7fe3d631cf3f2c2bcf603656a03ee4cfc85fe7b919babb3de904fafb"],"state_sha256":"224ea320093ee79ec5ff9c27d658f0f486cd8a06e94df55d99907bcc4bc269a3"}