{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CJR5REFST6NPCXRCZ3SRX67ZQX","short_pith_number":"pith:CJR5REFS","schema_version":"1.0","canonical_sha256":"1263d890b29f9af15e22cee51bfbf985ec8eae58e7140d079a7d77427c6e3428","source":{"kind":"arxiv","id":"2606.18138","version":1},"attestation_state":"computed","paper":{"title":"The Value of Adaptivity in LSM Bloom-Filter Tuning: A Log-Law and a Two-Clock Frontier","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Madhulatha Mandarapu, Sandeep Kunkunuru","submitted_at":"2026-06-16T16:39:41Z","abstract_excerpt":"Log-structured merge (LSM) trees attach an approximate-membership filter to every run and must split a fixed memory budget across them. The static optimum is known (Monkey); a large systems literature then makes the allocation adaptive, tracking shifting hotness online. We ask a prior question: when is that adaptivity worth its machinery? We give three analytical answers and validate them on synthetic sweeps, real Twitter production cache traces, and a real RocksDB engine. First, a log-law: optimal bits-per-key is affine in the logarithm of access frequency, at a fixed slope. Second, a robustn"},"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":"2606.18138","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-06-16T16:39:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6eaaf96d51396764e75579ecb3e74a530e87003011569ab9e0bc6b0207559be0","abstract_canon_sha256":"b11928966d81cbb00cd3a467d0893d23575b1b4222334c5ff9bc68697b84b286"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:49.332248Z","signature_b64":"MpDThe67tauI7/GBSh88r5spntJhm1a28auweAnz3qemfRbm28Q9Vla2rU5ugn+x84M56Pv8An4j0dmi6gjPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1263d890b29f9af15e22cee51bfbf985ec8eae58e7140d079a7d77427c6e3428","last_reissued_at":"2026-06-19T16:10:49.331917Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:49.331917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Value of Adaptivity in LSM Bloom-Filter Tuning: A Log-Law and a Two-Clock Frontier","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Madhulatha Mandarapu, Sandeep Kunkunuru","submitted_at":"2026-06-16T16:39:41Z","abstract_excerpt":"Log-structured merge (LSM) trees attach an approximate-membership filter to every run and must split a fixed memory budget across them. The static optimum is known (Monkey); a large systems literature then makes the allocation adaptive, tracking shifting hotness online. We ask a prior question: when is that adaptivity worth its machinery? We give three analytical answers and validate them on synthetic sweeps, real Twitter production cache traces, and a real RocksDB engine. First, a log-law: optimal bits-per-key is affine in the logarithm of access frequency, at a fixed slope. Second, a robustn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18138","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/2606.18138/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":"2606.18138","created_at":"2026-06-19T16:10:49.331973+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18138v1","created_at":"2026-06-19T16:10:49.331973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18138","created_at":"2026-06-19T16:10:49.331973+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJR5REFST6NP","created_at":"2026-06-19T16:10:49.331973+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJR5REFST6NPCXRC","created_at":"2026-06-19T16:10:49.331973+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJR5REFS","created_at":"2026-06-19T16:10:49.331973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX","json":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX.json","graph_json":"https://pith.science/api/pith-number/CJR5REFST6NPCXRCZ3SRX67ZQX/graph.json","events_json":"https://pith.science/api/pith-number/CJR5REFST6NPCXRCZ3SRX67ZQX/events.json","paper":"https://pith.science/paper/CJR5REFS"},"agent_actions":{"view_html":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX","download_json":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX.json","view_paper":"https://pith.science/paper/CJR5REFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18138&json=true","fetch_graph":"https://pith.science/api/pith-number/CJR5REFST6NPCXRCZ3SRX67ZQX/graph.json","fetch_events":"https://pith.science/api/pith-number/CJR5REFST6NPCXRCZ3SRX67ZQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/action/storage_attestation","attest_author":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/action/author_attestation","sign_citation":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/action/citation_signature","submit_replication":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/action/replication_record"}},"created_at":"2026-06-19T16:10:49.331973+00:00","updated_at":"2026-06-19T16:10:49.331973+00:00"}