{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:F5EPTPQWZAXVIMRBFXIIKVVWL3","short_pith_number":"pith:F5EPTPQW","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"},"canonical_sha256":"2f48f9be16c82f5432212dd08556b65efe2595aec7d1a42fb63ddaf7b69a3b9b","source":{"kind":"arxiv","id":"2103.16071","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.16071","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"2103.16071v2","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.16071","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"F5EPTPQWZAXV","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"pith_short_16","alias_value":"F5EPTPQWZAXVIMRB","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"pith_short_8","alias_value":"F5EPTPQW","created_at":"2026-07-05T02:28:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:F5EPTPQWZAXVIMRBFXIIKVVWL3","target":"record","payload":{"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"},"canonical_sha256":"2f48f9be16c82f5432212dd08556b65efe2595aec7d1a42fb63ddaf7b69a3b9b","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"},"source_kind":"arxiv","source_id":"2103.16071","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwP5LGI5VwvzuUQ6z+KwP6x2UAiV32WCwJLHhugeYul87z6THarUzrEpG/jo6mDz4ZRAJVjG2hbCIF9N9nyrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:12:08.420095Z"},"content_sha256":"a341bab5f7253f5af922b930d8cfa27bcbeaa1e85670c260e22301e0d10977c1","schema_version":"1.0","event_id":"sha256:a341bab5f7253f5af922b930d8cfa27bcbeaa1e85670c260e22301e0d10977c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:F5EPTPQWZAXVIMRBFXIIKVVWL3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhpCTfalrNm+A5zfFEFbNIPcel2dwby5Hox8U9BYLg33OWwPpzmzNh1Zo44CkLJVr46hj65gbPDT4GgXQgcDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:12:08.420482Z"},"content_sha256":"1a64fdafb868040899296554e837195e9cb494afca1ec6dba4e5df1a3d6e20e5","schema_version":"1.0","event_id":"sha256:1a64fdafb868040899296554e837195e9cb494afca1ec6dba4e5df1a3d6e20e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/bundle.json","state_url":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-09T04:12:08Z","links":{"resolver":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3","bundle":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/bundle.json","state":"https://pith.science/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5EPTPQWZAXVIMRBFXIIKVVWL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:F5EPTPQWZAXVIMRBFXIIKVVWL3","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":"7bb4a3c5273649fe23c3d98035e26665a49f728189ada3d8aaa31a4350c27ca9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2021-03-30T04:39:46Z","title_canon_sha256":"ace6d02cb1d0304b740b1115deb2d5e25657211375213cbd5d3bfc035b2075b1"},"schema_version":"1.0","source":{"id":"2103.16071","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.16071","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"2103.16071v2","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.16071","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"F5EPTPQWZAXV","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"pith_short_16","alias_value":"F5EPTPQWZAXVIMRB","created_at":"2026-07-05T02:28:08Z"},{"alias_kind":"pith_short_8","alias_value":"F5EPTPQW","created_at":"2026-07-05T02:28:08Z"}],"graph_snapshots":[{"event_id":"sha256:1a64fdafb868040899296554e837195e9cb494afca1ec6dba4e5df1a3d6e20e5","target":"graph","created_at":"2026-07-05T02:28:08Z","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/2103.16071/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 $","authors_text":"Ahmed Abdelkader, David M. Mount","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2021-03-30T04:39:46Z","title":"Approximate Nearest-Neighbor Search for Line Segments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.16071","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:a341bab5f7253f5af922b930d8cfa27bcbeaa1e85670c260e22301e0d10977c1","target":"record","created_at":"2026-07-05T02:28:08Z","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":"7bb4a3c5273649fe23c3d98035e26665a49f728189ada3d8aaa31a4350c27ca9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2021-03-30T04:39:46Z","title_canon_sha256":"ace6d02cb1d0304b740b1115deb2d5e25657211375213cbd5d3bfc035b2075b1"},"schema_version":"1.0","source":{"id":"2103.16071","kind":"arxiv","version":2}},"canonical_sha256":"2f48f9be16c82f5432212dd08556b65efe2595aec7d1a42fb63ddaf7b69a3b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f48f9be16c82f5432212dd08556b65efe2595aec7d1a42fb63ddaf7b69a3b9b","first_computed_at":"2026-07-05T02:28:08.590879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:28:08.590879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wouz0URkaOFmrKA1Jm7ogO444dXyCXhXwijHDgHVbIc4zxWuRMCTOLRxKpuiRC9Xd+LeIdWXztHv8WfE2zpODg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:28:08.591362Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.16071","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a341bab5f7253f5af922b930d8cfa27bcbeaa1e85670c260e22301e0d10977c1","sha256:1a64fdafb868040899296554e837195e9cb494afca1ec6dba4e5df1a3d6e20e5"],"state_sha256":"c7f487824def6ee816d0fa74708ba950691a39a4fbb812bf2e9fdc7e08bb8739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBAr6qjIidypYm7NUFRffM/1QmxmkDr5Nxl/mZtCQIqseZ7B/y1Y2xX68c+7KmIMLuJmOei8N33mofW4ivseDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T04:12:08.422762Z","bundle_sha256":"90eeb875bed37075a23cad5dd1073eaec523a1de861ccda4d0d050400c3ef5f3"}}