{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CJR5REFST6NPCXRCZ3SRX67ZQX","short_pith_number":"pith:CJR5REFS","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"},"canonical_sha256":"1263d890b29f9af15e22cee51bfbf985ec8eae58e7140d079a7d77427c6e3428","source":{"kind":"arxiv","id":"2606.18138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18138","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18138v1","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18138","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"CJR5REFST6NP","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"pith_short_16","alias_value":"CJR5REFST6NPCXRC","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"pith_short_8","alias_value":"CJR5REFS","created_at":"2026-06-19T16:10:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CJR5REFST6NPCXRCZ3SRX67ZQX","target":"record","payload":{"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"},"canonical_sha256":"1263d890b29f9af15e22cee51bfbf985ec8eae58e7140d079a7d77427c6e3428","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"},"source_kind":"arxiv","source_id":"2606.18138","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGQLa8gqYuVrJq87TCkNCrsFYOqWx9P7vE9N36wjcv8tsDVs44JiNcQFGQ69wOiquuG3+199PXBkgTaukYO6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:17:37.379798Z"},"content_sha256":"a9b3648255f8a0f3e657901c12e01c9edb65634b874a6b04194a8739c097a00d","schema_version":"1.0","event_id":"sha256:a9b3648255f8a0f3e657901c12e01c9edb65634b874a6b04194a8739c097a00d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CJR5REFST6NPCXRCZ3SRX67ZQX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZVHT/Z5WRmLsgwyaaEBrFGKEcmgalgyu2PiHKERBTIqpuCSDJ17onPwW5ZK6j7QLBdDX5l/W7PM+/ddIUTHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:17:37.380161Z"},"content_sha256":"ccaf939e1587041da9baa35a8f0a94f4b293688a7a0736c40df6d20126ddac00","schema_version":"1.0","event_id":"sha256:ccaf939e1587041da9baa35a8f0a94f4b293688a7a0736c40df6d20126ddac00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/bundle.json","state_url":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T07:17:37Z","links":{"resolver":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX","bundle":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/bundle.json","state":"https://pith.science/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJR5REFST6NPCXRCZ3SRX67ZQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CJR5REFST6NPCXRCZ3SRX67ZQX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b11928966d81cbb00cd3a467d0893d23575b1b4222334c5ff9bc68697b84b286","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-06-16T16:39:41Z","title_canon_sha256":"6eaaf96d51396764e75579ecb3e74a530e87003011569ab9e0bc6b0207559be0"},"schema_version":"1.0","source":{"id":"2606.18138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18138","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18138v1","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18138","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"CJR5REFST6NP","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"pith_short_16","alias_value":"CJR5REFST6NPCXRC","created_at":"2026-06-19T16:10:49Z"},{"alias_kind":"pith_short_8","alias_value":"CJR5REFS","created_at":"2026-06-19T16:10:49Z"}],"graph_snapshots":[{"event_id":"sha256:ccaf939e1587041da9baa35a8f0a94f4b293688a7a0736c40df6d20126ddac00","target":"graph","created_at":"2026-06-19T16:10:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.18138/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Madhulatha Mandarapu, Sandeep Kunkunuru","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-06-16T16:39:41Z","title":"The Value of Adaptivity in LSM Bloom-Filter Tuning: A Log-Law and a Two-Clock Frontier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18138","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a9b3648255f8a0f3e657901c12e01c9edb65634b874a6b04194a8739c097a00d","target":"record","created_at":"2026-06-19T16:10:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b11928966d81cbb00cd3a467d0893d23575b1b4222334c5ff9bc68697b84b286","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-06-16T16:39:41Z","title_canon_sha256":"6eaaf96d51396764e75579ecb3e74a530e87003011569ab9e0bc6b0207559be0"},"schema_version":"1.0","source":{"id":"2606.18138","kind":"arxiv","version":1}},"canonical_sha256":"1263d890b29f9af15e22cee51bfbf985ec8eae58e7140d079a7d77427c6e3428","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1263d890b29f9af15e22cee51bfbf985ec8eae58e7140d079a7d77427c6e3428","first_computed_at":"2026-06-19T16:10:49.331917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:49.331917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MpDThe67tauI7/GBSh88r5spntJhm1a28auweAnz3qemfRbm28Q9Vla2rU5ugn+x84M56Pv8An4j0dmi6gjPAg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:49.332248Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9b3648255f8a0f3e657901c12e01c9edb65634b874a6b04194a8739c097a00d","sha256:ccaf939e1587041da9baa35a8f0a94f4b293688a7a0736c40df6d20126ddac00"],"state_sha256":"945e83230d2259f990859feffd1f563bd8778cebff724dfad4f2a9791dc955f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HV/YUGTNBt7Y82TwEtMFXQtx5duybmgeb94vTzi4/1IhxI+m5pdm+JMrdsNQco8Zqk15yuCGHAEeCGsc0bJzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:17:37.382227Z","bundle_sha256":"a395d7fff518f3f40ed4ba32406c3aa2a6367127abc912c4a9747bacef87e2dd"}}