{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QUSL7KND34TRCL7VPBKLHGY5IC","short_pith_number":"pith:QUSL7KND","schema_version":"1.0","canonical_sha256":"8524bfa9a3df27112ff57854b39b1d409d45aa94dc3fa444bff52114d158617f","source":{"kind":"arxiv","id":"2004.08949","version":1},"attestation_state":"computed","paper":{"title":"Quantum algorithms for computational geometry problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","quant-ph"],"primary_cat":"cs.CG","authors_text":"Andris Ambainis, Nikita Larka","submitted_at":"2020-04-19T20:01:50Z","abstract_excerpt":"We study quantum algorithms for problems in computational geometry, such as POINT-ON-3-LINES problem. In this problem, we are given a set of lines and we are asked to find a point that lies on at least $3$ of these lines. POINT-ON-3-LINES and many other computational geometry problems are known to be 3SUM-HARD. That is, solving them classically requires time $\\Omega(n^{2-o(1)})$, unless there is faster algorithm for the well known 3SUM problem (in which we are given a set $S$ of $n$ integers and have to determine if there are $a, b, c \\in S$ such that $a + b + c = 0$). Quantumly, 3SUM can be s"},"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":"2004.08949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-04-19T20:01:50Z","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"title_canon_sha256":"9b49ca65d36a3822e712c594b610dbde2d94875d36f64b5469a9ea4227179b41","abstract_canon_sha256":"c1c5ff9f31384bab169c4cf4f5db67ff6bbe5788d77455f2da627234a96b69a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:11.684737Z","signature_b64":"JKOWRsyYXQ9r6rTeThBq8YLe5hUx+0BnELwPH+i8UPJx95fjIe7riK8fP0AkABPPORhliFGdI4vAcirRTguYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8524bfa9a3df27112ff57854b39b1d409d45aa94dc3fa444bff52114d158617f","last_reissued_at":"2026-07-05T00:56:11.684381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:11.684381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms for computational geometry problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","quant-ph"],"primary_cat":"cs.CG","authors_text":"Andris Ambainis, Nikita Larka","submitted_at":"2020-04-19T20:01:50Z","abstract_excerpt":"We study quantum algorithms for problems in computational geometry, such as POINT-ON-3-LINES problem. In this problem, we are given a set of lines and we are asked to find a point that lies on at least $3$ of these lines. POINT-ON-3-LINES and many other computational geometry problems are known to be 3SUM-HARD. That is, solving them classically requires time $\\Omega(n^{2-o(1)})$, unless there is faster algorithm for the well known 3SUM problem (in which we are given a set $S$ of $n$ integers and have to determine if there are $a, b, c \\in S$ such that $a + b + c = 0$). Quantumly, 3SUM can be s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08949","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/2004.08949/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":"2004.08949","created_at":"2026-07-05T00:56:11.684443+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.08949v1","created_at":"2026-07-05T00:56:11.684443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08949","created_at":"2026-07-05T00:56:11.684443+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUSL7KND34TR","created_at":"2026-07-05T00:56:11.684443+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUSL7KND34TRCL7V","created_at":"2026-07-05T00:56:11.684443+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUSL7KND","created_at":"2026-07-05T00:56:11.684443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC","json":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC.json","graph_json":"https://pith.science/api/pith-number/QUSL7KND34TRCL7VPBKLHGY5IC/graph.json","events_json":"https://pith.science/api/pith-number/QUSL7KND34TRCL7VPBKLHGY5IC/events.json","paper":"https://pith.science/paper/QUSL7KND"},"agent_actions":{"view_html":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC","download_json":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC.json","view_paper":"https://pith.science/paper/QUSL7KND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.08949&json=true","fetch_graph":"https://pith.science/api/pith-number/QUSL7KND34TRCL7VPBKLHGY5IC/graph.json","fetch_events":"https://pith.science/api/pith-number/QUSL7KND34TRCL7VPBKLHGY5IC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/action/storage_attestation","attest_author":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/action/author_attestation","sign_citation":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/action/citation_signature","submit_replication":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/action/replication_record"}},"created_at":"2026-07-05T00:56:11.684443+00:00","updated_at":"2026-07-05T00:56:11.684443+00:00"}