{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SRVOVSZCMKRDZQIK63FONS5M3B","short_pith_number":"pith:SRVOVSZC","schema_version":"1.0","canonical_sha256":"946aeacb2262a23cc10af6cae6cbacd871a73404705bd8322df766decf486fad","source":{"kind":"arxiv","id":"1910.08322","version":5},"attestation_state":"computed","paper":{"title":"A Multilabel Classification Framework for Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Elias J\\\"a\\\"asaari, Teemu Roos, Ville Hyv\\\"onen","submitted_at":"2019-10-18T09:37:19Z","abstract_excerpt":"Both supervised and unsupervised machine learning algorithms have been used to learn partition-based index structures for approximate nearest neighbor (ANN) search. Existing supervised algorithms formulate the learning task as finding a partition in which the nearest neighbors of a training set point belong to the same partition element as the point itself, so that the nearest neighbor candidates can be retrieved by naive lookup or backtracking search. We formulate candidate set selection in ANN search directly as a multilabel classification problem where the labels correspond to the nearest n"},"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":"1910.08322","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-18T09:37:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"53a5ad34cbbc45b06ce23d7a2df4a0b16abc5d276895b3b493625cf37d7f6fea","abstract_canon_sha256":"eef07d53c50b6fabc3e92b57a6e1cccf67e96c039e3bfe5fc97bc284a57e9132"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:06.363639Z","signature_b64":"YLl88J8hBhlxExWoBJzDoajvq+O+VK+aIs5h9/BCn989NF0VOC/PB9sVljsB2Bduj2y04jHLlRue0aMzm0S+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"946aeacb2262a23cc10af6cae6cbacd871a73404705bd8322df766decf486fad","last_reissued_at":"2026-07-05T05:06:06.363207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:06.363207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multilabel Classification Framework for Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Elias J\\\"a\\\"asaari, Teemu Roos, Ville Hyv\\\"onen","submitted_at":"2019-10-18T09:37:19Z","abstract_excerpt":"Both supervised and unsupervised machine learning algorithms have been used to learn partition-based index structures for approximate nearest neighbor (ANN) search. Existing supervised algorithms formulate the learning task as finding a partition in which the nearest neighbors of a training set point belong to the same partition element as the point itself, so that the nearest neighbor candidates can be retrieved by naive lookup or backtracking search. We formulate candidate set selection in ANN search directly as a multilabel classification problem where the labels correspond to the nearest n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08322","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.08322/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.08322","created_at":"2026-07-05T05:06:06.363266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.08322v5","created_at":"2026-07-05T05:06:06.363266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08322","created_at":"2026-07-05T05:06:06.363266+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRVOVSZCMKRD","created_at":"2026-07-05T05:06:06.363266+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRVOVSZCMKRDZQIK","created_at":"2026-07-05T05:06:06.363266+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRVOVSZC","created_at":"2026-07-05T05:06:06.363266+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/SRVOVSZCMKRDZQIK63FONS5M3B","json":"https://pith.science/pith/SRVOVSZCMKRDZQIK63FONS5M3B.json","graph_json":"https://pith.science/api/pith-number/SRVOVSZCMKRDZQIK63FONS5M3B/graph.json","events_json":"https://pith.science/api/pith-number/SRVOVSZCMKRDZQIK63FONS5M3B/events.json","paper":"https://pith.science/paper/SRVOVSZC"},"agent_actions":{"view_html":"https://pith.science/pith/SRVOVSZCMKRDZQIK63FONS5M3B","download_json":"https://pith.science/pith/SRVOVSZCMKRDZQIK63FONS5M3B.json","view_paper":"https://pith.science/paper/SRVOVSZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.08322&json=true","fetch_graph":"https://pith.science/api/pith-number/SRVOVSZCMKRDZQIK63FONS5M3B/graph.json","fetch_events":"https://pith.science/api/pith-number/SRVOVSZCMKRDZQIK63FONS5M3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRVOVSZCMKRDZQIK63FONS5M3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRVOVSZCMKRDZQIK63FONS5M3B/action/storage_attestation","attest_author":"https://pith.science/pith/SRVOVSZCMKRDZQIK63FONS5M3B/action/author_attestation","sign_citation":"https://pith.science/pith/SRVOVSZCMKRDZQIK63FONS5M3B/action/citation_signature","submit_replication":"https://pith.science/pith/SRVOVSZCMKRDZQIK63FONS5M3B/action/replication_record"}},"created_at":"2026-07-05T05:06:06.363266+00:00","updated_at":"2026-07-05T05:06:06.363266+00:00"}