{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:NUBJR5P3PMHQSLHJHV5QBWEADM","short_pith_number":"pith:NUBJR5P3","schema_version":"1.0","canonical_sha256":"6d0298f5fb7b0f092ce93d7b00d8801b1dfe6e4cf7a3aa6de27a13d419dc8932","source":{"kind":"arxiv","id":"quant-ph/0607173","version":1},"attestation_state":"computed","paper":{"title":"The one-way communication complexity of the Boolean Hidden Matching Problem","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Iordanis Kerenidis, Ran Raz","submitted_at":"2006-07-25T10:07:29Z","abstract_excerpt":"We give a tight lower bound of Omega(\\sqrt{n}) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(\\log n) qubits for this problem, we obtain an exponential separation of quantum and classical one-way communication complexity for partial functions. A similar result was independently obtained by Gavinsky, Kempe, de Wolf [GKdW06]. Our lower bound is obtained by Fourier analysis, using the Fourier coefficients inequality of Kahn Kalai and Linial [KKL88]."},"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":"quant-ph/0607173","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-07-25T10:07:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"62d8cc3ec4879d3e95817130c914b0410dc22e3c97365dee2db64d7775c14578","abstract_canon_sha256":"a8b45b2a996ec205867736689ad68ea3de4b0c10a23019c4f5ce67a608103f53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:56:14.535581Z","signature_b64":"/z+2AzIG5UVTf5uIPELLNBM9Rkk6b/jcwcxxdP8jclHuIUxdwfokeoWRgyW4NCcsMkNd2rv0kYODT1fysHscBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0298f5fb7b0f092ce93d7b00d8801b1dfe6e4cf7a3aa6de27a13d419dc8932","last_reissued_at":"2026-07-04T14:56:14.535139Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:56:14.535139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The one-way communication complexity of the Boolean Hidden Matching Problem","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Iordanis Kerenidis, Ran Raz","submitted_at":"2006-07-25T10:07:29Z","abstract_excerpt":"We give a tight lower bound of Omega(\\sqrt{n}) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(\\log n) qubits for this problem, we obtain an exponential separation of quantum and classical one-way communication complexity for partial functions. A similar result was independently obtained by Gavinsky, Kempe, de Wolf [GKdW06]. Our lower bound is obtained by Fourier analysis, using the Fourier coefficients inequality of Kahn Kalai and Linial [KKL88]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0607173","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0607173/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"quant-ph/0607173","created_at":"2026-07-04T14:56:14.535209+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0607173v1","created_at":"2026-07-04T14:56:14.535209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0607173","created_at":"2026-07-04T14:56:14.535209+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUBJR5P3PMHQ","created_at":"2026-07-04T14:56:14.535209+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUBJR5P3PMHQSLHJ","created_at":"2026-07-04T14:56:14.535209+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUBJR5P3","created_at":"2026-07-04T14:56:14.535209+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.11066","citing_title":"Quantum Coordination Advantages in AI State-Tracking Tasks: Semantic Compilation and Latent Memory","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM","json":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM.json","graph_json":"https://pith.science/api/pith-number/NUBJR5P3PMHQSLHJHV5QBWEADM/graph.json","events_json":"https://pith.science/api/pith-number/NUBJR5P3PMHQSLHJHV5QBWEADM/events.json","paper":"https://pith.science/paper/NUBJR5P3"},"agent_actions":{"view_html":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM","download_json":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM.json","view_paper":"https://pith.science/paper/NUBJR5P3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0607173&json=true","fetch_graph":"https://pith.science/api/pith-number/NUBJR5P3PMHQSLHJHV5QBWEADM/graph.json","fetch_events":"https://pith.science/api/pith-number/NUBJR5P3PMHQSLHJHV5QBWEADM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM/action/storage_attestation","attest_author":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM/action/author_attestation","sign_citation":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM/action/citation_signature","submit_replication":"https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM/action/replication_record"}},"created_at":"2026-07-04T14:56:14.535209+00:00","updated_at":"2026-07-04T14:56:14.535209+00:00"}