{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DAMKJQID3KNDGZLEO3CJGVH6WX","short_pith_number":"pith:DAMKJQID","canonical_record":{"source":{"id":"1611.03410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-10T17:29:24Z","cross_cats_sorted":["cs.LG","cs.MS"],"title_canon_sha256":"6cadcf64d0602076e0d9b8d8534ad0a2cfe0c38dbc323c02fdd24134bae9e6e5","abstract_canon_sha256":"66d7308665798fadc3318397d492a7a27d236d98cde15f438945e2b330b773e1"},"schema_version":"1.0"},"canonical_sha256":"1818a4c103da9a33656476c49354feb5c505e8c3ba4258dab4b484fa5c2e9602","source":{"kind":"arxiv","id":"1611.03410","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03410","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03410v1","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03410","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"pith_short_12","alias_value":"DAMKJQID3KND","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"DAMKJQID3KNDGZLE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"DAMKJQID","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DAMKJQID3KNDGZLEO3CJGVH6WX","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-10T17:29:24Z","cross_cats_sorted":["cs.LG","cs.MS"],"title_canon_sha256":"6cadcf64d0602076e0d9b8d8534ad0a2cfe0c38dbc323c02fdd24134bae9e6e5","abstract_canon_sha256":"66d7308665798fadc3318397d492a7a27d236d98cde15f438945e2b330b773e1"},"schema_version":"1.0"},"canonical_sha256":"1818a4c103da9a33656476c49354feb5c505e8c3ba4258dab4b484fa5c2e9602","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:35.389226Z","signature_b64":"TqVYWHx1w1EeZfpHdPqnQ1lwAwozxR2wJy4YeE2iEuO1nJHXUyL1W4rcJJZ4pkraKrVJ4hZPBndrOLY+qx4OCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1818a4c103da9a33656476c49354feb5c505e8c3ba4258dab4b484fa5c2e9602","last_reissued_at":"2026-05-18T00:59:35.388609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:35.388609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03410","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:59:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDXFiuM0nTZKyzO+R4EywRuo5lIomwqcOdZBeLTTFoaFvrQcaDakgEkNkSMlCnI+DnbsfTyuUALrkV+aBgsHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:41:59.548562Z"},"content_sha256":"dd1c0b54aad9f70a99f5dd625b85a609de6b9ae24561ca7eb113288aa628fecf","schema_version":"1.0","event_id":"sha256:dd1c0b54aad9f70a99f5dd625b85a609de6b9ae24561ca7eb113288aa628fecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DAMKJQID3KNDGZLEO3CJGVH6WX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binomial Checkpointing for Arbitrary Programs with No User Annotation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MS"],"primary_cat":"cs.PL","authors_text":"Barak A. Pearlmutter, Jeffrey Mark Siskind","submitted_at":"2016-11-10T17:29:24Z","abstract_excerpt":"Heretofore, automatic checkpointing at procedure-call boundaries, to reduce the space complexity of reverse mode, has been provided by systems like Tapenade. However, binomial checkpointing, or treeverse, has only been provided in Automatic Differentiation (AD) systems in special cases, e.g., through user-provided pragmas on DO loops in Tapenade, or as the nested taping mechanism in adol-c for time integration processes, which requires that user code be refactored. We present a framework for applying binomial checkpointing to arbitrary code with no special annotation or refactoring required. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03410","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:59:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Z2EF+QwbPBjbqfhCugVKm3bt51P0VLC88ZckSSgjOKN3HN+8SOnj/IUrzFJ5bzhsroyHQNXWtOtekP6TmtqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:41:59.548908Z"},"content_sha256":"0a7ae8c07b004518703e1cade54583d9afba394251ed88878b1acd8c44c3e6f5","schema_version":"1.0","event_id":"sha256:0a7ae8c07b004518703e1cade54583d9afba394251ed88878b1acd8c44c3e6f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAMKJQID3KNDGZLEO3CJGVH6WX/bundle.json","state_url":"https://pith.science/pith/DAMKJQID3KNDGZLEO3CJGVH6WX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAMKJQID3KNDGZLEO3CJGVH6WX/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-01T18:41:59Z","links":{"resolver":"https://pith.science/pith/DAMKJQID3KNDGZLEO3CJGVH6WX","bundle":"https://pith.science/pith/DAMKJQID3KNDGZLEO3CJGVH6WX/bundle.json","state":"https://pith.science/pith/DAMKJQID3KNDGZLEO3CJGVH6WX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAMKJQID3KNDGZLEO3CJGVH6WX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DAMKJQID3KNDGZLEO3CJGVH6WX","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":"66d7308665798fadc3318397d492a7a27d236d98cde15f438945e2b330b773e1","cross_cats_sorted":["cs.LG","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-10T17:29:24Z","title_canon_sha256":"6cadcf64d0602076e0d9b8d8534ad0a2cfe0c38dbc323c02fdd24134bae9e6e5"},"schema_version":"1.0","source":{"id":"1611.03410","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03410","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03410v1","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03410","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"pith_short_12","alias_value":"DAMKJQID3KND","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"DAMKJQID3KNDGZLE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"DAMKJQID","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:0a7ae8c07b004518703e1cade54583d9afba394251ed88878b1acd8c44c3e6f5","target":"graph","created_at":"2026-05-18T00:59:35Z","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":"Heretofore, automatic checkpointing at procedure-call boundaries, to reduce the space complexity of reverse mode, has been provided by systems like Tapenade. However, binomial checkpointing, or treeverse, has only been provided in Automatic Differentiation (AD) systems in special cases, e.g., through user-provided pragmas on DO loops in Tapenade, or as the nested taping mechanism in adol-c for time integration processes, which requires that user code be refactored. We present a framework for applying binomial checkpointing to arbitrary code with no special annotation or refactoring required. T","authors_text":"Barak A. Pearlmutter, Jeffrey Mark Siskind","cross_cats":["cs.LG","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-10T17:29:24Z","title":"Binomial Checkpointing for Arbitrary Programs with No User Annotation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03410","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:dd1c0b54aad9f70a99f5dd625b85a609de6b9ae24561ca7eb113288aa628fecf","target":"record","created_at":"2026-05-18T00:59:35Z","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":"66d7308665798fadc3318397d492a7a27d236d98cde15f438945e2b330b773e1","cross_cats_sorted":["cs.LG","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-11-10T17:29:24Z","title_canon_sha256":"6cadcf64d0602076e0d9b8d8534ad0a2cfe0c38dbc323c02fdd24134bae9e6e5"},"schema_version":"1.0","source":{"id":"1611.03410","kind":"arxiv","version":1}},"canonical_sha256":"1818a4c103da9a33656476c49354feb5c505e8c3ba4258dab4b484fa5c2e9602","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1818a4c103da9a33656476c49354feb5c505e8c3ba4258dab4b484fa5c2e9602","first_computed_at":"2026-05-18T00:59:35.388609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:35.388609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TqVYWHx1w1EeZfpHdPqnQ1lwAwozxR2wJy4YeE2iEuO1nJHXUyL1W4rcJJZ4pkraKrVJ4hZPBndrOLY+qx4OCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:35.389226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03410","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd1c0b54aad9f70a99f5dd625b85a609de6b9ae24561ca7eb113288aa628fecf","sha256:0a7ae8c07b004518703e1cade54583d9afba394251ed88878b1acd8c44c3e6f5"],"state_sha256":"9def1547d373773dfc59a8a1eec89f1947f017306700f75548be388dbca27f46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ATO2q+L7uEOVcCL5PrvxHwM9+IGYThFovNwUSml+IiR77TGvX9wm7htaV3gn2iFhsNLKijUpI0cTDPcIMn0QAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:41:59.550873Z","bundle_sha256":"2bebee9520f509e8c30542fb627d0a4b1c06714fd585b75b20f6a1638e21cdc4"}}