{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GUIUM5LZEA2P5WQZWMVR4Z76DL","short_pith_number":"pith:GUIUM5LZ","schema_version":"1.0","canonical_sha256":"35114675792034feda19b32b1e67fe1ae8bd2671fd888a73bfb388e58bb50987","source":{"kind":"arxiv","id":"2111.14905","version":1},"attestation_state":"computed","paper":{"title":"Bounding the Last Mile: Efficient Learned String Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Andreas Kipf, Benjamin Spector, Chi Wang, Kapil Vaidya, Tim Kraska, Umar Farooq Minhas","submitted_at":"2021-11-29T19:23:58Z","abstract_excerpt":"We introduce the RadixStringSpline (RSS) learned index structure for efficiently indexing strings. RSS is a tree of radix splines each indexing a fixed number of bytes. RSS approaches or exceeds the performance of traditional string indexes while using 7-70$\\times$ less memory. RSS achieves this by using the minimal string prefix to sufficiently distinguish the data unlike most learned approaches which index the entire string. Additionally, the bounded-error nature of RSS accelerates the last mile search and also enables a memory-efficient hash-table lookup accelerator. We benchmark RSS on sev"},"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":"2111.14905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-11-29T19:23:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c7e5a068d5857000119d88877df9a7a086aae52562b71c27bbc98922c27d8333","abstract_canon_sha256":"6215d00d894f5dcb4ef8f88d69531301c320190d430a5e56656485b47c92cc49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:36:20.373857Z","signature_b64":"b18Bt1Toov6JxUL+MDMoe/oCAlQPFF/QKuw8hH58m3XH8aN7LckcWCeprz3ps1sXHJ0vJOUI0MeMbWLuy6saBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35114675792034feda19b32b1e67fe1ae8bd2671fd888a73bfb388e58bb50987","last_reissued_at":"2026-07-05T03:36:20.373291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:36:20.373291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the Last Mile: Efficient Learned String Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Andreas Kipf, Benjamin Spector, Chi Wang, Kapil Vaidya, Tim Kraska, Umar Farooq Minhas","submitted_at":"2021-11-29T19:23:58Z","abstract_excerpt":"We introduce the RadixStringSpline (RSS) learned index structure for efficiently indexing strings. RSS is a tree of radix splines each indexing a fixed number of bytes. RSS approaches or exceeds the performance of traditional string indexes while using 7-70$\\times$ less memory. RSS achieves this by using the minimal string prefix to sufficiently distinguish the data unlike most learned approaches which index the entire string. Additionally, the bounded-error nature of RSS accelerates the last mile search and also enables a memory-efficient hash-table lookup accelerator. We benchmark RSS on sev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14905","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.14905/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":"2111.14905","created_at":"2026-07-05T03:36:20.373361+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.14905v1","created_at":"2026-07-05T03:36:20.373361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14905","created_at":"2026-07-05T03:36:20.373361+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUIUM5LZEA2P","created_at":"2026-07-05T03:36:20.373361+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUIUM5LZEA2P5WQZ","created_at":"2026-07-05T03:36:20.373361+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUIUM5LZ","created_at":"2026-07-05T03:36:20.373361+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23815","citing_title":"A Pragmatic Approach to Learned Indexing in RocksDB: Targeted Optimizations with Minimal System Modification","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL","json":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL.json","graph_json":"https://pith.science/api/pith-number/GUIUM5LZEA2P5WQZWMVR4Z76DL/graph.json","events_json":"https://pith.science/api/pith-number/GUIUM5LZEA2P5WQZWMVR4Z76DL/events.json","paper":"https://pith.science/paper/GUIUM5LZ"},"agent_actions":{"view_html":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL","download_json":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL.json","view_paper":"https://pith.science/paper/GUIUM5LZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.14905&json=true","fetch_graph":"https://pith.science/api/pith-number/GUIUM5LZEA2P5WQZWMVR4Z76DL/graph.json","fetch_events":"https://pith.science/api/pith-number/GUIUM5LZEA2P5WQZWMVR4Z76DL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL/action/storage_attestation","attest_author":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL/action/author_attestation","sign_citation":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL/action/citation_signature","submit_replication":"https://pith.science/pith/GUIUM5LZEA2P5WQZWMVR4Z76DL/action/replication_record"}},"created_at":"2026-07-05T03:36:20.373361+00:00","updated_at":"2026-07-05T03:36:20.373361+00:00"}