{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:P375LLMWEGQ7FNW3MTS3LD26V2","short_pith_number":"pith:P375LLMW","schema_version":"1.0","canonical_sha256":"7effd5ad9621a1f2b6db64e5b58f5eae94053dd37ee7af9e7eb273e1e6835574","source":{"kind":"arxiv","id":"2006.12804","version":2},"attestation_state":"computed","paper":{"title":"Benchmarking Learned Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alexander van Renen, Alfons Kemper, Andreas Kipf, Mihail Stoian, Ryan Marcus, Sanchit Misra, Thomas Neumann, Tim Kraska","submitted_at":"2020-06-23T07:37:59Z","abstract_excerpt":"Recent advancements in learned index structures propose replacing existing index structures, like B-Trees, with approximate learned models. In this work, we present a unified benchmark that compares well-tuned implementations of three learned index structures against several state-of-the-art \"traditional\" baselines. Using four real-world datasets, we demonstrate that learned index structures can indeed outperform non-learned indexes in read-only in-memory workloads over a dense array. We also investigate the impact of caching, pipelining, dataset size, and key size. We study the performance pr"},"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":"2006.12804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-06-23T07:37:59Z","cross_cats_sorted":[],"title_canon_sha256":"8d476b40860a95702c3d73754e99e36aba4c70e39548bb7ff488ca69e0e482c3","abstract_canon_sha256":"2554ebaabc42327b85c00b0bf74de441273d7c8548ba6d76fc0f789dc4c4a767"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:54:53.067619Z","signature_b64":"F6+Y2VuJ0CVnnS1shZYWwR6CuDnuamLrhzshFHrXmmQAsOnoPzNYEXwTAYcMFaxZ6ylDdUaOf4E5NgBjp0U1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7effd5ad9621a1f2b6db64e5b58f5eae94053dd37ee7af9e7eb273e1e6835574","last_reissued_at":"2026-07-05T05:54:53.067194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:54:53.067194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking Learned Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alexander van Renen, Alfons Kemper, Andreas Kipf, Mihail Stoian, Ryan Marcus, Sanchit Misra, Thomas Neumann, Tim Kraska","submitted_at":"2020-06-23T07:37:59Z","abstract_excerpt":"Recent advancements in learned index structures propose replacing existing index structures, like B-Trees, with approximate learned models. In this work, we present a unified benchmark that compares well-tuned implementations of three learned index structures against several state-of-the-art \"traditional\" baselines. Using four real-world datasets, we demonstrate that learned index structures can indeed outperform non-learned indexes in read-only in-memory workloads over a dense array. We also investigate the impact of caching, pipelining, dataset size, and key size. We study the performance pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.12804","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.12804/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":"2006.12804","created_at":"2026-07-05T05:54:53.067253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.12804v2","created_at":"2026-07-05T05:54:53.067253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.12804","created_at":"2026-07-05T05:54:53.067253+00:00"},{"alias_kind":"pith_short_12","alias_value":"P375LLMWEGQ7","created_at":"2026-07-05T05:54:53.067253+00:00"},{"alias_kind":"pith_short_16","alias_value":"P375LLMWEGQ7FNW3","created_at":"2026-07-05T05:54:53.067253+00:00"},{"alias_kind":"pith_short_8","alias_value":"P375LLMW","created_at":"2026-07-05T05:54:53.067253+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08671","citing_title":"Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2","json":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2.json","graph_json":"https://pith.science/api/pith-number/P375LLMWEGQ7FNW3MTS3LD26V2/graph.json","events_json":"https://pith.science/api/pith-number/P375LLMWEGQ7FNW3MTS3LD26V2/events.json","paper":"https://pith.science/paper/P375LLMW"},"agent_actions":{"view_html":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2","download_json":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2.json","view_paper":"https://pith.science/paper/P375LLMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.12804&json=true","fetch_graph":"https://pith.science/api/pith-number/P375LLMWEGQ7FNW3MTS3LD26V2/graph.json","fetch_events":"https://pith.science/api/pith-number/P375LLMWEGQ7FNW3MTS3LD26V2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2/action/storage_attestation","attest_author":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2/action/author_attestation","sign_citation":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2/action/citation_signature","submit_replication":"https://pith.science/pith/P375LLMWEGQ7FNW3MTS3LD26V2/action/replication_record"}},"created_at":"2026-07-05T05:54:53.067253+00:00","updated_at":"2026-07-05T05:54:53.067253+00:00"}