{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2IEJMUC5QJH4HX22Q54WRQ27QY","short_pith_number":"pith:2IEJMUC5","schema_version":"1.0","canonical_sha256":"d20896505d824fc3df5a877968c35f862390908b70d29810085e2dd6417f5d2f","source":{"kind":"arxiv","id":"2502.05369","version":2},"attestation_state":"computed","paper":{"title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DB","authors_text":"Alireza Heidari, Amirhossein Ahmadi, Wei Zhang","submitted_at":"2025-02-07T22:48:14Z","abstract_excerpt":"In this paper, we introduce DobLIX, a dual-objective learned index specifically designed for Log-Structured Merge(LSM) tree-based key-value stores. Although traditional learned indexes focus exclusively on optimizing index lookups, they often overlook the impact of data access from storage, resulting in performance bottlenecks. DobLIX addresses this by incorporating a second objective, data access optimization, into the learned index training process. This dual-objective approach ensures that both index lookup efficiency and data access costs are minimized, leading to significant improvements "},"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":"2502.05369","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2025-02-07T22:48:14Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"dc65e773c0c24de0a38eb8e9dac174bc799faf1e4deee202be3a34d6306e5bb5","abstract_canon_sha256":"afac345a5c00bff46d6c26a8b81400bf56926f9250d7d0aa471b9e8e5903a70f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:40.441602Z","signature_b64":"vY/GicdjJsUoUj/90/xH4DYPieJHhCvOkOlkaCAdezaci5JVaVdLt1oRpfwss1EtiHiZwt6400nuY3Hi6MpfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d20896505d824fc3df5a877968c35f862390908b70d29810085e2dd6417f5d2f","last_reissued_at":"2026-07-05T12:02:40.441113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:40.441113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DB","authors_text":"Alireza Heidari, Amirhossein Ahmadi, Wei Zhang","submitted_at":"2025-02-07T22:48:14Z","abstract_excerpt":"In this paper, we introduce DobLIX, a dual-objective learned index specifically designed for Log-Structured Merge(LSM) tree-based key-value stores. Although traditional learned indexes focus exclusively on optimizing index lookups, they often overlook the impact of data access from storage, resulting in performance bottlenecks. DobLIX addresses this by incorporating a second objective, data access optimization, into the learned index training process. This dual-objective approach ensures that both index lookup efficiency and data access costs are minimized, leading to significant improvements "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05369","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/2502.05369/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":"2502.05369","created_at":"2026-07-05T12:02:40.441165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05369v2","created_at":"2026-07-05T12:02:40.441165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05369","created_at":"2026-07-05T12:02:40.441165+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IEJMUC5QJH4","created_at":"2026-07-05T12:02:40.441165+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IEJMUC5QJH4HX22","created_at":"2026-07-05T12:02:40.441165+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IEJMUC5","created_at":"2026-07-05T12:02:40.441165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.15987","citing_title":"Filter-Centric Vector Indexing: Geometric Transformation for Efficient Filtered Vector Search","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY","json":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY.json","graph_json":"https://pith.science/api/pith-number/2IEJMUC5QJH4HX22Q54WRQ27QY/graph.json","events_json":"https://pith.science/api/pith-number/2IEJMUC5QJH4HX22Q54WRQ27QY/events.json","paper":"https://pith.science/paper/2IEJMUC5"},"agent_actions":{"view_html":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY","download_json":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY.json","view_paper":"https://pith.science/paper/2IEJMUC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05369&json=true","fetch_graph":"https://pith.science/api/pith-number/2IEJMUC5QJH4HX22Q54WRQ27QY/graph.json","fetch_events":"https://pith.science/api/pith-number/2IEJMUC5QJH4HX22Q54WRQ27QY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY/action/storage_attestation","attest_author":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY/action/author_attestation","sign_citation":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY/action/citation_signature","submit_replication":"https://pith.science/pith/2IEJMUC5QJH4HX22Q54WRQ27QY/action/replication_record"}},"created_at":"2026-07-05T12:02:40.441165+00:00","updated_at":"2026-07-05T12:02:40.441165+00:00"}