{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LSI4ZJZUIY4FCS3RCETXM6DVKV","short_pith_number":"pith:LSI4ZJZU","canonical_record":{"source":{"id":"1904.12666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-24T08:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"8165e3adcb95b90c39b65f0bbf736503bd08cc035e2557b719f6077f68bbd3ec","abstract_canon_sha256":"c2bcf0eab6d5702a429d94c672888dda70e707b4cdc1bf09afe7765588445aa6"},"schema_version":"1.0"},"canonical_sha256":"5c91cca7344638514b71112776787555426e2a7eb19a5680604db75803b3c4a3","source":{"kind":"arxiv","id":"1904.12666","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12666","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12666v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12666","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"LSI4ZJZUIY4F","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LSI4ZJZUIY4FCS3R","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LSI4ZJZU","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LSI4ZJZUIY4FCS3RCETXM6DVKV","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-24T08:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"8165e3adcb95b90c39b65f0bbf736503bd08cc035e2557b719f6077f68bbd3ec","abstract_canon_sha256":"c2bcf0eab6d5702a429d94c672888dda70e707b4cdc1bf09afe7765588445aa6"},"schema_version":"1.0"},"canonical_sha256":"5c91cca7344638514b71112776787555426e2a7eb19a5680604db75803b3c4a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:01.263049Z","signature_b64":"n8VbKRRyz1zAo6dP01UxtksGj9n5XD+gVIhOFeXyaI49ki+N86n4QUsd6iAnpL7AzTdAfGa96rabMHO+mNQhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c91cca7344638514b71112776787555426e2a7eb19a5680604db75803b3c4a3","last_reissued_at":"2026-05-17T23:47:01.262567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:01.262567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12666","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-05-17T23:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZNTiCttYZJFlm1fNRHBr9DnttalKdfzs9sPXpTxoslC0WZSA9iZcEQhi2OvSu+oFPdl9nzJMvVKw0hYES6tDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:44:24.116753Z"},"content_sha256":"a965353927c8401bce7fd4e8dbedf95a39c02350706f804b4fa7f41978e7f512","schema_version":"1.0","event_id":"sha256:a965353927c8401bce7fd4e8dbedf95a39c02350706f804b4fa7f41978e7f512"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LSI4ZJZUIY4FCS3RCETXM6DVKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstruct the Directories for In-Memory File Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chaoshu Yang, Runyu Zhang","submitted_at":"2019-04-24T08:54:20Z","abstract_excerpt":"Existing path lookup routines in file systems need to construct an auxiliary index in memory or traverse the dentries of the directory file sequentially, which brings either heavy writes or large timing cost. This paper designs a novel path lookup mechanism, Content-Indexed Browsing (CIB), for file systems on persistent memory, in which the structure of directory files is an exclusive index that can be searched in $O(log(n))$ time. We implement CIB in a real persistent memory file system, PMFS, denoted by CIB-PMFS. Comprehensive evaluations show that CIB can achieve times of performance improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12666","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":""},"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-17T23:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pl914FjsX5odTS7YuORSoSDIcQ6AU9X0DpiiaA62Lr2J6vtZNsMUoCz7XgzYu+UecAaoml+MaqMXR1aihWIqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:44:24.117099Z"},"content_sha256":"835bc7c1b96729b25c0664ddeceec4f9a69f1e10a50c6c19f0bee46ee344a173","schema_version":"1.0","event_id":"sha256:835bc7c1b96729b25c0664ddeceec4f9a69f1e10a50c6c19f0bee46ee344a173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSI4ZJZUIY4FCS3RCETXM6DVKV/bundle.json","state_url":"https://pith.science/pith/LSI4ZJZUIY4FCS3RCETXM6DVKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSI4ZJZUIY4FCS3RCETXM6DVKV/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-24T07:44:24Z","links":{"resolver":"https://pith.science/pith/LSI4ZJZUIY4FCS3RCETXM6DVKV","bundle":"https://pith.science/pith/LSI4ZJZUIY4FCS3RCETXM6DVKV/bundle.json","state":"https://pith.science/pith/LSI4ZJZUIY4FCS3RCETXM6DVKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSI4ZJZUIY4FCS3RCETXM6DVKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LSI4ZJZUIY4FCS3RCETXM6DVKV","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":"c2bcf0eab6d5702a429d94c672888dda70e707b4cdc1bf09afe7765588445aa6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-24T08:54:20Z","title_canon_sha256":"8165e3adcb95b90c39b65f0bbf736503bd08cc035e2557b719f6077f68bbd3ec"},"schema_version":"1.0","source":{"id":"1904.12666","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12666","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12666v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12666","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"LSI4ZJZUIY4F","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LSI4ZJZUIY4FCS3R","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LSI4ZJZU","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:835bc7c1b96729b25c0664ddeceec4f9a69f1e10a50c6c19f0bee46ee344a173","target":"graph","created_at":"2026-05-17T23:47:01Z","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":"Existing path lookup routines in file systems need to construct an auxiliary index in memory or traverse the dentries of the directory file sequentially, which brings either heavy writes or large timing cost. This paper designs a novel path lookup mechanism, Content-Indexed Browsing (CIB), for file systems on persistent memory, in which the structure of directory files is an exclusive index that can be searched in $O(log(n))$ time. We implement CIB in a real persistent memory file system, PMFS, denoted by CIB-PMFS. Comprehensive evaluations show that CIB can achieve times of performance improv","authors_text":"Chaoshu Yang, Runyu Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-24T08:54:20Z","title":"Reconstruct the Directories for In-Memory File Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12666","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:a965353927c8401bce7fd4e8dbedf95a39c02350706f804b4fa7f41978e7f512","target":"record","created_at":"2026-05-17T23:47:01Z","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":"c2bcf0eab6d5702a429d94c672888dda70e707b4cdc1bf09afe7765588445aa6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-24T08:54:20Z","title_canon_sha256":"8165e3adcb95b90c39b65f0bbf736503bd08cc035e2557b719f6077f68bbd3ec"},"schema_version":"1.0","source":{"id":"1904.12666","kind":"arxiv","version":2}},"canonical_sha256":"5c91cca7344638514b71112776787555426e2a7eb19a5680604db75803b3c4a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c91cca7344638514b71112776787555426e2a7eb19a5680604db75803b3c4a3","first_computed_at":"2026-05-17T23:47:01.262567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:01.262567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8VbKRRyz1zAo6dP01UxtksGj9n5XD+gVIhOFeXyaI49ki+N86n4QUsd6iAnpL7AzTdAfGa96rabMHO+mNQhDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:01.263049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12666","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a965353927c8401bce7fd4e8dbedf95a39c02350706f804b4fa7f41978e7f512","sha256:835bc7c1b96729b25c0664ddeceec4f9a69f1e10a50c6c19f0bee46ee344a173"],"state_sha256":"57eed95bd6eda9542c82e6835e0709af3f34981392c503cb846f1c3f8f461a11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDkdyUwYjL89M/lmro9B92kdufuBs4kgzsLZdQB1pTTjLgbqIBKlf/zXyB0L9+yFCqeUH2yw0m11ztXrTGIuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:44:24.119055Z","bundle_sha256":"268084574465583914d599168693a71ee69cd150439a93815247f9f4b0423a14"}}