{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OLFYQOMPDSB6VI3UL5FDMNF6US","short_pith_number":"pith:OLFYQOMP","canonical_record":{"source":{"id":"1905.11722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T10:15:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c7e23b53b3fabca29793849ae235a485e343de4e0fab21c3f2edf9d4803d8105","abstract_canon_sha256":"0c5a0fdcabee32a2a29594a49b50e55e1198dc6767de04e2a299a92659d6b455"},"schema_version":"1.0"},"canonical_sha256":"72cb88398f1c83eaa3745f4a3634bea4b1aa97323af8a87cbec20e6a6de17624","source":{"kind":"arxiv","id":"1905.11722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11722","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11722v1","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11722","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"OLFYQOMPDSB6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OLFYQOMPDSB6VI3U","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OLFYQOMP","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OLFYQOMPDSB6VI3UL5FDMNF6US","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T10:15:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c7e23b53b3fabca29793849ae235a485e343de4e0fab21c3f2edf9d4803d8105","abstract_canon_sha256":"0c5a0fdcabee32a2a29594a49b50e55e1198dc6767de04e2a299a92659d6b455"},"schema_version":"1.0"},"canonical_sha256":"72cb88398f1c83eaa3745f4a3634bea4b1aa97323af8a87cbec20e6a6de17624","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:52.513293Z","signature_b64":"0CuSeM+iflTCFIxbFvkv0o/4ldVE8QsW6MRePvzLmRrF548FSZAtQB4KMJqKfxzgCY8MqaFLhK4D4lwHLX4bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72cb88398f1c83eaa3745f4a3634bea4b1aa97323af8a87cbec20e6a6de17624","last_reissued_at":"2026-05-17T23:44:52.512700Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:52.512700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11722","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-17T23:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6IKqJfbkRcUpdYit5I/GO2Kf24977zsEid7ftG7o/WB2Omt5OnQW6ibmCxlnKkZLDFu/ROsfo4/gikrVW2iyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:58:30.548241Z"},"content_sha256":"cce0aad214cce336937646da0cda4e7d5201b7ac9209c0b8f030532da2fe9bc6","schema_version":"1.0","event_id":"sha256:cce0aad214cce336937646da0cda4e7d5201b7ac9209c0b8f030532da2fe9bc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OLFYQOMPDSB6VI3UL5FDMNF6US","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gentaro Watanabe, Masanori Koyama, Mitsuru Kusumoto, Takuya Akiba, Takuya Inoue","submitted_at":"2019-05-28T10:15:35Z","abstract_excerpt":"Recomputation algorithms collectively refer to a family of methods that aims to reduce the memory consumption of the backpropagation by selectively discarding the intermediate results of the forward propagation and recomputing the discarded results as needed. In this paper, we will propose a novel and efficient recomputation method that can be applied to a wider range of neural nets than previous methods. We use the language of graph theory to formalize the general recomputation problem of minimizing the computational overhead under a fixed memory budget constraint, and provide a dynamic progr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11722","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-17T23:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfBoGpPR0SArXckSi6L06eLUODdQs/WeZgptYnCbDmMCJASDzPaUKqVARVtc6SdU3M34BmqvnWk5H+xA/U0jBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:58:30.548833Z"},"content_sha256":"c468a3d1f397efc44e567abbd3d8c954e7e31a7a71d93ad54baeceacf32b130f","schema_version":"1.0","event_id":"sha256:c468a3d1f397efc44e567abbd3d8c954e7e31a7a71d93ad54baeceacf32b130f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLFYQOMPDSB6VI3UL5FDMNF6US/bundle.json","state_url":"https://pith.science/pith/OLFYQOMPDSB6VI3UL5FDMNF6US/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLFYQOMPDSB6VI3UL5FDMNF6US/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-08T14:58:30Z","links":{"resolver":"https://pith.science/pith/OLFYQOMPDSB6VI3UL5FDMNF6US","bundle":"https://pith.science/pith/OLFYQOMPDSB6VI3UL5FDMNF6US/bundle.json","state":"https://pith.science/pith/OLFYQOMPDSB6VI3UL5FDMNF6US/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLFYQOMPDSB6VI3UL5FDMNF6US/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OLFYQOMPDSB6VI3UL5FDMNF6US","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":"0c5a0fdcabee32a2a29594a49b50e55e1198dc6767de04e2a299a92659d6b455","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T10:15:35Z","title_canon_sha256":"c7e23b53b3fabca29793849ae235a485e343de4e0fab21c3f2edf9d4803d8105"},"schema_version":"1.0","source":{"id":"1905.11722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11722","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11722v1","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11722","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"OLFYQOMPDSB6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OLFYQOMPDSB6VI3U","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OLFYQOMP","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:c468a3d1f397efc44e567abbd3d8c954e7e31a7a71d93ad54baeceacf32b130f","target":"graph","created_at":"2026-05-17T23:44:52Z","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":"Recomputation algorithms collectively refer to a family of methods that aims to reduce the memory consumption of the backpropagation by selectively discarding the intermediate results of the forward propagation and recomputing the discarded results as needed. In this paper, we will propose a novel and efficient recomputation method that can be applied to a wider range of neural nets than previous methods. We use the language of graph theory to formalize the general recomputation problem of minimizing the computational overhead under a fixed memory budget constraint, and provide a dynamic progr","authors_text":"Gentaro Watanabe, Masanori Koyama, Mitsuru Kusumoto, Takuya Akiba, Takuya Inoue","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T10:15:35Z","title":"A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11722","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:cce0aad214cce336937646da0cda4e7d5201b7ac9209c0b8f030532da2fe9bc6","target":"record","created_at":"2026-05-17T23:44:52Z","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":"0c5a0fdcabee32a2a29594a49b50e55e1198dc6767de04e2a299a92659d6b455","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T10:15:35Z","title_canon_sha256":"c7e23b53b3fabca29793849ae235a485e343de4e0fab21c3f2edf9d4803d8105"},"schema_version":"1.0","source":{"id":"1905.11722","kind":"arxiv","version":1}},"canonical_sha256":"72cb88398f1c83eaa3745f4a3634bea4b1aa97323af8a87cbec20e6a6de17624","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72cb88398f1c83eaa3745f4a3634bea4b1aa97323af8a87cbec20e6a6de17624","first_computed_at":"2026-05-17T23:44:52.512700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:52.512700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0CuSeM+iflTCFIxbFvkv0o/4ldVE8QsW6MRePvzLmRrF548FSZAtQB4KMJqKfxzgCY8MqaFLhK4D4lwHLX4bAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:52.513293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cce0aad214cce336937646da0cda4e7d5201b7ac9209c0b8f030532da2fe9bc6","sha256:c468a3d1f397efc44e567abbd3d8c954e7e31a7a71d93ad54baeceacf32b130f"],"state_sha256":"10e5d6577754d90ea525151833f2d27485bf674d77402e73f082888050edde7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YS1WBYxEUxqLYNKqHBmvoOCaIg2DrPtXWsoA+qHmdPpMITPbl9hZp9ITtsIUHY31KBROA64luQ7uN3Fs9w6vDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:58:30.551633Z","bundle_sha256":"456d2b5241ecf1f25ade8a9e0fd94d56848895ea9d50672096a097eb2eac2093"}}