{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:C3PQPGFL6XPCNWHH7EXN4CEUAZ","short_pith_number":"pith:C3PQPGFL","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"},"canonical_sha256":"16df0798abf5de26d8e7f92ede08940663206f118fc17629b15a3e07ed9c488c","source":{"kind":"arxiv","id":"cs/0411076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0411076","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0411076v2","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0411076","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"C3PQPGFL6XPC","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"C3PQPGFL6XPCNWHH","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"C3PQPGFL","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:C3PQPGFL6XPCNWHH7EXN4CEUAZ","target":"record","payload":{"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"},"canonical_sha256":"16df0798abf5de26d8e7f92ede08940663206f118fc17629b15a3e07ed9c488c","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"},"source_kind":"arxiv","source_id":"cs/0411076","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZvaM1URW3cfXHlD04BmwtpPWgRbogRueqUkTwa60UdQ9Wr+9dSHn8A2XIdN+LSFWWc2+/KwY8Nszw2FOnulDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:37:24.314370Z"},"content_sha256":"3c0290df300e30c5fb2603c37c5c822ceffa79f929b0d926af8866b6b6e3fd01","schema_version":"1.0","event_id":"sha256:3c0290df300e30c5fb2603c37c5c822ceffa79f929b0d926af8866b6b6e3fd01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:C3PQPGFL6XPCNWHH7EXN4CEUAZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMKdHi1zW6MbjAvnw/tuu7YJqakUzeawQqpVTKFN+nFg11+pKgDve4GOFciUd882FBWwu+fx8iL16lxKI2j5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:37:24.314774Z"},"content_sha256":"1dbcc18edfac46368f6b5b45d1556dcb0d579775222a2eed50c2d60477b7a6f8","schema_version":"1.0","event_id":"sha256:1dbcc18edfac46368f6b5b45d1556dcb0d579775222a2eed50c2d60477b7a6f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/bundle.json","state_url":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T07:37:24Z","links":{"resolver":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ","bundle":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/bundle.json","state":"https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:C3PQPGFL6XPCNWHH7EXN4CEUAZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2521a79e1628e9c707463913af7313bf2b5c737be6b5140e866d2518d4c2ecbd","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2004-11-20T19:55:19Z","title_canon_sha256":"de8a1fe868953f30a5f8a096e7628d4014c8d241f3183a3300f672ab0d11f1ba"},"schema_version":"1.0","source":{"id":"cs/0411076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0411076","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0411076v2","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0411076","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"C3PQPGFL6XPC","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"C3PQPGFL6XPCNWHH","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"C3PQPGFL","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:1dbcc18edfac46368f6b5b45d1556dcb0d579775222a2eed50c2d60477b7a6f8","target":"graph","created_at":"2026-05-18T02:29:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Andrey Utis, Andris Ambainis, Aravind Srinavasan, William Gasarch","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2004-11-20T19:55:19Z","title":"Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0411076","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3c0290df300e30c5fb2603c37c5c822ceffa79f929b0d926af8866b6b6e3fd01","target":"record","created_at":"2026-05-18T02:29:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2521a79e1628e9c707463913af7313bf2b5c737be6b5140e866d2518d4c2ecbd","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2004-11-20T19:55:19Z","title_canon_sha256":"de8a1fe868953f30a5f8a096e7628d4014c8d241f3183a3300f672ab0d11f1ba"},"schema_version":"1.0","source":{"id":"cs/0411076","kind":"arxiv","version":2}},"canonical_sha256":"16df0798abf5de26d8e7f92ede08940663206f118fc17629b15a3e07ed9c488c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16df0798abf5de26d8e7f92ede08940663206f118fc17629b15a3e07ed9c488c","first_computed_at":"2026-05-18T02:29:37.203494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:37.203494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZzegTtdVSa2ZKKZUWAHwZ0j5j8o1pRqUFDJcd/LXfQyPVGnLyNZQ+px7qwMHDSclQWSRpKN/MbOwN4ZAzAFCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:37.203934Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0411076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c0290df300e30c5fb2603c37c5c822ceffa79f929b0d926af8866b6b6e3fd01","sha256:1dbcc18edfac46368f6b5b45d1556dcb0d579775222a2eed50c2d60477b7a6f8"],"state_sha256":"b33ef9096a0f8f1a2de62d9ad9aeadee47c4486c568caf541643803cca16a9fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PyDwXWLW+NW+Kbr18u5LNbOAbRvqT7SqJ5893wI451Wi6nFItjH4RUO6Zpx4Lra9b30JAfY6Nkv2ssKu/DNyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:37:24.316950Z","bundle_sha256":"5a44576dd9adcaf93d9bc0cedd07c2c04d921d90089e29ca3efdfafd33720e1e"}}