{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NCD4BKOROF2CJWRMVPFTTWDG5F","short_pith_number":"pith:NCD4BKOR","schema_version":"1.0","canonical_sha256":"6887c0a9d1717424da2cabcb39d866e96850cca1bf2f5887d9f0e7dc945beb24","source":{"kind":"arxiv","id":"2103.02131","version":1},"attestation_state":"computed","paper":{"title":"VELOC: VEry Low Overhead Checkpointing in the Age of Exascale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adam Moody, Bogdan Nicolae, Franck Cappello, Gregory Kosinovsky, Kathryn Mohror","submitted_at":"2021-03-03T02:24:05Z","abstract_excerpt":"Checkpointing large amounts of related data concurrently to stable storage is a common I/O pattern of many HPC applications. However, such a pattern frequently leads to I/O bottlenecks that lead to poor scalability and performance. As modern HPC infrastructures continue to evolve, there is a growing gap between compute capacity vs. I/O capabilities. Furthermore, the storage hierarchy is becoming increasingly heterogeneous: in addition to parallel file systems, it comprises burst buffers, key-value stores, deep memory hierarchies at node level, etc. In this context, state of art is insufficient"},"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":"2103.02131","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-03-03T02:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"768d9818d39d23cf122ebd15c3f8e6e95c12a4826e48c7b1b0aac016568f7a26","abstract_canon_sha256":"0ec2b5bcf680896e53e03e7a039fdd5d797474124350a374ab5d7dc1a3626cd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:20:00.655795Z","signature_b64":"wkcXKhgmr7EQBay3wJrYnr73hRwpSa2YGGIA9m1WNrZSRkr4RHX4irAqq9FcgZsc56dfO1Pnqakkir+mb7YzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6887c0a9d1717424da2cabcb39d866e96850cca1bf2f5887d9f0e7dc945beb24","last_reissued_at":"2026-07-05T02:20:00.655252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:20:00.655252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VELOC: VEry Low Overhead Checkpointing in the Age of Exascale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adam Moody, Bogdan Nicolae, Franck Cappello, Gregory Kosinovsky, Kathryn Mohror","submitted_at":"2021-03-03T02:24:05Z","abstract_excerpt":"Checkpointing large amounts of related data concurrently to stable storage is a common I/O pattern of many HPC applications. However, such a pattern frequently leads to I/O bottlenecks that lead to poor scalability and performance. As modern HPC infrastructures continue to evolve, there is a growing gap between compute capacity vs. I/O capabilities. Furthermore, the storage hierarchy is becoming increasingly heterogeneous: in addition to parallel file systems, it comprises burst buffers, key-value stores, deep memory hierarchies at node level, etc. In this context, state of art is insufficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.02131","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/2103.02131/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":"2103.02131","created_at":"2026-07-05T02:20:00.655345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.02131v1","created_at":"2026-07-05T02:20:00.655345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.02131","created_at":"2026-07-05T02:20:00.655345+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCD4BKOROF2C","created_at":"2026-07-05T02:20:00.655345+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCD4BKOROF2CJWRM","created_at":"2026-07-05T02:20:00.655345+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCD4BKOR","created_at":"2026-07-05T02:20:00.655345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00303","citing_title":"Promise-Future Synchronization for Cluster Asynchronous Many-Task Runtimes via MPI One-Sided Communication","ref_index":246,"is_internal_anchor":false},{"citing_arxiv_id":"2604.28138","citing_title":"Crab: A Semantics-Aware Checkpoint/Restore Runtime for Agent Sandboxes","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F","json":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F.json","graph_json":"https://pith.science/api/pith-number/NCD4BKOROF2CJWRMVPFTTWDG5F/graph.json","events_json":"https://pith.science/api/pith-number/NCD4BKOROF2CJWRMVPFTTWDG5F/events.json","paper":"https://pith.science/paper/NCD4BKOR"},"agent_actions":{"view_html":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F","download_json":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F.json","view_paper":"https://pith.science/paper/NCD4BKOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.02131&json=true","fetch_graph":"https://pith.science/api/pith-number/NCD4BKOROF2CJWRMVPFTTWDG5F/graph.json","fetch_events":"https://pith.science/api/pith-number/NCD4BKOROF2CJWRMVPFTTWDG5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F/action/storage_attestation","attest_author":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F/action/author_attestation","sign_citation":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F/action/citation_signature","submit_replication":"https://pith.science/pith/NCD4BKOROF2CJWRMVPFTTWDG5F/action/replication_record"}},"created_at":"2026-07-05T02:20:00.655345+00:00","updated_at":"2026-07-05T02:20:00.655345+00:00"}