{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IR724GQFG3SV4F76YY2OKWIHP3","short_pith_number":"pith:IR724GQF","schema_version":"1.0","canonical_sha256":"447fae1a0536e55e17fec634e559077ecefe31ef93cfe2d084fff6d08330c53e","source":{"kind":"arxiv","id":"1704.01460","version":1},"attestation_state":"computed","paper":{"title":"Comparison Based Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Debarghya Ghoshdastidar, Siavash Haghiri, Ulrike von Luxburg","submitted_at":"2017-04-05T14:54:28Z","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"},"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":"1704.01460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-05T14:54:28Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"90a2f92c2f230f20d8abc3131b960bf2794e9c07920321555ebdfb5e469356b7","abstract_canon_sha256":"f538630c8f042394970de254fbc8e48399726d9d3bc372d8348bed257f17d9f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:56.373920Z","signature_b64":"byCVGUmiIZOsOT7jNWbKPaozbv1FNPzte52+Frg4kMjQ9S/HrDCk6SbBO8TU63xqtJHdfLYGvqgG/B17oQNkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"447fae1a0536e55e17fec634e559077ecefe31ef93cfe2d084fff6d08330c53e","last_reissued_at":"2026-05-18T00:46:56.373524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:56.373524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison Based Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Debarghya Ghoshdastidar, Siavash Haghiri, Ulrike von Luxburg","submitted_at":"2017-04-05T14:54:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01460","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":"1704.01460","created_at":"2026-05-18T00:46:56.373585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01460v1","created_at":"2026-05-18T00:46:56.373585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01460","created_at":"2026-05-18T00:46:56.373585+00:00"},{"alias_kind":"pith_short_12","alias_value":"IR724GQFG3SV","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IR724GQFG3SV4F76","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IR724GQF","created_at":"2026-05-18T12:31:21.493067+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/IR724GQFG3SV4F76YY2OKWIHP3","json":"https://pith.science/pith/IR724GQFG3SV4F76YY2OKWIHP3.json","graph_json":"https://pith.science/api/pith-number/IR724GQFG3SV4F76YY2OKWIHP3/graph.json","events_json":"https://pith.science/api/pith-number/IR724GQFG3SV4F76YY2OKWIHP3/events.json","paper":"https://pith.science/paper/IR724GQF"},"agent_actions":{"view_html":"https://pith.science/pith/IR724GQFG3SV4F76YY2OKWIHP3","download_json":"https://pith.science/pith/IR724GQFG3SV4F76YY2OKWIHP3.json","view_paper":"https://pith.science/paper/IR724GQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01460&json=true","fetch_graph":"https://pith.science/api/pith-number/IR724GQFG3SV4F76YY2OKWIHP3/graph.json","fetch_events":"https://pith.science/api/pith-number/IR724GQFG3SV4F76YY2OKWIHP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IR724GQFG3SV4F76YY2OKWIHP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IR724GQFG3SV4F76YY2OKWIHP3/action/storage_attestation","attest_author":"https://pith.science/pith/IR724GQFG3SV4F76YY2OKWIHP3/action/author_attestation","sign_citation":"https://pith.science/pith/IR724GQFG3SV4F76YY2OKWIHP3/action/citation_signature","submit_replication":"https://pith.science/pith/IR724GQFG3SV4F76YY2OKWIHP3/action/replication_record"}},"created_at":"2026-05-18T00:46:56.373585+00:00","updated_at":"2026-05-18T00:46:56.373585+00:00"}