{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DCYINHI7ZTW3YNIFIWLQGU3227","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":"e3129be7c214d4e547f6dd8c64ba36b3a078f1a5564abaa01e7e0af263bde638","cross_cats_sorted":["cs.CG","cs.DB","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T07:35:45Z","title_canon_sha256":"60f54726fa09534248e11598a5712ff69deecad9b79068427afd43793b962dda"},"schema_version":"1.0","source":{"id":"1806.09823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09823","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09823v1","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09823","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"DCYINHI7ZTW3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCYINHI7ZTW3YNIF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCYINHI7","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:a0670d5c0356f88266c5abf168bdd79d57c684e5d42b6372862de7ef2a2c8f39","target":"graph","created_at":"2026-05-18T00:12:23Z","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":"The nearest neighbor problem is defined as follows: Given a set $P$ of $n$ points in some metric space $(X,D)$, build a data structure that, given any point $q$, returns a point in $P$ that is closest to $q$ (its \"nearest neighbor\" in $P$). The data structure stores additional information about the set $P$, which is then used to find the nearest neighbor without computing all distances between $q$ and $P$. The problem has a wide range of applications in machine learning, computer vision, databases and other fields.\n  To reduce the time needed to find nearest neighbors and the amount of memory ","authors_text":"Alexandr Andoni, Ilya Razenshteyn, Piotr Indyk","cross_cats":["cs.CG","cs.DB","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T07:35:45Z","title":"Approximate Nearest Neighbor Search in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09823","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:8278a1c718baf1f6e3d3f6ba3a38810f508629386d258061d905cd5f306f6a8f","target":"record","created_at":"2026-05-18T00:12:23Z","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":"e3129be7c214d4e547f6dd8c64ba36b3a078f1a5564abaa01e7e0af263bde638","cross_cats_sorted":["cs.CG","cs.DB","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T07:35:45Z","title_canon_sha256":"60f54726fa09534248e11598a5712ff69deecad9b79068427afd43793b962dda"},"schema_version":"1.0","source":{"id":"1806.09823","kind":"arxiv","version":1}},"canonical_sha256":"18b0869d1fccedbc3505459703537ad7e6a26a301a030774c48415a5e4fb2a43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18b0869d1fccedbc3505459703537ad7e6a26a301a030774c48415a5e4fb2a43","first_computed_at":"2026-05-18T00:12:23.234186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:23.234186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"um+d+7xvBClyAfsM0V0WYhznrQB5MLv6LHwZaGU1IjRmEay98ijEaXWf6hTkfZ34puKZF8IbGnURYpCda8ahBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:23.234910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8278a1c718baf1f6e3d3f6ba3a38810f508629386d258061d905cd5f306f6a8f","sha256:a0670d5c0356f88266c5abf168bdd79d57c684e5d42b6372862de7ef2a2c8f39"],"state_sha256":"aecb0c6750cab10ac14f747b30e1cd571a306a91a3e0ea86ca7b90e9c0769a76"}