{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MFMFK5FMEEGNWJCHSNFLUGKN7P","short_pith_number":"pith:MFMFK5FM","schema_version":"1.0","canonical_sha256":"61585574ac210cdb2447934aba194dfbc933defc22cd9c17f6008dcd0a5a9518","source":{"kind":"arxiv","id":"2302.05326","version":3},"attestation_state":"computed","paper":{"title":"Scalable Real-Time Recurrent Learning Using Columnar-Constructive Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Haseeb Shah, Khurram Javed, Martha White, Rich Sutton","submitted_at":"2023-01-20T23:17:48Z","abstract_excerpt":"Constructing states from sequences of observations is an important component of reinforcement learning agents. One solution for state construction is to use recurrent neural networks. Back-propagation through time (BPTT), and real-time recurrent learning (RTRL) are two popular gradient-based methods for recurrent learning. BPTT requires complete trajectories of observations before it can compute the gradients and is unsuitable for online updates. RTRL can do online updates but scales poorly to large networks. In this paper, we propose two constraints that make RTRL scalable. We show that by ei"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2302.05326","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-20T23:17:48Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c604b4dff73bbe8b7f39ecb81140a9722900b5fb79d55f810e2ecc8903c15864","abstract_canon_sha256":"b673e6c56f05547f46da781fee75d098232357a48a89206cacafcc8d8d2bea53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:13.156339Z","signature_b64":"p9/47p01xxVdNj3aovSNjpI9ssL6r9eA7VXtyvEsnmB8oj7X2W/KJwS80ICZx8tZd9hvqd/76KJnX1KmibG5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61585574ac210cdb2447934aba194dfbc933defc22cd9c17f6008dcd0a5a9518","last_reissued_at":"2026-07-05T07:15:13.155919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:13.155919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Real-Time Recurrent Learning Using Columnar-Constructive Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Haseeb Shah, Khurram Javed, Martha White, Rich Sutton","submitted_at":"2023-01-20T23:17:48Z","abstract_excerpt":"Constructing states from sequences of observations is an important component of reinforcement learning agents. One solution for state construction is to use recurrent neural networks. Back-propagation through time (BPTT), and real-time recurrent learning (RTRL) are two popular gradient-based methods for recurrent learning. BPTT requires complete trajectories of observations before it can compute the gradients and is unsuitable for online updates. RTRL can do online updates but scales poorly to large networks. In this paper, we propose two constraints that make RTRL scalable. We show that by ei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05326","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.05326/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.05326","created_at":"2026-07-05T07:15:13.155975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05326v3","created_at":"2026-07-05T07:15:13.155975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05326","created_at":"2026-07-05T07:15:13.155975+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFMFK5FMEEGN","created_at":"2026-07-05T07:15:13.155975+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFMFK5FMEEGNWJCH","created_at":"2026-07-05T07:15:13.155975+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFMFK5FM","created_at":"2026-07-05T07:15:13.155975+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P","json":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P.json","graph_json":"https://pith.science/api/pith-number/MFMFK5FMEEGNWJCHSNFLUGKN7P/graph.json","events_json":"https://pith.science/api/pith-number/MFMFK5FMEEGNWJCHSNFLUGKN7P/events.json","paper":"https://pith.science/paper/MFMFK5FM"},"agent_actions":{"view_html":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P","download_json":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P.json","view_paper":"https://pith.science/paper/MFMFK5FM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05326&json=true","fetch_graph":"https://pith.science/api/pith-number/MFMFK5FMEEGNWJCHSNFLUGKN7P/graph.json","fetch_events":"https://pith.science/api/pith-number/MFMFK5FMEEGNWJCHSNFLUGKN7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P/action/storage_attestation","attest_author":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P/action/author_attestation","sign_citation":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P/action/citation_signature","submit_replication":"https://pith.science/pith/MFMFK5FMEEGNWJCHSNFLUGKN7P/action/replication_record"}},"created_at":"2026-07-05T07:15:13.155975+00:00","updated_at":"2026-07-05T07:15:13.155975+00:00"}