{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GXDHC3DWZCW6TODMPR2QQA35OF","short_pith_number":"pith:GXDHC3DW","schema_version":"1.0","canonical_sha256":"35c6716c76c8ade9b86c7c7508037d71696f3e80984da50b3545135d7db47c43","source":{"kind":"arxiv","id":"1112.2000","version":3},"attestation_state":"computed","paper":{"title":"A discrepancy lower bound for information complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mark Braverman, Omri Weinstein","submitted_at":"2011-12-09T02:02:56Z","abstract_excerpt":"This paper provides the first general technique for proving information lower bounds on two-party unbounded-rounds communication problems. We show that the discrepancy lower bound, which applies to randomized communication complexity, also applies to information complexity. More precisely, if the discrepancy of a two-party function $f$ with respect to a distribution $\\mu$ is $Disc_\\mu f$, then any two party randomized protocol computing $f$ must reveal at least $\\Omega(\\log (1/Disc_\\mu f))$ bits of information to the participants. As a corollary, we obtain that any two-party protocol for compu"},"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":"1112.2000","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-09T02:02:56Z","cross_cats_sorted":[],"title_canon_sha256":"ec9f05a9610673b6ef251bceed96793094baf30cab5edcbb980db66a27a56c21","abstract_canon_sha256":"d690cad0d570a6d902c2fb00e5934d7e57ff80241b3625eecd731ff6726fc1b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:44.944612Z","signature_b64":"8N2P8RC03lzfV9kyddnq0gJRayzu9JTJK/FCiqut1JtkZRNpzPQzWPuIjSJOGVSOBeeh6br9m3R4ckBod0JtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c6716c76c8ade9b86c7c7508037d71696f3e80984da50b3545135d7db47c43","last_reissued_at":"2026-05-18T03:53:44.944079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:44.944079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A discrepancy lower bound for information complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mark Braverman, Omri Weinstein","submitted_at":"2011-12-09T02:02:56Z","abstract_excerpt":"This paper provides the first general technique for proving information lower bounds on two-party unbounded-rounds communication problems. We show that the discrepancy lower bound, which applies to randomized communication complexity, also applies to information complexity. More precisely, if the discrepancy of a two-party function $f$ with respect to a distribution $\\mu$ is $Disc_\\mu f$, then any two party randomized protocol computing $f$ must reveal at least $\\Omega(\\log (1/Disc_\\mu f))$ bits of information to the participants. As a corollary, we obtain that any two-party protocol for compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2000","kind":"arxiv","version":3},"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":"1112.2000","created_at":"2026-05-18T03:53:44.944153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2000v3","created_at":"2026-05-18T03:53:44.944153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2000","created_at":"2026-05-18T03:53:44.944153+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXDHC3DWZCW6","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXDHC3DWZCW6TODM","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXDHC3DW","created_at":"2026-05-18T12:26:30.835961+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/GXDHC3DWZCW6TODMPR2QQA35OF","json":"https://pith.science/pith/GXDHC3DWZCW6TODMPR2QQA35OF.json","graph_json":"https://pith.science/api/pith-number/GXDHC3DWZCW6TODMPR2QQA35OF/graph.json","events_json":"https://pith.science/api/pith-number/GXDHC3DWZCW6TODMPR2QQA35OF/events.json","paper":"https://pith.science/paper/GXDHC3DW"},"agent_actions":{"view_html":"https://pith.science/pith/GXDHC3DWZCW6TODMPR2QQA35OF","download_json":"https://pith.science/pith/GXDHC3DWZCW6TODMPR2QQA35OF.json","view_paper":"https://pith.science/paper/GXDHC3DW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2000&json=true","fetch_graph":"https://pith.science/api/pith-number/GXDHC3DWZCW6TODMPR2QQA35OF/graph.json","fetch_events":"https://pith.science/api/pith-number/GXDHC3DWZCW6TODMPR2QQA35OF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXDHC3DWZCW6TODMPR2QQA35OF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXDHC3DWZCW6TODMPR2QQA35OF/action/storage_attestation","attest_author":"https://pith.science/pith/GXDHC3DWZCW6TODMPR2QQA35OF/action/author_attestation","sign_citation":"https://pith.science/pith/GXDHC3DWZCW6TODMPR2QQA35OF/action/citation_signature","submit_replication":"https://pith.science/pith/GXDHC3DWZCW6TODMPR2QQA35OF/action/replication_record"}},"created_at":"2026-05-18T03:53:44.944153+00:00","updated_at":"2026-05-18T03:53:44.944153+00:00"}