{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:BVM6OJC3BPLYCFJQHJPVVSTB2E","short_pith_number":"pith:BVM6OJC3","canonical_record":{"source":{"id":"2006.02957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-04T15:38:17Z","cross_cats_sorted":["cs.NE","math.DS","stat.ML"],"title_canon_sha256":"840a53ae340cd7caba0c33330c6e292d7adf8961fcde67c61e9f0b80e5884166","abstract_canon_sha256":"fa162731703a4acfaee919c83f3ac8b3fe9f4bd46130b30aaba78c6481780c9f"},"schema_version":"1.0"},"canonical_sha256":"0d59e7245b0bd78115303a5f5aca61d1210bb9860bd2ccb0a7b0aa8c9aa1c864","source":{"kind":"arxiv","id":"2006.02957","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.02957","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"arxiv_version","alias_value":"2006.02957v1","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.02957","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"pith_short_12","alias_value":"BVM6OJC3BPLY","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"pith_short_16","alias_value":"BVM6OJC3BPLYCFJQ","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"pith_short_8","alias_value":"BVM6OJC3","created_at":"2026-07-05T01:08:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:BVM6OJC3BPLYCFJQHJPVVSTB2E","target":"record","payload":{"canonical_record":{"source":{"id":"2006.02957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-04T15:38:17Z","cross_cats_sorted":["cs.NE","math.DS","stat.ML"],"title_canon_sha256":"840a53ae340cd7caba0c33330c6e292d7adf8961fcde67c61e9f0b80e5884166","abstract_canon_sha256":"fa162731703a4acfaee919c83f3ac8b3fe9f4bd46130b30aaba78c6481780c9f"},"schema_version":"1.0"},"canonical_sha256":"0d59e7245b0bd78115303a5f5aca61d1210bb9860bd2ccb0a7b0aa8c9aa1c864","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:01.978157Z","signature_b64":"RAV1USEfB9Hp14mY3bN4OloUdAdrSkaVc8rEaeRTxZ9YqIn3RKZCVSxcmvXMmJZpTAmq5ue/eSFXpL3dlBCbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d59e7245b0bd78115303a5f5aca61d1210bb9860bd2ccb0a7b0aa8c9aa1c864","last_reissued_at":"2026-07-05T01:08:01.977673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:01.977673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.02957","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:08:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHo5xehapvykowGjO7AzMAjFRgRGs8ktY4wGtTLNBm6iEJAx3Vpe+ur6jaXhRUIDorBXgOuyxIrx19LSvmhhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:31:11.838924Z"},"content_sha256":"36341fa7a8c4213c16cd5f5cc56c01a679116d58f0cd7078446952d07300a655","schema_version":"1.0","event_id":"sha256:36341fa7a8c4213c16cd5f5cc56c01a679116d58f0cd7078446952d07300a655"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:BVM6OJC3BPLYCFJQHJPVVSTB2E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity in Reservoir Computing Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Claudio Gallicchio","submitted_at":"2020-06-04T15:38:17Z","abstract_excerpt":"Reservoir Computing (RC) is a well-known strategy for designing Recurrent Neural Networks featured by striking efficiency of training. The crucial aspect of RC is to properly instantiate the hidden recurrent layer that serves as dynamical memory to the system. In this respect, the common recipe is to create a pool of randomly and sparsely connected recurrent neurons. While the aspect of sparsity in the design of RC systems has been debated in the literature, it is nowadays understood mainly as a way to enhance the efficiency of computation, exploiting sparse matrix operations. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.02957","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.02957/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:08:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugoJ1zv3vFovlFe1jMxhOoR0ZUGTgNihYirytWLEyHbV+P6LBvbOYJvxaXIG4rp1u+qYu9KtpyAaJUbZiX2UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:31:11.839295Z"},"content_sha256":"1ea796f2a25b0e68c7bf9d7336b16dbd0aa927daac534bae600e3143f347cfea","schema_version":"1.0","event_id":"sha256:1ea796f2a25b0e68c7bf9d7336b16dbd0aa927daac534bae600e3143f347cfea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVM6OJC3BPLYCFJQHJPVVSTB2E/bundle.json","state_url":"https://pith.science/pith/BVM6OJC3BPLYCFJQHJPVVSTB2E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVM6OJC3BPLYCFJQHJPVVSTB2E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T12:31:11Z","links":{"resolver":"https://pith.science/pith/BVM6OJC3BPLYCFJQHJPVVSTB2E","bundle":"https://pith.science/pith/BVM6OJC3BPLYCFJQHJPVVSTB2E/bundle.json","state":"https://pith.science/pith/BVM6OJC3BPLYCFJQHJPVVSTB2E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVM6OJC3BPLYCFJQHJPVVSTB2E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:BVM6OJC3BPLYCFJQHJPVVSTB2E","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fa162731703a4acfaee919c83f3ac8b3fe9f4bd46130b30aaba78c6481780c9f","cross_cats_sorted":["cs.NE","math.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-04T15:38:17Z","title_canon_sha256":"840a53ae340cd7caba0c33330c6e292d7adf8961fcde67c61e9f0b80e5884166"},"schema_version":"1.0","source":{"id":"2006.02957","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.02957","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"arxiv_version","alias_value":"2006.02957v1","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.02957","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"pith_short_12","alias_value":"BVM6OJC3BPLY","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"pith_short_16","alias_value":"BVM6OJC3BPLYCFJQ","created_at":"2026-07-05T01:08:01Z"},{"alias_kind":"pith_short_8","alias_value":"BVM6OJC3","created_at":"2026-07-05T01:08:01Z"}],"graph_snapshots":[{"event_id":"sha256:1ea796f2a25b0e68c7bf9d7336b16dbd0aa927daac534bae600e3143f347cfea","target":"graph","created_at":"2026-07-05T01:08:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.02957/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reservoir Computing (RC) is a well-known strategy for designing Recurrent Neural Networks featured by striking efficiency of training. The crucial aspect of RC is to properly instantiate the hidden recurrent layer that serves as dynamical memory to the system. In this respect, the common recipe is to create a pool of randomly and sparsely connected recurrent neurons. While the aspect of sparsity in the design of RC systems has been debated in the literature, it is nowadays understood mainly as a way to enhance the efficiency of computation, exploiting sparse matrix operations. In this paper, w","authors_text":"Claudio Gallicchio","cross_cats":["cs.NE","math.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-04T15:38:17Z","title":"Sparsity in Reservoir Computing Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.02957","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:36341fa7a8c4213c16cd5f5cc56c01a679116d58f0cd7078446952d07300a655","target":"record","created_at":"2026-07-05T01:08:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fa162731703a4acfaee919c83f3ac8b3fe9f4bd46130b30aaba78c6481780c9f","cross_cats_sorted":["cs.NE","math.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-04T15:38:17Z","title_canon_sha256":"840a53ae340cd7caba0c33330c6e292d7adf8961fcde67c61e9f0b80e5884166"},"schema_version":"1.0","source":{"id":"2006.02957","kind":"arxiv","version":1}},"canonical_sha256":"0d59e7245b0bd78115303a5f5aca61d1210bb9860bd2ccb0a7b0aa8c9aa1c864","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d59e7245b0bd78115303a5f5aca61d1210bb9860bd2ccb0a7b0aa8c9aa1c864","first_computed_at":"2026-07-05T01:08:01.977673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:08:01.977673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RAV1USEfB9Hp14mY3bN4OloUdAdrSkaVc8rEaeRTxZ9YqIn3RKZCVSxcmvXMmJZpTAmq5ue/eSFXpL3dlBCbBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:08:01.978157Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.02957","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36341fa7a8c4213c16cd5f5cc56c01a679116d58f0cd7078446952d07300a655","sha256:1ea796f2a25b0e68c7bf9d7336b16dbd0aa927daac534bae600e3143f347cfea"],"state_sha256":"85ffe22f98cf776963b27c2ae9781afc1994dd6145e265bd256e630b7dc9b99b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUrZAzV6H1hBCzejy+ZaEwFlBZnpJ1LX83W/y9otFmLAYRHkleK89Uq1M7gFeR+dALbuaEeSN8YeiNhMa/TADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:31:11.841162Z","bundle_sha256":"c4f587018b770e9b664808e1963c46d1c14b1e0ef7ed4b39e1ccd8fa18d200fa"}}