{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4H5S5PHU6SOTGQUVXWCW2TSLHD","short_pith_number":"pith:4H5S5PHU","schema_version":"1.0","canonical_sha256":"e1fb2ebcf4f49d334295bd856d4e4b38f43e3ac32351f6c7a47fa1845f979b3b","source":{"kind":"arxiv","id":"1411.1519","version":1},"attestation_state":"computed","paper":{"title":"Approximate k-flat Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Huy L. Nguyen, Paul Seiferth, Wolfgang Mulzer, Yannik Stein","submitted_at":"2014-11-06T08:13:15Z","abstract_excerpt":"Let $k$ be a nonnegative integer. In the approximate $k$-flat nearest neighbor ($k$-ANN) problem, we are given a set $P \\subset \\mathbb{R}^d$ of $n$ points in $d$-dimensional space and a fixed approximation factor $c > 1$. Our goal is to preprocess $P$ so that we can efficiently answer approximate $k$-flat nearest neighbor queries: given a $k$-flat $F$, find a point in $P$ whose distance to $F$ is within a factor $c$ of the distance between $F$ and the closest point in $P$. The case $k = 0$ corresponds to the well-studied approximate nearest neighbor problem, for which a plethora of results ar"},"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":"1411.1519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-06T08:13:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a8d2c8d8f0e31f321948b1fcc72a30cd00fcbcdad8197278cbc60b3179cbb8a5","abstract_canon_sha256":"7f297b6dcc8b3dd66322400a5bbb3bbfadac1a02cc03061f230f9ef3faea5d08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:27.709732Z","signature_b64":"knbueoOHM7F9Uj+oLmzPouMQ3nffo93ap0Xs+34eyu0a+jFWnV4I5rgwHNsLdaNBuOpegkLxuLakNkl9vgnTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1fb2ebcf4f49d334295bd856d4e4b38f43e3ac32351f6c7a47fa1845f979b3b","last_reissued_at":"2026-05-18T02:38:27.709221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:27.709221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate k-flat Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Huy L. Nguyen, Paul Seiferth, Wolfgang Mulzer, Yannik Stein","submitted_at":"2014-11-06T08:13:15Z","abstract_excerpt":"Let $k$ be a nonnegative integer. In the approximate $k$-flat nearest neighbor ($k$-ANN) problem, we are given a set $P \\subset \\mathbb{R}^d$ of $n$ points in $d$-dimensional space and a fixed approximation factor $c > 1$. Our goal is to preprocess $P$ so that we can efficiently answer approximate $k$-flat nearest neighbor queries: given a $k$-flat $F$, find a point in $P$ whose distance to $F$ is within a factor $c$ of the distance between $F$ and the closest point in $P$. The case $k = 0$ corresponds to the well-studied approximate nearest neighbor problem, for which a plethora of results ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1519","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":""},"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":"1411.1519","created_at":"2026-05-18T02:38:27.709307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1519v1","created_at":"2026-05-18T02:38:27.709307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1519","created_at":"2026-05-18T02:38:27.709307+00:00"},{"alias_kind":"pith_short_12","alias_value":"4H5S5PHU6SOT","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4H5S5PHU6SOTGQUV","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4H5S5PHU","created_at":"2026-05-18T12:28:14.216126+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/4H5S5PHU6SOTGQUVXWCW2TSLHD","json":"https://pith.science/pith/4H5S5PHU6SOTGQUVXWCW2TSLHD.json","graph_json":"https://pith.science/api/pith-number/4H5S5PHU6SOTGQUVXWCW2TSLHD/graph.json","events_json":"https://pith.science/api/pith-number/4H5S5PHU6SOTGQUVXWCW2TSLHD/events.json","paper":"https://pith.science/paper/4H5S5PHU"},"agent_actions":{"view_html":"https://pith.science/pith/4H5S5PHU6SOTGQUVXWCW2TSLHD","download_json":"https://pith.science/pith/4H5S5PHU6SOTGQUVXWCW2TSLHD.json","view_paper":"https://pith.science/paper/4H5S5PHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1519&json=true","fetch_graph":"https://pith.science/api/pith-number/4H5S5PHU6SOTGQUVXWCW2TSLHD/graph.json","fetch_events":"https://pith.science/api/pith-number/4H5S5PHU6SOTGQUVXWCW2TSLHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4H5S5PHU6SOTGQUVXWCW2TSLHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4H5S5PHU6SOTGQUVXWCW2TSLHD/action/storage_attestation","attest_author":"https://pith.science/pith/4H5S5PHU6SOTGQUVXWCW2TSLHD/action/author_attestation","sign_citation":"https://pith.science/pith/4H5S5PHU6SOTGQUVXWCW2TSLHD/action/citation_signature","submit_replication":"https://pith.science/pith/4H5S5PHU6SOTGQUVXWCW2TSLHD/action/replication_record"}},"created_at":"2026-05-18T02:38:27.709307+00:00","updated_at":"2026-05-18T02:38:27.709307+00:00"}