{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EOJN3HV723NMDJ43SLIP2AMADV","short_pith_number":"pith:EOJN3HV7","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"},"canonical_sha256":"2392dd9ebfd6dac1a79b92d0fd01801d57d231689f2afc9d850a0c0b24ec3aa1","source":{"kind":"arxiv","id":"2005.13762","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.13762","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"2005.13762v3","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13762","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"EOJN3HV723NM","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"pith_short_16","alias_value":"EOJN3HV723NMDJ43","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"pith_short_8","alias_value":"EOJN3HV7","created_at":"2026-07-05T02:59:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EOJN3HV723NMDJ43SLIP2AMADV","target":"record","payload":{"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"},"canonical_sha256":"2392dd9ebfd6dac1a79b92d0fd01801d57d231689f2afc9d850a0c0b24ec3aa1","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"},"source_kind":"arxiv","source_id":"2005.13762","source_version":3,"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-05T02:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYShPqCUT3Kq7SbjrVsoLFP53bcrV4KwCJfd33+s2NG96TBOUY7db5/gSb9U8MoRXv+13MEFjU7kjXxybpPrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T07:14:47.237023Z"},"content_sha256":"c4bd60382ba4e7d69d6df0af9e7f91c015fe60c1def18e6c03f50d88262bd3b7","schema_version":"1.0","event_id":"sha256:c4bd60382ba4e7d69d6df0af9e7f91c015fe60c1def18e6c03f50d88262bd3b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EOJN3HV723NMDJ43SLIP2AMADV","target":"graph","payload":{"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"},"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-05T02:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afu0dW8Y0S+vu1x8TBhf4xVm5Y2urFYTMVQQRg8CwGiMAzBQYgL4UgT2EqQChb6bPvbESasUmhu91EVM3/XoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T07:14:47.237598Z"},"content_sha256":"f073382387808ae3982d863541d653246256ccb23e1b34a01678de16c75be5ff","schema_version":"1.0","event_id":"sha256:f073382387808ae3982d863541d653246256ccb23e1b34a01678de16c75be5ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/bundle.json","state_url":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EOJN3HV723NMDJ43SLIP2AMADV/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-12T07:14:47Z","links":{"resolver":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV","bundle":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/bundle.json","state":"https://pith.science/pith/EOJN3HV723NMDJ43SLIP2AMADV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EOJN3HV723NMDJ43SLIP2AMADV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EOJN3HV723NMDJ43SLIP2AMADV","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":"d90c2c3dfa8a71bf53e2e786d638a0f954d7fda7ef7bcfd72005604d36f749c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-05-28T03:26:02Z","title_canon_sha256":"71e059e108908a050da679cf1982ca263905f01b506fa5eaf0daee85511cea79"},"schema_version":"1.0","source":{"id":"2005.13762","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.13762","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"2005.13762v3","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13762","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"EOJN3HV723NM","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"pith_short_16","alias_value":"EOJN3HV723NMDJ43","created_at":"2026-07-05T02:59:52Z"},{"alias_kind":"pith_short_8","alias_value":"EOJN3HV7","created_at":"2026-07-05T02:59:52Z"}],"graph_snapshots":[{"event_id":"sha256:f073382387808ae3982d863541d653246256ccb23e1b34a01678de16c75be5ff","target":"graph","created_at":"2026-07-05T02:59:52Z","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/2005.13762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Emin G\\\"un Sirer, Hongbo Zhang, Maofan Yin, Robbert van Renesse","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-05-28T03:26:02Z","title":"CedrusDB: Persistent Key-Value Store with Memory-Mapped Lazy-Trie"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13762","kind":"arxiv","version":3},"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:c4bd60382ba4e7d69d6df0af9e7f91c015fe60c1def18e6c03f50d88262bd3b7","target":"record","created_at":"2026-07-05T02:59:52Z","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":"d90c2c3dfa8a71bf53e2e786d638a0f954d7fda7ef7bcfd72005604d36f749c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-05-28T03:26:02Z","title_canon_sha256":"71e059e108908a050da679cf1982ca263905f01b506fa5eaf0daee85511cea79"},"schema_version":"1.0","source":{"id":"2005.13762","kind":"arxiv","version":3}},"canonical_sha256":"2392dd9ebfd6dac1a79b92d0fd01801d57d231689f2afc9d850a0c0b24ec3aa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2392dd9ebfd6dac1a79b92d0fd01801d57d231689f2afc9d850a0c0b24ec3aa1","first_computed_at":"2026-07-05T02:59:52.824569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:59:52.824569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3yume/bm6kMiQtEE4I19FwFkpUK4F78QGWm/2CxRmz6RRq9htDrol2kYH8gIFSLydbsOH6zVIB+pRXBvNSBUBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:59:52.824924Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.13762","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4bd60382ba4e7d69d6df0af9e7f91c015fe60c1def18e6c03f50d88262bd3b7","sha256:f073382387808ae3982d863541d653246256ccb23e1b34a01678de16c75be5ff"],"state_sha256":"e7f62a97bae21b6a633ba76f345782cd482bc1f4aea1a8b11947c513e0e148a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NA+OrKAQfiqJN0iZlMmafzyWSJPxiuK7vKlqh3dyQDFAkmDKp+Bv8XBKqE1SZnNg1xovh0+yj+PL0uRbAk6/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T07:14:47.241367Z","bundle_sha256":"9b3500e206dee5028c40fabeee565f108f1f621dc04b398e12b9989dd072dcc0"}}