{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DPWHNQ6EMZMNSO3K4L7TT4PWAA","short_pith_number":"pith:DPWHNQ6E","canonical_record":{"source":{"id":"1705.00264","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-30T03:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"25efb3d85e7b0c5ade62c0da923b89a4557cb38da158f6c53235966afbaf19f9","abstract_canon_sha256":"afa4a015fe6b2a99e09e88d29390b3c59ab4342af370b972a792dded64ba5098"},"schema_version":"1.0"},"canonical_sha256":"1bec76c3c46658d93b6ae2ff39f1f60018bd69c3dc8c14984db5e328e0a4ed17","source":{"kind":"arxiv","id":"1705.00264","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00264","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00264v2","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00264","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"DPWHNQ6EMZMN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPWHNQ6EMZMNSO3K","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPWHNQ6E","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DPWHNQ6EMZMNSO3K4L7TT4PWAA","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00264","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-30T03:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"25efb3d85e7b0c5ade62c0da923b89a4557cb38da158f6c53235966afbaf19f9","abstract_canon_sha256":"afa4a015fe6b2a99e09e88d29390b3c59ab4342af370b972a792dded64ba5098"},"schema_version":"1.0"},"canonical_sha256":"1bec76c3c46658d93b6ae2ff39f1f60018bd69c3dc8c14984db5e328e0a4ed17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:10.391006Z","signature_b64":"+3q1CY+VxN9J1eh1PRjPQtLohHZsf5K1KuKhoJ1ar4Xcp9EeunyXXvSdWZaOYZjMsL1RGGl63oBUA2VIaRt9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bec76c3c46658d93b6ae2ff39f1f60018bd69c3dc8c14984db5e328e0a4ed17","last_reissued_at":"2026-05-18T00:45:10.390415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:10.390415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00264","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-18T00:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XP0PLq5Zs/9iaBC4X4pIpaB1MvAwV8sMgn0FiYAjm0lbHDwjU7vMw3LdVGXYsibqhdjm0KE7yGjkIINjAmYTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:01:59.508453Z"},"content_sha256":"8be972cde52ef7b8869ee436f70e822574ffbad246dfe4d3ffbe6580948d89dc","schema_version":"1.0","event_id":"sha256:8be972cde52ef7b8869ee436f70e822574ffbad246dfe4d3ffbe6580948d89dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DPWHNQ6EMZMNSO3K4L7TT4PWAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High Performance Data Persistence in Non-Volatile Memory for Resilient High Performance Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dong Li, Kai Wu, Yingchao Huang","submitted_at":"2017-04-30T03:24:14Z","abstract_excerpt":"Resilience is a major design goal for HPC. Checkpoint is the most common method to enable resilient HPC. Checkpoint periodically saves critical data objects to non-volatile storage to enable data persistence. However, using checkpoint, we face dilemmas between resilience, recomputation and checkpoint cost. The reason that accounts for the dilemmas is the cost of data copying inherent in checkpoint. In this paper we explore how to build resilient HPC with non-volatile memory (NVM) as main memory and address the dilemmas. We introduce a variety of optimization techniques that leverage high perfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00264","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-18T00:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25xTZqc4b4dyxqFIF9LoMm7ngcXyl9I/nu6sXrhnGbjKvN4tdCOKbzdqnanIEjtIe40eLvJ0EJap1P8tH76tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:01:59.509135Z"},"content_sha256":"5db933c6ec72e562a35f1c6b7c72f636da47d23713bd6c5b98e59a429e69ca33","schema_version":"1.0","event_id":"sha256:5db933c6ec72e562a35f1c6b7c72f636da47d23713bd6c5b98e59a429e69ca33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPWHNQ6EMZMNSO3K4L7TT4PWAA/bundle.json","state_url":"https://pith.science/pith/DPWHNQ6EMZMNSO3K4L7TT4PWAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPWHNQ6EMZMNSO3K4L7TT4PWAA/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-11T05:01:59Z","links":{"resolver":"https://pith.science/pith/DPWHNQ6EMZMNSO3K4L7TT4PWAA","bundle":"https://pith.science/pith/DPWHNQ6EMZMNSO3K4L7TT4PWAA/bundle.json","state":"https://pith.science/pith/DPWHNQ6EMZMNSO3K4L7TT4PWAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPWHNQ6EMZMNSO3K4L7TT4PWAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DPWHNQ6EMZMNSO3K4L7TT4PWAA","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":"afa4a015fe6b2a99e09e88d29390b3c59ab4342af370b972a792dded64ba5098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-30T03:24:14Z","title_canon_sha256":"25efb3d85e7b0c5ade62c0da923b89a4557cb38da158f6c53235966afbaf19f9"},"schema_version":"1.0","source":{"id":"1705.00264","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00264","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00264v2","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00264","created_at":"2026-05-18T00:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"DPWHNQ6EMZMN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPWHNQ6EMZMNSO3K","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPWHNQ6E","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:5db933c6ec72e562a35f1c6b7c72f636da47d23713bd6c5b98e59a429e69ca33","target":"graph","created_at":"2026-05-18T00:45:10Z","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":"Resilience is a major design goal for HPC. Checkpoint is the most common method to enable resilient HPC. Checkpoint periodically saves critical data objects to non-volatile storage to enable data persistence. However, using checkpoint, we face dilemmas between resilience, recomputation and checkpoint cost. The reason that accounts for the dilemmas is the cost of data copying inherent in checkpoint. In this paper we explore how to build resilient HPC with non-volatile memory (NVM) as main memory and address the dilemmas. We introduce a variety of optimization techniques that leverage high perfo","authors_text":"Dong Li, Kai Wu, Yingchao Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-30T03:24:14Z","title":"High Performance Data Persistence in Non-Volatile Memory for Resilient High Performance Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00264","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:8be972cde52ef7b8869ee436f70e822574ffbad246dfe4d3ffbe6580948d89dc","target":"record","created_at":"2026-05-18T00:45:10Z","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":"afa4a015fe6b2a99e09e88d29390b3c59ab4342af370b972a792dded64ba5098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-30T03:24:14Z","title_canon_sha256":"25efb3d85e7b0c5ade62c0da923b89a4557cb38da158f6c53235966afbaf19f9"},"schema_version":"1.0","source":{"id":"1705.00264","kind":"arxiv","version":2}},"canonical_sha256":"1bec76c3c46658d93b6ae2ff39f1f60018bd69c3dc8c14984db5e328e0a4ed17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bec76c3c46658d93b6ae2ff39f1f60018bd69c3dc8c14984db5e328e0a4ed17","first_computed_at":"2026-05-18T00:45:10.390415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:10.390415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3q1CY+VxN9J1eh1PRjPQtLohHZsf5K1KuKhoJ1ar4Xcp9EeunyXXvSdWZaOYZjMsL1RGGl63oBUA2VIaRt9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:10.391006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00264","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8be972cde52ef7b8869ee436f70e822574ffbad246dfe4d3ffbe6580948d89dc","sha256:5db933c6ec72e562a35f1c6b7c72f636da47d23713bd6c5b98e59a429e69ca33"],"state_sha256":"0d80f3033098e0dde7378c5861261bd74532ed249c885744c9ca01351bad5281"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnAggMDyGWYdXcD0fsI50Vcx4dhTx/kib7ZkoGYDFcC19x/zSc97kE2gehcUa4byRW3iAd+hMqAoqp8kw3TSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:01:59.513185Z","bundle_sha256":"0da2cfb911b8cea31ae1de07d6a301e52dfed783a0204b0396b7d1eed49255c9"}}