{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CCFRI5XK7EYNWJETT4KQHMVY3Q","short_pith_number":"pith:CCFRI5XK","schema_version":"1.0","canonical_sha256":"108b1476eaf930db24939f1503b2b8dc32613970d21d28498831df7303cc59e3","source":{"kind":"arxiv","id":"2405.01160","version":1},"attestation_state":"computed","paper":{"title":"Quantum algorithms for Hopcroft's problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Jevg\\=enijs Vihrovs, Vladimirs Andrejevs","submitted_at":"2024-05-02T10:29:06Z","abstract_excerpt":"In this work we study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry. Given $n$ points and $n$ lines in the plane, the task is to determine whether there is a point-line incidence. The classical complexity of this problem is well-studied, with the best known algorithm running in $O(n^{4/3})$ time, with matching lower bounds in some restricted settings. Our results are two different quantum algorithms with time complexity $\\widetilde O(n^{5/6})$. The first algorithm is based on partition trees and the quantum backtracking algorithm. The second"},"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":"2405.01160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T10:29:06Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"089d06349299592636f5df040de84904158464921343d4e6b4d76038d2519175","abstract_canon_sha256":"21abaf900e0087a05c561bd1b9a2bbceafedcfb8a48cb79863d7f4fe6c090f0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:31.321303Z","signature_b64":"ekE7Vb07f3YbKplchDbHReAvtr1U2yKy6dmd62eBAfYsnKi3p0tGeTwM4vuMgOGcRAB3j9URu45rn/bYJdGzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"108b1476eaf930db24939f1503b2b8dc32613970d21d28498831df7303cc59e3","last_reissued_at":"2026-07-05T08:14:31.320886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:31.320886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms for Hopcroft's problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Jevg\\=enijs Vihrovs, Vladimirs Andrejevs","submitted_at":"2024-05-02T10:29:06Z","abstract_excerpt":"In this work we study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry. Given $n$ points and $n$ lines in the plane, the task is to determine whether there is a point-line incidence. The classical complexity of this problem is well-studied, with the best known algorithm running in $O(n^{4/3})$ time, with matching lower bounds in some restricted settings. Our results are two different quantum algorithms with time complexity $\\widetilde O(n^{5/6})$. The first algorithm is based on partition trees and the quantum backtracking algorithm. The second"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01160","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/2405.01160/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":"2405.01160","created_at":"2026-07-05T08:14:31.320955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01160v1","created_at":"2026-07-05T08:14:31.320955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01160","created_at":"2026-07-05T08:14:31.320955+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCFRI5XK7EYN","created_at":"2026-07-05T08:14:31.320955+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCFRI5XK7EYNWJET","created_at":"2026-07-05T08:14:31.320955+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCFRI5XK","created_at":"2026-07-05T08:14:31.320955+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/CCFRI5XK7EYNWJETT4KQHMVY3Q","json":"https://pith.science/pith/CCFRI5XK7EYNWJETT4KQHMVY3Q.json","graph_json":"https://pith.science/api/pith-number/CCFRI5XK7EYNWJETT4KQHMVY3Q/graph.json","events_json":"https://pith.science/api/pith-number/CCFRI5XK7EYNWJETT4KQHMVY3Q/events.json","paper":"https://pith.science/paper/CCFRI5XK"},"agent_actions":{"view_html":"https://pith.science/pith/CCFRI5XK7EYNWJETT4KQHMVY3Q","download_json":"https://pith.science/pith/CCFRI5XK7EYNWJETT4KQHMVY3Q.json","view_paper":"https://pith.science/paper/CCFRI5XK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01160&json=true","fetch_graph":"https://pith.science/api/pith-number/CCFRI5XK7EYNWJETT4KQHMVY3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/CCFRI5XK7EYNWJETT4KQHMVY3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCFRI5XK7EYNWJETT4KQHMVY3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCFRI5XK7EYNWJETT4KQHMVY3Q/action/storage_attestation","attest_author":"https://pith.science/pith/CCFRI5XK7EYNWJETT4KQHMVY3Q/action/author_attestation","sign_citation":"https://pith.science/pith/CCFRI5XK7EYNWJETT4KQHMVY3Q/action/citation_signature","submit_replication":"https://pith.science/pith/CCFRI5XK7EYNWJETT4KQHMVY3Q/action/replication_record"}},"created_at":"2026-07-05T08:14:31.320955+00:00","updated_at":"2026-07-05T08:14:31.320955+00:00"}