{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VARL7RE5IG2P44ICQE36ZTPZ2J","short_pith_number":"pith:VARL7RE5","canonical_record":{"source":{"id":"2106.13879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2021-06-25T20:41:50Z","cross_cats_sorted":[],"title_canon_sha256":"c0859ea9c6c37ec4b8e0fde445dd92f609bed8765dbe7eaf0b88a73158f2b08e","abstract_canon_sha256":"11efa8cfd61a1c26a113e70440dd9b8133f9416434b4bdf641795ab77cc0d091"},"schema_version":"1.0"},"canonical_sha256":"a822bfc49d41b4fe71028137eccdf9d271913efda355cf8d4b220e5cd14462a6","source":{"kind":"arxiv","id":"2106.13879","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.13879","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"2106.13879v2","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13879","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"VARL7RE5IG2P","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"pith_short_16","alias_value":"VARL7RE5IG2P44IC","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"pith_short_8","alias_value":"VARL7RE5","created_at":"2026-07-05T04:18:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VARL7RE5IG2P44ICQE36ZTPZ2J","target":"record","payload":{"canonical_record":{"source":{"id":"2106.13879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2021-06-25T20:41:50Z","cross_cats_sorted":[],"title_canon_sha256":"c0859ea9c6c37ec4b8e0fde445dd92f609bed8765dbe7eaf0b88a73158f2b08e","abstract_canon_sha256":"11efa8cfd61a1c26a113e70440dd9b8133f9416434b4bdf641795ab77cc0d091"},"schema_version":"1.0"},"canonical_sha256":"a822bfc49d41b4fe71028137eccdf9d271913efda355cf8d4b220e5cd14462a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:40.718689Z","signature_b64":"1ONlZofqc0sHe3syNlK5BJtMNspOmUtaAcmaaDglgVxlNBQs3phr2JNHADa31PexrLE9Gkz3C5sJ16y1rh7lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a822bfc49d41b4fe71028137eccdf9d271913efda355cf8d4b220e5cd14462a6","last_reissued_at":"2026-07-05T04:18:40.718118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:40.718118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.13879","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-07-05T04:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRn81yWDq4bTyFPwsCk23XmcOuezVF2Yy8TE+G1wcCIIdINxhaxKdgjr+Zr8UYEdHoflsYn47Q6TE9HDuDCGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T15:33:42.959807Z"},"content_sha256":"c6375bcfcf81ae06150b8217b36fb6b556dcdd9334016719d54237738a8f83b7","schema_version":"1.0","event_id":"sha256:c6375bcfcf81ae06150b8217b36fb6b556dcdd9334016719d54237738a8f83b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VARL7RE5IG2P44ICQE36ZTPZ2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Checkpointing for Adjoint Multistage Time-Stepping Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Emil Constantinescu, Hong Zhang","submitted_at":"2021-06-25T20:41:50Z","abstract_excerpt":"We consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes, which requires computing several substeps within one complete time step. In this case we propose two algorithms that can generate optimal checkpointing schedules under weak assumptions. The first is an extension of the seminal Revolve algorithm adapted to multistage schemes. The second algorithm, named CAMS, is developed based on dynamic programming, and it requires the least number of recomputations when compared with othe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13879","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.13879/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-05T04:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abZxtWZyxQOk37dFSKh/tULy3Uv6xHe8wrFKzW8vBbz7KeGlk0s0tmOTKqs+t5MxRFkHN+Swi7GJ4jmx8sYpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T15:33:42.960173Z"},"content_sha256":"985b2ea5c9745afe9a9e41e0dcb8dc43e7f1b1e147db3bee42807a153dc399d4","schema_version":"1.0","event_id":"sha256:985b2ea5c9745afe9a9e41e0dcb8dc43e7f1b1e147db3bee42807a153dc399d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VARL7RE5IG2P44ICQE36ZTPZ2J/bundle.json","state_url":"https://pith.science/pith/VARL7RE5IG2P44ICQE36ZTPZ2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VARL7RE5IG2P44ICQE36ZTPZ2J/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-13T15:33:42Z","links":{"resolver":"https://pith.science/pith/VARL7RE5IG2P44ICQE36ZTPZ2J","bundle":"https://pith.science/pith/VARL7RE5IG2P44ICQE36ZTPZ2J/bundle.json","state":"https://pith.science/pith/VARL7RE5IG2P44ICQE36ZTPZ2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VARL7RE5IG2P44ICQE36ZTPZ2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VARL7RE5IG2P44ICQE36ZTPZ2J","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":"11efa8cfd61a1c26a113e70440dd9b8133f9416434b4bdf641795ab77cc0d091","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2021-06-25T20:41:50Z","title_canon_sha256":"c0859ea9c6c37ec4b8e0fde445dd92f609bed8765dbe7eaf0b88a73158f2b08e"},"schema_version":"1.0","source":{"id":"2106.13879","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.13879","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"2106.13879v2","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13879","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"VARL7RE5IG2P","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"pith_short_16","alias_value":"VARL7RE5IG2P44IC","created_at":"2026-07-05T04:18:40Z"},{"alias_kind":"pith_short_8","alias_value":"VARL7RE5","created_at":"2026-07-05T04:18:40Z"}],"graph_snapshots":[{"event_id":"sha256:985b2ea5c9745afe9a9e41e0dcb8dc43e7f1b1e147db3bee42807a153dc399d4","target":"graph","created_at":"2026-07-05T04:18:40Z","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/2106.13879/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes, which requires computing several substeps within one complete time step. In this case we propose two algorithms that can generate optimal checkpointing schedules under weak assumptions. The first is an extension of the seminal Revolve algorithm adapted to multistage schemes. The second algorithm, named CAMS, is developed based on dynamic programming, and it requires the least number of recomputations when compared with othe","authors_text":"Emil Constantinescu, Hong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2021-06-25T20:41:50Z","title":"Optimal Checkpointing for Adjoint Multistage Time-Stepping Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13879","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:c6375bcfcf81ae06150b8217b36fb6b556dcdd9334016719d54237738a8f83b7","target":"record","created_at":"2026-07-05T04:18:40Z","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":"11efa8cfd61a1c26a113e70440dd9b8133f9416434b4bdf641795ab77cc0d091","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2021-06-25T20:41:50Z","title_canon_sha256":"c0859ea9c6c37ec4b8e0fde445dd92f609bed8765dbe7eaf0b88a73158f2b08e"},"schema_version":"1.0","source":{"id":"2106.13879","kind":"arxiv","version":2}},"canonical_sha256":"a822bfc49d41b4fe71028137eccdf9d271913efda355cf8d4b220e5cd14462a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a822bfc49d41b4fe71028137eccdf9d271913efda355cf8d4b220e5cd14462a6","first_computed_at":"2026-07-05T04:18:40.718118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:18:40.718118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ONlZofqc0sHe3syNlK5BJtMNspOmUtaAcmaaDglgVxlNBQs3phr2JNHADa31PexrLE9Gkz3C5sJ16y1rh7lBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:18:40.718689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.13879","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6375bcfcf81ae06150b8217b36fb6b556dcdd9334016719d54237738a8f83b7","sha256:985b2ea5c9745afe9a9e41e0dcb8dc43e7f1b1e147db3bee42807a153dc399d4"],"state_sha256":"20f067c559c0868741f416b04fa457aa6230c9a11b123c99212fb810c2f3878c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSuXvEDD7IssLsg2VbXfGu53ZGITeTFCCoyFTBf4GDzJnrnXTzUZqxgf22hwJitOX0l3fh6ZbfVGNtFcN9XzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T15:33:42.962361Z","bundle_sha256":"5a4c91dac05e281b222ebc62a345378791236dac884f2ad4e0f62ace97d880eb"}}