{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2W44ET2PZ4VHYCMR6UHUGA2J5W","short_pith_number":"pith:2W44ET2P","canonical_record":{"source":{"id":"1602.06662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-02-22T06:51:25Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"61170bed21b968f256374c175ed4e1548986489264ba150351ba172e414f77ad","abstract_canon_sha256":"bf3ff85cd85c5ccdfb2da3e54e869c62cfb16b3153fcbc2b0e96887c94101d24"},"schema_version":"1.0"},"canonical_sha256":"d5b9c24f4fcf2a7c0991f50f430349edbdff44c3a1c59bdf802f2adfc63baf39","source":{"kind":"arxiv","id":"1602.06662","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06662","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06662v2","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06662","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"pith_short_12","alias_value":"2W44ET2PZ4VH","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2W44ET2PZ4VHYCMR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2W44ET2P","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2W44ET2PZ4VHYCMR6UHUGA2J5W","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-02-22T06:51:25Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"61170bed21b968f256374c175ed4e1548986489264ba150351ba172e414f77ad","abstract_canon_sha256":"bf3ff85cd85c5ccdfb2da3e54e869c62cfb16b3153fcbc2b0e96887c94101d24"},"schema_version":"1.0"},"canonical_sha256":"d5b9c24f4fcf2a7c0991f50f430349edbdff44c3a1c59bdf802f2adfc63baf39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:42.979964Z","signature_b64":"62QM3n1y+hasIlYTcOPU5pOlRLKUaCk75o+giKS8Hg0s29QOKzMyxlWnXiuhBxwxOUpTdg7iO2ea9TYavz0dAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5b9c24f4fcf2a7c0991f50f430349edbdff44c3a1c59bdf802f2adfc63baf39","last_reissued_at":"2026-05-18T00:48:42.979525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:42.979525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06662","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:48:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EY1qHArdPP/1w42g/Bb7cIvxJCntZA8gGhzmvj8GcuqPZ8d6vTAfKmYrt5ug5MHpMRi/b63gLaEXdpNMOaP5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:46:36.409818Z"},"content_sha256":"d3c1191d39538c020a16c23338a79fad062bfecb212b0598b0d7f1c8638aa294","schema_version":"1.0","event_id":"sha256:d3c1191d39538c020a16c23338a79fad062bfecb212b0598b0d7f1c8638aa294"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2W44ET2PZ4VHYCMR6UHUGA2J5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recurrent Orthogonal Networks and Long-Memory Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Arthur Szlam, Mikael Henaff, Yann LeCun","submitted_at":"2016-02-22T06:51:25Z","abstract_excerpt":"Although RNNs have been shown to be powerful tools for processing sequential data, finding architectures or optimization strategies that allow them to model very long term dependencies is still an active area of research. In this work, we carefully analyze two synthetic datasets originally outlined in (Hochreiter and Schmidhuber, 1997) which are used to evaluate the ability of RNNs to store information over many time steps. We explicitly construct RNN solutions to these problems, and using these constructions, illuminate both the problems themselves and the way in which RNNs store different ty"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06662","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:48:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0u4vsvLDcZ9EyWOrd+2gxnufxSPwofrsB7GD3p5HX/LnPirhzUCOF8Ci0uT+vwl3XHFnfEYqGgxmMxCQBocCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:46:36.410171Z"},"content_sha256":"8f1a23685024425bd546081ff9a03f20ef75c5c4eda19e2e2945a5f073213108","schema_version":"1.0","event_id":"sha256:8f1a23685024425bd546081ff9a03f20ef75c5c4eda19e2e2945a5f073213108"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2W44ET2PZ4VHYCMR6UHUGA2J5W/bundle.json","state_url":"https://pith.science/pith/2W44ET2PZ4VHYCMR6UHUGA2J5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2W44ET2PZ4VHYCMR6UHUGA2J5W/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-02T18:46:36Z","links":{"resolver":"https://pith.science/pith/2W44ET2PZ4VHYCMR6UHUGA2J5W","bundle":"https://pith.science/pith/2W44ET2PZ4VHYCMR6UHUGA2J5W/bundle.json","state":"https://pith.science/pith/2W44ET2PZ4VHYCMR6UHUGA2J5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2W44ET2PZ4VHYCMR6UHUGA2J5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2W44ET2PZ4VHYCMR6UHUGA2J5W","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":"bf3ff85cd85c5ccdfb2da3e54e869c62cfb16b3153fcbc2b0e96887c94101d24","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-02-22T06:51:25Z","title_canon_sha256":"61170bed21b968f256374c175ed4e1548986489264ba150351ba172e414f77ad"},"schema_version":"1.0","source":{"id":"1602.06662","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06662","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06662v2","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06662","created_at":"2026-05-18T00:48:42Z"},{"alias_kind":"pith_short_12","alias_value":"2W44ET2PZ4VH","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2W44ET2PZ4VHYCMR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2W44ET2P","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:8f1a23685024425bd546081ff9a03f20ef75c5c4eda19e2e2945a5f073213108","target":"graph","created_at":"2026-05-18T00:48:42Z","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":"Although RNNs have been shown to be powerful tools for processing sequential data, finding architectures or optimization strategies that allow them to model very long term dependencies is still an active area of research. In this work, we carefully analyze two synthetic datasets originally outlined in (Hochreiter and Schmidhuber, 1997) which are used to evaluate the ability of RNNs to store information over many time steps. We explicitly construct RNN solutions to these problems, and using these constructions, illuminate both the problems themselves and the way in which RNNs store different ty","authors_text":"Arthur Szlam, Mikael Henaff, Yann LeCun","cross_cats":["cs.AI","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-02-22T06:51:25Z","title":"Recurrent Orthogonal Networks and Long-Memory Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06662","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:d3c1191d39538c020a16c23338a79fad062bfecb212b0598b0d7f1c8638aa294","target":"record","created_at":"2026-05-18T00:48:42Z","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":"bf3ff85cd85c5ccdfb2da3e54e869c62cfb16b3153fcbc2b0e96887c94101d24","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-02-22T06:51:25Z","title_canon_sha256":"61170bed21b968f256374c175ed4e1548986489264ba150351ba172e414f77ad"},"schema_version":"1.0","source":{"id":"1602.06662","kind":"arxiv","version":2}},"canonical_sha256":"d5b9c24f4fcf2a7c0991f50f430349edbdff44c3a1c59bdf802f2adfc63baf39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5b9c24f4fcf2a7c0991f50f430349edbdff44c3a1c59bdf802f2adfc63baf39","first_computed_at":"2026-05-18T00:48:42.979525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:42.979525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"62QM3n1y+hasIlYTcOPU5pOlRLKUaCk75o+giKS8Hg0s29QOKzMyxlWnXiuhBxwxOUpTdg7iO2ea9TYavz0dAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:42.979964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06662","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3c1191d39538c020a16c23338a79fad062bfecb212b0598b0d7f1c8638aa294","sha256:8f1a23685024425bd546081ff9a03f20ef75c5c4eda19e2e2945a5f073213108"],"state_sha256":"9d180d6085595deef13d3ec2117598dc02d3e083b07c89aaaf60e811dea098c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rz/0BBOpwMzsFB9MW+vlejGOxaUWAzvUWHT8xbXu6qg0lPJtBDcbd4H/T0x4c0I6lATyrL4if+UIMzWOkht/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:46:36.412150Z","bundle_sha256":"718327d732271e428cce820fcfa68e99852035af2431c652ee76969a237cb515"}}