{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4DSUAFA2DNJCIAMSCKQ7XYU2FT","short_pith_number":"pith:4DSUAFA2","canonical_record":{"source":{"id":"1907.02649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-05T01:49:45Z","cross_cats_sorted":["cs.NE","q-bio.NC","stat.ML"],"title_canon_sha256":"ffe57f8eba3fd72dc45e6a7a4f57ef079b9b9391ea07e8f3050a6b24d33029f0","abstract_canon_sha256":"d662f62ecaf5038e314646d979bffa91d00010d36119f8557191232ad74ba3b0"},"schema_version":"1.0"},"canonical_sha256":"e0e540141a1b5224019212a1fbe29a2cc52a0db7efd5942ee8391416ca4f1ffd","source":{"kind":"arxiv","id":"1907.02649","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02649","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02649v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02649","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"4DSUAFA2DNJC","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4DSUAFA2DNJCIAMS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4DSUAFA2","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4DSUAFA2DNJCIAMSCKQ7XYU2FT","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-05T01:49:45Z","cross_cats_sorted":["cs.NE","q-bio.NC","stat.ML"],"title_canon_sha256":"ffe57f8eba3fd72dc45e6a7a4f57ef079b9b9391ea07e8f3050a6b24d33029f0","abstract_canon_sha256":"d662f62ecaf5038e314646d979bffa91d00010d36119f8557191232ad74ba3b0"},"schema_version":"1.0"},"canonical_sha256":"e0e540141a1b5224019212a1fbe29a2cc52a0db7efd5942ee8391416ca4f1ffd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:23.639897Z","signature_b64":"wziz8J4l/paWWGb6th+pTseR3fhJ4BYetJRmT91Fpbj6NBRiYg+hPFv8agCEFcM25sE+o0gIR6hwjjzBycsBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e540141a1b5224019212a1fbe29a2cc52a0db7efd5942ee8391416ca4f1ffd","last_reissued_at":"2026-05-17T23:41:23.639241Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:23.639241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02649","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:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpF9hHs6YDdupwOg7OlXL0zceQuV9xLu6Uf2LAuHt261Rme2m2sH/b8SP+spQLXPMLtMzodv9TWnKa2vRHFJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:11:47.283604Z"},"content_sha256":"3f3b8f00ee54e93970fb4da07652c5c0d9547d4d88d8009daff3d0d2cdd5f6a7","schema_version":"1.0","event_id":"sha256:3f3b8f00ee54e93970fb4da07652c5c0d9547d4d88d8009daff3d0d2cdd5f6a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4DSUAFA2DNJCIAMSCKQ7XYU2FT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Framework of Online Learning Algorithms for Training Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","q-bio.NC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cristina Savin, Kyunghyun Cho, Owen Marschall","submitted_at":"2019-07-05T01:49:45Z","abstract_excerpt":"We present a framework for compactly summarizing many recent results in efficient and/or biologically plausible online training of recurrent neural networks (RNN). The framework organizes algorithms according to several criteria: (a) past vs. future facing, (b) tensor structure, (c) stochastic vs. deterministic, and (d) closed form vs. numerical. These axes reveal latent conceptual connections among several recent advances in online learning. Furthermore, we provide novel mathematical intuitions for their degree of success. Testing various algorithms on two synthetic tasks shows that performan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02649","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:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWqhQ6DKj1nrK/3Q2WH5VVg3OgUJV7dz3COIx8Tx1Mnz3fKoIBmjZAwHasb2rF8VTw24meypzE1O2uTcDDQVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:11:47.284090Z"},"content_sha256":"03a2277ae29d53819f0ff86cf1c1f48f27c062bf3d1647dfe9b35aadae6bfa1c","schema_version":"1.0","event_id":"sha256:03a2277ae29d53819f0ff86cf1c1f48f27c062bf3d1647dfe9b35aadae6bfa1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DSUAFA2DNJCIAMSCKQ7XYU2FT/bundle.json","state_url":"https://pith.science/pith/4DSUAFA2DNJCIAMSCKQ7XYU2FT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DSUAFA2DNJCIAMSCKQ7XYU2FT/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-05-25T23:11:47Z","links":{"resolver":"https://pith.science/pith/4DSUAFA2DNJCIAMSCKQ7XYU2FT","bundle":"https://pith.science/pith/4DSUAFA2DNJCIAMSCKQ7XYU2FT/bundle.json","state":"https://pith.science/pith/4DSUAFA2DNJCIAMSCKQ7XYU2FT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DSUAFA2DNJCIAMSCKQ7XYU2FT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4DSUAFA2DNJCIAMSCKQ7XYU2FT","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":"d662f62ecaf5038e314646d979bffa91d00010d36119f8557191232ad74ba3b0","cross_cats_sorted":["cs.NE","q-bio.NC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-05T01:49:45Z","title_canon_sha256":"ffe57f8eba3fd72dc45e6a7a4f57ef079b9b9391ea07e8f3050a6b24d33029f0"},"schema_version":"1.0","source":{"id":"1907.02649","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02649","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02649v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02649","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"4DSUAFA2DNJC","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4DSUAFA2DNJCIAMS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4DSUAFA2","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:03a2277ae29d53819f0ff86cf1c1f48f27c062bf3d1647dfe9b35aadae6bfa1c","target":"graph","created_at":"2026-05-17T23:41:23Z","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 present a framework for compactly summarizing many recent results in efficient and/or biologically plausible online training of recurrent neural networks (RNN). The framework organizes algorithms according to several criteria: (a) past vs. future facing, (b) tensor structure, (c) stochastic vs. deterministic, and (d) closed form vs. numerical. These axes reveal latent conceptual connections among several recent advances in online learning. Furthermore, we provide novel mathematical intuitions for their degree of success. Testing various algorithms on two synthetic tasks shows that performan","authors_text":"Cristina Savin, Kyunghyun Cho, Owen Marschall","cross_cats":["cs.NE","q-bio.NC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-05T01:49:45Z","title":"A Unified Framework of Online Learning Algorithms for Training Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02649","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:3f3b8f00ee54e93970fb4da07652c5c0d9547d4d88d8009daff3d0d2cdd5f6a7","target":"record","created_at":"2026-05-17T23:41:23Z","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":"d662f62ecaf5038e314646d979bffa91d00010d36119f8557191232ad74ba3b0","cross_cats_sorted":["cs.NE","q-bio.NC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-05T01:49:45Z","title_canon_sha256":"ffe57f8eba3fd72dc45e6a7a4f57ef079b9b9391ea07e8f3050a6b24d33029f0"},"schema_version":"1.0","source":{"id":"1907.02649","kind":"arxiv","version":1}},"canonical_sha256":"e0e540141a1b5224019212a1fbe29a2cc52a0db7efd5942ee8391416ca4f1ffd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0e540141a1b5224019212a1fbe29a2cc52a0db7efd5942ee8391416ca4f1ffd","first_computed_at":"2026-05-17T23:41:23.639241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:23.639241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wziz8J4l/paWWGb6th+pTseR3fhJ4BYetJRmT91Fpbj6NBRiYg+hPFv8agCEFcM25sE+o0gIR6hwjjzBycsBCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:23.639897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02649","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3b8f00ee54e93970fb4da07652c5c0d9547d4d88d8009daff3d0d2cdd5f6a7","sha256:03a2277ae29d53819f0ff86cf1c1f48f27c062bf3d1647dfe9b35aadae6bfa1c"],"state_sha256":"2a2b818735725eb51e3eea23940564483c33020a128ba35c7864c4883f55bf75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tU1j42jwq5b4q9EVjN8AMJVXEsEEMqg3nS5RkSYPhsY5Y8cAlknsXwgIoBbHVoO9+nLndzY62r0djPEJcx4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:11:47.287357Z","bundle_sha256":"41d9f5d3d65ea741c19430b7c1bdaaf9e1ebb1cbcb61f50486184aabb4cfca7d"}}