{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:52Y7IXK2CL4DAITW3SJ4QUXRGC","short_pith_number":"pith:52Y7IXK2","schema_version":"1.0","canonical_sha256":"eeb1f45d5a12f8302276dc93c852f1309a19680b2873690d7687099b53c844ab","source":{"kind":"arxiv","id":"1401.4512","version":1},"attestation_state":"computed","paper":{"title":"A quadratically tight partition bound for classical communication complexity and query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nisheeth K. Vishnoi, Rahul Jain, Troy Lee","submitted_at":"2014-01-18T02:39:29Z","abstract_excerpt":"In this work we introduce, both for classical communication complexity and query complexity, a modification of the 'partition bound' introduced by Jain and Klauck [2010]. We call it the 'public-coin partition bound'. We show that (the logarithm to the base two of) its communication complexity and query complexity versions form, for all relations, a quadratically tight lower bound on the public-coin randomized communication complexity and randomized query complexity respectively."},"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":"1401.4512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-18T02:39:29Z","cross_cats_sorted":[],"title_canon_sha256":"144f8b153da72bcd113d3f61b0c88ebdb975d18c988c3cccb87e657df60b9c70","abstract_canon_sha256":"931db1dafc915fde32bfa619750d1942b8aa8829f1466dbefd4b929baac33a77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:45.519893Z","signature_b64":"Daf+H9axFpb7l7HhW5YhyPkBi0jXeVeIFEENgVh2WCEDMQCUEFpm9dJvHOpnI02CRjy+G4s16MA3j0w4nbaYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeb1f45d5a12f8302276dc93c852f1309a19680b2873690d7687099b53c844ab","last_reissued_at":"2026-05-18T03:01:45.519449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:45.519449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quadratically tight partition bound for classical communication complexity and query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nisheeth K. Vishnoi, Rahul Jain, Troy Lee","submitted_at":"2014-01-18T02:39:29Z","abstract_excerpt":"In this work we introduce, both for classical communication complexity and query complexity, a modification of the 'partition bound' introduced by Jain and Klauck [2010]. We call it the 'public-coin partition bound'. We show that (the logarithm to the base two of) its communication complexity and query complexity versions form, for all relations, a quadratically tight lower bound on the public-coin randomized communication complexity and randomized query complexity respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4512","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":"1401.4512","created_at":"2026-05-18T03:01:45.519510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4512v1","created_at":"2026-05-18T03:01:45.519510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4512","created_at":"2026-05-18T03:01:45.519510+00:00"},{"alias_kind":"pith_short_12","alias_value":"52Y7IXK2CL4D","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"52Y7IXK2CL4DAITW","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"52Y7IXK2","created_at":"2026-05-18T12:28:14.216126+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/52Y7IXK2CL4DAITW3SJ4QUXRGC","json":"https://pith.science/pith/52Y7IXK2CL4DAITW3SJ4QUXRGC.json","graph_json":"https://pith.science/api/pith-number/52Y7IXK2CL4DAITW3SJ4QUXRGC/graph.json","events_json":"https://pith.science/api/pith-number/52Y7IXK2CL4DAITW3SJ4QUXRGC/events.json","paper":"https://pith.science/paper/52Y7IXK2"},"agent_actions":{"view_html":"https://pith.science/pith/52Y7IXK2CL4DAITW3SJ4QUXRGC","download_json":"https://pith.science/pith/52Y7IXK2CL4DAITW3SJ4QUXRGC.json","view_paper":"https://pith.science/paper/52Y7IXK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4512&json=true","fetch_graph":"https://pith.science/api/pith-number/52Y7IXK2CL4DAITW3SJ4QUXRGC/graph.json","fetch_events":"https://pith.science/api/pith-number/52Y7IXK2CL4DAITW3SJ4QUXRGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52Y7IXK2CL4DAITW3SJ4QUXRGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52Y7IXK2CL4DAITW3SJ4QUXRGC/action/storage_attestation","attest_author":"https://pith.science/pith/52Y7IXK2CL4DAITW3SJ4QUXRGC/action/author_attestation","sign_citation":"https://pith.science/pith/52Y7IXK2CL4DAITW3SJ4QUXRGC/action/citation_signature","submit_replication":"https://pith.science/pith/52Y7IXK2CL4DAITW3SJ4QUXRGC/action/replication_record"}},"created_at":"2026-05-18T03:01:45.519510+00:00","updated_at":"2026-05-18T03:01:45.519510+00:00"}