{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IAD3HLDY3UHAZGRQZBT6GV5ALO","short_pith_number":"pith:IAD3HLDY","schema_version":"1.0","canonical_sha256":"4007b3ac78dd0e0c9a30c867e357a05b927dabc0c85a2cadae4e641a9cb5c792","source":{"kind":"arxiv","id":"1805.07159","version":2},"attestation_state":"computed","paper":{"title":"Low-Cost Recurrent Neural Network Expected Performance Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'es Camero, Enrique Alba, Jamal Toutouh","submitted_at":"2018-05-18T12:00:09Z","abstract_excerpt":"Recurrent neural networks are a powerful tool, but they are very sensitive to their hyper-parameter configuration. Moreover, training properly a recurrent neural network is a tough task, therefore selecting an appropriate configuration is critical. Varied strategies have been proposed to tackle this issue. However, most of them are still impractical because of the time/resources needed. In this study, we propose a low computational cost model to evaluate the expected performance of a given architecture based on the distribution of the error of random samples of the weights. We empirically vali"},"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":"1805.07159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-18T12:00:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"57c504a9a9d15b5f482560c11e051bfeb11f6f5ad2382f2217c416c293f663c7","abstract_canon_sha256":"ef4ddf5b9e0268ca969f37ed6b219255f663b0638dbfd91f0349997d9133cf09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:39.615447Z","signature_b64":"aMPi1xsHpVsRLY2mbwMh1YXDspX6czarQfVMA+qG0ZlXeqEJvr6fJNyjXL+0QstNQuxCEp0d+frOHffSMfp3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4007b3ac78dd0e0c9a30c867e357a05b927dabc0c85a2cadae4e641a9cb5c792","last_reissued_at":"2026-05-17T23:51:39.614868Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:39.614868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Cost Recurrent Neural Network Expected Performance Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'es Camero, Enrique Alba, Jamal Toutouh","submitted_at":"2018-05-18T12:00:09Z","abstract_excerpt":"Recurrent neural networks are a powerful tool, but they are very sensitive to their hyper-parameter configuration. Moreover, training properly a recurrent neural network is a tough task, therefore selecting an appropriate configuration is critical. Varied strategies have been proposed to tackle this issue. However, most of them are still impractical because of the time/resources needed. In this study, we propose a low computational cost model to evaluate the expected performance of a given architecture based on the distribution of the error of random samples of the weights. We empirically vali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07159","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":""},"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":"1805.07159","created_at":"2026-05-17T23:51:39.614965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07159v2","created_at":"2026-05-17T23:51:39.614965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07159","created_at":"2026-05-17T23:51:39.614965+00:00"},{"alias_kind":"pith_short_12","alias_value":"IAD3HLDY3UHA","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IAD3HLDY3UHAZGRQ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IAD3HLDY","created_at":"2026-05-18T12:32:28.185984+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/IAD3HLDY3UHAZGRQZBT6GV5ALO","json":"https://pith.science/pith/IAD3HLDY3UHAZGRQZBT6GV5ALO.json","graph_json":"https://pith.science/api/pith-number/IAD3HLDY3UHAZGRQZBT6GV5ALO/graph.json","events_json":"https://pith.science/api/pith-number/IAD3HLDY3UHAZGRQZBT6GV5ALO/events.json","paper":"https://pith.science/paper/IAD3HLDY"},"agent_actions":{"view_html":"https://pith.science/pith/IAD3HLDY3UHAZGRQZBT6GV5ALO","download_json":"https://pith.science/pith/IAD3HLDY3UHAZGRQZBT6GV5ALO.json","view_paper":"https://pith.science/paper/IAD3HLDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07159&json=true","fetch_graph":"https://pith.science/api/pith-number/IAD3HLDY3UHAZGRQZBT6GV5ALO/graph.json","fetch_events":"https://pith.science/api/pith-number/IAD3HLDY3UHAZGRQZBT6GV5ALO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IAD3HLDY3UHAZGRQZBT6GV5ALO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IAD3HLDY3UHAZGRQZBT6GV5ALO/action/storage_attestation","attest_author":"https://pith.science/pith/IAD3HLDY3UHAZGRQZBT6GV5ALO/action/author_attestation","sign_citation":"https://pith.science/pith/IAD3HLDY3UHAZGRQZBT6GV5ALO/action/citation_signature","submit_replication":"https://pith.science/pith/IAD3HLDY3UHAZGRQZBT6GV5ALO/action/replication_record"}},"created_at":"2026-05-17T23:51:39.614965+00:00","updated_at":"2026-05-17T23:51:39.614965+00:00"}