{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7MNERLS5FFIA2ZXEMFBIIQVZF5","short_pith_number":"pith:7MNERLS5","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"},"canonical_sha256":"fb1a48ae5d29500d66e461428442b92f4b04640156e855031be06c409e3b8e1a","source":{"kind":"arxiv","id":"1611.07303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07303","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07303v1","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07303","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"7MNERLS5FFIA","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7MNERLS5FFIA2ZXE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7MNERLS5","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7MNERLS5FFIA2ZXEMFBIIQVZF5","target":"record","payload":{"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"},"canonical_sha256":"fb1a48ae5d29500d66e461428442b92f4b04640156e855031be06c409e3b8e1a","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"},"source_kind":"arxiv","source_id":"1611.07303","source_version":1,"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-05-18T00:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mt5il0uCo08BuSTx6oEsXByILvdycR+Jqf9f7WPRBqdJr6xEzFJPZRYxsKaj8UGrIRGxWnlZi4SipH7LXHzoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:55:57.172996Z"},"content_sha256":"d3db8aacb2157e9ee81ab8d0d34f596b7b0116c230018337939e04ff12892522","schema_version":"1.0","event_id":"sha256:d3db8aacb2157e9ee81ab8d0d34f596b7b0116c230018337939e04ff12892522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7MNERLS5FFIA2ZXEMFBIIQVZF5","target":"graph","payload":{"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"},"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-05-18T00:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HVSLoldCt0c4I73Ja1gR+QjkTfevU1e1Fjz0q0M+ge6X04hmYkk3RO0uyTJpLomzN3SlsKX94O0+/zl2R42BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:55:57.173349Z"},"content_sha256":"da1ef4035b9ab9e948876301cfaf0a5e5df74b4e857f47d24c4dde9066d1aaa1","schema_version":"1.0","event_id":"sha256:da1ef4035b9ab9e948876301cfaf0a5e5df74b4e857f47d24c4dde9066d1aaa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/bundle.json","state_url":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/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-06-03T18:55:57Z","links":{"resolver":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5","bundle":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/bundle.json","state":"https://pith.science/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MNERLS5FFIA2ZXEMFBIIQVZF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7MNERLS5FFIA2ZXEMFBIIQVZF5","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":"feb280f7a06eca0179d675ea5bfac364fd0e9d036c402edb456de8440d1018cd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T14:06:14Z","title_canon_sha256":"1d6bf7f0abf4e89994b1de7f990261292031308305d835426a0904cdb8beb59b"},"schema_version":"1.0","source":{"id":"1611.07303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07303","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07303v1","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07303","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"7MNERLS5FFIA","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7MNERLS5FFIA2ZXE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7MNERLS5","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:da1ef4035b9ab9e948876301cfaf0a5e5df74b4e857f47d24c4dde9066d1aaa1","target":"graph","created_at":"2026-05-18T00:57:24Z","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"},"paper":{"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 ","authors_text":"Francesco Silvestri, Johan Sivertsen, Matthew Skala, Rasmus Pagh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T14:06:14Z","title":"Approximate Furthest Neighbor with Application to Annulus Query"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07303","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:d3db8aacb2157e9ee81ab8d0d34f596b7b0116c230018337939e04ff12892522","target":"record","created_at":"2026-05-18T00:57:24Z","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":"feb280f7a06eca0179d675ea5bfac364fd0e9d036c402edb456de8440d1018cd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-11-22T14:06:14Z","title_canon_sha256":"1d6bf7f0abf4e89994b1de7f990261292031308305d835426a0904cdb8beb59b"},"schema_version":"1.0","source":{"id":"1611.07303","kind":"arxiv","version":1}},"canonical_sha256":"fb1a48ae5d29500d66e461428442b92f4b04640156e855031be06c409e3b8e1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb1a48ae5d29500d66e461428442b92f4b04640156e855031be06c409e3b8e1a","first_computed_at":"2026-05-18T00:57:24.335414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:24.335414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oSb1ymgFrXiX5l5niiKGl94Is+Gjc808TF3jfrRwY//ZHjjOjUWCKsrsG5Ct56LF15RSa1PsA2zlIVWf9A8gAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:24.335888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3db8aacb2157e9ee81ab8d0d34f596b7b0116c230018337939e04ff12892522","sha256:da1ef4035b9ab9e948876301cfaf0a5e5df74b4e857f47d24c4dde9066d1aaa1"],"state_sha256":"758956a7b453bc42f0d06675f81a3da1c78d3eef67b55bd1e4faf2ce3d48ba3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WVyhopnhwxTO2UTvNObWM6ISDP4ueWBuxPLfnLIZ6OidCDV7kqY/Q90Y0pdg4zWgMLrlho9mT939X4KSO6aBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:55:57.175370Z","bundle_sha256":"583bd29b004a746851b9c55813e316094a82e89b2617520880b8d520ac15eb3f"}}