{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7MNERLS5FFIA2ZXEMFBIIQVZF5","short_pith_number":"pith:7MNERLS5","schema_version":"1.0","canonical_sha256":"fb1a48ae5d29500d66e461428442b92f4b04640156e855031be06c409e3b8e1a","source":{"kind":"arxiv","id":"1611.07303","version":1},"attestation_state":"computed","paper":{"title":"Approximate Furthest Neighbor with Application to Annulus Query","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Johan Sivertsen, Matthew Skala, Rasmus Pagh","submitted_at":"2016-11-22T14:06:14Z","abstract_excerpt":"Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries and present a simple, fast, and highly practical data structure for answering AFN queries in high- dimensional Euclidean space. The method builds on the technique of In- dyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk's approximation factor and reducing the running time by a logarithmic factor. We also present "},"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":"1611.07303","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T14:06:14Z","cross_cats_sorted":[],"title_canon_sha256":"1d6bf7f0abf4e89994b1de7f990261292031308305d835426a0904cdb8beb59b","abstract_canon_sha256":"feb280f7a06eca0179d675ea5bfac364fd0e9d036c402edb456de8440d1018cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:24.335888Z","signature_b64":"oSb1ymgFrXiX5l5niiKGl94Is+Gjc808TF3jfrRwY//ZHjjOjUWCKsrsG5Ct56LF15RSa1PsA2zlIVWf9A8gAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb1a48ae5d29500d66e461428442b92f4b04640156e855031be06c409e3b8e1a","last_reissued_at":"2026-05-18T00:57:24.335414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:24.335414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Furthest Neighbor with Application to Annulus Query","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Johan Sivertsen, Matthew Skala, Rasmus Pagh","submitted_at":"2016-11-22T14:06:14Z","abstract_excerpt":"Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries and present a simple, fast, and highly practical data structure for answering AFN queries in high- dimensional Euclidean space. The method builds on the technique of In- dyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk's approximation factor and reducing the running time by a logarithmic factor. We also present "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07303","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":"1611.07303","created_at":"2026-05-18T00:57:24.335484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07303v1","created_at":"2026-05-18T00:57:24.335484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07303","created_at":"2026-05-18T00:57:24.335484+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MNERLS5FFIA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MNERLS5FFIA2ZXE","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MNERLS5","created_at":"2026-05-18T12:30:04.600751+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/7MNERLS5FFIA2ZXEMFBIIQVZF5","json":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5.json","graph_json":"https://pith.science/api/pith-number/7MNERLS5FFIA2ZXEMFBIIQVZF5/graph.json","events_json":"https://pith.science/api/pith-number/7MNERLS5FFIA2ZXEMFBIIQVZF5/events.json","paper":"https://pith.science/paper/7MNERLS5"},"agent_actions":{"view_html":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5","download_json":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5.json","view_paper":"https://pith.science/paper/7MNERLS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07303&json=true","fetch_graph":"https://pith.science/api/pith-number/7MNERLS5FFIA2ZXEMFBIIQVZF5/graph.json","fetch_events":"https://pith.science/api/pith-number/7MNERLS5FFIA2ZXEMFBIIQVZF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/action/storage_attestation","attest_author":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/action/author_attestation","sign_citation":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/action/citation_signature","submit_replication":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/action/replication_record"}},"created_at":"2026-05-18T00:57:24.335484+00:00","updated_at":"2026-05-18T00:57:24.335484+00:00"}