{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FG3SFSFWR3KGVVKUXE2RQGRHSL","short_pith_number":"pith:FG3SFSFW","canonical_record":{"source":{"id":"1804.11268","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-30T15:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"689958581d22a6295f750eea0d28bedce4f03cbc9ac7c2c37d7afc8c877f56da","abstract_canon_sha256":"1224ebdd2909aa85769314cd3820f7b5a2c6c1d29ed1cf0a196aec225ddf3332"},"schema_version":"1.0"},"canonical_sha256":"29b722c8b68ed46ad554b935181a2792c8d182635c53b064b271dbf9c7985bfa","source":{"kind":"arxiv","id":"1804.11268","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11268","created_at":"2026-05-18T00:14:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11268v4","created_at":"2026-05-18T00:14:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11268","created_at":"2026-05-18T00:14:44Z"},{"alias_kind":"pith_short_12","alias_value":"FG3SFSFWR3KG","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FG3SFSFWR3KGVVKU","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FG3SFSFW","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FG3SFSFWR3KGVVKUXE2RQGRHSL","target":"record","payload":{"canonical_record":{"source":{"id":"1804.11268","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-30T15:12:32Z","cross_cats_sorted":[],"title_canon_sha256":"689958581d22a6295f750eea0d28bedce4f03cbc9ac7c2c37d7afc8c877f56da","abstract_canon_sha256":"1224ebdd2909aa85769314cd3820f7b5a2c6c1d29ed1cf0a196aec225ddf3332"},"schema_version":"1.0"},"canonical_sha256":"29b722c8b68ed46ad554b935181a2792c8d182635c53b064b271dbf9c7985bfa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:44.006001Z","signature_b64":"lBjeNyc5Vw1M+Hos6+VHz89+csGM8oVwe1jlCc3X61QUEmZ+kXTPfd4EGJNatoSMW7vyVwhhQPQbJr+wKL74AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b722c8b68ed46ad554b935181a2792c8d182635c53b064b271dbf9c7985bfa","last_reissued_at":"2026-05-18T00:14:44.005572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:44.005572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.11268","source_version":4,"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:14:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voOFus+M7ft2+10s9ddTrTg5BPSCRv66Ht1qw4xrmHMI4DzZ0Ezjc53VPvEyeC1dW9FAODR1hiKeBrC6HayDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:33:15.630862Z"},"content_sha256":"d3a9e9d5929ad9b090b5086307585dc88d088024ed8c2c095e3df6dd27d4be28","schema_version":"1.0","event_id":"sha256:d3a9e9d5929ad9b090b5086307585dc88d088024ed8c2c095e3df6dd27d4be28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FG3SFSFWR3KGVVKUXE2RQGRHSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Performance of Iterative Methods by Lossy Checkponting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dingwen Tao, Franck Cappello, Sheng Di, Xin Liang, Zizhong Chen","submitted_at":"2018-04-30T15:12:32Z","abstract_excerpt":"Iterative methods are commonly used approaches to solve large, sparse linear systems, which are fundamental operations for many modern scientific simulations. When the large-scale iterative methods are running with a large number of ranks in parallel, they have to checkpoint the dynamic variables periodically in case of unavoidable fail-stop errors, requiring fast I/O systems and large storage space. To this end, significantly reducing the checkpointing overhead is critical to improving the overall performance of iterative methods. Our contribution is fourfold. (1) We propose a novel lossy che"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11268","kind":"arxiv","version":4},"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:14:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HyMzDetIQi414CikAbHpt9mKB7SV96nSnDauT3Yob3KNiJIhU0fzUciSpKN8GaQ6Mxb+JR6tqfpJVOPFxOr/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:33:15.631214Z"},"content_sha256":"fefb2814a4e6f38aea72d0aef675ab776359d7fcefb12f2f28f305e72a0393ec","schema_version":"1.0","event_id":"sha256:fefb2814a4e6f38aea72d0aef675ab776359d7fcefb12f2f28f305e72a0393ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FG3SFSFWR3KGVVKUXE2RQGRHSL/bundle.json","state_url":"https://pith.science/pith/FG3SFSFWR3KGVVKUXE2RQGRHSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FG3SFSFWR3KGVVKUXE2RQGRHSL/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-05-28T08:33:15Z","links":{"resolver":"https://pith.science/pith/FG3SFSFWR3KGVVKUXE2RQGRHSL","bundle":"https://pith.science/pith/FG3SFSFWR3KGVVKUXE2RQGRHSL/bundle.json","state":"https://pith.science/pith/FG3SFSFWR3KGVVKUXE2RQGRHSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FG3SFSFWR3KGVVKUXE2RQGRHSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FG3SFSFWR3KGVVKUXE2RQGRHSL","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":"1224ebdd2909aa85769314cd3820f7b5a2c6c1d29ed1cf0a196aec225ddf3332","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-30T15:12:32Z","title_canon_sha256":"689958581d22a6295f750eea0d28bedce4f03cbc9ac7c2c37d7afc8c877f56da"},"schema_version":"1.0","source":{"id":"1804.11268","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11268","created_at":"2026-05-18T00:14:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11268v4","created_at":"2026-05-18T00:14:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11268","created_at":"2026-05-18T00:14:44Z"},{"alias_kind":"pith_short_12","alias_value":"FG3SFSFWR3KG","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FG3SFSFWR3KGVVKU","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FG3SFSFW","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:fefb2814a4e6f38aea72d0aef675ab776359d7fcefb12f2f28f305e72a0393ec","target":"graph","created_at":"2026-05-18T00:14:44Z","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":"Iterative methods are commonly used approaches to solve large, sparse linear systems, which are fundamental operations for many modern scientific simulations. When the large-scale iterative methods are running with a large number of ranks in parallel, they have to checkpoint the dynamic variables periodically in case of unavoidable fail-stop errors, requiring fast I/O systems and large storage space. To this end, significantly reducing the checkpointing overhead is critical to improving the overall performance of iterative methods. Our contribution is fourfold. (1) We propose a novel lossy che","authors_text":"Dingwen Tao, Franck Cappello, Sheng Di, Xin Liang, Zizhong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-30T15:12:32Z","title":"Improving Performance of Iterative Methods by Lossy Checkponting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11268","kind":"arxiv","version":4},"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:d3a9e9d5929ad9b090b5086307585dc88d088024ed8c2c095e3df6dd27d4be28","target":"record","created_at":"2026-05-18T00:14:44Z","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":"1224ebdd2909aa85769314cd3820f7b5a2c6c1d29ed1cf0a196aec225ddf3332","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-30T15:12:32Z","title_canon_sha256":"689958581d22a6295f750eea0d28bedce4f03cbc9ac7c2c37d7afc8c877f56da"},"schema_version":"1.0","source":{"id":"1804.11268","kind":"arxiv","version":4}},"canonical_sha256":"29b722c8b68ed46ad554b935181a2792c8d182635c53b064b271dbf9c7985bfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29b722c8b68ed46ad554b935181a2792c8d182635c53b064b271dbf9c7985bfa","first_computed_at":"2026-05-18T00:14:44.005572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:44.005572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lBjeNyc5Vw1M+Hos6+VHz89+csGM8oVwe1jlCc3X61QUEmZ+kXTPfd4EGJNatoSMW7vyVwhhQPQbJr+wKL74AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:44.006001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.11268","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3a9e9d5929ad9b090b5086307585dc88d088024ed8c2c095e3df6dd27d4be28","sha256:fefb2814a4e6f38aea72d0aef675ab776359d7fcefb12f2f28f305e72a0393ec"],"state_sha256":"dc956458418ae20101c2c4d6d48f392a2ab2a94f8e263b0f9989548a33ac587d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ooV7+IFZgNl51TWykC3PzYRRL5WEKuz1VV/KtO/PlsUW8Rk/OPS1SlOKNOWmO/IwnM2/MQk2pfY5Kyx57dUcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:33:15.633217Z","bundle_sha256":"992249e3da1b3376b759ecbfaa50b94adadbc9f2c47c2dced9bebd3738d85315"}}