{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:INENRSKFVTQCR2TJJ6EIZIVNI6","short_pith_number":"pith:INENRSKF","canonical_record":{"source":{"id":"1611.09913","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T22:13:20Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"95dd65f04e810b48ecd6fab1ab5d7c9517d0e19811cbd3eec100f190b140e406","abstract_canon_sha256":"e33da77249fc5962cec81fa27ee6d7a97fa317296590d4a4ee602eee00ef7c9d"},"schema_version":"1.0"},"canonical_sha256":"4348d8c945ace028ea694f888ca2ad478e119f24c186769efea2b9acccd2dbe9","source":{"kind":"arxiv","id":"1611.09913","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09913","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09913v3","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09913","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"pith_short_12","alias_value":"INENRSKFVTQC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"INENRSKFVTQCR2TJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"INENRSKF","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:INENRSKFVTQCR2TJJ6EIZIVNI6","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09913","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T22:13:20Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"95dd65f04e810b48ecd6fab1ab5d7c9517d0e19811cbd3eec100f190b140e406","abstract_canon_sha256":"e33da77249fc5962cec81fa27ee6d7a97fa317296590d4a4ee602eee00ef7c9d"},"schema_version":"1.0"},"canonical_sha256":"4348d8c945ace028ea694f888ca2ad478e119f24c186769efea2b9acccd2dbe9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:36.379638Z","signature_b64":"ExKaKF5eUqfosKQX7xSSCUkSjDmLl0+IxE1pxr21XqMIE7yoIQmrV1nhRVPgW36H1Gh2NjE3mzD46zWzeojoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4348d8c945ace028ea694f888ca2ad478e119f24c186769efea2b9acccd2dbe9","last_reissued_at":"2026-05-18T00:49:36.379097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:36.379097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09913","source_version":3,"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-18T00:49:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFjWoXwQaUMamy3n4UZb3tuO6mBD+Rowfg602Qazsyw6LfQhmvV2OvRTXm5czskSogewKec6SBGh2Y5OYfv3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:59:17.405797Z"},"content_sha256":"ed3a38e9af74d0a688073450f36bb22ea9fca85c8911c50c90f0543b5766371b","schema_version":"1.0","event_id":"sha256:ed3a38e9af74d0a688073450f36bb22ea9fca85c8911c50c90f0543b5766371b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:INENRSKFVTQCR2TJJ6EIZIVNI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity and Trainability in Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"David Sussillo, Jascha Sohl-Dickstein, Jasmine Collins","submitted_at":"2016-11-29T22:13:20Z","abstract_excerpt":"Two potential bottlenecks on the expressiveness of recurrent neural networks (RNNs) are their ability to store information about the task in their parameters, and to store information about the input history in their units. We show experimentally that all common RNN architectures achieve nearly the same per-task and per-unit capacity bounds with careful training, for a variety of tasks and stacking depths. They can store an amount of task information which is linear in the number of parameters, and is approximately 5 bits per parameter. They can additionally store approximately one real number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09913","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"},"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-18T00:49:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjMnoPlhc7VKMCOIEoOCDSAeUFaD0PwijL/3og0cFXMMmeVaY9Bh+tmyXK0BMt7rxM0RFvPXvUDh1tuPOiGGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:59:17.406503Z"},"content_sha256":"6ac352a62a65953beebaafe92a8b31308ad07031c66c5759cf43b0afef5980ba","schema_version":"1.0","event_id":"sha256:6ac352a62a65953beebaafe92a8b31308ad07031c66c5759cf43b0afef5980ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INENRSKFVTQCR2TJJ6EIZIVNI6/bundle.json","state_url":"https://pith.science/pith/INENRSKFVTQCR2TJJ6EIZIVNI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INENRSKFVTQCR2TJJ6EIZIVNI6/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-28T19:59:17Z","links":{"resolver":"https://pith.science/pith/INENRSKFVTQCR2TJJ6EIZIVNI6","bundle":"https://pith.science/pith/INENRSKFVTQCR2TJJ6EIZIVNI6/bundle.json","state":"https://pith.science/pith/INENRSKFVTQCR2TJJ6EIZIVNI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INENRSKFVTQCR2TJJ6EIZIVNI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:INENRSKFVTQCR2TJJ6EIZIVNI6","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":"e33da77249fc5962cec81fa27ee6d7a97fa317296590d4a4ee602eee00ef7c9d","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T22:13:20Z","title_canon_sha256":"95dd65f04e810b48ecd6fab1ab5d7c9517d0e19811cbd3eec100f190b140e406"},"schema_version":"1.0","source":{"id":"1611.09913","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09913","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09913v3","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09913","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"pith_short_12","alias_value":"INENRSKFVTQC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"INENRSKFVTQCR2TJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"INENRSKF","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:6ac352a62a65953beebaafe92a8b31308ad07031c66c5759cf43b0afef5980ba","target":"graph","created_at":"2026-05-18T00:49:36Z","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":"Two potential bottlenecks on the expressiveness of recurrent neural networks (RNNs) are their ability to store information about the task in their parameters, and to store information about the input history in their units. We show experimentally that all common RNN architectures achieve nearly the same per-task and per-unit capacity bounds with careful training, for a variety of tasks and stacking depths. They can store an amount of task information which is linear in the number of parameters, and is approximately 5 bits per parameter. They can additionally store approximately one real number","authors_text":"David Sussillo, Jascha Sohl-Dickstein, Jasmine Collins","cross_cats":["cs.AI","cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T22:13:20Z","title":"Capacity and Trainability in Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09913","kind":"arxiv","version":3},"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:ed3a38e9af74d0a688073450f36bb22ea9fca85c8911c50c90f0543b5766371b","target":"record","created_at":"2026-05-18T00:49:36Z","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":"e33da77249fc5962cec81fa27ee6d7a97fa317296590d4a4ee602eee00ef7c9d","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T22:13:20Z","title_canon_sha256":"95dd65f04e810b48ecd6fab1ab5d7c9517d0e19811cbd3eec100f190b140e406"},"schema_version":"1.0","source":{"id":"1611.09913","kind":"arxiv","version":3}},"canonical_sha256":"4348d8c945ace028ea694f888ca2ad478e119f24c186769efea2b9acccd2dbe9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4348d8c945ace028ea694f888ca2ad478e119f24c186769efea2b9acccd2dbe9","first_computed_at":"2026-05-18T00:49:36.379097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:36.379097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ExKaKF5eUqfosKQX7xSSCUkSjDmLl0+IxE1pxr21XqMIE7yoIQmrV1nhRVPgW36H1Gh2NjE3mzD46zWzeojoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:36.379638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09913","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed3a38e9af74d0a688073450f36bb22ea9fca85c8911c50c90f0543b5766371b","sha256:6ac352a62a65953beebaafe92a8b31308ad07031c66c5759cf43b0afef5980ba"],"state_sha256":"52e02f252faa26ef152e011e3bbd8e078a4daed3795a08289381418faaae1e70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LMk4sCit3NFwXFQN2GqwOyKo9n1esGQSWlsxnLYaqJ3PEOsDgjNWrqdrT5WsTF+0X3abP2f8rErTAY2X8OhZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:59:17.410761Z","bundle_sha256":"d8e0e6b4be002f3b3899ac60b0d56d6c5126ae64be67151cfdf8320db03f3c0b"}}