{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NZPW3WN6TJRJIWO2GRBSSQDXD6","short_pith_number":"pith:NZPW3WN6","schema_version":"1.0","canonical_sha256":"6e5f6dd9be9a629459da34432940771fb3cdc18a4b48ecccedfdc24ac901234e","source":{"kind":"arxiv","id":"1506.03163","version":4},"attestation_state":"computed","paper":{"title":"Permutation Search Methods are Efficient, Yet Faster Search is Possible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.LG","authors_text":"Bilegsaikhan Naidan, Eric Nyberg, Leonid Boytsov","submitted_at":"2015-06-10T04:50:29Z","abstract_excerpt":"We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are called permutations. The underpinning assumption is that, for both metric and non-metric spaces, the distance between permutations is a good proxy for the distance between original points. Thus, it should be possible to efficiently retrieve most true nearest neighbors by examining only a tiny subset of data points whose permutations are similar to the permutation of a query. We fur"},"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":"1506.03163","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-10T04:50:29Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"871c2e7859721d6a8e7db455082694071f33ad3c2317587240b998ad55204870","abstract_canon_sha256":"f654893f8fd5f502250a42610054a1e9f3cde26e57c2b5d92179ae38968e084f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:53.867178Z","signature_b64":"dILJuPOWR9Ny73f0fJar6iN1z5lg/VEYjMWXiPc9VRniHGpc3DRdyqyOxSLcltEF1QKC3GggWqo7hbatQc6iCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e5f6dd9be9a629459da34432940771fb3cdc18a4b48ecccedfdc24ac901234e","last_reissued_at":"2026-05-18T01:00:53.866638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:53.866638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutation Search Methods are Efficient, Yet Faster Search is Possible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.LG","authors_text":"Bilegsaikhan Naidan, Eric Nyberg, Leonid Boytsov","submitted_at":"2015-06-10T04:50:29Z","abstract_excerpt":"We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are called permutations. The underpinning assumption is that, for both metric and non-metric spaces, the distance between permutations is a good proxy for the distance between original points. Thus, it should be possible to efficiently retrieve most true nearest neighbors by examining only a tiny subset of data points whose permutations are similar to the permutation of a query. We fur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03163","kind":"arxiv","version":4},"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":"1506.03163","created_at":"2026-05-18T01:00:53.866721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03163v4","created_at":"2026-05-18T01:00:53.866721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03163","created_at":"2026-05-18T01:00:53.866721+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZPW3WN6TJRJ","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZPW3WN6TJRJIWO2","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZPW3WN6","created_at":"2026-05-18T12:29:34.919912+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/NZPW3WN6TJRJIWO2GRBSSQDXD6","json":"https://pith.science/pith/NZPW3WN6TJRJIWO2GRBSSQDXD6.json","graph_json":"https://pith.science/api/pith-number/NZPW3WN6TJRJIWO2GRBSSQDXD6/graph.json","events_json":"https://pith.science/api/pith-number/NZPW3WN6TJRJIWO2GRBSSQDXD6/events.json","paper":"https://pith.science/paper/NZPW3WN6"},"agent_actions":{"view_html":"https://pith.science/pith/NZPW3WN6TJRJIWO2GRBSSQDXD6","download_json":"https://pith.science/pith/NZPW3WN6TJRJIWO2GRBSSQDXD6.json","view_paper":"https://pith.science/paper/NZPW3WN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03163&json=true","fetch_graph":"https://pith.science/api/pith-number/NZPW3WN6TJRJIWO2GRBSSQDXD6/graph.json","fetch_events":"https://pith.science/api/pith-number/NZPW3WN6TJRJIWO2GRBSSQDXD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZPW3WN6TJRJIWO2GRBSSQDXD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZPW3WN6TJRJIWO2GRBSSQDXD6/action/storage_attestation","attest_author":"https://pith.science/pith/NZPW3WN6TJRJIWO2GRBSSQDXD6/action/author_attestation","sign_citation":"https://pith.science/pith/NZPW3WN6TJRJIWO2GRBSSQDXD6/action/citation_signature","submit_replication":"https://pith.science/pith/NZPW3WN6TJRJIWO2GRBSSQDXD6/action/replication_record"}},"created_at":"2026-05-18T01:00:53.866721+00:00","updated_at":"2026-05-18T01:00:53.866721+00:00"}