{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LLHWNN73D4E6FSWUOCN2FWF3NP","short_pith_number":"pith:LLHWNN73","schema_version":"1.0","canonical_sha256":"5acf66b7fb1f09e2cad4709ba2d8bb6bd3d1cb52287f433a5932211c6b46410a","source":{"kind":"arxiv","id":"1611.05193","version":3},"attestation_state":"computed","paper":{"title":"Bayesian optimization of hyper-parameters in reservoir computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jan Yperman, Thijs Becker","submitted_at":"2016-11-16T09:25:17Z","abstract_excerpt":"We describe a method for searching the optimal hyper-parameters in reservoir computing, which consists of a Gaussian process with Bayesian optimization. It provides an alternative to other frequently used optimization methods such as grid, random, or manual search. In addition to a set of optimal hyper-parameters, the method also provides a probability distribution of the cost function as a function of the hyper-parameters. We apply this method to two types of reservoirs: nonlinear delay nodes and echo state networks. It shows excellent performance on all considered benchmarks, either matching"},"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":"1611.05193","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-16T09:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"5611e0ba4190e8ea08f517b1d55700541a5f4261014134f2a72786eb8619928d","abstract_canon_sha256":"2dec5e5cbbf6134a40e7508c6d3fdeb7fadb0a4f6079fb6585c1114d4ad79cfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.723186Z","signature_b64":"VMJ37606P3CEx4YV0Gaf33uIUUtI+mgw37euW8W4kBNcXE/cdbL/AnvOV6FzG+ZZhAvdIimujhTXSSbOejZNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5acf66b7fb1f09e2cad4709ba2d8bb6bd3d1cb52287f433a5932211c6b46410a","last_reissued_at":"2026-05-18T00:42:23.722759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.722759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian optimization of hyper-parameters in reservoir computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jan Yperman, Thijs Becker","submitted_at":"2016-11-16T09:25:17Z","abstract_excerpt":"We describe a method for searching the optimal hyper-parameters in reservoir computing, which consists of a Gaussian process with Bayesian optimization. It provides an alternative to other frequently used optimization methods such as grid, random, or manual search. In addition to a set of optimal hyper-parameters, the method also provides a probability distribution of the cost function as a function of the hyper-parameters. We apply this method to two types of reservoirs: nonlinear delay nodes and echo state networks. It shows excellent performance on all considered benchmarks, either matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05193","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.05193","created_at":"2026-05-18T00:42:23.722820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05193v3","created_at":"2026-05-18T00:42:23.722820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05193","created_at":"2026-05-18T00:42:23.722820+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLHWNN73D4E6","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLHWNN73D4E6FSWU","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLHWNN73","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13620","citing_title":"Tri-Learn Graph Fusion Network for Attributed Graph Clustering","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP","json":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP.json","graph_json":"https://pith.science/api/pith-number/LLHWNN73D4E6FSWUOCN2FWF3NP/graph.json","events_json":"https://pith.science/api/pith-number/LLHWNN73D4E6FSWUOCN2FWF3NP/events.json","paper":"https://pith.science/paper/LLHWNN73"},"agent_actions":{"view_html":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP","download_json":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP.json","view_paper":"https://pith.science/paper/LLHWNN73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05193&json=true","fetch_graph":"https://pith.science/api/pith-number/LLHWNN73D4E6FSWUOCN2FWF3NP/graph.json","fetch_events":"https://pith.science/api/pith-number/LLHWNN73D4E6FSWUOCN2FWF3NP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP/action/storage_attestation","attest_author":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP/action/author_attestation","sign_citation":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP/action/citation_signature","submit_replication":"https://pith.science/pith/LLHWNN73D4E6FSWUOCN2FWF3NP/action/replication_record"}},"created_at":"2026-05-18T00:42:23.722820+00:00","updated_at":"2026-05-18T00:42:23.722820+00:00"}