{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IR724GQFG3SV4F76YY2OKWIHP3","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":"f538630c8f042394970de254fbc8e48399726d9d3bc372d8348bed257f17d9f0","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T14:54:28Z","title_canon_sha256":"90a2f92c2f230f20d8abc3131b960bf2794e9c07920321555ebdfb5e469356b7"},"schema_version":"1.0","source":{"id":"1704.01460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01460","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01460v1","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01460","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"IR724GQFG3SV","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IR724GQFG3SV4F76","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IR724GQF","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:eafad086d7f20106367d2c26fcabfe9bf9fa8c2e5cc5e39f47a8a10a3282c4e5","target":"graph","created_at":"2026-05-18T00:46:56Z","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":"We consider machine learning in a comparison-based setting where we are given a set of points in a metric space, but we have no access to the actual distances between the points. Instead, we can only ask an oracle whether the distance between two points $i$ and $j$ is smaller than the distance between the points $i$ and $k$. We are concerned with data structures and algorithms to find nearest neighbors based on such comparisons. We focus on a simple yet effective algorithm that recursively splits the space by first selecting two random pivot points and then assigning all other points to the cl","authors_text":"Debarghya Ghoshdastidar, Siavash Haghiri, Ulrike von Luxburg","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T14:54:28Z","title":"Comparison Based Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01460","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:2247addcd9eb2b2555ab0feedf02ad7de1ebda89e2d1afd006631c0da64dc248","target":"record","created_at":"2026-05-18T00:46:56Z","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":"f538630c8f042394970de254fbc8e48399726d9d3bc372d8348bed257f17d9f0","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T14:54:28Z","title_canon_sha256":"90a2f92c2f230f20d8abc3131b960bf2794e9c07920321555ebdfb5e469356b7"},"schema_version":"1.0","source":{"id":"1704.01460","kind":"arxiv","version":1}},"canonical_sha256":"447fae1a0536e55e17fec634e559077ecefe31ef93cfe2d084fff6d08330c53e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"447fae1a0536e55e17fec634e559077ecefe31ef93cfe2d084fff6d08330c53e","first_computed_at":"2026-05-18T00:46:56.373524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:56.373524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"byCVGUmiIZOsOT7jNWbKPaozbv1FNPzte52+Frg4kMjQ9S/HrDCk6SbBO8TU63xqtJHdfLYGvqgG/B17oQNkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:56.373920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2247addcd9eb2b2555ab0feedf02ad7de1ebda89e2d1afd006631c0da64dc248","sha256:eafad086d7f20106367d2c26fcabfe9bf9fa8c2e5cc5e39f47a8a10a3282c4e5"],"state_sha256":"a8bfa81824eec075aeaefcdd096a432bd6f0ded5b9593745a1665447f7985c9c"}