{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PTWPXEPWOHIUJWXBENQNMNAP7K","short_pith_number":"pith:PTWPXEPW","canonical_record":{"source":{"id":"1806.01117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-22T12:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"ffa7d1f44a8a905d1053033a5841213ca8bf909f66dbafd1a635a3f5a818cb44","abstract_canon_sha256":"98951fb9ffc15dc34a7f9f47fb838fce450424b550db22e38365ca9970edc539"},"schema_version":"1.0"},"canonical_sha256":"7cecfb91f671d144dae12360d6340ffa9f73674073ba6c31006d679992e09793","source":{"kind":"arxiv","id":"1806.01117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01117","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01117v1","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01117","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"PTWPXEPWOHIU","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PTWPXEPWOHIUJWXB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PTWPXEPW","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PTWPXEPWOHIUJWXBENQNMNAP7K","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-22T12:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"ffa7d1f44a8a905d1053033a5841213ca8bf909f66dbafd1a635a3f5a818cb44","abstract_canon_sha256":"98951fb9ffc15dc34a7f9f47fb838fce450424b550db22e38365ca9970edc539"},"schema_version":"1.0"},"canonical_sha256":"7cecfb91f671d144dae12360d6340ffa9f73674073ba6c31006d679992e09793","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:17.431579Z","signature_b64":"JczLkPs+OOlGN81psPgQGHLZ6lHFHSkTRi7hmskIj4HdIwKfb7+nb6n9eq48pb3acsCn7xAqNUisLr6e8M7aAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cecfb91f671d144dae12360d6340ffa9f73674073ba6c31006d679992e09793","last_reissued_at":"2026-05-18T00:14:17.431002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:17.431002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01117","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:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9AZ4GhAu7Vf64hlezaO4LX2jol9STo9auyP3pyQ1u2TCAGfkoorlzsi0FxI6ipiXq9OZat3ThK6jRJR1RPeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:15:05.378142Z"},"content_sha256":"ac53b225932af0635c9fb6417b77bf280634fe5476dc9d83d7391673e3e827a7","schema_version":"1.0","event_id":"sha256:ac53b225932af0635c9fb6417b77bf280634fe5476dc9d83d7391673e3e827a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PTWPXEPWOHIUJWXBENQNMNAP7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Backpropagation for long sequences: beyond memory constraints with constant overheads","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gerard J. Gorman, Jan H\\\"uckelheim, Navjot Kukreja","submitted_at":"2018-05-22T12:59:40Z","abstract_excerpt":"Naive backpropagation through time has a memory footprint that grows linearly in the sequence length, due to the need to store each state of the forward propagation. This is a problem for large networks. Strategies have been developed to trade memory for added computations, which results in a sublinear growth of memory footprint or computation overhead. In this work, we present a library that uses asynchronous storing and prefetching to move data to and from slow and cheap stor- age. The library only stores and prefetches states as frequently as possible without delaying the computation, and u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01117","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:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eB9BzuLOPF2nQTkB5QTIC448tS/F41OMvl9SkmfgDqDNfAgSpqyVauuVuK+u3ZjzuDduhecTQRu5eksKhng/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:15:05.378697Z"},"content_sha256":"578e89c78161d77783ad1561be5c2870b28d938f4eafa47675c80270de3b5169","schema_version":"1.0","event_id":"sha256:578e89c78161d77783ad1561be5c2870b28d938f4eafa47675c80270de3b5169"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTWPXEPWOHIUJWXBENQNMNAP7K/bundle.json","state_url":"https://pith.science/pith/PTWPXEPWOHIUJWXBENQNMNAP7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTWPXEPWOHIUJWXBENQNMNAP7K/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-08-18T10:15:05Z","links":{"resolver":"https://pith.science/pith/PTWPXEPWOHIUJWXBENQNMNAP7K","bundle":"https://pith.science/pith/PTWPXEPWOHIUJWXBENQNMNAP7K/bundle.json","state":"https://pith.science/pith/PTWPXEPWOHIUJWXBENQNMNAP7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTWPXEPWOHIUJWXBENQNMNAP7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PTWPXEPWOHIUJWXBENQNMNAP7K","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":"98951fb9ffc15dc34a7f9f47fb838fce450424b550db22e38365ca9970edc539","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-22T12:59:40Z","title_canon_sha256":"ffa7d1f44a8a905d1053033a5841213ca8bf909f66dbafd1a635a3f5a818cb44"},"schema_version":"1.0","source":{"id":"1806.01117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01117","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01117v1","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01117","created_at":"2026-05-18T00:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"PTWPXEPWOHIU","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PTWPXEPWOHIUJWXB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PTWPXEPW","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:578e89c78161d77783ad1561be5c2870b28d938f4eafa47675c80270de3b5169","target":"graph","created_at":"2026-05-18T00:14:17Z","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":"Naive backpropagation through time has a memory footprint that grows linearly in the sequence length, due to the need to store each state of the forward propagation. This is a problem for large networks. Strategies have been developed to trade memory for added computations, which results in a sublinear growth of memory footprint or computation overhead. In this work, we present a library that uses asynchronous storing and prefetching to move data to and from slow and cheap stor- age. The library only stores and prefetches states as frequently as possible without delaying the computation, and u","authors_text":"Gerard J. Gorman, Jan H\\\"uckelheim, Navjot Kukreja","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-22T12:59:40Z","title":"Backpropagation for long sequences: beyond memory constraints with constant overheads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01117","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:ac53b225932af0635c9fb6417b77bf280634fe5476dc9d83d7391673e3e827a7","target":"record","created_at":"2026-05-18T00:14:17Z","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":"98951fb9ffc15dc34a7f9f47fb838fce450424b550db22e38365ca9970edc539","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-22T12:59:40Z","title_canon_sha256":"ffa7d1f44a8a905d1053033a5841213ca8bf909f66dbafd1a635a3f5a818cb44"},"schema_version":"1.0","source":{"id":"1806.01117","kind":"arxiv","version":1}},"canonical_sha256":"7cecfb91f671d144dae12360d6340ffa9f73674073ba6c31006d679992e09793","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cecfb91f671d144dae12360d6340ffa9f73674073ba6c31006d679992e09793","first_computed_at":"2026-05-18T00:14:17.431002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:17.431002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JczLkPs+OOlGN81psPgQGHLZ6lHFHSkTRi7hmskIj4HdIwKfb7+nb6n9eq48pb3acsCn7xAqNUisLr6e8M7aAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:17.431579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac53b225932af0635c9fb6417b77bf280634fe5476dc9d83d7391673e3e827a7","sha256:578e89c78161d77783ad1561be5c2870b28d938f4eafa47675c80270de3b5169"],"state_sha256":"ecc0f211095ade487d6b5d37c417e39fb04684c02e92742bd7741f3cd0a8df84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+OezJU6jVtXR6sZyfcHqS4R1kSMkNr6F9wljgjzaglFbuv108AGlXZgt8qoYZrTYAJPP+TQjtMIZH7OA2hMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T10:15:05.385886Z","bundle_sha256":"922a0a20e9122a0327ff229f3028f9ab4565c87b54ae022c9669ede20598d7c4"}}