{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6DBHIXAGMNK2PWRXUE7OQZB65O","short_pith_number":"pith:6DBHIXAG","canonical_record":{"source":{"id":"1905.13011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-29T17:56:55Z","cross_cats_sorted":["cs.AR","cs.DS","cs.PF"],"title_canon_sha256":"e89ba0a653e58bcd7e70d9aceec8018e9045795abdf4e7f41976e705a463e4a6","abstract_canon_sha256":"6d7471da219d44f8dda88a4bd37b2929df0974187861b4efa4db44c76cd9f03b"},"schema_version":"1.0"},"canonical_sha256":"f0c2745c066355a7da37a13ee8643eeb93d564f50e9c773a0a20f01c6459b1fb","source":{"kind":"arxiv","id":"1905.13011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13011","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13011v1","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13011","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"pith_short_12","alias_value":"6DBHIXAGMNK2","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"pith_short_16","alias_value":"6DBHIXAGMNK2PWRX","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"pith_short_8","alias_value":"6DBHIXAG","created_at":"2026-07-05T11:47:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6DBHIXAGMNK2PWRXUE7OQZB65O","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-29T17:56:55Z","cross_cats_sorted":["cs.AR","cs.DS","cs.PF"],"title_canon_sha256":"e89ba0a653e58bcd7e70d9aceec8018e9045795abdf4e7f41976e705a463e4a6","abstract_canon_sha256":"6d7471da219d44f8dda88a4bd37b2929df0974187861b4efa4db44c76cd9f03b"},"schema_version":"1.0"},"canonical_sha256":"f0c2745c066355a7da37a13ee8643eeb93d564f50e9c773a0a20f01c6459b1fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:08.457572Z","signature_b64":"Zcy4LbZ2VHcrKZWDmnOvnNfFyOwO3YJEkMl1scznDzCCiZdWAxFdm6IeLSrfu8Yfyd0qzaH2K9s60IO1Ae/WAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0c2745c066355a7da37a13ee8643eeb93d564f50e9c773a0a20f01c6459b1fb","last_reissued_at":"2026-07-05T11:47:08.457075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:08.457075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13011","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-07-05T11:47:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJH1lZt6U8SjB92/cAMoLNdpgdPEqgLET6E50nMUKA3QIKU+K96uPY27LBzdzq2xq28TaKS55wyPC+MvSuTCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T13:22:23.859488Z"},"content_sha256":"ec03ea617ed806834a4fe203ad5f632e8b0972e6316106771fd8f03eeb256b79","schema_version":"1.0","event_id":"sha256:ec03ea617ed806834a4fe203ad5f632e8b0972e6316106771fd8f03eeb256b79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6DBHIXAGMNK2PWRXUE7OQZB65O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Don't Persist All : Efficient Persistent Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.DS","cs.PF"],"primary_cat":"cs.DB","authors_text":"Mark D. Hill, Michael M. Swift, Pratyush Mahapatra","submitted_at":"2019-05-29T17:56:55Z","abstract_excerpt":"Data structures used in software development have inbuilt redundancy to improve software reliability and to speed up performance. Examples include a Doubly Linked List which allows a faster deletion due to the presence of the previous pointer. With the introduction of Persistent Memory, storing the redundant data fields into persistent memory adds a significant write overhead, and reduces performance. In this work, we focus on three data structures - Doubly Linked List, B+Tree and Hashmap, and showcase alternate partly persistent implementations where we only store a limited set of data fields"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13011","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.13011/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-05T11:47:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+GcF5nO6T5UBUNpAUqBQEhMtEWpSnH4FAa9PE7w1s+CSQhJyeMCkw6zWth/3/f4Yl9tyW9MqNIOwVFfStdZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T13:22:23.859870Z"},"content_sha256":"b98d8408afdd8f9d18229bd2e00be5b5bf98b417abbae3f12c64db245ab2f863","schema_version":"1.0","event_id":"sha256:b98d8408afdd8f9d18229bd2e00be5b5bf98b417abbae3f12c64db245ab2f863"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DBHIXAGMNK2PWRXUE7OQZB65O/bundle.json","state_url":"https://pith.science/pith/6DBHIXAGMNK2PWRXUE7OQZB65O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DBHIXAGMNK2PWRXUE7OQZB65O/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-07-20T13:22:23Z","links":{"resolver":"https://pith.science/pith/6DBHIXAGMNK2PWRXUE7OQZB65O","bundle":"https://pith.science/pith/6DBHIXAGMNK2PWRXUE7OQZB65O/bundle.json","state":"https://pith.science/pith/6DBHIXAGMNK2PWRXUE7OQZB65O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DBHIXAGMNK2PWRXUE7OQZB65O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6DBHIXAGMNK2PWRXUE7OQZB65O","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":"6d7471da219d44f8dda88a4bd37b2929df0974187861b4efa4db44c76cd9f03b","cross_cats_sorted":["cs.AR","cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-29T17:56:55Z","title_canon_sha256":"e89ba0a653e58bcd7e70d9aceec8018e9045795abdf4e7f41976e705a463e4a6"},"schema_version":"1.0","source":{"id":"1905.13011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13011","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13011v1","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13011","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"pith_short_12","alias_value":"6DBHIXAGMNK2","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"pith_short_16","alias_value":"6DBHIXAGMNK2PWRX","created_at":"2026-07-05T11:47:08Z"},{"alias_kind":"pith_short_8","alias_value":"6DBHIXAG","created_at":"2026-07-05T11:47:08Z"}],"graph_snapshots":[{"event_id":"sha256:b98d8408afdd8f9d18229bd2e00be5b5bf98b417abbae3f12c64db245ab2f863","target":"graph","created_at":"2026-07-05T11:47:08Z","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/1905.13011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Data structures used in software development have inbuilt redundancy to improve software reliability and to speed up performance. Examples include a Doubly Linked List which allows a faster deletion due to the presence of the previous pointer. With the introduction of Persistent Memory, storing the redundant data fields into persistent memory adds a significant write overhead, and reduces performance. In this work, we focus on three data structures - Doubly Linked List, B+Tree and Hashmap, and showcase alternate partly persistent implementations where we only store a limited set of data fields","authors_text":"Mark D. Hill, Michael M. Swift, Pratyush Mahapatra","cross_cats":["cs.AR","cs.DS","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-29T17:56:55Z","title":"Don't Persist All : Efficient Persistent Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13011","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:ec03ea617ed806834a4fe203ad5f632e8b0972e6316106771fd8f03eeb256b79","target":"record","created_at":"2026-07-05T11:47:08Z","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":"6d7471da219d44f8dda88a4bd37b2929df0974187861b4efa4db44c76cd9f03b","cross_cats_sorted":["cs.AR","cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-29T17:56:55Z","title_canon_sha256":"e89ba0a653e58bcd7e70d9aceec8018e9045795abdf4e7f41976e705a463e4a6"},"schema_version":"1.0","source":{"id":"1905.13011","kind":"arxiv","version":1}},"canonical_sha256":"f0c2745c066355a7da37a13ee8643eeb93d564f50e9c773a0a20f01c6459b1fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0c2745c066355a7da37a13ee8643eeb93d564f50e9c773a0a20f01c6459b1fb","first_computed_at":"2026-07-05T11:47:08.457075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:47:08.457075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zcy4LbZ2VHcrKZWDmnOvnNfFyOwO3YJEkMl1scznDzCCiZdWAxFdm6IeLSrfu8Yfyd0qzaH2K9s60IO1Ae/WAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:47:08.457572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec03ea617ed806834a4fe203ad5f632e8b0972e6316106771fd8f03eeb256b79","sha256:b98d8408afdd8f9d18229bd2e00be5b5bf98b417abbae3f12c64db245ab2f863"],"state_sha256":"ae8b46f58cd0166ce355daa475c0102ba5c8f34efc597f1552c3c78765fda286"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCq41RoTWk4yZF4RdPuquzex5MpRce0BKNO/vwX32zXgEIu8TeNjA5wDh4Ez5aT/UY0d1JNE1qtwInEivPB4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-20T13:22:23.862536Z","bundle_sha256":"4e9e729dd8975495ce96cd82e06f24ef8ce520adb043ff23c5dcbc7c992bffc3"}}