{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:F5EPTPQWZAXVIMRBFXIIKVVWL3","short_pith_number":"pith:F5EPTPQW","schema_version":"1.0","canonical_sha256":"2f48f9be16c82f5432212dd08556b65efe2595aec7d1a42fb63ddaf7b69a3b9b","source":{"kind":"arxiv","id":"2103.16071","version":2},"attestation_state":"computed","paper":{"title":"Approximate Nearest-Neighbor Search for Line Segments","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmed Abdelkader, David M. Mount","submitted_at":"2021-03-30T04:39:46Z","abstract_excerpt":"Approximate nearest-neighbor search is a fundamental algorithmic problem that continues to inspire study due its essential role in numerous contexts. In contrast to most prior work, which has focused on point sets, we consider nearest-neighbor queries against a set of line segments in $\\mathbb{R}^d$, for constant dimension $d$. Given a set $S$ of $n$ disjoint line segments in $\\mathbb{R}^d$ and an error parameter $\\varepsilon > 0$, the objective is to build a data structure such that for any query point $q$, it is possible to return a line segment whose Euclidean distance from $q$ is at most $"},"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":"2103.16071","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2021-03-30T04:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"ace6d02cb1d0304b740b1115deb2d5e25657211375213cbd5d3bfc035b2075b1","abstract_canon_sha256":"7bb4a3c5273649fe23c3d98035e26665a49f728189ada3d8aaa31a4350c27ca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:08.591362Z","signature_b64":"wouz0URkaOFmrKA1Jm7ogO444dXyCXhXwijHDgHVbIc4zxWuRMCTOLRxKpuiRC9Xd+LeIdWXztHv8WfE2zpODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f48f9be16c82f5432212dd08556b65efe2595aec7d1a42fb63ddaf7b69a3b9b","last_reissued_at":"2026-07-05T02:28:08.590879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:08.590879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Nearest-Neighbor Search for Line Segments","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmed Abdelkader, David M. Mount","submitted_at":"2021-03-30T04:39:46Z","abstract_excerpt":"Approximate nearest-neighbor search is a fundamental algorithmic problem that continues to inspire study due its essential role in numerous contexts. In contrast to most prior work, which has focused on point sets, we consider nearest-neighbor queries against a set of line segments in $\\mathbb{R}^d$, for constant dimension $d$. Given a set $S$ of $n$ disjoint line segments in $\\mathbb{R}^d$ and an error parameter $\\varepsilon > 0$, the objective is to build a data structure such that for any query point $q$, it is possible to return a line segment whose Euclidean distance from $q$ is at most $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.16071","kind":"arxiv","version":2},"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/2103.16071/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":"2103.16071","created_at":"2026-07-05T02:28:08.590937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.16071v2","created_at":"2026-07-05T02:28:08.590937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.16071","created_at":"2026-07-05T02:28:08.590937+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5EPTPQWZAXV","created_at":"2026-07-05T02:28:08.590937+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5EPTPQWZAXVIMRB","created_at":"2026-07-05T02:28:08.590937+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5EPTPQW","created_at":"2026-07-05T02:28:08.590937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03129","citing_title":"Parallel Metric Skiplists and Nearest Neighbor Search","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3","json":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3.json","graph_json":"https://pith.science/api/pith-number/F5EPTPQWZAXVIMRBFXIIKVVWL3/graph.json","events_json":"https://pith.science/api/pith-number/F5EPTPQWZAXVIMRBFXIIKVVWL3/events.json","paper":"https://pith.science/paper/F5EPTPQW"},"agent_actions":{"view_html":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3","download_json":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3.json","view_paper":"https://pith.science/paper/F5EPTPQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.16071&json=true","fetch_graph":"https://pith.science/api/pith-number/F5EPTPQWZAXVIMRBFXIIKVVWL3/graph.json","fetch_events":"https://pith.science/api/pith-number/F5EPTPQWZAXVIMRBFXIIKVVWL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/action/storage_attestation","attest_author":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/action/author_attestation","sign_citation":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/action/citation_signature","submit_replication":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/action/replication_record"}},"created_at":"2026-07-05T02:28:08.590937+00:00","updated_at":"2026-07-05T02:28:08.590937+00:00"}