{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EJYNP7E42LJB6VBLDKFHXRKYZJ","short_pith_number":"pith:EJYNP7E4","canonical_record":{"source":{"id":"1802.02474","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.MS","submitted_at":"2018-01-12T16:02:09Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"dba634c4920e7aa6232403ff67e6de7da2d2b30a13273a37b2c2dfef2bfa1bdc","abstract_canon_sha256":"2f3635c0664885b900a489572f7605bf2081181a9b20e852c685e0f298c915eb"},"schema_version":"1.0"},"canonical_sha256":"2270d7fc9cd2d21f542b1a8a7bc558ca591c3118222707d9d1f003e389349dc0","source":{"kind":"arxiv","id":"1802.02474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02474","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02474v1","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02474","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"EJYNP7E42LJB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EJYNP7E42LJB6VBL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EJYNP7E4","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EJYNP7E42LJB6VBLDKFHXRKYZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02474","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.MS","submitted_at":"2018-01-12T16:02:09Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"dba634c4920e7aa6232403ff67e6de7da2d2b30a13273a37b2c2dfef2bfa1bdc","abstract_canon_sha256":"2f3635c0664885b900a489572f7605bf2081181a9b20e852c685e0f298c915eb"},"schema_version":"1.0"},"canonical_sha256":"2270d7fc9cd2d21f542b1a8a7bc558ca591c3118222707d9d1f003e389349dc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:08.159835Z","signature_b64":"Azy4joXIYlj6wdHwk+QRsEnUOs/VlJCL6ujFhNryRzDGzdz26vekDSROTQO3afaUplOBkAdRcvg1m3kynq0IDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2270d7fc9cd2d21f542b1a8a7bc558ca591c3118222707d9d1f003e389349dc0","last_reissued_at":"2026-05-18T00:24:08.159009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:08.159009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02474","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-05-18T00:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zz60TqQpgLcHw9tYBM+SVfShvuVkDC4PvF7ZXn1wWwscycIGhFYWGYOggjCOW1XUfeh2oMTbGIn/i4fi0I1rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:41:51.296651Z"},"content_sha256":"29f31d8c9454b207f0359f14a12e983d69f04540ed8de27fd805878fab3c672c","schema_version":"1.0","event_id":"sha256:29f31d8c9454b207f0359f14a12e983d69f04540ed8de27fd805878fab3c672c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EJYNP7E42LJB6VBLDKFHXRKYZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-level python abstractions for optimal checkpointing in inversion problems","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.MS","authors_text":"Andrea Walther, Gerard Gorman, Jan H\\\"uckelheim, Mathias Louboutin, Michael Lange, Navjot Kukreja, Simon W. Funke","submitted_at":"2018-01-12T16:02:09Z","abstract_excerpt":"Inversion and PDE-constrained optimization problems often rely on solving the adjoint problem to calculate the gradient of the objec- tive function. This requires storing large amounts of intermediate data, setting a limit to the largest problem that might be solved with a given amount of memory available. Checkpointing is an approach that can reduce the amount of memory required by redoing parts of the computation instead of storing intermediate results. The Revolve checkpointing algorithm o ers an optimal schedule that trades computational cost for smaller memory footprints. Integrat- ing Re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02474","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":""},"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:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wr9ZyAVrqtmawJVvLh+MUFcbOBQBPFKXWrrPsiR1S8PSYy3cdDNss2/2CkXwtmUPq4VMX59jY7JEbTOBgQ88BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:41:51.297006Z"},"content_sha256":"3b2ed5d59bca5bd52a9a63ddc82f6c4c6caca3113931db97d2a29964a6f3fcd2","schema_version":"1.0","event_id":"sha256:3b2ed5d59bca5bd52a9a63ddc82f6c4c6caca3113931db97d2a29964a6f3fcd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJYNP7E42LJB6VBLDKFHXRKYZJ/bundle.json","state_url":"https://pith.science/pith/EJYNP7E42LJB6VBLDKFHXRKYZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJYNP7E42LJB6VBLDKFHXRKYZJ/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-01T05:41:51Z","links":{"resolver":"https://pith.science/pith/EJYNP7E42LJB6VBLDKFHXRKYZJ","bundle":"https://pith.science/pith/EJYNP7E42LJB6VBLDKFHXRKYZJ/bundle.json","state":"https://pith.science/pith/EJYNP7E42LJB6VBLDKFHXRKYZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJYNP7E42LJB6VBLDKFHXRKYZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EJYNP7E42LJB6VBLDKFHXRKYZJ","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":"2f3635c0664885b900a489572f7605bf2081181a9b20e852c685e0f298c915eb","cross_cats_sorted":["cs.CE"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.MS","submitted_at":"2018-01-12T16:02:09Z","title_canon_sha256":"dba634c4920e7aa6232403ff67e6de7da2d2b30a13273a37b2c2dfef2bfa1bdc"},"schema_version":"1.0","source":{"id":"1802.02474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02474","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02474v1","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02474","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"EJYNP7E42LJB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EJYNP7E42LJB6VBL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EJYNP7E4","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:3b2ed5d59bca5bd52a9a63ddc82f6c4c6caca3113931db97d2a29964a6f3fcd2","target":"graph","created_at":"2026-05-18T00:24: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"},"paper":{"abstract_excerpt":"Inversion and PDE-constrained optimization problems often rely on solving the adjoint problem to calculate the gradient of the objec- tive function. This requires storing large amounts of intermediate data, setting a limit to the largest problem that might be solved with a given amount of memory available. Checkpointing is an approach that can reduce the amount of memory required by redoing parts of the computation instead of storing intermediate results. The Revolve checkpointing algorithm o ers an optimal schedule that trades computational cost for smaller memory footprints. Integrat- ing Re","authors_text":"Andrea Walther, Gerard Gorman, Jan H\\\"uckelheim, Mathias Louboutin, Michael Lange, Navjot Kukreja, Simon W. Funke","cross_cats":["cs.CE"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.MS","submitted_at":"2018-01-12T16:02:09Z","title":"High-level python abstractions for optimal checkpointing in inversion problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02474","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:29f31d8c9454b207f0359f14a12e983d69f04540ed8de27fd805878fab3c672c","target":"record","created_at":"2026-05-18T00:24: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":"2f3635c0664885b900a489572f7605bf2081181a9b20e852c685e0f298c915eb","cross_cats_sorted":["cs.CE"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.MS","submitted_at":"2018-01-12T16:02:09Z","title_canon_sha256":"dba634c4920e7aa6232403ff67e6de7da2d2b30a13273a37b2c2dfef2bfa1bdc"},"schema_version":"1.0","source":{"id":"1802.02474","kind":"arxiv","version":1}},"canonical_sha256":"2270d7fc9cd2d21f542b1a8a7bc558ca591c3118222707d9d1f003e389349dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2270d7fc9cd2d21f542b1a8a7bc558ca591c3118222707d9d1f003e389349dc0","first_computed_at":"2026-05-18T00:24:08.159009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:08.159009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Azy4joXIYlj6wdHwk+QRsEnUOs/VlJCL6ujFhNryRzDGzdz26vekDSROTQO3afaUplOBkAdRcvg1m3kynq0IDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:08.159835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29f31d8c9454b207f0359f14a12e983d69f04540ed8de27fd805878fab3c672c","sha256:3b2ed5d59bca5bd52a9a63ddc82f6c4c6caca3113931db97d2a29964a6f3fcd2"],"state_sha256":"194736d2f39b283c18fc4f44f0e736e8851ed0ebe5bba849a5b1d68b39231d75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDwjVU8+GcYC+nsB/V24H3GnBA3TfFmJZljyX5SCBkoQtlCNEOdgMjEq1DgyQ8KBGzCDKGoHoS1NAy8uPEVWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:41:51.299289Z","bundle_sha256":"478db31a0103247e95d2c11f705a627bc227022e55505e24c15e3b0812bafc04"}}