{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:G7HXKV65CFIMJW2QNCRORRYL7V","short_pith_number":"pith:G7HXKV65","canonical_record":{"source":{"id":"2308.07013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-08-14T09:00:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ee37f1e783245850a8abed4e091f971adbb7e31c347222fb9c8f9be454b8aa92","abstract_canon_sha256":"7f6aac86f21f54efd4ae2396c6f16a8612572780223625352b8da5245a74dfdc"},"schema_version":"1.0"},"canonical_sha256":"37cf7557dd1150c4db5068a2e8c70bfd7d01d929d8ce13af855bb5c9a30aeab8","source":{"kind":"arxiv","id":"2308.07013","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07013","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07013v2","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07013","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"pith_short_12","alias_value":"G7HXKV65CFIM","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"pith_short_16","alias_value":"G7HXKV65CFIMJW2Q","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"pith_short_8","alias_value":"G7HXKV65","created_at":"2026-07-05T06:51:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:G7HXKV65CFIMJW2QNCRORRYL7V","target":"record","payload":{"canonical_record":{"source":{"id":"2308.07013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-08-14T09:00:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ee37f1e783245850a8abed4e091f971adbb7e31c347222fb9c8f9be454b8aa92","abstract_canon_sha256":"7f6aac86f21f54efd4ae2396c6f16a8612572780223625352b8da5245a74dfdc"},"schema_version":"1.0"},"canonical_sha256":"37cf7557dd1150c4db5068a2e8c70bfd7d01d929d8ce13af855bb5c9a30aeab8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:28.200244Z","signature_b64":"ukpuftvhw6BG2uEMGQvBeO2L6P563Jt7PUu7qNOouaM0iXRDIJmyDhLCxStdO6K5sq0I74U0iWf6QEjUV/oKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37cf7557dd1150c4db5068a2e8c70bfd7d01d929d8ce13af855bb5c9a30aeab8","last_reissued_at":"2026-07-05T06:51:28.199762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:28.199762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.07013","source_version":2,"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-07-05T06:51:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"706CB0SWp9jEHJ8deq+8JFa3cijxFStCLVVGrGTY5/QnP3w1U1uh9mYf3THVSQZoLGHET7D0DNj0mRTzxTXEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:52:58.744974Z"},"content_sha256":"7fd95f822c33b0401e14bb4cccfda99c21fc5ce796bd6cd3c11cc5f69d936132","schema_version":"1.0","event_id":"sha256:7fd95f822c33b0401e14bb4cccfda99c21fc5ce796bd6cd3c11cc5f69d936132"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:G7HXKV65CFIMJW2QNCRORRYL7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Caihua Shan, Dingheng Mo, Fanchao Chen, Siqiang Luo","submitted_at":"2023-08-14T09:00:58Z","abstract_excerpt":"LSM-trees are widely adopted as the storage backend of key-value stores. However, optimizing the system performance under dynamic workloads has not been sufficiently studied or evaluated in previous work. To fill the gap, we present RusKey, a key-value store with the following new features: (1) RusKey is a first attempt to orchestrate LSM-tree structures online to enable robust performance under the context of dynamic workloads; (2) RusKey is the first study to use Reinforcement Learning (RL) to guide LSM-tree transformations; (3) RusKey includes a new LSM-tree design, named FLSM-tree, for an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07013","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/2308.07013/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-07-05T06:51:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPei18Z/vzO7p8ngm790/YDksh7dIoZbB2mtF/2dCFUsQaxJU5PYzfOP5jjKIjjbpCGjZntvilj78/YSsWXYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:52:58.745494Z"},"content_sha256":"211f836f7a03cf2dd85983fa497aad948fd6800c8027da018be355efeb07e942","schema_version":"1.0","event_id":"sha256:211f836f7a03cf2dd85983fa497aad948fd6800c8027da018be355efeb07e942"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7HXKV65CFIMJW2QNCRORRYL7V/bundle.json","state_url":"https://pith.science/pith/G7HXKV65CFIMJW2QNCRORRYL7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7HXKV65CFIMJW2QNCRORRYL7V/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-08-10T03:52:58Z","links":{"resolver":"https://pith.science/pith/G7HXKV65CFIMJW2QNCRORRYL7V","bundle":"https://pith.science/pith/G7HXKV65CFIMJW2QNCRORRYL7V/bundle.json","state":"https://pith.science/pith/G7HXKV65CFIMJW2QNCRORRYL7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7HXKV65CFIMJW2QNCRORRYL7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:G7HXKV65CFIMJW2QNCRORRYL7V","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":"7f6aac86f21f54efd4ae2396c6f16a8612572780223625352b8da5245a74dfdc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-08-14T09:00:58Z","title_canon_sha256":"ee37f1e783245850a8abed4e091f971adbb7e31c347222fb9c8f9be454b8aa92"},"schema_version":"1.0","source":{"id":"2308.07013","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07013","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07013v2","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07013","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"pith_short_12","alias_value":"G7HXKV65CFIM","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"pith_short_16","alias_value":"G7HXKV65CFIMJW2Q","created_at":"2026-07-05T06:51:28Z"},{"alias_kind":"pith_short_8","alias_value":"G7HXKV65","created_at":"2026-07-05T06:51:28Z"}],"graph_snapshots":[{"event_id":"sha256:211f836f7a03cf2dd85983fa497aad948fd6800c8027da018be355efeb07e942","target":"graph","created_at":"2026-07-05T06:51:28Z","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/2308.07013/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"LSM-trees are widely adopted as the storage backend of key-value stores. However, optimizing the system performance under dynamic workloads has not been sufficiently studied or evaluated in previous work. To fill the gap, we present RusKey, a key-value store with the following new features: (1) RusKey is a first attempt to orchestrate LSM-tree structures online to enable robust performance under the context of dynamic workloads; (2) RusKey is the first study to use Reinforcement Learning (RL) to guide LSM-tree transformations; (3) RusKey includes a new LSM-tree design, named FLSM-tree, for an ","authors_text":"Caihua Shan, Dingheng Mo, Fanchao Chen, Siqiang Luo","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-08-14T09:00:58Z","title":"Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07013","kind":"arxiv","version":2},"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:7fd95f822c33b0401e14bb4cccfda99c21fc5ce796bd6cd3c11cc5f69d936132","target":"record","created_at":"2026-07-05T06:51:28Z","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":"7f6aac86f21f54efd4ae2396c6f16a8612572780223625352b8da5245a74dfdc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-08-14T09:00:58Z","title_canon_sha256":"ee37f1e783245850a8abed4e091f971adbb7e31c347222fb9c8f9be454b8aa92"},"schema_version":"1.0","source":{"id":"2308.07013","kind":"arxiv","version":2}},"canonical_sha256":"37cf7557dd1150c4db5068a2e8c70bfd7d01d929d8ce13af855bb5c9a30aeab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37cf7557dd1150c4db5068a2e8c70bfd7d01d929d8ce13af855bb5c9a30aeab8","first_computed_at":"2026-07-05T06:51:28.199762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:51:28.199762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ukpuftvhw6BG2uEMGQvBeO2L6P563Jt7PUu7qNOouaM0iXRDIJmyDhLCxStdO6K5sq0I74U0iWf6QEjUV/oKBg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:51:28.200244Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07013","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fd95f822c33b0401e14bb4cccfda99c21fc5ce796bd6cd3c11cc5f69d936132","sha256:211f836f7a03cf2dd85983fa497aad948fd6800c8027da018be355efeb07e942"],"state_sha256":"d35971c206acebec1b09ce458f687a87d3f4f981ca68659169bf6b50828a6aa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElmNUjyUsCJl9aVQTC1Z6q0YEc//aHOwGje2Nde+E/AnKRL/F6bGDUBWmiqFbOOt/OmNcr9cHqpmvJQ4V7iCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:52:58.750801Z","bundle_sha256":"846047e2317b18e27126b97dbc7d4d33afff09039f6bdff11dbe2975825e0871"}}