{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CCFRI5XK7EYNWJETT4KQHMVY3Q","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":"21abaf900e0087a05c561bd1b9a2bbceafedcfb8a48cb79863d7f4fe6c090f0f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T10:29:06Z","title_canon_sha256":"089d06349299592636f5df040de84904158464921343d4e6b4d76038d2519175"},"schema_version":"1.0","source":{"id":"2405.01160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.01160","created_at":"2026-07-05T08:14:31Z"},{"alias_kind":"arxiv_version","alias_value":"2405.01160v1","created_at":"2026-07-05T08:14:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01160","created_at":"2026-07-05T08:14:31Z"},{"alias_kind":"pith_short_12","alias_value":"CCFRI5XK7EYN","created_at":"2026-07-05T08:14:31Z"},{"alias_kind":"pith_short_16","alias_value":"CCFRI5XK7EYNWJET","created_at":"2026-07-05T08:14:31Z"},{"alias_kind":"pith_short_8","alias_value":"CCFRI5XK","created_at":"2026-07-05T08:14:31Z"}],"graph_snapshots":[{"event_id":"sha256:97c49355a027b433b977128e6ea6c71bd0498960afd713bf578073674112fed9","target":"graph","created_at":"2026-07-05T08:14:31Z","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/2405.01160/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aleksandrs Belovs, Jevg\\=enijs Vihrovs, Vladimirs Andrejevs","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T10:29:06Z","title":"Quantum algorithms for Hopcroft's problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01160","kind":"arxiv","version":1},"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:36c1abc174fa0d01914ea7f5e7c81ec8feee9584a9b78b333f5b5f18fab5fefc","target":"record","created_at":"2026-07-05T08:14:31Z","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":"21abaf900e0087a05c561bd1b9a2bbceafedcfb8a48cb79863d7f4fe6c090f0f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-02T10:29:06Z","title_canon_sha256":"089d06349299592636f5df040de84904158464921343d4e6b4d76038d2519175"},"schema_version":"1.0","source":{"id":"2405.01160","kind":"arxiv","version":1}},"canonical_sha256":"108b1476eaf930db24939f1503b2b8dc32613970d21d28498831df7303cc59e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"108b1476eaf930db24939f1503b2b8dc32613970d21d28498831df7303cc59e3","first_computed_at":"2026-07-05T08:14:31.320886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:14:31.320886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ekE7Vb07f3YbKplchDbHReAvtr1U2yKy6dmd62eBAfYsnKi3p0tGeTwM4vuMgOGcRAB3j9URu45rn/bYJdGzBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:14:31.321303Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.01160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36c1abc174fa0d01914ea7f5e7c81ec8feee9584a9b78b333f5b5f18fab5fefc","sha256:97c49355a027b433b977128e6ea6c71bd0498960afd713bf578073674112fed9"],"state_sha256":"56643eb867c52b5a8ad522df98eac2689799a4ebc756b33c337ed6f5598da44b"}