{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EOJN3HV723NMDJ43SLIP2AMADV","short_pith_number":"pith:EOJN3HV7","schema_version":"1.0","canonical_sha256":"2392dd9ebfd6dac1a79b92d0fd01801d57d231689f2afc9d850a0c0b24ec3aa1","source":{"kind":"arxiv","id":"2005.13762","version":3},"attestation_state":"computed","paper":{"title":"CedrusDB: Persistent Key-Value Store with Memory-Mapped Lazy-Trie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Emin G\\\"un Sirer, Hongbo Zhang, Maofan Yin, Robbert van Renesse","submitted_at":"2020-05-28T03:26:02Z","abstract_excerpt":"As a result of RAM becoming cheaper, there has been a trend in key-value store design towards maintaining a fast in-memory index (such as a hash table) while logging user operations to disk, allowing high performance under failure-free conditions while still being able to recover from failures. This design, however, comes at the cost of long recovery times or expensive checkpoint operations. This paper presents a new in-memory index that is also storage-friendly. A \"lazy-trie\" is a variant of the hash-trie data structure that achieves near-optimal height, has practical storage overhead, and ca"},"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":"2005.13762","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-05-28T03:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"71e059e108908a050da679cf1982ca263905f01b506fa5eaf0daee85511cea79","abstract_canon_sha256":"d90c2c3dfa8a71bf53e2e786d638a0f954d7fda7ef7bcfd72005604d36f749c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:59:52.824924Z","signature_b64":"3yume/bm6kMiQtEE4I19FwFkpUK4F78QGWm/2CxRmz6RRq9htDrol2kYH8gIFSLydbsOH6zVIB+pRXBvNSBUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2392dd9ebfd6dac1a79b92d0fd01801d57d231689f2afc9d850a0c0b24ec3aa1","last_reissued_at":"2026-07-05T02:59:52.824569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:59:52.824569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CedrusDB: Persistent Key-Value Store with Memory-Mapped Lazy-Trie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Emin G\\\"un Sirer, Hongbo Zhang, Maofan Yin, Robbert van Renesse","submitted_at":"2020-05-28T03:26:02Z","abstract_excerpt":"As a result of RAM becoming cheaper, there has been a trend in key-value store design towards maintaining a fast in-memory index (such as a hash table) while logging user operations to disk, allowing high performance under failure-free conditions while still being able to recover from failures. This design, however, comes at the cost of long recovery times or expensive checkpoint operations. This paper presents a new in-memory index that is also storage-friendly. A \"lazy-trie\" is a variant of the hash-trie data structure that achieves near-optimal height, has practical storage overhead, and ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13762","kind":"arxiv","version":3},"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/2005.13762/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":"2005.13762","created_at":"2026-07-05T02:59:52.824632+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.13762v3","created_at":"2026-07-05T02:59:52.824632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13762","created_at":"2026-07-05T02:59:52.824632+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOJN3HV723NM","created_at":"2026-07-05T02:59:52.824632+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOJN3HV723NMDJ43","created_at":"2026-07-05T02:59:52.824632+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOJN3HV7","created_at":"2026-07-05T02:59:52.824632+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/EOJN3HV723NMDJ43SLIP2AMADV","json":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV.json","graph_json":"https://pith.science/api/pith-number/EOJN3HV723NMDJ43SLIP2AMADV/graph.json","events_json":"https://pith.science/api/pith-number/EOJN3HV723NMDJ43SLIP2AMADV/events.json","paper":"https://pith.science/paper/EOJN3HV7"},"agent_actions":{"view_html":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV","download_json":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV.json","view_paper":"https://pith.science/paper/EOJN3HV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.13762&json=true","fetch_graph":"https://pith.science/api/pith-number/EOJN3HV723NMDJ43SLIP2AMADV/graph.json","fetch_events":"https://pith.science/api/pith-number/EOJN3HV723NMDJ43SLIP2AMADV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/action/storage_attestation","attest_author":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/action/author_attestation","sign_citation":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/action/citation_signature","submit_replication":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/action/replication_record"}},"created_at":"2026-07-05T02:59:52.824632+00:00","updated_at":"2026-07-05T02:59:52.824632+00:00"}