{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AD6X5VMHWQN6Q3LCC2KOYEVCNY","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":"99efbf8939c37d83da949c08129d04d30273e343f0f3cabb4b7a5b97e868f531","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-05T18:01:23Z","title_canon_sha256":"eaee2ad63c16feca05a6a31dbc1685c7b5b6c8b8fcb4c8000dfa6c71950b42d4"},"schema_version":"1.0","source":{"id":"1911.01973","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.01973","created_at":"2026-07-05T01:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1911.01973v2","created_at":"2026-07-05T01:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01973","created_at":"2026-07-05T01:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"AD6X5VMHWQN6","created_at":"2026-07-05T01:25:11Z"},{"alias_kind":"pith_short_16","alias_value":"AD6X5VMHWQN6Q3LC","created_at":"2026-07-05T01:25:11Z"},{"alias_kind":"pith_short_8","alias_value":"AD6X5VMH","created_at":"2026-07-05T01:25:11Z"}],"graph_snapshots":[{"event_id":"sha256:c24a684ce6f97c48bf15a97aa70a15a710a7b67390022c30129251516e3165d3","target":"graph","created_at":"2026-07-05T01:25:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.01973/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The closest pair problem is a fundamental problem of computational geometry: given a set of $n$ points in a $d$-dimensional space, find a pair with the smallest distance. A classical algorithm taught in introductory courses solves this problem in $O(n\\log n)$ time in constant dimensions (i.e., when $d=O(1)$). This paper asks and answers the question of the problem's quantum time complexity. Specifically, we give an $\\tilde{O}(n^{2/3})$ algorithm in constant dimensions, which is optimal up to a polylogarithmic factor by the lower bound on the quantum query complexity of element distinctness. Th","authors_text":"Chunhao Wang, Han-Hsuan Lin, Nai-Hui Chia, Ruizhe Zhang, Scott Aaronson","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-05T18:01:23Z","title":"On the Quantum Complexity of Closest Pair and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01973","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:0c76d7f4c048ac547e2983110ca24cd15730c19cf0e3949155b6e7080539fee0","target":"record","created_at":"2026-07-05T01:25:11Z","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":"99efbf8939c37d83da949c08129d04d30273e343f0f3cabb4b7a5b97e868f531","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-05T18:01:23Z","title_canon_sha256":"eaee2ad63c16feca05a6a31dbc1685c7b5b6c8b8fcb4c8000dfa6c71950b42d4"},"schema_version":"1.0","source":{"id":"1911.01973","kind":"arxiv","version":2}},"canonical_sha256":"00fd7ed587b41be86d621694ec12a26e0c7d5b694ffb185b227a9d3500f75c3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00fd7ed587b41be86d621694ec12a26e0c7d5b694ffb185b227a9d3500f75c3f","first_computed_at":"2026-07-05T01:25:11.641945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:11.641945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"arUP3q7qEczVvcSDVU99BUQpa8fU76qFizqSRdKyZ/OU0T+cQTlfmBvOeSrNKdtRny43ggGsTZy1wForEULgBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:11.642512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.01973","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c76d7f4c048ac547e2983110ca24cd15730c19cf0e3949155b6e7080539fee0","sha256:c24a684ce6f97c48bf15a97aa70a15a710a7b67390022c30129251516e3165d3"],"state_sha256":"eb95f99729db3ef856d97165558df863b1fdf50074fbfbb6d917f7fa22e93dea"}