{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7EYLJL2BFH7KBHFMCX5GHXYT3I","short_pith_number":"pith:7EYLJL2B","schema_version":"1.0","canonical_sha256":"f930b4af4129fea09cac15fa63df13da19216a984d6939774fb0865374db27cd","source":{"kind":"arxiv","id":"2504.17178","version":1},"attestation_state":"computed","paper":{"title":"How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dingheng Mo, Siqiang Luo, Stratos Idreos","submitted_at":"2025-04-24T01:24:55Z","abstract_excerpt":"LSM-tree based key-value stores are widely adopted as the data storage backend in modern big data applications. The LSM-tree grows with data ingestion, by either adding levels with fixed level capacities (dubbed as vertical scheme) or increasing level capacities with fixed number of levels (dubbed as horizontal scheme). The vertical scheme leads the trend in recent system designs in RocksDB, LevelDB, and WiredTiger, whereas the horizontal scheme shows a decline in being adopted in the industry. The growth scheme profoundly impacts the LSM system performance in various aspects such as read, wri"},"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":"2504.17178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-04-24T01:24:55Z","cross_cats_sorted":[],"title_canon_sha256":"01e6213e5dfe636a690b63d2c80a1f6183a973f764a05920c3537184a4bae127","abstract_canon_sha256":"0dfb57a8bd44b4dc45d205a66b5e50bbad835c909c94f5242c720ffc64e71b00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:23.771688Z","signature_b64":"asl0FUMticNkbuwLSzwGKeeh5gjeBcre/SEEzH1npZ6wX3lNHsOf6diHzKiXm1H06TOfWt0ysGZFLUCFDzgmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f930b4af4129fea09cac15fa63df13da19216a984d6939774fb0865374db27cd","last_reissued_at":"2026-07-05T10:53:23.771283Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:23.771283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dingheng Mo, Siqiang Luo, Stratos Idreos","submitted_at":"2025-04-24T01:24:55Z","abstract_excerpt":"LSM-tree based key-value stores are widely adopted as the data storage backend in modern big data applications. The LSM-tree grows with data ingestion, by either adding levels with fixed level capacities (dubbed as vertical scheme) or increasing level capacities with fixed number of levels (dubbed as horizontal scheme). The vertical scheme leads the trend in recent system designs in RocksDB, LevelDB, and WiredTiger, whereas the horizontal scheme shows a decline in being adopted in the industry. The growth scheme profoundly impacts the LSM system performance in various aspects such as read, wri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17178","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/2504.17178/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":"2504.17178","created_at":"2026-07-05T10:53:23.771342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17178v1","created_at":"2026-07-05T10:53:23.771342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17178","created_at":"2026-07-05T10:53:23.771342+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EYLJL2BFH7K","created_at":"2026-07-05T10:53:23.771342+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EYLJL2BFH7KBHFM","created_at":"2026-07-05T10:53:23.771342+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EYLJL2B","created_at":"2026-07-05T10:53:23.771342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05369","citing_title":"DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I","json":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I.json","graph_json":"https://pith.science/api/pith-number/7EYLJL2BFH7KBHFMCX5GHXYT3I/graph.json","events_json":"https://pith.science/api/pith-number/7EYLJL2BFH7KBHFMCX5GHXYT3I/events.json","paper":"https://pith.science/paper/7EYLJL2B"},"agent_actions":{"view_html":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I","download_json":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I.json","view_paper":"https://pith.science/paper/7EYLJL2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17178&json=true","fetch_graph":"https://pith.science/api/pith-number/7EYLJL2BFH7KBHFMCX5GHXYT3I/graph.json","fetch_events":"https://pith.science/api/pith-number/7EYLJL2BFH7KBHFMCX5GHXYT3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I/action/storage_attestation","attest_author":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I/action/author_attestation","sign_citation":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I/action/citation_signature","submit_replication":"https://pith.science/pith/7EYLJL2BFH7KBHFMCX5GHXYT3I/action/replication_record"}},"created_at":"2026-07-05T10:53:23.771342+00:00","updated_at":"2026-07-05T10:53:23.771342+00:00"}