{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2YIIXPCXLBIBNTQ5CIPCDZ43EA","short_pith_number":"pith:2YIIXPCX","canonical_record":{"source":{"id":"1604.06929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-23T17:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"a2a9f77a706adf57fe407fb47867a6b84122ac9022c99cf32e0e7a92a02e3fb5","abstract_canon_sha256":"2b059cff1a5df198d2c104ec704086fc6df610baab41f6c3440dc616f27a5499"},"schema_version":"1.0"},"canonical_sha256":"d6108bbc57585016ce1d121e21e79b201511833249963038083b8333a63d0e55","source":{"kind":"arxiv","id":"1604.06929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06929","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06929v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06929","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"2YIIXPCXLBIB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YIIXPCXLBIBNTQ5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YIIXPCX","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2YIIXPCXLBIBNTQ5CIPCDZ43EA","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-23T17:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"a2a9f77a706adf57fe407fb47867a6b84122ac9022c99cf32e0e7a92a02e3fb5","abstract_canon_sha256":"2b059cff1a5df198d2c104ec704086fc6df610baab41f6c3440dc616f27a5499"},"schema_version":"1.0"},"canonical_sha256":"d6108bbc57585016ce1d121e21e79b201511833249963038083b8333a63d0e55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.563651Z","signature_b64":"rvLtybnqPzkhCMV03WnAQmKNArflyB/oO1kjWU6zREjQcP5AtsksbVYtex87iKbv02voHj96mBIJOdnE0yAyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6108bbc57585016ce1d121e21e79b201511833249963038083b8333a63d0e55","last_reissued_at":"2026-05-18T01:16:23.563075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.563075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06929","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-05-18T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBtV5BlTLDqcrw6I7uhSBDSVG+1CY5RSAZ774Mz8wyWyI+ePrXamezsXvRsb4r+Fxb88xPcTv6kqFCJpmvKiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:35:03.179880Z"},"content_sha256":"3d01f76065d86aeacb9adb0b7512fadcf710e0e3795aa3dcfc56fc0066a328af","schema_version":"1.0","event_id":"sha256:3d01f76065d86aeacb9adb0b7512fadcf710e0e3795aa3dcfc56fc0066a328af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2YIIXPCXLBIBNTQ5CIPCDZ43EA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory and Information Processing in Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Alireza Goudarzi, Christof Teuscher, Darko Stefanovic, Guy Feldman, Peter Banda, Sarah Marzen","submitted_at":"2016-04-23T17:36:12Z","abstract_excerpt":"Recurrent neural networks (RNN) are simple dynamical systems whose computational power has been attributed to their short-term memory. Short-term memory of RNNs has been previously studied analytically only for the case of orthogonal networks, and only under annealed approximation, and uncorrelated input. Here for the first time, we present an exact solution to the memory capacity and the task-solving performance as a function of the structure of a given network instance, enabling direct determination of the function--structure relation in RNNs. We calculate the memory capacity for arbitrary n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06929","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"},"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-05-18T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SG7u4ce72sfhZVkavOGJKJbGBXjjgnohj/vaFHW2sLivIUn0D2MnQuyP9uIEFPouzGJMIXj4WUulzKceq2F8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:35:03.180609Z"},"content_sha256":"fc4819f4cba62cfcc3c4f666abf7e8fcfcd2feb1b1d823c740e0554217fe53de","schema_version":"1.0","event_id":"sha256:fc4819f4cba62cfcc3c4f666abf7e8fcfcd2feb1b1d823c740e0554217fe53de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YIIXPCXLBIBNTQ5CIPCDZ43EA/bundle.json","state_url":"https://pith.science/pith/2YIIXPCXLBIBNTQ5CIPCDZ43EA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YIIXPCXLBIBNTQ5CIPCDZ43EA/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-05-25T16:35:03Z","links":{"resolver":"https://pith.science/pith/2YIIXPCXLBIBNTQ5CIPCDZ43EA","bundle":"https://pith.science/pith/2YIIXPCXLBIBNTQ5CIPCDZ43EA/bundle.json","state":"https://pith.science/pith/2YIIXPCXLBIBNTQ5CIPCDZ43EA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YIIXPCXLBIBNTQ5CIPCDZ43EA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2YIIXPCXLBIBNTQ5CIPCDZ43EA","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":"2b059cff1a5df198d2c104ec704086fc6df610baab41f6c3440dc616f27a5499","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-23T17:36:12Z","title_canon_sha256":"a2a9f77a706adf57fe407fb47867a6b84122ac9022c99cf32e0e7a92a02e3fb5"},"schema_version":"1.0","source":{"id":"1604.06929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06929","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06929v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06929","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"2YIIXPCXLBIB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YIIXPCXLBIBNTQ5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YIIXPCX","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:fc4819f4cba62cfcc3c4f666abf7e8fcfcd2feb1b1d823c740e0554217fe53de","target":"graph","created_at":"2026-05-18T01:16:23Z","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"},"paper":{"abstract_excerpt":"Recurrent neural networks (RNN) are simple dynamical systems whose computational power has been attributed to their short-term memory. Short-term memory of RNNs has been previously studied analytically only for the case of orthogonal networks, and only under annealed approximation, and uncorrelated input. Here for the first time, we present an exact solution to the memory capacity and the task-solving performance as a function of the structure of a given network instance, enabling direct determination of the function--structure relation in RNNs. We calculate the memory capacity for arbitrary n","authors_text":"Alireza Goudarzi, Christof Teuscher, Darko Stefanovic, Guy Feldman, Peter Banda, Sarah Marzen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-23T17:36:12Z","title":"Memory and Information Processing in Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06929","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:3d01f76065d86aeacb9adb0b7512fadcf710e0e3795aa3dcfc56fc0066a328af","target":"record","created_at":"2026-05-18T01:16:23Z","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":"2b059cff1a5df198d2c104ec704086fc6df610baab41f6c3440dc616f27a5499","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-23T17:36:12Z","title_canon_sha256":"a2a9f77a706adf57fe407fb47867a6b84122ac9022c99cf32e0e7a92a02e3fb5"},"schema_version":"1.0","source":{"id":"1604.06929","kind":"arxiv","version":1}},"canonical_sha256":"d6108bbc57585016ce1d121e21e79b201511833249963038083b8333a63d0e55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6108bbc57585016ce1d121e21e79b201511833249963038083b8333a63d0e55","first_computed_at":"2026-05-18T01:16:23.563075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:23.563075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rvLtybnqPzkhCMV03WnAQmKNArflyB/oO1kjWU6zREjQcP5AtsksbVYtex87iKbv02voHj96mBIJOdnE0yAyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:23.563651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d01f76065d86aeacb9adb0b7512fadcf710e0e3795aa3dcfc56fc0066a328af","sha256:fc4819f4cba62cfcc3c4f666abf7e8fcfcd2feb1b1d823c740e0554217fe53de"],"state_sha256":"ae7d5b9048e6d958cd24879572fb748b86b282d6ab28939288498cad5a897903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVNmy4IV1oJcA8KlWax9bmCwjacggqoALW2hPurd1aM5eR1oiZRP6nb/uFFopYxGim58pbmLqz/9x3K1UUs/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:35:03.184559Z","bundle_sha256":"cc4ad32700a619f0196cc8045db98c70f5d65bc74b2e28966ab81252a77930b1"}}