{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TNGWUNZDC4YI3RI63CGXIVLSPT","short_pith_number":"pith:TNGWUNZD","canonical_record":{"source":{"id":"2003.11660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-25T22:08:03Z","cross_cats_sorted":["cs.NE","q-bio.NC"],"title_canon_sha256":"bea617f6087d4279afc4bea710625a3f9800a5a5816b6ab9ae81d6cd49c7b8fe","abstract_canon_sha256":"48233edce67706ee881dc2c2ed38ca93343650d23250f3ea188ce0aa2b2ea0be"},"schema_version":"1.0"},"canonical_sha256":"9b4d6a372317308dc51ed88d7455727ce2da65ab899705e6c66b31f394994b25","source":{"kind":"arxiv","id":"2003.11660","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.11660","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"2003.11660v2","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11660","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"TNGWUNZDC4YI","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"pith_short_16","alias_value":"TNGWUNZDC4YI3RI6","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"pith_short_8","alias_value":"TNGWUNZD","created_at":"2026-07-05T11:18:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TNGWUNZDC4YI3RI63CGXIVLSPT","target":"record","payload":{"canonical_record":{"source":{"id":"2003.11660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-25T22:08:03Z","cross_cats_sorted":["cs.NE","q-bio.NC"],"title_canon_sha256":"bea617f6087d4279afc4bea710625a3f9800a5a5816b6ab9ae81d6cd49c7b8fe","abstract_canon_sha256":"48233edce67706ee881dc2c2ed38ca93343650d23250f3ea188ce0aa2b2ea0be"},"schema_version":"1.0"},"canonical_sha256":"9b4d6a372317308dc51ed88d7455727ce2da65ab899705e6c66b31f394994b25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:09.280764Z","signature_b64":"wDABrLweo23pSC4XDWdA9dwrkp587UoYBo5l6gMitGs8tbGDXEaGUm35OXlEHJlavAHalKt8nAwiae1vgpUBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b4d6a372317308dc51ed88d7455727ce2da65ab899705e6c66b31f394994b25","last_reissued_at":"2026-07-05T11:18:09.280270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:09.280270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.11660","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-07-05T11:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0t/5aAJ0CtmiTEgO02IQOZc42afI4AgmpO1NT/B8Z6O8mW88nrE/bX8yDeCqkAPVx8HMiEDz31NerLKOM57iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:29:27.440379Z"},"content_sha256":"8bf4788840b4a84b4a26bc1ef2627c3b216a72aa5cc0b34fa016f6f1a8098ebd","schema_version":"1.0","event_id":"sha256:8bf4788840b4a84b4a26bc1ef2627c3b216a72aa5cc0b34fa016f6f1a8098ebd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TNGWUNZDC4YI3RI63CGXIVLSPT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"R-FORCE: Robust Learning for Random Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","q-bio.NC"],"primary_cat":"cs.LG","authors_text":"Eli Shlizerman, Yang Zheng","submitted_at":"2020-03-25T22:08:03Z","abstract_excerpt":"Random Recurrent Neural Networks (RRNN) are the simplest recurrent networks to model and extract features from sequential data. The simplicity however comes with a price; RRNN are known to be susceptible to diminishing/exploding gradient problem when trained with gradient-descent based optimization. To enhance robustness of RRNN, alternative training approaches have been proposed. Specifically, FORCE learning approach proposed a recursive least squares alternative to train RRNN and was shown to be applicable even for the challenging task of target-learning, where the network is tasked with gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11660","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.11660/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0cSLAdl9Pn1pe1x/ouhlvDqw2uZOnwEccyFl93Gie8D1pkAOMzzOos2doM4wezTZt4nJNKc7H9AZn9jep9GhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:29:27.442948Z"},"content_sha256":"8eeffad64faad8feb175add59f95fd5180e8acba23161a22ea510308dd37f66e","schema_version":"1.0","event_id":"sha256:8eeffad64faad8feb175add59f95fd5180e8acba23161a22ea510308dd37f66e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNGWUNZDC4YI3RI63CGXIVLSPT/bundle.json","state_url":"https://pith.science/pith/TNGWUNZDC4YI3RI63CGXIVLSPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNGWUNZDC4YI3RI63CGXIVLSPT/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-07T18:29:27Z","links":{"resolver":"https://pith.science/pith/TNGWUNZDC4YI3RI63CGXIVLSPT","bundle":"https://pith.science/pith/TNGWUNZDC4YI3RI63CGXIVLSPT/bundle.json","state":"https://pith.science/pith/TNGWUNZDC4YI3RI63CGXIVLSPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNGWUNZDC4YI3RI63CGXIVLSPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TNGWUNZDC4YI3RI63CGXIVLSPT","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":"48233edce67706ee881dc2c2ed38ca93343650d23250f3ea188ce0aa2b2ea0be","cross_cats_sorted":["cs.NE","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-25T22:08:03Z","title_canon_sha256":"bea617f6087d4279afc4bea710625a3f9800a5a5816b6ab9ae81d6cd49c7b8fe"},"schema_version":"1.0","source":{"id":"2003.11660","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.11660","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"2003.11660v2","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11660","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"TNGWUNZDC4YI","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"pith_short_16","alias_value":"TNGWUNZDC4YI3RI6","created_at":"2026-07-05T11:18:09Z"},{"alias_kind":"pith_short_8","alias_value":"TNGWUNZD","created_at":"2026-07-05T11:18:09Z"}],"graph_snapshots":[{"event_id":"sha256:8eeffad64faad8feb175add59f95fd5180e8acba23161a22ea510308dd37f66e","target":"graph","created_at":"2026-07-05T11:18:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.11660/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Random Recurrent Neural Networks (RRNN) are the simplest recurrent networks to model and extract features from sequential data. The simplicity however comes with a price; RRNN are known to be susceptible to diminishing/exploding gradient problem when trained with gradient-descent based optimization. To enhance robustness of RRNN, alternative training approaches have been proposed. Specifically, FORCE learning approach proposed a recursive least squares alternative to train RRNN and was shown to be applicable even for the challenging task of target-learning, where the network is tasked with gen","authors_text":"Eli Shlizerman, Yang Zheng","cross_cats":["cs.NE","q-bio.NC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-25T22:08:03Z","title":"R-FORCE: Robust Learning for Random Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11660","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:8bf4788840b4a84b4a26bc1ef2627c3b216a72aa5cc0b34fa016f6f1a8098ebd","target":"record","created_at":"2026-07-05T11:18:09Z","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":"48233edce67706ee881dc2c2ed38ca93343650d23250f3ea188ce0aa2b2ea0be","cross_cats_sorted":["cs.NE","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-25T22:08:03Z","title_canon_sha256":"bea617f6087d4279afc4bea710625a3f9800a5a5816b6ab9ae81d6cd49c7b8fe"},"schema_version":"1.0","source":{"id":"2003.11660","kind":"arxiv","version":2}},"canonical_sha256":"9b4d6a372317308dc51ed88d7455727ce2da65ab899705e6c66b31f394994b25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b4d6a372317308dc51ed88d7455727ce2da65ab899705e6c66b31f394994b25","first_computed_at":"2026-07-05T11:18:09.280270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:09.280270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wDABrLweo23pSC4XDWdA9dwrkp587UoYBo5l6gMitGs8tbGDXEaGUm35OXlEHJlavAHalKt8nAwiae1vgpUBDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:09.280764Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.11660","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bf4788840b4a84b4a26bc1ef2627c3b216a72aa5cc0b34fa016f6f1a8098ebd","sha256:8eeffad64faad8feb175add59f95fd5180e8acba23161a22ea510308dd37f66e"],"state_sha256":"b68cf26b4174bc7ab453232666c8b6e98e045a9edaa1abb39b0f7f0ecf5e6b4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SrALpkjqakd41wOdLtCAKykLDHKH6cKY3jmLRqaj1gtrhAzi7B3ckCF9Crzv1X09fSbUXBCSJWdzl9iOrJMOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T18:29:27.458390Z","bundle_sha256":"b300b152c14b86b3bb3f12ee9110d42a953631269d52e4cefa25def1840864ce"}}