{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TBUCKSCNSFW56H7Y3LIDHA3XVI","short_pith_number":"pith:TBUCKSCN","schema_version":"1.0","canonical_sha256":"986825484d916ddf1ff8dad0338377aa09b6860c4361a5bad6e0722fef5ab229","source":{"kind":"arxiv","id":"2605.31516","version":1},"attestation_state":"computed","paper":{"title":"Experimental demonstration of quantum advantage in communication complexity for Euclidean distance problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eleni Diamanti, Iordanis Kerenidis, Niraj Kumar, Verena Yacoub","submitted_at":"2026-05-29T16:34:34Z","abstract_excerpt":"When considering the complexity of communication protocols, the aim is to perform a certain task with the minimum amount of communication resources, such as time and transmitted information. The use of quantum states may lead to an exponential advantage in the use of such resources. Here, we are interested in the task of calculating the Euclidean distance between two vectors representing real data sets. It has been previously shown that it is possible to obtain an advantage for this task based on quantum fingerprinting. This protocol is defined in the simultaneous message passing model of comm"},"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":"2605.31516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-29T16:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"dc7c975f10a704e415abf5f2332c2abadebff2f424405e41cd08af083ee2153f","abstract_canon_sha256":"e270cebb10df44590bb28fe883628a2767a7a12fb05b9f762c1a5c3d5addffaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:04:10.358027Z","signature_b64":"zT3F7V38qFTB2S/uIaNw6/1pkHQcH+pBT9dZE8CzBPBQzSKqMtTXi7XUB6FjZUm6LRLRPkWh2tmNEohdvLN8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"986825484d916ddf1ff8dad0338377aa09b6860c4361a5bad6e0722fef5ab229","last_reissued_at":"2026-06-01T02:04:10.357085Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:04:10.357085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Experimental demonstration of quantum advantage in communication complexity for Euclidean distance problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eleni Diamanti, Iordanis Kerenidis, Niraj Kumar, Verena Yacoub","submitted_at":"2026-05-29T16:34:34Z","abstract_excerpt":"When considering the complexity of communication protocols, the aim is to perform a certain task with the minimum amount of communication resources, such as time and transmitted information. The use of quantum states may lead to an exponential advantage in the use of such resources. Here, we are interested in the task of calculating the Euclidean distance between two vectors representing real data sets. It has been previously shown that it is possible to obtain an advantage for this task based on quantum fingerprinting. This protocol is defined in the simultaneous message passing model of comm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31516","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/2605.31516/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":"2605.31516","created_at":"2026-06-01T02:04:10.357235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.31516v1","created_at":"2026-06-01T02:04:10.357235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31516","created_at":"2026-06-01T02:04:10.357235+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBUCKSCNSFW5","created_at":"2026-06-01T02:04:10.357235+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBUCKSCNSFW56H7Y","created_at":"2026-06-01T02:04:10.357235+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBUCKSCN","created_at":"2026-06-01T02:04:10.357235+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08133","citing_title":"Communication Advantages from Quantum Dense Network Coding","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI","json":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI.json","graph_json":"https://pith.science/api/pith-number/TBUCKSCNSFW56H7Y3LIDHA3XVI/graph.json","events_json":"https://pith.science/api/pith-number/TBUCKSCNSFW56H7Y3LIDHA3XVI/events.json","paper":"https://pith.science/paper/TBUCKSCN"},"agent_actions":{"view_html":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI","download_json":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI.json","view_paper":"https://pith.science/paper/TBUCKSCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.31516&json=true","fetch_graph":"https://pith.science/api/pith-number/TBUCKSCNSFW56H7Y3LIDHA3XVI/graph.json","fetch_events":"https://pith.science/api/pith-number/TBUCKSCNSFW56H7Y3LIDHA3XVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI/action/storage_attestation","attest_author":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI/action/author_attestation","sign_citation":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI/action/citation_signature","submit_replication":"https://pith.science/pith/TBUCKSCNSFW56H7Y3LIDHA3XVI/action/replication_record"}},"created_at":"2026-06-01T02:04:10.357235+00:00","updated_at":"2026-06-01T02:04:10.357235+00:00"}