{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZQSI3KTYBEOUWYU77UNQX6MLPC","short_pith_number":"pith:ZQSI3KTY","canonical_record":{"source":{"id":"1809.03261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-10T12:11:29Z","cross_cats_sorted":[],"title_canon_sha256":"4c537825d60d59a6ee8368a585da4226b7205af695ea579c71589d654a813cfe","abstract_canon_sha256":"19bd6c7dd900804aab84879730d088f7079b673fea3bd1ff37e9fdd3908918a7"},"schema_version":"1.0"},"canonical_sha256":"cc248daa78091d4b629ffd1b0bf98b7885dfce8aa795b78ab884e8e3b82b2cbe","source":{"kind":"arxiv","id":"1809.03261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03261","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03261v1","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03261","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZQSI3KTYBEOU","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZQSI3KTYBEOUWYU7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZQSI3KTY","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZQSI3KTYBEOUWYU77UNQX6MLPC","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-10T12:11:29Z","cross_cats_sorted":[],"title_canon_sha256":"4c537825d60d59a6ee8368a585da4226b7205af695ea579c71589d654a813cfe","abstract_canon_sha256":"19bd6c7dd900804aab84879730d088f7079b673fea3bd1ff37e9fdd3908918a7"},"schema_version":"1.0"},"canonical_sha256":"cc248daa78091d4b629ffd1b0bf98b7885dfce8aa795b78ab884e8e3b82b2cbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:09.449993Z","signature_b64":"mcYCqh889I8R9LksmpU7J3BeLXuDUPo3H1SVcSWOHsMDCCSIdA1t8+nQ+EgJpG2iSUnxGgUsTaudu2ycGtZ8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc248daa78091d4b629ffd1b0bf98b7885dfce8aa795b78ab884e8e3b82b2cbe","last_reissued_at":"2026-05-18T00:06:09.449264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:09.449264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03261","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-05-18T00:06:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9AGFzOQRl2G/Y5IToWKh7j3ONBeTMey+JQId6wERg09tqujlRpwWXeP9brtZKkyiCqoVrE2jUe03NbeoH2GCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:32:33.089020Z"},"content_sha256":"268cb08b277377ccd61e75df474440a775891ce40a7efc56f8595464b7ec8da1","schema_version":"1.0","event_id":"sha256:268cb08b277377ccd61e75df474440a775891ce40a7efc56f8595464b7ec8da1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZQSI3KTYBEOUWYU77UNQX6MLPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Skiplist-Based LSM Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aron Szanto","submitted_at":"2018-09-10T12:11:29Z","abstract_excerpt":"Log-Structured Merge (LSM) Trees provide a tiered data storage and retrieval paradigm that is attractive for write-optimized data systems. Maintaining an efficient buffer in memory and deferring updates past their initial write-time, the structure provides quick operations over hot data. Because each layer of the structure is logically separate from the others, the structure is also conducive to opportunistic and granular optimization. In this paper, we introduce the Skiplist-Based LSM Tree (sLSM), a novel system in which the memory buffer of the LSM is composed of a sequence of skiplists. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03261","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":""},"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-05-18T00:06:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYjch/ezSgfHUwLryUPoBxfR80FkEZqTLQOgTQW/19BlVf4LjaAPm5PiTgZ2GDRhjbiXEzc5O1CtJRwBHkfvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:32:33.089383Z"},"content_sha256":"9cabfd16caa9815acd9592450e5d526755477e6cda6e829b324f84cbf50ec4e1","schema_version":"1.0","event_id":"sha256:9cabfd16caa9815acd9592450e5d526755477e6cda6e829b324f84cbf50ec4e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQSI3KTYBEOUWYU77UNQX6MLPC/bundle.json","state_url":"https://pith.science/pith/ZQSI3KTYBEOUWYU77UNQX6MLPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQSI3KTYBEOUWYU77UNQX6MLPC/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-02T21:32:33Z","links":{"resolver":"https://pith.science/pith/ZQSI3KTYBEOUWYU77UNQX6MLPC","bundle":"https://pith.science/pith/ZQSI3KTYBEOUWYU77UNQX6MLPC/bundle.json","state":"https://pith.science/pith/ZQSI3KTYBEOUWYU77UNQX6MLPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQSI3KTYBEOUWYU77UNQX6MLPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZQSI3KTYBEOUWYU77UNQX6MLPC","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":"19bd6c7dd900804aab84879730d088f7079b673fea3bd1ff37e9fdd3908918a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-10T12:11:29Z","title_canon_sha256":"4c537825d60d59a6ee8368a585da4226b7205af695ea579c71589d654a813cfe"},"schema_version":"1.0","source":{"id":"1809.03261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03261","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03261v1","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03261","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZQSI3KTYBEOU","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZQSI3KTYBEOUWYU7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZQSI3KTY","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:9cabfd16caa9815acd9592450e5d526755477e6cda6e829b324f84cbf50ec4e1","target":"graph","created_at":"2026-05-18T00:06:09Z","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"},"paper":{"abstract_excerpt":"Log-Structured Merge (LSM) Trees provide a tiered data storage and retrieval paradigm that is attractive for write-optimized data systems. Maintaining an efficient buffer in memory and deferring updates past their initial write-time, the structure provides quick operations over hot data. Because each layer of the structure is logically separate from the others, the structure is also conducive to opportunistic and granular optimization. In this paper, we introduce the Skiplist-Based LSM Tree (sLSM), a novel system in which the memory buffer of the LSM is composed of a sequence of skiplists. We ","authors_text":"Aron Szanto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-10T12:11:29Z","title":"The Skiplist-Based LSM Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03261","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:268cb08b277377ccd61e75df474440a775891ce40a7efc56f8595464b7ec8da1","target":"record","created_at":"2026-05-18T00:06:09Z","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":"19bd6c7dd900804aab84879730d088f7079b673fea3bd1ff37e9fdd3908918a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-09-10T12:11:29Z","title_canon_sha256":"4c537825d60d59a6ee8368a585da4226b7205af695ea579c71589d654a813cfe"},"schema_version":"1.0","source":{"id":"1809.03261","kind":"arxiv","version":1}},"canonical_sha256":"cc248daa78091d4b629ffd1b0bf98b7885dfce8aa795b78ab884e8e3b82b2cbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc248daa78091d4b629ffd1b0bf98b7885dfce8aa795b78ab884e8e3b82b2cbe","first_computed_at":"2026-05-18T00:06:09.449264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:09.449264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mcYCqh889I8R9LksmpU7J3BeLXuDUPo3H1SVcSWOHsMDCCSIdA1t8+nQ+EgJpG2iSUnxGgUsTaudu2ycGtZ8CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:09.449993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:268cb08b277377ccd61e75df474440a775891ce40a7efc56f8595464b7ec8da1","sha256:9cabfd16caa9815acd9592450e5d526755477e6cda6e829b324f84cbf50ec4e1"],"state_sha256":"ac84152e10351c75e08e6e7bc9d95c693b40089e1013219e1682480d9da6cf27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hGcDFOP+LuNhWevDKVZsD2MTSPCxyZfjwt5qfKIXEUrMfLxcuZJo7vJegaZU9DkSon3amgh5uo17/LdN7XpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:32:33.091348Z","bundle_sha256":"d6a1e3ba6fc84fc5f2b65a50026c6fba01c1a36b4481c9710e954932ca3a2e7f"}}