{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4HJ3OT2N26C7UYE3U2KPNQIROO","short_pith_number":"pith:4HJ3OT2N","schema_version":"1.0","canonical_sha256":"e1d3b74f4dd785fa609ba694f6c11173b2ffaeacfd356a536e36024bebc2cab2","source":{"kind":"arxiv","id":"1205.0968","version":1},"attestation_state":"computed","paper":{"title":"Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.CC","authors_text":"Amit Chakrabarti, Ranganath Kondapally, Zhenghui Wang","submitted_at":"2012-05-04T14:51:04Z","abstract_excerpt":"Three decades of research in communication complexity have led to the invention of a number of techniques to lower bound randomized communication complexity. The majority of these techniques involve properties of large submatrices (rectangles) of the truth-table matrix defining a communication problem. The only technique that does not quite fit is information complexity, which has been investigated over the last decade. Here, we connect information complexity to one of the most powerful \"rectangular\" techniques: the recently-introduced smooth corruption (or \"smooth rectangle\") bound. We show t"},"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":"1205.0968","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-04T14:51:04Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"6fc765c385e580397ef1182583eec26ccb9232d514c0b35b57dac560276fd10c","abstract_canon_sha256":"9037161790248d3bb0761506bd08b29bdb39b51f5f492a4a4a0597c97cdda3dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:23.451915Z","signature_b64":"6PbwqMAHMigKPwqKNIWmXs5TA8bySo2ZmwO+rX8H9laJp2ahO7uhgb7MdwxrOQz1FSAOG4LYLUWIOB51hIjEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1d3b74f4dd785fa609ba694f6c11173b2ffaeacfd356a536e36024bebc2cab2","last_reissued_at":"2026-05-18T03:56:23.451113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:23.451113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.CC","authors_text":"Amit Chakrabarti, Ranganath Kondapally, Zhenghui Wang","submitted_at":"2012-05-04T14:51:04Z","abstract_excerpt":"Three decades of research in communication complexity have led to the invention of a number of techniques to lower bound randomized communication complexity. The majority of these techniques involve properties of large submatrices (rectangles) of the truth-table matrix defining a communication problem. The only technique that does not quite fit is information complexity, which has been investigated over the last decade. Here, we connect information complexity to one of the most powerful \"rectangular\" techniques: the recently-introduced smooth corruption (or \"smooth rectangle\") bound. We show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0968","kind":"arxiv","version":1},"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":"1205.0968","created_at":"2026-05-18T03:56:23.451253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0968v1","created_at":"2026-05-18T03:56:23.451253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0968","created_at":"2026-05-18T03:56:23.451253+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HJ3OT2N26C7","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HJ3OT2N26C7UYE3","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HJ3OT2N","created_at":"2026-05-18T12:26:53.410803+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/4HJ3OT2N26C7UYE3U2KPNQIROO","json":"https://pith.science/pith/4HJ3OT2N26C7UYE3U2KPNQIROO.json","graph_json":"https://pith.science/api/pith-number/4HJ3OT2N26C7UYE3U2KPNQIROO/graph.json","events_json":"https://pith.science/api/pith-number/4HJ3OT2N26C7UYE3U2KPNQIROO/events.json","paper":"https://pith.science/paper/4HJ3OT2N"},"agent_actions":{"view_html":"https://pith.science/pith/4HJ3OT2N26C7UYE3U2KPNQIROO","download_json":"https://pith.science/pith/4HJ3OT2N26C7UYE3U2KPNQIROO.json","view_paper":"https://pith.science/paper/4HJ3OT2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0968&json=true","fetch_graph":"https://pith.science/api/pith-number/4HJ3OT2N26C7UYE3U2KPNQIROO/graph.json","fetch_events":"https://pith.science/api/pith-number/4HJ3OT2N26C7UYE3U2KPNQIROO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HJ3OT2N26C7UYE3U2KPNQIROO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HJ3OT2N26C7UYE3U2KPNQIROO/action/storage_attestation","attest_author":"https://pith.science/pith/4HJ3OT2N26C7UYE3U2KPNQIROO/action/author_attestation","sign_citation":"https://pith.science/pith/4HJ3OT2N26C7UYE3U2KPNQIROO/action/citation_signature","submit_replication":"https://pith.science/pith/4HJ3OT2N26C7UYE3U2KPNQIROO/action/replication_record"}},"created_at":"2026-05-18T03:56:23.451253+00:00","updated_at":"2026-05-18T03:56:23.451253+00:00"}