{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IL3MKIYFVWNGHNBRRKZIR2A6ZG","short_pith_number":"pith:IL3MKIYF","canonical_record":{"source":{"id":"1801.06105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-18T15:54:55Z","cross_cats_sorted":[],"title_canon_sha256":"16d00c103b4fc8e996d924b8d583cd20594b3bd8c4088ef421f5e95d11d709ba","abstract_canon_sha256":"00cb07b7960c59927474f5c1d8909a9659f626e9188bd85fc6754ed686686392"},"schema_version":"1.0"},"canonical_sha256":"42f6c52305ad9a63b4318ab288e81ec9a1c82b41743bdd300237d415645326d2","source":{"kind":"arxiv","id":"1801.06105","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06105","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06105v3","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06105","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"pith_short_12","alias_value":"IL3MKIYFVWNG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IL3MKIYFVWNGHNBR","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IL3MKIYF","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IL3MKIYFVWNGHNBRRKZIR2A6ZG","target":"record","payload":{"canonical_record":{"source":{"id":"1801.06105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-18T15:54:55Z","cross_cats_sorted":[],"title_canon_sha256":"16d00c103b4fc8e996d924b8d583cd20594b3bd8c4088ef421f5e95d11d709ba","abstract_canon_sha256":"00cb07b7960c59927474f5c1d8909a9659f626e9188bd85fc6754ed686686392"},"schema_version":"1.0"},"canonical_sha256":"42f6c52305ad9a63b4318ab288e81ec9a1c82b41743bdd300237d415645326d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:27.810379Z","signature_b64":"pfBCc+gy8+8RRlLL5xeC8RTfomXd/ijFtgIw6JD3Tdo4ThXA5nSbsuwHVjgU9fCxzAi/4/AzPDkKkGvpAIDECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42f6c52305ad9a63b4318ab288e81ec9a1c82b41743bdd300237d415645326d2","last_reissued_at":"2026-05-17T23:41:27.809704Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:27.809704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.06105","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-17T23:41:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oq+H8LTRBF/tqwCXR2dHKPdCwDeHJjugjPKqGKuHMAmzXzpJ9pdtNF5Qy0fU+Cm4DoRtzDNeWrmA0Jyabt0TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:10:18.883642Z"},"content_sha256":"0b0d6c8659aa28432d9ce727f1378fc1ea57c33c208ed496537e4fde8c4e87f9","schema_version":"1.0","event_id":"sha256:0b0d6c8659aa28432d9ce727f1378fc1ea57c33c208ed496537e4fde8c4e87f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IL3MKIYFVWNGHNBRRKZIR2A6ZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overcoming the vanishing gradient problem in plain recurrent networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Adrian Huber, Jithendar Anumula, Shih-Chii Liu, Yuhuang Hu","submitted_at":"2018-01-18T15:54:55Z","abstract_excerpt":"Plain recurrent networks greatly suffer from the vanishing gradient problem while Gated Neural Networks (GNNs) such as Long-short Term Memory (LSTM) and Gated Recurrent Unit (GRU) deliver promising results in many sequence learning tasks through sophisticated network designs. This paper shows how we can address this problem in a plain recurrent network by analyzing the gating mechanisms in GNNs. We propose a novel network called the Recurrent Identity Network (RIN) which allows a plain recurrent network to overcome the vanishing gradient problem while training very deep models without the use "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06105","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-17T23:41:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJF8n31rFG3f6ClDtEG8P/laAev3fP2+wTGC9zEGHbywJj3eFf28x3JW+98gsHzkV9PpQX0USUaVaDwmJXiEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:10:18.883996Z"},"content_sha256":"f86a4aca3cb5af96a810305c003e062b2add2f70727f1e3eb7431de070bdace5","schema_version":"1.0","event_id":"sha256:f86a4aca3cb5af96a810305c003e062b2add2f70727f1e3eb7431de070bdace5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IL3MKIYFVWNGHNBRRKZIR2A6ZG/bundle.json","state_url":"https://pith.science/pith/IL3MKIYFVWNGHNBRRKZIR2A6ZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IL3MKIYFVWNGHNBRRKZIR2A6ZG/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-06-01T10:10:18Z","links":{"resolver":"https://pith.science/pith/IL3MKIYFVWNGHNBRRKZIR2A6ZG","bundle":"https://pith.science/pith/IL3MKIYFVWNGHNBRRKZIR2A6ZG/bundle.json","state":"https://pith.science/pith/IL3MKIYFVWNGHNBRRKZIR2A6ZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IL3MKIYFVWNGHNBRRKZIR2A6ZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IL3MKIYFVWNGHNBRRKZIR2A6ZG","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":"00cb07b7960c59927474f5c1d8909a9659f626e9188bd85fc6754ed686686392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-18T15:54:55Z","title_canon_sha256":"16d00c103b4fc8e996d924b8d583cd20594b3bd8c4088ef421f5e95d11d709ba"},"schema_version":"1.0","source":{"id":"1801.06105","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06105","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06105v3","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06105","created_at":"2026-05-17T23:41:27Z"},{"alias_kind":"pith_short_12","alias_value":"IL3MKIYFVWNG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IL3MKIYFVWNGHNBR","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IL3MKIYF","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:f86a4aca3cb5af96a810305c003e062b2add2f70727f1e3eb7431de070bdace5","target":"graph","created_at":"2026-05-17T23:41:27Z","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":"Plain recurrent networks greatly suffer from the vanishing gradient problem while Gated Neural Networks (GNNs) such as Long-short Term Memory (LSTM) and Gated Recurrent Unit (GRU) deliver promising results in many sequence learning tasks through sophisticated network designs. This paper shows how we can address this problem in a plain recurrent network by analyzing the gating mechanisms in GNNs. We propose a novel network called the Recurrent Identity Network (RIN) which allows a plain recurrent network to overcome the vanishing gradient problem while training very deep models without the use ","authors_text":"Adrian Huber, Jithendar Anumula, Shih-Chii Liu, Yuhuang Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-18T15:54:55Z","title":"Overcoming the vanishing gradient problem in plain recurrent networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06105","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:0b0d6c8659aa28432d9ce727f1378fc1ea57c33c208ed496537e4fde8c4e87f9","target":"record","created_at":"2026-05-17T23:41:27Z","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":"00cb07b7960c59927474f5c1d8909a9659f626e9188bd85fc6754ed686686392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-01-18T15:54:55Z","title_canon_sha256":"16d00c103b4fc8e996d924b8d583cd20594b3bd8c4088ef421f5e95d11d709ba"},"schema_version":"1.0","source":{"id":"1801.06105","kind":"arxiv","version":3}},"canonical_sha256":"42f6c52305ad9a63b4318ab288e81ec9a1c82b41743bdd300237d415645326d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42f6c52305ad9a63b4318ab288e81ec9a1c82b41743bdd300237d415645326d2","first_computed_at":"2026-05-17T23:41:27.809704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:27.809704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pfBCc+gy8+8RRlLL5xeC8RTfomXd/ijFtgIw6JD3Tdo4ThXA5nSbsuwHVjgU9fCxzAi/4/AzPDkKkGvpAIDECA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:27.810379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06105","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b0d6c8659aa28432d9ce727f1378fc1ea57c33c208ed496537e4fde8c4e87f9","sha256:f86a4aca3cb5af96a810305c003e062b2add2f70727f1e3eb7431de070bdace5"],"state_sha256":"80f58646e0db7d7ae53b4cf62e0bca3c939367677572869049e842e373b7a4fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ak86+VXvWzkJRr9vBSj9N1acYa+eBOCyAty3O0Huctzaw92kWDxMdplaQpffMcL2H2wSdHjN26CYod7pIeVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:10:18.890683Z","bundle_sha256":"4ac4310e17f8ac4975c42bea870abad9a23dd26600255840f8f0523ab4135cab"}}