{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MAGGZTLCGKSCCQ7NHNWCTA2NX2","short_pith_number":"pith:MAGGZTLC","schema_version":"1.0","canonical_sha256":"600c6ccd6232a42143ed3b6c29834dbe8f9fd4d08a968f6dc62f4f2624a00e31","source":{"kind":"arxiv","id":"1807.05614","version":2},"attestation_state":"computed","paper":{"title":"ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Alexander Faithfull, Erik Bernhardsson, Martin Aum\\\"uller","submitted_at":"2018-07-15T21:25:55Z","abstract_excerpt":"This paper describes ANN-Benchmarks, a tool for evaluating the performance of in-memory approximate nearest neighbor algorithms. It provides a standard interface for measuring the performance and quality achieved by nearest neighbor algorithms on different standard data sets. It supports several different ways of integrating $k$-NN algorithms, and its configuration system automatically tests a range of parameter settings for each algorithm. Algorithms are compared with respect to many different (approximate) quality measures, and adding more is easy and fast; the included plotting front-ends c"},"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":"1807.05614","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2018-07-15T21:25:55Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"f46cdf1eaf0dc863c5c1f65e65c909267615b1522e22ef907fd2f84a9139a4a7","abstract_canon_sha256":"239b939889a0fed54e6c4b0c2a97053faef5003d7fc117114e04b7574db59716"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:27.555482Z","signature_b64":"H5ybFyxwbZui7dndtNcPJ6hPHloIbn1et9mRZmAp6zY8Hc8k8ymcJzOgHlvtdpXYRPMaVeqkEA7MfjBTdA0QAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600c6ccd6232a42143ed3b6c29834dbe8f9fd4d08a968f6dc62f4f2624a00e31","last_reissued_at":"2026-05-18T00:10:27.554940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:27.554940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Alexander Faithfull, Erik Bernhardsson, Martin Aum\\\"uller","submitted_at":"2018-07-15T21:25:55Z","abstract_excerpt":"This paper describes ANN-Benchmarks, a tool for evaluating the performance of in-memory approximate nearest neighbor algorithms. It provides a standard interface for measuring the performance and quality achieved by nearest neighbor algorithms on different standard data sets. It supports several different ways of integrating $k$-NN algorithms, and its configuration system automatically tests a range of parameter settings for each algorithm. Algorithms are compared with respect to many different (approximate) quality measures, and adding more is easy and fast; the included plotting front-ends c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05614","kind":"arxiv","version":2},"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":"1807.05614","created_at":"2026-05-18T00:10:27.555027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05614v2","created_at":"2026-05-18T00:10:27.555027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05614","created_at":"2026-05-18T00:10:27.555027+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAGGZTLCGKSC","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAGGZTLCGKSCCQ7N","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAGGZTLC","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.08950","citing_title":"When More Cores Hurts: The Vector Database Scaling Paradox in HPC","ref_index":78,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2","json":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2.json","graph_json":"https://pith.science/api/pith-number/MAGGZTLCGKSCCQ7NHNWCTA2NX2/graph.json","events_json":"https://pith.science/api/pith-number/MAGGZTLCGKSCCQ7NHNWCTA2NX2/events.json","paper":"https://pith.science/paper/MAGGZTLC"},"agent_actions":{"view_html":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2","download_json":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2.json","view_paper":"https://pith.science/paper/MAGGZTLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05614&json=true","fetch_graph":"https://pith.science/api/pith-number/MAGGZTLCGKSCCQ7NHNWCTA2NX2/graph.json","fetch_events":"https://pith.science/api/pith-number/MAGGZTLCGKSCCQ7NHNWCTA2NX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2/action/storage_attestation","attest_author":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2/action/author_attestation","sign_citation":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2/action/citation_signature","submit_replication":"https://pith.science/pith/MAGGZTLCGKSCCQ7NHNWCTA2NX2/action/replication_record"}},"created_at":"2026-05-18T00:10:27.555027+00:00","updated_at":"2026-05-18T00:10:27.555027+00:00"}