{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SHP7VZ5XMAJNPTRP7223WDC2PD","short_pith_number":"pith:SHP7VZ5X","canonical_record":{"source":{"id":"1711.06788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T01:42:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"131a2b4292ec02cab0f8e4eebdee47d9047444f8ea717210cc2529a7f4e01942","abstract_canon_sha256":"3fd15d4c96c14a1650d3e122fb47a067efdf9821dfcc4ffd206ad51d2f82b4af"},"schema_version":"1.0"},"canonical_sha256":"91dffae7b76012d7ce2ffeb5bb0c5a78fba3f7316877dfaad1f268b00da969ae","source":{"kind":"arxiv","id":"1711.06788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06788","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06788v2","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06788","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"SHP7VZ5XMAJN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SHP7VZ5XMAJNPTRP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SHP7VZ5X","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SHP7VZ5XMAJNPTRP7223WDC2PD","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T01:42:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"131a2b4292ec02cab0f8e4eebdee47d9047444f8ea717210cc2529a7f4e01942","abstract_canon_sha256":"3fd15d4c96c14a1650d3e122fb47a067efdf9821dfcc4ffd206ad51d2f82b4af"},"schema_version":"1.0"},"canonical_sha256":"91dffae7b76012d7ce2ffeb5bb0c5a78fba3f7316877dfaad1f268b00da969ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:48.609128Z","signature_b64":"KfxRhrB23IjiB4jSEM7iI1qrdcSCasMRqUKEzdFSH+3RWJLYk92sJ/TFCBj4MyAm5OxJV4v4eHMSwoK+AjLRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91dffae7b76012d7ce2ffeb5bb0c5a78fba3f7316877dfaad1f268b00da969ae","last_reissued_at":"2026-05-18T00:12:48.608383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:48.608383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06788","source_version":2,"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:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ez0S/ajC3Fw5GWAZNBHDTQK+0h4wMeo9ELDolYdIg75vFO2J3d6dPU510w9vyyTPpiB0IJJBOQs52mZ/UKz1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:51:36.938134Z"},"content_sha256":"10c87eadb0d288a60699f5f34ae5a4be97474d5c4dc25425371b7487eb0be36a","schema_version":"1.0","event_id":"sha256:10c87eadb0d288a60699f5f34ae5a4be97474d5c4dc25425371b7487eb0be36a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SHP7VZ5XMAJNPTRP7223WDC2PD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MinimalRNN: Toward More Interpretable and Trainable Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Minmin Chen","submitted_at":"2017-11-18T01:42:04Z","abstract_excerpt":"We introduce MinimalRNN, a new recurrent neural network architecture that achieves comparable performance as the popular gated RNNs with a simplified structure. It employs minimal updates within RNN, which not only leads to efficient learning and testing but more importantly better interpretability and trainability. We demonstrate that by endorsing the more restrictive update rule, MinimalRNN learns disentangled RNN states. We further examine the learning dynamics of different RNN structures using input-output Jacobians, and show that MinimalRNN is able to capture longer range dependencies tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06788","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"},"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:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vQbbNWzr1KGn8g3y3UtPmLzmwNboFfgQtdXLyGu69rmcpACJiW2qHQdVxnYxlznTDjRsZLuTJUddhhNKnb1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:51:36.938796Z"},"content_sha256":"3d163b730a4cf450d4d2538415e41bc3eecda371e108becf6fdeb4b98e2eaba6","schema_version":"1.0","event_id":"sha256:3d163b730a4cf450d4d2538415e41bc3eecda371e108becf6fdeb4b98e2eaba6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHP7VZ5XMAJNPTRP7223WDC2PD/bundle.json","state_url":"https://pith.science/pith/SHP7VZ5XMAJNPTRP7223WDC2PD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHP7VZ5XMAJNPTRP7223WDC2PD/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-25T18:51:36Z","links":{"resolver":"https://pith.science/pith/SHP7VZ5XMAJNPTRP7223WDC2PD","bundle":"https://pith.science/pith/SHP7VZ5XMAJNPTRP7223WDC2PD/bundle.json","state":"https://pith.science/pith/SHP7VZ5XMAJNPTRP7223WDC2PD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHP7VZ5XMAJNPTRP7223WDC2PD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SHP7VZ5XMAJNPTRP7223WDC2PD","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":"3fd15d4c96c14a1650d3e122fb47a067efdf9821dfcc4ffd206ad51d2f82b4af","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T01:42:04Z","title_canon_sha256":"131a2b4292ec02cab0f8e4eebdee47d9047444f8ea717210cc2529a7f4e01942"},"schema_version":"1.0","source":{"id":"1711.06788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06788","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06788v2","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06788","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"SHP7VZ5XMAJN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SHP7VZ5XMAJNPTRP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SHP7VZ5X","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:3d163b730a4cf450d4d2538415e41bc3eecda371e108becf6fdeb4b98e2eaba6","target":"graph","created_at":"2026-05-18T00:12:48Z","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":"We introduce MinimalRNN, a new recurrent neural network architecture that achieves comparable performance as the popular gated RNNs with a simplified structure. It employs minimal updates within RNN, which not only leads to efficient learning and testing but more importantly better interpretability and trainability. We demonstrate that by endorsing the more restrictive update rule, MinimalRNN learns disentangled RNN states. We further examine the learning dynamics of different RNN structures using input-output Jacobians, and show that MinimalRNN is able to capture longer range dependencies tha","authors_text":"Minmin Chen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T01:42:04Z","title":"MinimalRNN: Toward More Interpretable and Trainable Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06788","kind":"arxiv","version":2},"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:10c87eadb0d288a60699f5f34ae5a4be97474d5c4dc25425371b7487eb0be36a","target":"record","created_at":"2026-05-18T00:12:48Z","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":"3fd15d4c96c14a1650d3e122fb47a067efdf9821dfcc4ffd206ad51d2f82b4af","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T01:42:04Z","title_canon_sha256":"131a2b4292ec02cab0f8e4eebdee47d9047444f8ea717210cc2529a7f4e01942"},"schema_version":"1.0","source":{"id":"1711.06788","kind":"arxiv","version":2}},"canonical_sha256":"91dffae7b76012d7ce2ffeb5bb0c5a78fba3f7316877dfaad1f268b00da969ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91dffae7b76012d7ce2ffeb5bb0c5a78fba3f7316877dfaad1f268b00da969ae","first_computed_at":"2026-05-18T00:12:48.608383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:48.608383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KfxRhrB23IjiB4jSEM7iI1qrdcSCasMRqUKEzdFSH+3RWJLYk92sJ/TFCBj4MyAm5OxJV4v4eHMSwoK+AjLRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:48.609128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10c87eadb0d288a60699f5f34ae5a4be97474d5c4dc25425371b7487eb0be36a","sha256:3d163b730a4cf450d4d2538415e41bc3eecda371e108becf6fdeb4b98e2eaba6"],"state_sha256":"673df0e2e4382f36794127582c856caeebb1d225b5738f684f7d517b1d2d6a11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FfzFzQRV29AslpoCeNQeLgNv90slsX0spDXbrTjOmt2jOy4shCoR6Um8CnWtESH1khwFKKEuvTZsX1e7YkgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:51:36.943210Z","bundle_sha256":"1bbd62c2a1f37fe9e991810ffdd72be7916406d2391126708b347099ed760de0"}}