{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GDCBZB2RKCAQHRQJ3LBIZNES32","short_pith_number":"pith:GDCBZB2R","schema_version":"1.0","canonical_sha256":"30c41c8751508103c609dac28cb492de9c2fd743a490242d90cabf7883355f33","source":{"kind":"arxiv","id":"1907.08040","version":1},"attestation_state":"computed","paper":{"title":"Convolutional Reservoir Computing for World Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hanten Chang, Katsuya Futagami","submitted_at":"2019-07-18T13:16:39Z","abstract_excerpt":"Recently, reinforcement learning models have achieved great success, completing complex tasks such as mastering Go and other games with higher scores than human players. Many of these models collect considerable data on the tasks and improve accuracy by extracting visual and time-series features using convolutional neural networks (CNNs) and recurrent neural networks, respectively. However, these networks have very high computational costs because they need to be trained by repeatedly using a large volume of past playing data. In this study, we propose a novel practical approach called reinfor"},"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":"1907.08040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-18T13:16:39Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"294961d589c74818710a5da238e0ab345e05e5498a1c07fd9b7633423ff24309","abstract_canon_sha256":"f33a3f19aadc8329a70b30f4c25373bc8d7a1fadfed143da78e725d306a09364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.333962Z","signature_b64":"oR9sLs2zhKaI/XaNq5SEYuG2OcGLQROjLJafyuoDGZbWbL1oyD0KWoMIbVehB5gn8t20REv8fauL7rP0u5o+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c41c8751508103c609dac28cb492de9c2fd743a490242d90cabf7883355f33","last_reissued_at":"2026-05-17T23:40:15.333176Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.333176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convolutional Reservoir Computing for World Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hanten Chang, Katsuya Futagami","submitted_at":"2019-07-18T13:16:39Z","abstract_excerpt":"Recently, reinforcement learning models have achieved great success, completing complex tasks such as mastering Go and other games with higher scores than human players. Many of these models collect considerable data on the tasks and improve accuracy by extracting visual and time-series features using convolutional neural networks (CNNs) and recurrent neural networks, respectively. However, these networks have very high computational costs because they need to be trained by repeatedly using a large volume of past playing data. In this study, we propose a novel practical approach called reinfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08040","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.08040","created_at":"2026-05-17T23:40:15.333304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08040v1","created_at":"2026-05-17T23:40:15.333304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08040","created_at":"2026-05-17T23:40:15.333304+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDCBZB2RKCAQ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDCBZB2RKCAQHRQJ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDCBZB2R","created_at":"2026-05-18T12:33:18.533446+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/GDCBZB2RKCAQHRQJ3LBIZNES32","json":"https://pith.science/pith/GDCBZB2RKCAQHRQJ3LBIZNES32.json","graph_json":"https://pith.science/api/pith-number/GDCBZB2RKCAQHRQJ3LBIZNES32/graph.json","events_json":"https://pith.science/api/pith-number/GDCBZB2RKCAQHRQJ3LBIZNES32/events.json","paper":"https://pith.science/paper/GDCBZB2R"},"agent_actions":{"view_html":"https://pith.science/pith/GDCBZB2RKCAQHRQJ3LBIZNES32","download_json":"https://pith.science/pith/GDCBZB2RKCAQHRQJ3LBIZNES32.json","view_paper":"https://pith.science/paper/GDCBZB2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08040&json=true","fetch_graph":"https://pith.science/api/pith-number/GDCBZB2RKCAQHRQJ3LBIZNES32/graph.json","fetch_events":"https://pith.science/api/pith-number/GDCBZB2RKCAQHRQJ3LBIZNES32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDCBZB2RKCAQHRQJ3LBIZNES32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDCBZB2RKCAQHRQJ3LBIZNES32/action/storage_attestation","attest_author":"https://pith.science/pith/GDCBZB2RKCAQHRQJ3LBIZNES32/action/author_attestation","sign_citation":"https://pith.science/pith/GDCBZB2RKCAQHRQJ3LBIZNES32/action/citation_signature","submit_replication":"https://pith.science/pith/GDCBZB2RKCAQHRQJ3LBIZNES32/action/replication_record"}},"created_at":"2026-05-17T23:40:15.333304+00:00","updated_at":"2026-05-17T23:40:15.333304+00:00"}