{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3IUIHACC22PQ3EU2PC4OEVALNB","short_pith_number":"pith:3IUIHACC","canonical_record":{"source":{"id":"1702.05043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-16T16:38:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"188ec3300b76a10fda670f832e71f8e89dfd89dcdca036584c70943eeb1075ac","abstract_canon_sha256":"708e346feb9f3b253b2c64b994a942cd9be18f9a28af6fa296944a8dc1084fe7"},"schema_version":"1.0"},"canonical_sha256":"da28838042d69f0d929a78b8e2540b6840d7306f0a1de685552c2652c1f38687","source":{"kind":"arxiv","id":"1702.05043","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05043","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05043v3","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05043","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"3IUIHACC22PQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3IUIHACC22PQ3EU2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3IUIHACC","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3IUIHACC22PQ3EU2PC4OEVALNB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-16T16:38:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"188ec3300b76a10fda670f832e71f8e89dfd89dcdca036584c70943eeb1075ac","abstract_canon_sha256":"708e346feb9f3b253b2c64b994a942cd9be18f9a28af6fa296944a8dc1084fe7"},"schema_version":"1.0"},"canonical_sha256":"da28838042d69f0d929a78b8e2540b6840d7306f0a1de685552c2652c1f38687","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:54.522122Z","signature_b64":"dwKuJyELX+5PF2FZXQbWr1cgHg1Fwr9Z1KGZBmW2gbkFE781rTVP75t9rOuZGcvr8tzH1JPydG3AiDKq0cDtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da28838042d69f0d929a78b8e2540b6840d7306f0a1de685552c2652c1f38687","last_reissued_at":"2026-05-18T00:43:54.521410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:54.521410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05043","source_version":3,"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:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucPCzorvw4eW33owYqO1vozK49muANEUJJshNB/eVrJGB+ym40473oHtywMutpmpuc1vSaSkvYgkH9b6KF9SCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:58:18.408585Z"},"content_sha256":"d18ffe026fec556f70ac94ef2c55925722c655671857e620259cdb9a8661af41","schema_version":"1.0","event_id":"sha256:d18ffe026fec556f70ac94ef2c55925722c655671857e620259cdb9a8661af41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3IUIHACC22PQ3EU2PC4OEVALNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unbiased Online Recurrent Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Corentin Tallec, Yann Ollivier","submitted_at":"2017-02-16T16:38:08Z","abstract_excerpt":"The novel Unbiased Online Recurrent Optimization (UORO) algorithm allows for online learning of general recurrent computational graphs such as recurrent network models. It works in a streaming fashion and avoids backtracking through past activations and inputs. UORO is computationally as costly as Truncated Backpropagation Through Time (truncated BPTT), a widespread algorithm for online learning of recurrent networks. UORO is a modification of NoBackTrack that bypasses the need for model sparsity and makes implementation easy in current deep learning frameworks, even for complex models.\n  Like"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05043","kind":"arxiv","version":3},"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:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/BP33bu9kwCYJ+nOmy39wIt6R/XhHhnw/M3iBVCCXrQmv5LQT+ccO5c+QvGAzReQ1KzQetr57fBuIsFUZYDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:58:18.409203Z"},"content_sha256":"e510b66128de21236db075e37b3b9c5c62a336ab5fe91c3cc21a74439aba0e06","schema_version":"1.0","event_id":"sha256:e510b66128de21236db075e37b3b9c5c62a336ab5fe91c3cc21a74439aba0e06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/bundle.json","state_url":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IUIHACC22PQ3EU2PC4OEVALNB/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-25T13:58:18Z","links":{"resolver":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB","bundle":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/bundle.json","state":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IUIHACC22PQ3EU2PC4OEVALNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3IUIHACC22PQ3EU2PC4OEVALNB","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":"708e346feb9f3b253b2c64b994a942cd9be18f9a28af6fa296944a8dc1084fe7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-16T16:38:08Z","title_canon_sha256":"188ec3300b76a10fda670f832e71f8e89dfd89dcdca036584c70943eeb1075ac"},"schema_version":"1.0","source":{"id":"1702.05043","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05043","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05043v3","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05043","created_at":"2026-05-18T00:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"3IUIHACC22PQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3IUIHACC22PQ3EU2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3IUIHACC","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:e510b66128de21236db075e37b3b9c5c62a336ab5fe91c3cc21a74439aba0e06","target":"graph","created_at":"2026-05-18T00:43:54Z","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":"The novel Unbiased Online Recurrent Optimization (UORO) algorithm allows for online learning of general recurrent computational graphs such as recurrent network models. It works in a streaming fashion and avoids backtracking through past activations and inputs. UORO is computationally as costly as Truncated Backpropagation Through Time (truncated BPTT), a widespread algorithm for online learning of recurrent networks. UORO is a modification of NoBackTrack that bypasses the need for model sparsity and makes implementation easy in current deep learning frameworks, even for complex models.\n  Like","authors_text":"Corentin Tallec, Yann Ollivier","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-16T16:38:08Z","title":"Unbiased Online Recurrent Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05043","kind":"arxiv","version":3},"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:d18ffe026fec556f70ac94ef2c55925722c655671857e620259cdb9a8661af41","target":"record","created_at":"2026-05-18T00:43:54Z","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":"708e346feb9f3b253b2c64b994a942cd9be18f9a28af6fa296944a8dc1084fe7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-16T16:38:08Z","title_canon_sha256":"188ec3300b76a10fda670f832e71f8e89dfd89dcdca036584c70943eeb1075ac"},"schema_version":"1.0","source":{"id":"1702.05043","kind":"arxiv","version":3}},"canonical_sha256":"da28838042d69f0d929a78b8e2540b6840d7306f0a1de685552c2652c1f38687","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da28838042d69f0d929a78b8e2540b6840d7306f0a1de685552c2652c1f38687","first_computed_at":"2026-05-18T00:43:54.521410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:54.521410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dwKuJyELX+5PF2FZXQbWr1cgHg1Fwr9Z1KGZBmW2gbkFE781rTVP75t9rOuZGcvr8tzH1JPydG3AiDKq0cDtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:54.522122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05043","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d18ffe026fec556f70ac94ef2c55925722c655671857e620259cdb9a8661af41","sha256:e510b66128de21236db075e37b3b9c5c62a336ab5fe91c3cc21a74439aba0e06"],"state_sha256":"c9e07a6abeccd734d89d68ede4a2eb00618ec1f92e8a2a2522107a2dc0eddfeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3PSY9mhC2TBHV33Y6MNKeJK65oPpNcSeMwhONI9a2P83vjxHGqgpYC6zwLifp8YVHQZw0YkKu4E54tcnAlIkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:58:18.412707Z","bundle_sha256":"c13154ba636e51445b63b3b1fb3f5c9d5723f48e09dcfe2df2c3d29df01db91e"}}