{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BLGWF5ZYIBZCQS57DZUUVRIF2Y","short_pith_number":"pith:BLGWF5ZY","canonical_record":{"source":{"id":"2412.13093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-17T17:02:06Z","cross_cats_sorted":[],"title_canon_sha256":"dd99f91aed612f36e806859a768f4c4021acc6ed6a4d29896629aa649af7ba2c","abstract_canon_sha256":"9fad1bebca654e8e5f2c8b25f38b4eb55a7dba854410a962033bd67628136956"},"schema_version":"1.0"},"canonical_sha256":"0acd62f7384072284bbf1e694ac505d6070510e08a1eb1037df945f18e0907d8","source":{"kind":"arxiv","id":"2412.13093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13093","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13093v1","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13093","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"BLGWF5ZYIBZC","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_16","alias_value":"BLGWF5ZYIBZCQS57","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_8","alias_value":"BLGWF5ZY","created_at":"2026-07-05T09:50:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BLGWF5ZYIBZCQS57DZUUVRIF2Y","target":"record","payload":{"canonical_record":{"source":{"id":"2412.13093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-17T17:02:06Z","cross_cats_sorted":[],"title_canon_sha256":"dd99f91aed612f36e806859a768f4c4021acc6ed6a4d29896629aa649af7ba2c","abstract_canon_sha256":"9fad1bebca654e8e5f2c8b25f38b4eb55a7dba854410a962033bd67628136956"},"schema_version":"1.0"},"canonical_sha256":"0acd62f7384072284bbf1e694ac505d6070510e08a1eb1037df945f18e0907d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:40.112585Z","signature_b64":"Imt8GTCR93pY0Va8Na91hcBWXfzBrYw0obSVDHDcQaCgpqruHIcXwAOofQhPOUUPKZiwjXJqC+qDqHYCZNquAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0acd62f7384072284bbf1e694ac505d6070510e08a1eb1037df945f18e0907d8","last_reissued_at":"2026-07-05T09:50:40.112120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:40.112120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.13093","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-05T09:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDX3Wd7lD9dvFlAmpJRC1Prgws6h/0LprBKrQ/DbrALYtpWQQ972Ows0+jVdZnci/ejZpubsgvImw872O+o0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T03:16:06.883673Z"},"content_sha256":"af14ce72e3152be97ed6d9fb1e3f8de23bd4499350cc76b63180aea609fb7334","schema_version":"1.0","event_id":"sha256:af14ce72e3152be97ed6d9fb1e3f8de23bd4499350cc76b63180aea609fb7334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BLGWF5ZYIBZCQS57DZUUVRIF2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reservoir Computing for Fast, Simplified Reinforcement Learning on Memory Tasks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kevin McKee","submitted_at":"2024-12-17T17:02:06Z","abstract_excerpt":"Tasks in which rewards depend upon past information not available in the current observation set can only be solved by agents that are equipped with short-term memory. Usual choices for memory modules include trainable recurrent hidden layers, often with gated memory. Reservoir computing presents an alternative, in which a recurrent layer is not trained, but rather has a set of fixed, sparse recurrent weights. The weights are scaled to produce stable dynamical behavior such that the reservoir state contains a high-dimensional, nonlinear impulse response function of the inputs. An output decode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13093","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/2412.13093/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-05T09:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OC2XSD46fk1vXer57EQ6384xHmZcGyXkW0ObKA9B9UVLQyCunPilMTHhRCiOSwO49Gmf3VvgQLyimAaPM11CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T03:16:06.884183Z"},"content_sha256":"acfa967429ad5094b51a97ba9646740b547e468cc874bdc0fc2ac8078267a638","schema_version":"1.0","event_id":"sha256:acfa967429ad5094b51a97ba9646740b547e468cc874bdc0fc2ac8078267a638"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLGWF5ZYIBZCQS57DZUUVRIF2Y/bundle.json","state_url":"https://pith.science/pith/BLGWF5ZYIBZCQS57DZUUVRIF2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLGWF5ZYIBZCQS57DZUUVRIF2Y/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-08-23T03:16:06Z","links":{"resolver":"https://pith.science/pith/BLGWF5ZYIBZCQS57DZUUVRIF2Y","bundle":"https://pith.science/pith/BLGWF5ZYIBZCQS57DZUUVRIF2Y/bundle.json","state":"https://pith.science/pith/BLGWF5ZYIBZCQS57DZUUVRIF2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLGWF5ZYIBZCQS57DZUUVRIF2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BLGWF5ZYIBZCQS57DZUUVRIF2Y","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":"9fad1bebca654e8e5f2c8b25f38b4eb55a7dba854410a962033bd67628136956","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-17T17:02:06Z","title_canon_sha256":"dd99f91aed612f36e806859a768f4c4021acc6ed6a4d29896629aa649af7ba2c"},"schema_version":"1.0","source":{"id":"2412.13093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13093","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13093v1","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13093","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"BLGWF5ZYIBZC","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_16","alias_value":"BLGWF5ZYIBZCQS57","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_8","alias_value":"BLGWF5ZY","created_at":"2026-07-05T09:50:40Z"}],"graph_snapshots":[{"event_id":"sha256:acfa967429ad5094b51a97ba9646740b547e468cc874bdc0fc2ac8078267a638","target":"graph","created_at":"2026-07-05T09:50:40Z","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/2412.13093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Tasks in which rewards depend upon past information not available in the current observation set can only be solved by agents that are equipped with short-term memory. Usual choices for memory modules include trainable recurrent hidden layers, often with gated memory. Reservoir computing presents an alternative, in which a recurrent layer is not trained, but rather has a set of fixed, sparse recurrent weights. The weights are scaled to produce stable dynamical behavior such that the reservoir state contains a high-dimensional, nonlinear impulse response function of the inputs. An output decode","authors_text":"Kevin McKee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-17T17:02:06Z","title":"Reservoir Computing for Fast, Simplified Reinforcement Learning on Memory Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13093","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:af14ce72e3152be97ed6d9fb1e3f8de23bd4499350cc76b63180aea609fb7334","target":"record","created_at":"2026-07-05T09:50:40Z","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":"9fad1bebca654e8e5f2c8b25f38b4eb55a7dba854410a962033bd67628136956","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-17T17:02:06Z","title_canon_sha256":"dd99f91aed612f36e806859a768f4c4021acc6ed6a4d29896629aa649af7ba2c"},"schema_version":"1.0","source":{"id":"2412.13093","kind":"arxiv","version":1}},"canonical_sha256":"0acd62f7384072284bbf1e694ac505d6070510e08a1eb1037df945f18e0907d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0acd62f7384072284bbf1e694ac505d6070510e08a1eb1037df945f18e0907d8","first_computed_at":"2026-07-05T09:50:40.112120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:40.112120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Imt8GTCR93pY0Va8Na91hcBWXfzBrYw0obSVDHDcQaCgpqruHIcXwAOofQhPOUUPKZiwjXJqC+qDqHYCZNquAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:40.112585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.13093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af14ce72e3152be97ed6d9fb1e3f8de23bd4499350cc76b63180aea609fb7334","sha256:acfa967429ad5094b51a97ba9646740b547e468cc874bdc0fc2ac8078267a638"],"state_sha256":"30ba40df7e25b19c7d245520d3d76bc780ebdb2bcdff07ed1d6b8831b08dfa16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FYHkHlMKhGwhJ2OmwmRyeY1JiRpp+VvkkYBCq5yui/3eLmmWHtQK98HfbvGzCgABXbpAnp0deHesrwuQxUbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T03:16:06.889329Z","bundle_sha256":"dab08fca7913cda17cd53892eb64eb0c63d818633c818b902eb8a0cc74f01783"}}