{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:ZYSL557ZIZSU6G2FQJ77XMBSQK","short_pith_number":"pith:ZYSL557Z","canonical_record":{"source":{"id":"quant-ph/0509181","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-26T19:44:23Z","cross_cats_sorted":[],"title_canon_sha256":"ade635f05454fd1b550446025211cbebcc9d748351bee4d3f89923aa76cfce0f","abstract_canon_sha256":"1dd23ebdef3668e761980969b4009b8150a2f9aded28c26b75c5fcccdd2949a8"},"schema_version":"1.0"},"canonical_sha256":"ce24bef7f946654f1b45827ffbb03282819cb0fba7cfe29756da4caee98c78af","source":{"kind":"arxiv","id":"quant-ph/0509181","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0509181","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509181v3","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509181","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZYSL557ZIZSU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZYSL557ZIZSU6G2F","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZYSL557Z","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:ZYSL557ZIZSU6G2FQJ77XMBSQK","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0509181","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-26T19:44:23Z","cross_cats_sorted":[],"title_canon_sha256":"ade635f05454fd1b550446025211cbebcc9d748351bee4d3f89923aa76cfce0f","abstract_canon_sha256":"1dd23ebdef3668e761980969b4009b8150a2f9aded28c26b75c5fcccdd2949a8"},"schema_version":"1.0"},"canonical_sha256":"ce24bef7f946654f1b45827ffbb03282819cb0fba7cfe29756da4caee98c78af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:36.517095Z","signature_b64":"AosCtja29bG7ajbWArrF6ccMY6jgXc5dnordlIFMpPECsTXav1FT2z6Jf0CQb/b20AVTGifRNrUftpO2Ygm8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce24bef7f946654f1b45827ffbb03282819cb0fba7cfe29756da4caee98c78af","last_reissued_at":"2026-05-18T04:09:36.516665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:36.516665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0509181","source_version":3,"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-18T04:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXU9Krlq86vSfEEtonQpS5QKmlXhAQFDVZ/zSQjndGy8OMcvKCWxHKr8tgj0pUEko6iJJkZKQRM8TXkM0Zi3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:58:42.354405Z"},"content_sha256":"7231d91da64200cbb5257592233d3fddb1c8d203aa893a2c89f351afc2ca8282","schema_version":"1.0","event_id":"sha256:7231d91da64200cbb5257592233d3fddb1c8d203aa893a2c89f351afc2ca8282"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:ZYSL557ZIZSU6G2FQJ77XMBSQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Communication Complexity of the Hamming Distance Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shengyu Zhang, Wei Huang, Yaoyun Shi, Yufan Zhu","submitted_at":"2005-09-26T19:44:23Z","abstract_excerpt":"We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two n-bit strings is no less than a threshold d. We prove a quantum lower bound of \\Omega(d) qubits in the general interactive model with shared prior entanglement. We also construct a classical protocol of O(d \\log d) bits in the restricted Simultaneous Message Passing model, improving previous protocols of O(d^2) bits (A. C.-C. Yao, Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 77-81, 2003), and O(d\\log n)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509181","kind":"arxiv","version":3},"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-18T04:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0Xxq4XUUt6/j/V8FxRknLM4pxZYERAeU2xdbJx83kDqzhES5ZKhL01S7wJ7BZ0O13zdyOTKvqVQ5WdC/Mr9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:58:42.354819Z"},"content_sha256":"46f74d81afa52dfbb95e3619c5434b2769af963d2d30d01f15c2c74260dbadf8","schema_version":"1.0","event_id":"sha256:46f74d81afa52dfbb95e3619c5434b2769af963d2d30d01f15c2c74260dbadf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYSL557ZIZSU6G2FQJ77XMBSQK/bundle.json","state_url":"https://pith.science/pith/ZYSL557ZIZSU6G2FQJ77XMBSQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYSL557ZIZSU6G2FQJ77XMBSQK/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-26T11:58:42Z","links":{"resolver":"https://pith.science/pith/ZYSL557ZIZSU6G2FQJ77XMBSQK","bundle":"https://pith.science/pith/ZYSL557ZIZSU6G2FQJ77XMBSQK/bundle.json","state":"https://pith.science/pith/ZYSL557ZIZSU6G2FQJ77XMBSQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYSL557ZIZSU6G2FQJ77XMBSQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:ZYSL557ZIZSU6G2FQJ77XMBSQK","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":"1dd23ebdef3668e761980969b4009b8150a2f9aded28c26b75c5fcccdd2949a8","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-26T19:44:23Z","title_canon_sha256":"ade635f05454fd1b550446025211cbebcc9d748351bee4d3f89923aa76cfce0f"},"schema_version":"1.0","source":{"id":"quant-ph/0509181","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0509181","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509181v3","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509181","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZYSL557ZIZSU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZYSL557ZIZSU6G2F","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZYSL557Z","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:46f74d81afa52dfbb95e3619c5434b2769af963d2d30d01f15c2c74260dbadf8","target":"graph","created_at":"2026-05-18T04:09:36Z","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":"We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two n-bit strings is no less than a threshold d. We prove a quantum lower bound of \\Omega(d) qubits in the general interactive model with shared prior entanglement. We also construct a classical protocol of O(d \\log d) bits in the restricted Simultaneous Message Passing model, improving previous protocols of O(d^2) bits (A. C.-C. Yao, Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 77-81, 2003), and O(d\\log n)","authors_text":"Shengyu Zhang, Wei Huang, Yaoyun Shi, Yufan Zhu","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-09-26T19:44:23Z","title":"The Communication Complexity of the Hamming Distance Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509181","kind":"arxiv","version":3},"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:7231d91da64200cbb5257592233d3fddb1c8d203aa893a2c89f351afc2ca8282","target":"record","created_at":"2026-05-18T04:09:36Z","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":"1dd23ebdef3668e761980969b4009b8150a2f9aded28c26b75c5fcccdd2949a8","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-26T19:44:23Z","title_canon_sha256":"ade635f05454fd1b550446025211cbebcc9d748351bee4d3f89923aa76cfce0f"},"schema_version":"1.0","source":{"id":"quant-ph/0509181","kind":"arxiv","version":3}},"canonical_sha256":"ce24bef7f946654f1b45827ffbb03282819cb0fba7cfe29756da4caee98c78af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce24bef7f946654f1b45827ffbb03282819cb0fba7cfe29756da4caee98c78af","first_computed_at":"2026-05-18T04:09:36.516665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:36.516665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AosCtja29bG7ajbWArrF6ccMY6jgXc5dnordlIFMpPECsTXav1FT2z6Jf0CQb/b20AVTGifRNrUftpO2Ygm8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:36.517095Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0509181","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7231d91da64200cbb5257592233d3fddb1c8d203aa893a2c89f351afc2ca8282","sha256:46f74d81afa52dfbb95e3619c5434b2769af963d2d30d01f15c2c74260dbadf8"],"state_sha256":"a92d953ed7f069e90d3aa7cf5e4f00f72366c305ed0f403bba7cb901f7bda1cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owb7I3VSNy6MfvwjfpCERDCcMQE2h+EA9SGf8iGCP6m9h9sVjyIeojisY6TylhSmwiUjwvhLfGVl6VYyr2fZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:58:42.357760Z","bundle_sha256":"888490e267dcce28234c8cf9569024512e46c08eb980795b76f16bc92e5e6a74"}}