{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:C3PQPGFL6XPCNWHH7EXN4CEUAZ","short_pith_number":"pith:C3PQPGFL","schema_version":"1.0","canonical_sha256":"16df0798abf5de26d8e7f92ede08940663206f118fc17629b15a3e07ed9c488c","source":{"kind":"arxiv","id":"cs/0411076","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Andrey Utis, Andris Ambainis, Aravind Srinavasan, William Gasarch","submitted_at":"2004-11-20T19:55:19Z","abstract_excerpt":"Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on \\textit{at most} a bits? Let 0\\leq a\\leq n-1. We show that any deterministic protocol, as well as any error-free quantum protocol (C* version), for this problem requires at least n-2 bits of communication. We show the same bounds for the problem of determining if two strings differ in exactly a bits. We also prove a lower bound of n/2-1 for error-free Q* quantum protocols. Our results are obtained by lower-bounding the ranks of the appropriate matrices."},"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":"cs/0411076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2004-11-20T19:55:19Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"de8a1fe868953f30a5f8a096e7628d4014c8d241f3183a3300f672ab0d11f1ba","abstract_canon_sha256":"2521a79e1628e9c707463913af7313bf2b5c737be6b5140e866d2518d4c2ecbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.203934Z","signature_b64":"ZzegTtdVSa2ZKKZUWAHwZ0j5j8o1pRqUFDJcd/LXfQyPVGnLyNZQ+px7qwMHDSclQWSRpKN/MbOwN4ZAzAFCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16df0798abf5de26d8e7f92ede08940663206f118fc17629b15a3e07ed9c488c","last_reissued_at":"2026-05-18T02:29:37.203494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.203494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Andrey Utis, Andris Ambainis, Aravind Srinavasan, William Gasarch","submitted_at":"2004-11-20T19:55:19Z","abstract_excerpt":"Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on \\textit{at most} a bits? Let 0\\leq a\\leq n-1. We show that any deterministic protocol, as well as any error-free quantum protocol (C* version), for this problem requires at least n-2 bits of communication. We show the same bounds for the problem of determining if two strings differ in exactly a bits. We also prove a lower bound of n/2-1 for error-free Q* quantum protocols. Our results are obtained by lower-bounding the ranks of the appropriate matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0411076","kind":"arxiv","version":2},"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":"cs/0411076","created_at":"2026-05-18T02:29:37.203565+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0411076v2","created_at":"2026-05-18T02:29:37.203565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0411076","created_at":"2026-05-18T02:29:37.203565+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3PQPGFL6XPC","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3PQPGFL6XPCNWHH","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3PQPGFL","created_at":"2026-05-18T12:25:52.051335+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/C3PQPGFL6XPCNWHH7EXN4CEUAZ","json":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ.json","graph_json":"https://pith.science/api/pith-number/C3PQPGFL6XPCNWHH7EXN4CEUAZ/graph.json","events_json":"https://pith.science/api/pith-number/C3PQPGFL6XPCNWHH7EXN4CEUAZ/events.json","paper":"https://pith.science/paper/C3PQPGFL"},"agent_actions":{"view_html":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ","download_json":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ.json","view_paper":"https://pith.science/paper/C3PQPGFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0411076&json=true","fetch_graph":"https://pith.science/api/pith-number/C3PQPGFL6XPCNWHH7EXN4CEUAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/C3PQPGFL6XPCNWHH7EXN4CEUAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/action/storage_attestation","attest_author":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/action/author_attestation","sign_citation":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/action/citation_signature","submit_replication":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/action/replication_record"}},"created_at":"2026-05-18T02:29:37.203565+00:00","updated_at":"2026-05-18T02:29:37.203565+00:00"}