{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FFTAYKYDWT54CAE7U5GI2ECJKN","short_pith_number":"pith:FFTAYKYD","schema_version":"1.0","canonical_sha256":"29660c2b03b4fbc1009fa74c8d1049536255773daf8c269638d5b7457659443b","source":{"kind":"arxiv","id":"1702.03812","version":1},"attestation_state":"computed","paper":{"title":"Reservoir Computing Using Non-Uniform Binary Cellular Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.ET","authors_text":"Magnus S. Gundersen, Stefano Nichele","submitted_at":"2017-02-13T15:23:06Z","abstract_excerpt":"The Reservoir Computing (RC) paradigm utilizes a dynamical system, i.e., a reservoir, and a linear classifier, i.e., a read-out layer, to process data from sequential classification tasks. In this paper the usage of Cellular Automata (CA) as a reservoir is investigated. The use of CA in RC has been showing promising results. In this paper, selected state-of-the-art experiments are reproduced. It is shown that some CA-rules perform better than others, and the reservoir performance is improved by increasing the size of the CA reservoir itself. In addition, the usage of parallel loosely coupled C"},"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":"1702.03812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-02-13T15:23:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"75fbfc5fad103f7ac0e8c4ce232a68bc25f4b332676d817190ceabf79f35210a","abstract_canon_sha256":"59f495eb5ad9db3306a56f8c1c70c0acc2251391307bdd1464ea87ba2cb9af7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:52.940855Z","signature_b64":"qZ2B0/6PvydVb1BuVj35wYDlMjdJmgrAq1XI0Hn84pRSY20ziehnHT6V0THU2wyn4ef09NEN1xubI6+h5fo9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29660c2b03b4fbc1009fa74c8d1049536255773daf8c269638d5b7457659443b","last_reissued_at":"2026-05-18T00:50:52.940374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:52.940374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reservoir Computing Using Non-Uniform Binary Cellular Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.ET","authors_text":"Magnus S. Gundersen, Stefano Nichele","submitted_at":"2017-02-13T15:23:06Z","abstract_excerpt":"The Reservoir Computing (RC) paradigm utilizes a dynamical system, i.e., a reservoir, and a linear classifier, i.e., a read-out layer, to process data from sequential classification tasks. In this paper the usage of Cellular Automata (CA) as a reservoir is investigated. The use of CA in RC has been showing promising results. In this paper, selected state-of-the-art experiments are reproduced. It is shown that some CA-rules perform better than others, and the reservoir performance is improved by increasing the size of the CA reservoir itself. In addition, the usage of parallel loosely coupled C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03812","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":"1702.03812","created_at":"2026-05-18T00:50:52.940441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03812v1","created_at":"2026-05-18T00:50:52.940441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03812","created_at":"2026-05-18T00:50:52.940441+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFTAYKYDWT54","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFTAYKYDWT54CAE7","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFTAYKYD","created_at":"2026-05-18T12:31:15.632608+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/FFTAYKYDWT54CAE7U5GI2ECJKN","json":"https://pith.science/pith/FFTAYKYDWT54CAE7U5GI2ECJKN.json","graph_json":"https://pith.science/api/pith-number/FFTAYKYDWT54CAE7U5GI2ECJKN/graph.json","events_json":"https://pith.science/api/pith-number/FFTAYKYDWT54CAE7U5GI2ECJKN/events.json","paper":"https://pith.science/paper/FFTAYKYD"},"agent_actions":{"view_html":"https://pith.science/pith/FFTAYKYDWT54CAE7U5GI2ECJKN","download_json":"https://pith.science/pith/FFTAYKYDWT54CAE7U5GI2ECJKN.json","view_paper":"https://pith.science/paper/FFTAYKYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03812&json=true","fetch_graph":"https://pith.science/api/pith-number/FFTAYKYDWT54CAE7U5GI2ECJKN/graph.json","fetch_events":"https://pith.science/api/pith-number/FFTAYKYDWT54CAE7U5GI2ECJKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFTAYKYDWT54CAE7U5GI2ECJKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFTAYKYDWT54CAE7U5GI2ECJKN/action/storage_attestation","attest_author":"https://pith.science/pith/FFTAYKYDWT54CAE7U5GI2ECJKN/action/author_attestation","sign_citation":"https://pith.science/pith/FFTAYKYDWT54CAE7U5GI2ECJKN/action/citation_signature","submit_replication":"https://pith.science/pith/FFTAYKYDWT54CAE7U5GI2ECJKN/action/replication_record"}},"created_at":"2026-05-18T00:50:52.940441+00:00","updated_at":"2026-05-18T00:50:52.940441+00:00"}