{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DM4PHQIQZHZ3KEN6VNP3AXSZUQ","short_pith_number":"pith:DM4PHQIQ","schema_version":"1.0","canonical_sha256":"1b38f3c110c9f3b511beab5fb05e59a40fa0feee8e0e1d3bca29bbb3b13dbcc7","source":{"kind":"arxiv","id":"1505.03110","version":1},"attestation_state":"computed","paper":{"title":"Near-optimal bounds on bounded-round quantum communication complexity of disjointness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","quant-ph"],"primary_cat":"cs.CC","authors_text":"Ankit Garg, Dave Touchette, Jieming Mao, Mark Braverman, Young Kun Ko","submitted_at":"2015-05-12T18:23:54Z","abstract_excerpt":"We prove a near optimal round-communication tradeoff for the two-party quantum communication complexity of disjointness. For protocols with $r$ rounds, we prove a lower bound of $\\tilde{\\Omega}(n/r + r)$ on the communication required for computing disjointness of input size $n$, which is optimal up to logarithmic factors. The previous best lower bound was $\\Omega(n/r^2 + r)$ due to Jain, Radhakrishnan and Sen [JRS03]. Along the way, we develop several tools for quantum information complexity, one of which is a lower bound for quantum information complexity in terms of the generalized discrepan"},"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":"1505.03110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-12T18:23:54Z","cross_cats_sorted":["cs.IT","math.IT","quant-ph"],"title_canon_sha256":"0b9c6d8d36cd6f22f308fb349059a93a0092400363efc7f0693988d78518e721","abstract_canon_sha256":"49c51b745d142e841fc6f0a3d161257dec542444e4cd851972198fef338bfc23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:08.959918Z","signature_b64":"diAiXHp9po16Bi+r237cWNAyYXOWTo+zX+qnMaApHfIPuRp4q8+mQ31f2X+LrUwpOSVfwOGJEQGl9XHa64OuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b38f3c110c9f3b511beab5fb05e59a40fa0feee8e0e1d3bca29bbb3b13dbcc7","last_reissued_at":"2026-05-18T02:14:08.959266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:08.959266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal bounds on bounded-round quantum communication complexity of disjointness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","quant-ph"],"primary_cat":"cs.CC","authors_text":"Ankit Garg, Dave Touchette, Jieming Mao, Mark Braverman, Young Kun Ko","submitted_at":"2015-05-12T18:23:54Z","abstract_excerpt":"We prove a near optimal round-communication tradeoff for the two-party quantum communication complexity of disjointness. For protocols with $r$ rounds, we prove a lower bound of $\\tilde{\\Omega}(n/r + r)$ on the communication required for computing disjointness of input size $n$, which is optimal up to logarithmic factors. The previous best lower bound was $\\Omega(n/r^2 + r)$ due to Jain, Radhakrishnan and Sen [JRS03]. Along the way, we develop several tools for quantum information complexity, one of which is a lower bound for quantum information complexity in terms of the generalized discrepan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03110","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":"1505.03110","created_at":"2026-05-18T02:14:08.959358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03110v1","created_at":"2026-05-18T02:14:08.959358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03110","created_at":"2026-05-18T02:14:08.959358+00:00"},{"alias_kind":"pith_short_12","alias_value":"DM4PHQIQZHZ3","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DM4PHQIQZHZ3KEN6","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DM4PHQIQ","created_at":"2026-05-18T12:29:17.054201+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/DM4PHQIQZHZ3KEN6VNP3AXSZUQ","json":"https://pith.science/pith/DM4PHQIQZHZ3KEN6VNP3AXSZUQ.json","graph_json":"https://pith.science/api/pith-number/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/graph.json","events_json":"https://pith.science/api/pith-number/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/events.json","paper":"https://pith.science/paper/DM4PHQIQ"},"agent_actions":{"view_html":"https://pith.science/pith/DM4PHQIQZHZ3KEN6VNP3AXSZUQ","download_json":"https://pith.science/pith/DM4PHQIQZHZ3KEN6VNP3AXSZUQ.json","view_paper":"https://pith.science/paper/DM4PHQIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03110&json=true","fetch_graph":"https://pith.science/api/pith-number/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/action/storage_attestation","attest_author":"https://pith.science/pith/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/action/author_attestation","sign_citation":"https://pith.science/pith/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/action/citation_signature","submit_replication":"https://pith.science/pith/DM4PHQIQZHZ3KEN6VNP3AXSZUQ/action/replication_record"}},"created_at":"2026-05-18T02:14:08.959358+00:00","updated_at":"2026-05-18T02:14:08.959358+00:00"}