{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MS4E5TK7ED5UGQBGUL7Z6P4DHS","short_pith_number":"pith:MS4E5TK7","canonical_record":{"source":{"id":"1507.07680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-07-28T08:26:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b97651de72cd94b24ecc75e880c9cd312a33371975feb3cbf932e7aef84ce5a9","abstract_canon_sha256":"6a7a1881daacc72e4705563795dcd0bba91b5d6339ccd658bfefc895281a9926"},"schema_version":"1.0"},"canonical_sha256":"64b84ecd5f20fb434026a2ff9f3f833cb148317bc2be1f8d2125f5932fba19d7","source":{"kind":"arxiv","id":"1507.07680","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07680","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07680v2","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07680","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"pith_short_12","alias_value":"MS4E5TK7ED5U","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MS4E5TK7ED5UGQBG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MS4E5TK7","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MS4E5TK7ED5UGQBGUL7Z6P4DHS","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-07-28T08:26:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b97651de72cd94b24ecc75e880c9cd312a33371975feb3cbf932e7aef84ce5a9","abstract_canon_sha256":"6a7a1881daacc72e4705563795dcd0bba91b5d6339ccd658bfefc895281a9926"},"schema_version":"1.0"},"canonical_sha256":"64b84ecd5f20fb434026a2ff9f3f833cb148317bc2be1f8d2125f5932fba19d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:19.567545Z","signature_b64":"Nc8pB5n5DzkfsS98U8ke2Ovgx1evks3i5H+8t4E/LPkiYLh6vfkNTSU0HjKiKLFnGNXwpGnE4cCozvpmgGf3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b84ecd5f20fb434026a2ff9f3f833cb148317bc2be1f8d2125f5932fba19d7","last_reissued_at":"2026-05-18T01:26:19.567053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:19.567053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07680","source_version":2,"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:26:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60j40B63oKhRahp/vA3QbemG3AI4ann2sSQEfspYwHu+HOJdhx8++3e/5j1MwmcwSxuPDSE0iVvY8609hq06BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:03:04.568071Z"},"content_sha256":"5a20e7a386cde38333293a90a8b146eecba59b52437113743afbd2f9e4da2456","schema_version":"1.0","event_id":"sha256:5a20e7a386cde38333293a90a8b146eecba59b52437113743afbd2f9e4da2456"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MS4E5TK7ED5UGQBGUL7Z6P4DHS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Training recurrent networks online without backtracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Corentin Tallec, Guillaume Charpiat, Yann Ollivier","submitted_at":"2015-07-28T08:26:50Z","abstract_excerpt":"We introduce the \"NoBackTrack\" algorithm to train the parameters of dynamical systems such as recurrent neural networks. This algorithm works in an online, memoryless setting, thus requiring no backpropagation through time, and is scalable, avoiding the large computational and memory cost of maintaining the full gradient of the current state with respect to the parameters.\n  The algorithm essentially maintains, at each time, a single search direction in parameter space. The evolution of this search direction is partly stochastic and is constructed in such a way to provide, at every time, an un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07680","kind":"arxiv","version":2},"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:26:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Js0SV27lCOUBXeLvLkmZQ+nDXTZKWQvtASmcv2ebDbsOXXgK+8i//BSzLpnjkygkh49C+3va9cDuQf3stgwhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:03:04.568729Z"},"content_sha256":"8fab298f97cd5af33cf6e5972d1353e2248a01119f5fa00039c54ecb0643e1a1","schema_version":"1.0","event_id":"sha256:8fab298f97cd5af33cf6e5972d1353e2248a01119f5fa00039c54ecb0643e1a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MS4E5TK7ED5UGQBGUL7Z6P4DHS/bundle.json","state_url":"https://pith.science/pith/MS4E5TK7ED5UGQBGUL7Z6P4DHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MS4E5TK7ED5UGQBGUL7Z6P4DHS/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-01T02:03:04Z","links":{"resolver":"https://pith.science/pith/MS4E5TK7ED5UGQBGUL7Z6P4DHS","bundle":"https://pith.science/pith/MS4E5TK7ED5UGQBGUL7Z6P4DHS/bundle.json","state":"https://pith.science/pith/MS4E5TK7ED5UGQBGUL7Z6P4DHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MS4E5TK7ED5UGQBGUL7Z6P4DHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MS4E5TK7ED5UGQBGUL7Z6P4DHS","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":"6a7a1881daacc72e4705563795dcd0bba91b5d6339ccd658bfefc895281a9926","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-07-28T08:26:50Z","title_canon_sha256":"b97651de72cd94b24ecc75e880c9cd312a33371975feb3cbf932e7aef84ce5a9"},"schema_version":"1.0","source":{"id":"1507.07680","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07680","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07680v2","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07680","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"pith_short_12","alias_value":"MS4E5TK7ED5U","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MS4E5TK7ED5UGQBG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MS4E5TK7","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:8fab298f97cd5af33cf6e5972d1353e2248a01119f5fa00039c54ecb0643e1a1","target":"graph","created_at":"2026-05-18T01:26:19Z","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 introduce the \"NoBackTrack\" algorithm to train the parameters of dynamical systems such as recurrent neural networks. This algorithm works in an online, memoryless setting, thus requiring no backpropagation through time, and is scalable, avoiding the large computational and memory cost of maintaining the full gradient of the current state with respect to the parameters.\n  The algorithm essentially maintains, at each time, a single search direction in parameter space. The evolution of this search direction is partly stochastic and is constructed in such a way to provide, at every time, an un","authors_text":"Corentin Tallec, Guillaume Charpiat, Yann Ollivier","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-07-28T08:26:50Z","title":"Training recurrent networks online without backtracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07680","kind":"arxiv","version":2},"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:5a20e7a386cde38333293a90a8b146eecba59b52437113743afbd2f9e4da2456","target":"record","created_at":"2026-05-18T01:26:19Z","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":"6a7a1881daacc72e4705563795dcd0bba91b5d6339ccd658bfefc895281a9926","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-07-28T08:26:50Z","title_canon_sha256":"b97651de72cd94b24ecc75e880c9cd312a33371975feb3cbf932e7aef84ce5a9"},"schema_version":"1.0","source":{"id":"1507.07680","kind":"arxiv","version":2}},"canonical_sha256":"64b84ecd5f20fb434026a2ff9f3f833cb148317bc2be1f8d2125f5932fba19d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64b84ecd5f20fb434026a2ff9f3f833cb148317bc2be1f8d2125f5932fba19d7","first_computed_at":"2026-05-18T01:26:19.567053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:19.567053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nc8pB5n5DzkfsS98U8ke2Ovgx1evks3i5H+8t4E/LPkiYLh6vfkNTSU0HjKiKLFnGNXwpGnE4cCozvpmgGf3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:19.567545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07680","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a20e7a386cde38333293a90a8b146eecba59b52437113743afbd2f9e4da2456","sha256:8fab298f97cd5af33cf6e5972d1353e2248a01119f5fa00039c54ecb0643e1a1"],"state_sha256":"b3b7dd3293d32fc9884ed705c03a2ddff5554520bc4804fbcdb8edc8be716558"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwYpVEBS2R5M/MpxQxmLXwOJPr+k14fjUsVq0SFAvAVErLj7ErprmNxC4RoyB1JTDa/e/QcyAJbHwSw3x7FVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:03:04.572269Z","bundle_sha256":"1566d0a45a43f752c6c0282bd249d297ad66c6abbba067fcb66a3b5b83afadd5"}}