{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D3AK5WDZ4GD2KR2K4WNHZDTDUU","short_pith_number":"pith:D3AK5WDZ","canonical_record":{"source":{"id":"1606.03401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T17:20:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"572e78e2e05a02ae5bd658a7812a3eeac86f3d0886d420710928b0eb8d31c7ce","abstract_canon_sha256":"935bee9b47a5a461d2ca74273f6f62d58398edf21f42fd6afa5a74de3614858b"},"schema_version":"1.0"},"canonical_sha256":"1ec0aed879e187a5474ae59a7c8e63a51e28701ea1fb72c11b67dcc48c9e18b7","source":{"kind":"arxiv","id":"1606.03401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03401","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03401v1","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03401","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"D3AK5WDZ4GD2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3AK5WDZ4GD2KR2K","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3AK5WDZ","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D3AK5WDZ4GD2KR2K4WNHZDTDUU","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T17:20:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"572e78e2e05a02ae5bd658a7812a3eeac86f3d0886d420710928b0eb8d31c7ce","abstract_canon_sha256":"935bee9b47a5a461d2ca74273f6f62d58398edf21f42fd6afa5a74de3614858b"},"schema_version":"1.0"},"canonical_sha256":"1ec0aed879e187a5474ae59a7c8e63a51e28701ea1fb72c11b67dcc48c9e18b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:36.974694Z","signature_b64":"LAKJfPdpryqASrjLECVEsL1Vx3do0gHByChTpiCCqRHM7t1oy7GSfwhsKhXGJ1SEIvdap0MqqdZYuR2mofpTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ec0aed879e187a5474ae59a7c8e63a51e28701ea1fb72c11b67dcc48c9e18b7","last_reissued_at":"2026-05-18T01:12:36.974058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:36.974058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03401","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-18T01:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Fe8l4sb64lEkRyR3SKDhxN1YmdqyTqo9bz6+b6V3KQS76TcLJ5k3UI59Hr6ZZfi1QMy0rBXT2hLYD76LrCNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:43:19.741023Z"},"content_sha256":"013fec42a330c39e88ea0fae4ea9a25fde628963879ee8cf4271bb8271bbd313","schema_version":"1.0","event_id":"sha256:013fec42a330c39e88ea0fae4ea9a25fde628963879ee8cf4271bb8271bbd313"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D3AK5WDZ4GD2KR2K4WNHZDTDUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory-Efficient Backpropagation Through Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Alex Graves, Audr\\=unas Gruslys, Ivo Danihelka, Marc Lanctot, Remi Munos","submitted_at":"2016-06-10T17:20:39Z","abstract_excerpt":"We propose a novel approach to reduce memory consumption of the backpropagation through time (BPTT) algorithm when training recurrent neural networks (RNNs). Our approach uses dynamic programming to balance a trade-off between caching of intermediate results and recomputation. The algorithm is capable of tightly fitting within almost any user-set memory budget while finding an optimal execution policy minimizing the computational cost. Computational devices have limited memory capacity and maximizing a computational performance given a fixed memory budget is a practical use-case. We provide as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03401","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-18T01:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yT4kfch66Xpx8BgVS9qy4V5+3WOGesbvvLDUdfSdJnLG450jcioTUOSx74QK2EHcuky14KFVh+nWKgK5tGqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:43:19.741804Z"},"content_sha256":"1d3cf6c73889a87ee251300d6993c0760302f3a126d199d8304a744f14c32745","schema_version":"1.0","event_id":"sha256:1d3cf6c73889a87ee251300d6993c0760302f3a126d199d8304a744f14c32745"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3AK5WDZ4GD2KR2K4WNHZDTDUU/bundle.json","state_url":"https://pith.science/pith/D3AK5WDZ4GD2KR2K4WNHZDTDUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3AK5WDZ4GD2KR2K4WNHZDTDUU/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-10T08:43:19Z","links":{"resolver":"https://pith.science/pith/D3AK5WDZ4GD2KR2K4WNHZDTDUU","bundle":"https://pith.science/pith/D3AK5WDZ4GD2KR2K4WNHZDTDUU/bundle.json","state":"https://pith.science/pith/D3AK5WDZ4GD2KR2K4WNHZDTDUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3AK5WDZ4GD2KR2K4WNHZDTDUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D3AK5WDZ4GD2KR2K4WNHZDTDUU","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":"935bee9b47a5a461d2ca74273f6f62d58398edf21f42fd6afa5a74de3614858b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T17:20:39Z","title_canon_sha256":"572e78e2e05a02ae5bd658a7812a3eeac86f3d0886d420710928b0eb8d31c7ce"},"schema_version":"1.0","source":{"id":"1606.03401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03401","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03401v1","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03401","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"D3AK5WDZ4GD2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D3AK5WDZ4GD2KR2K","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D3AK5WDZ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:1d3cf6c73889a87ee251300d6993c0760302f3a126d199d8304a744f14c32745","target":"graph","created_at":"2026-05-18T01:12:36Z","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":"We propose a novel approach to reduce memory consumption of the backpropagation through time (BPTT) algorithm when training recurrent neural networks (RNNs). Our approach uses dynamic programming to balance a trade-off between caching of intermediate results and recomputation. The algorithm is capable of tightly fitting within almost any user-set memory budget while finding an optimal execution policy minimizing the computational cost. Computational devices have limited memory capacity and maximizing a computational performance given a fixed memory budget is a practical use-case. We provide as","authors_text":"Alex Graves, Audr\\=unas Gruslys, Ivo Danihelka, Marc Lanctot, Remi Munos","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T17:20:39Z","title":"Memory-Efficient Backpropagation Through Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03401","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:013fec42a330c39e88ea0fae4ea9a25fde628963879ee8cf4271bb8271bbd313","target":"record","created_at":"2026-05-18T01:12:36Z","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":"935bee9b47a5a461d2ca74273f6f62d58398edf21f42fd6afa5a74de3614858b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-10T17:20:39Z","title_canon_sha256":"572e78e2e05a02ae5bd658a7812a3eeac86f3d0886d420710928b0eb8d31c7ce"},"schema_version":"1.0","source":{"id":"1606.03401","kind":"arxiv","version":1}},"canonical_sha256":"1ec0aed879e187a5474ae59a7c8e63a51e28701ea1fb72c11b67dcc48c9e18b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ec0aed879e187a5474ae59a7c8e63a51e28701ea1fb72c11b67dcc48c9e18b7","first_computed_at":"2026-05-18T01:12:36.974058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:36.974058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LAKJfPdpryqASrjLECVEsL1Vx3do0gHByChTpiCCqRHM7t1oy7GSfwhsKhXGJ1SEIvdap0MqqdZYuR2mofpTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:36.974694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:013fec42a330c39e88ea0fae4ea9a25fde628963879ee8cf4271bb8271bbd313","sha256:1d3cf6c73889a87ee251300d6993c0760302f3a126d199d8304a744f14c32745"],"state_sha256":"214d74425015875fccaaa101203764ce273669438bdbb0539af5105001171101"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oBOAeGIypWr7NrDlXosvOxbEnVc2vs0cMxeg73iBE7Wd7obBp6+JLx5OWw4FkZO1OTp0RRTzsw9hIwxHMyTVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T08:43:19.747049Z","bundle_sha256":"eb9ea87ea705b96a9c40694d44583ff1be962e0da5b82154ae6d5bee4e513f56"}}