{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AIZ2E3IPEVUGPPFV7ODCWQSW3V","short_pith_number":"pith:AIZ2E3IP","canonical_record":{"source":{"id":"1702.07805","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-24T23:48:11Z","cross_cats_sorted":[],"title_canon_sha256":"f0a3e7a5a71b09d14d7834b86fbb2961cd3c87c808759eaec8f26e6d6a4dd95f","abstract_canon_sha256":"e10874d6a03f0747fbe79df76c5a62c44bb8e604459ceb0865078ccf486cbf7d"},"schema_version":"1.0"},"canonical_sha256":"0233a26d0f256867bcb5fb862b4256dd6363dff6cb8cadf3c4b6bd192c0194bd","source":{"kind":"arxiv","id":"1702.07805","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07805","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07805v4","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07805","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"AIZ2E3IPEVUG","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIZ2E3IPEVUGPPFV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIZ2E3IP","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AIZ2E3IPEVUGPPFV7ODCWQSW3V","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07805","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-24T23:48:11Z","cross_cats_sorted":[],"title_canon_sha256":"f0a3e7a5a71b09d14d7834b86fbb2961cd3c87c808759eaec8f26e6d6a4dd95f","abstract_canon_sha256":"e10874d6a03f0747fbe79df76c5a62c44bb8e604459ceb0865078ccf486cbf7d"},"schema_version":"1.0"},"canonical_sha256":"0233a26d0f256867bcb5fb862b4256dd6363dff6cb8cadf3c4b6bd192c0194bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:54.930499Z","signature_b64":"v4US8vquVofW+ZMB4Zx0hegB/6I1nferzEDODfz+OGIgqEmdCFclB5UL4M6TdfMrRRwBj+2Pq3mZv0t6jGVgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0233a26d0f256867bcb5fb862b4256dd6363dff6cb8cadf3c4b6bd192c0194bd","last_reissued_at":"2026-05-18T00:17:54.929856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:54.929856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07805","source_version":4,"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:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLvzsqntOG1K+3Qqo4QNVzDVNUApPahLV85bdhcHOOoTqS2jj/JIQb0hZBy3UUGAaGH2IIWKoxrXK7IH2fkpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:13:45.639597Z"},"content_sha256":"2067ed4dcb5801cb2e6c44f04b3e18b284a7e45a7c3ae9a5c070ac55073b8106","schema_version":"1.0","event_id":"sha256:2067ed4dcb5801cb2e6c44f04b3e18b284a7e45a7c3ae9a5c070ac55073b8106"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AIZ2E3IPEVUGPPFV7ODCWQSW3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analyzing and Exploiting NARX Recurrent Neural Networks for Long-Term Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Christian Rupprecht, Gregory D. Hager, Nassir Navab, Robert DiPietro","submitted_at":"2017-02-24T23:48:11Z","abstract_excerpt":"Recurrent neural networks (RNNs) have achieved state-of-the-art performance on many diverse tasks, from machine translation to surgical activity recognition, yet training RNNs to capture long-term dependencies remains difficult. To date, the vast majority of successful RNN architectures alleviate this problem using nearly-additive connections between states, as introduced by long short-term memory (LSTM). We take an orthogonal approach and introduce MIST RNNs, a NARX RNN architecture that allows direct connections from the very distant past. We show that MIST RNNs 1) exhibit superior vanishing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07805","kind":"arxiv","version":4},"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:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+mDLiNjFBayHUX23xt8H1bHPj+WpLYD+Usa6cSpMRzgtyLijfI6kr4eTjW8bYbxM2RxVWCyHK1iwY5kVcebiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:13:45.640459Z"},"content_sha256":"fe9c0eae4d12ed74757514a7d4168670d6c05598c4431d19ae8532e85edbd631","schema_version":"1.0","event_id":"sha256:fe9c0eae4d12ed74757514a7d4168670d6c05598c4431d19ae8532e85edbd631"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIZ2E3IPEVUGPPFV7ODCWQSW3V/bundle.json","state_url":"https://pith.science/pith/AIZ2E3IPEVUGPPFV7ODCWQSW3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIZ2E3IPEVUGPPFV7ODCWQSW3V/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-17T20:13:45Z","links":{"resolver":"https://pith.science/pith/AIZ2E3IPEVUGPPFV7ODCWQSW3V","bundle":"https://pith.science/pith/AIZ2E3IPEVUGPPFV7ODCWQSW3V/bundle.json","state":"https://pith.science/pith/AIZ2E3IPEVUGPPFV7ODCWQSW3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIZ2E3IPEVUGPPFV7ODCWQSW3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AIZ2E3IPEVUGPPFV7ODCWQSW3V","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":"e10874d6a03f0747fbe79df76c5a62c44bb8e604459ceb0865078ccf486cbf7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-24T23:48:11Z","title_canon_sha256":"f0a3e7a5a71b09d14d7834b86fbb2961cd3c87c808759eaec8f26e6d6a4dd95f"},"schema_version":"1.0","source":{"id":"1702.07805","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07805","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07805v4","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07805","created_at":"2026-05-18T00:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"AIZ2E3IPEVUG","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIZ2E3IPEVUGPPFV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIZ2E3IP","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:fe9c0eae4d12ed74757514a7d4168670d6c05598c4431d19ae8532e85edbd631","target":"graph","created_at":"2026-05-18T00:17:54Z","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 (RNNs) have achieved state-of-the-art performance on many diverse tasks, from machine translation to surgical activity recognition, yet training RNNs to capture long-term dependencies remains difficult. To date, the vast majority of successful RNN architectures alleviate this problem using nearly-additive connections between states, as introduced by long short-term memory (LSTM). We take an orthogonal approach and introduce MIST RNNs, a NARX RNN architecture that allows direct connections from the very distant past. We show that MIST RNNs 1) exhibit superior vanishing","authors_text":"Christian Rupprecht, Gregory D. Hager, Nassir Navab, Robert DiPietro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-24T23:48:11Z","title":"Analyzing and Exploiting NARX Recurrent Neural Networks for Long-Term Dependencies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07805","kind":"arxiv","version":4},"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:2067ed4dcb5801cb2e6c44f04b3e18b284a7e45a7c3ae9a5c070ac55073b8106","target":"record","created_at":"2026-05-18T00:17:54Z","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":"e10874d6a03f0747fbe79df76c5a62c44bb8e604459ceb0865078ccf486cbf7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-24T23:48:11Z","title_canon_sha256":"f0a3e7a5a71b09d14d7834b86fbb2961cd3c87c808759eaec8f26e6d6a4dd95f"},"schema_version":"1.0","source":{"id":"1702.07805","kind":"arxiv","version":4}},"canonical_sha256":"0233a26d0f256867bcb5fb862b4256dd6363dff6cb8cadf3c4b6bd192c0194bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0233a26d0f256867bcb5fb862b4256dd6363dff6cb8cadf3c4b6bd192c0194bd","first_computed_at":"2026-05-18T00:17:54.929856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:54.929856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v4US8vquVofW+ZMB4Zx0hegB/6I1nferzEDODfz+OGIgqEmdCFclB5UL4M6TdfMrRRwBj+2Pq3mZv0t6jGVgBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:54.930499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07805","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2067ed4dcb5801cb2e6c44f04b3e18b284a7e45a7c3ae9a5c070ac55073b8106","sha256:fe9c0eae4d12ed74757514a7d4168670d6c05598c4431d19ae8532e85edbd631"],"state_sha256":"e0b7e3649c8916433b7c397e9c6440ac5d5964a3ae12e7237e946317ec575485"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wcGjEobRatfuFkgUheoRwG1bWcwkxQJxx/OOtlZvMAu3z8YQetk+l8+9Yn9JS2jZobh5FJ9FTbIb17+cOVYaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T20:13:45.649915Z","bundle_sha256":"4b2a973cb7992030acb7e207067aee8f65ba80a023d808e579e2a0ceb9b3e02e"}}