{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HN3HAB7NUHCLAUKBJO4YA6BM7I","short_pith_number":"pith:HN3HAB7N","canonical_record":{"source":{"id":"1602.08210","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-26T06:16:27Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"1a1c6daeabf5a5ae23252c537a6e98092c257d3850a04941507b0664cf38a6af","abstract_canon_sha256":"2f8c69c67440b76e7315f9f3b84ac166963f450f18f1af5c42013a12dd8f6dca"},"schema_version":"1.0"},"canonical_sha256":"3b767007eda1c4b051414bb980782cfa276c8d0adc51d3b2a0439d04d46902eb","source":{"kind":"arxiv","id":"1602.08210","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08210","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08210v3","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08210","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"HN3HAB7NUHCL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HN3HAB7NUHCLAUKB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HN3HAB7N","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HN3HAB7NUHCLAUKBJO4YA6BM7I","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08210","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-26T06:16:27Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"1a1c6daeabf5a5ae23252c537a6e98092c257d3850a04941507b0664cf38a6af","abstract_canon_sha256":"2f8c69c67440b76e7315f9f3b84ac166963f450f18f1af5c42013a12dd8f6dca"},"schema_version":"1.0"},"canonical_sha256":"3b767007eda1c4b051414bb980782cfa276c8d0adc51d3b2a0439d04d46902eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:25.819181Z","signature_b64":"rFfvhz1QqK7iWi+xBDChVx0neIUSWKKYRLNvjMTB/7yeiDwSB/Zwxv0rIEdS88iXZeCYDOuhmAPweGAEqpg4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b767007eda1c4b051414bb980782cfa276c8d0adc51d3b2a0439d04d46902eb","last_reissued_at":"2026-05-18T00:59:25.818554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:25.818554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08210","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:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBOO69VTJrxdiR6u0lC+INFuTLR9bMcW57J5i+ikiYTGDUm0CoF+7eiiSq0FdYpEngvV2NvJZxUIy0ClusA7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:38:49.248452Z"},"content_sha256":"c8d7cf3ba60d56386dd84941c25dbbe13f3d2ffcf03a26c41551055ad310d3af","schema_version":"1.0","event_id":"sha256:c8d7cf3ba60d56386dd84941c25dbbe13f3d2ffcf03a26c41551055ad310d3af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HN3HAB7NUHCLAUKBJO4YA6BM7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Architectural Complexity Measures of Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Roland Memisevic, Ruslan Salakhutdinov, Saizheng Zhang, Tong Che, Yoshua Bengio, Yuhuai Wu, Zhouhan Lin","submitted_at":"2016-02-26T06:16:27Z","abstract_excerpt":"In this paper, we systematically analyze the connecting architectures of recurrent neural networks (RNNs). Our main contribution is twofold: first, we present a rigorous graph-theoretic framework describing the connecting architectures of RNNs in general. Second, we propose three architecture complexity measures of RNNs: (a) the recurrent depth, which captures the RNN's over-time nonlinear complexity, (b) the feedforward depth, which captures the local input-output nonlinearity (similar to the \"depth\" in feedforward neural networks (FNNs)), and (c) the recurrent skip coefficient which captures"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08210","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:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhzlDqH/UAdsBdWonejqHfnnkODPjxcTiii24EDNv3A8e7aiH0EO2JvLulthwqM6JusGv0Gf6cmRQqW0IAdXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:38:49.249153Z"},"content_sha256":"0505b91b3b3860f3be4b5f161bc0e6eeea74ba500c671dda8e61697db07e9e5a","schema_version":"1.0","event_id":"sha256:0505b91b3b3860f3be4b5f161bc0e6eeea74ba500c671dda8e61697db07e9e5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HN3HAB7NUHCLAUKBJO4YA6BM7I/bundle.json","state_url":"https://pith.science/pith/HN3HAB7NUHCLAUKBJO4YA6BM7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HN3HAB7NUHCLAUKBJO4YA6BM7I/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-26T10:38:49Z","links":{"resolver":"https://pith.science/pith/HN3HAB7NUHCLAUKBJO4YA6BM7I","bundle":"https://pith.science/pith/HN3HAB7NUHCLAUKBJO4YA6BM7I/bundle.json","state":"https://pith.science/pith/HN3HAB7NUHCLAUKBJO4YA6BM7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HN3HAB7NUHCLAUKBJO4YA6BM7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HN3HAB7NUHCLAUKBJO4YA6BM7I","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":"2f8c69c67440b76e7315f9f3b84ac166963f450f18f1af5c42013a12dd8f6dca","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-26T06:16:27Z","title_canon_sha256":"1a1c6daeabf5a5ae23252c537a6e98092c257d3850a04941507b0664cf38a6af"},"schema_version":"1.0","source":{"id":"1602.08210","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08210","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08210v3","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08210","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"HN3HAB7NUHCL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HN3HAB7NUHCLAUKB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HN3HAB7N","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:0505b91b3b3860f3be4b5f161bc0e6eeea74ba500c671dda8e61697db07e9e5a","target":"graph","created_at":"2026-05-18T00:59:25Z","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":"In this paper, we systematically analyze the connecting architectures of recurrent neural networks (RNNs). Our main contribution is twofold: first, we present a rigorous graph-theoretic framework describing the connecting architectures of RNNs in general. Second, we propose three architecture complexity measures of RNNs: (a) the recurrent depth, which captures the RNN's over-time nonlinear complexity, (b) the feedforward depth, which captures the local input-output nonlinearity (similar to the \"depth\" in feedforward neural networks (FNNs)), and (c) the recurrent skip coefficient which captures","authors_text":"Roland Memisevic, Ruslan Salakhutdinov, Saizheng Zhang, Tong Che, Yoshua Bengio, Yuhuai Wu, Zhouhan Lin","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-26T06:16:27Z","title":"Architectural Complexity Measures of Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08210","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:c8d7cf3ba60d56386dd84941c25dbbe13f3d2ffcf03a26c41551055ad310d3af","target":"record","created_at":"2026-05-18T00:59:25Z","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":"2f8c69c67440b76e7315f9f3b84ac166963f450f18f1af5c42013a12dd8f6dca","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-26T06:16:27Z","title_canon_sha256":"1a1c6daeabf5a5ae23252c537a6e98092c257d3850a04941507b0664cf38a6af"},"schema_version":"1.0","source":{"id":"1602.08210","kind":"arxiv","version":3}},"canonical_sha256":"3b767007eda1c4b051414bb980782cfa276c8d0adc51d3b2a0439d04d46902eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b767007eda1c4b051414bb980782cfa276c8d0adc51d3b2a0439d04d46902eb","first_computed_at":"2026-05-18T00:59:25.818554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:25.818554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rFfvhz1QqK7iWi+xBDChVx0neIUSWKKYRLNvjMTB/7yeiDwSB/Zwxv0rIEdS88iXZeCYDOuhmAPweGAEqpg4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:25.819181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08210","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8d7cf3ba60d56386dd84941c25dbbe13f3d2ffcf03a26c41551055ad310d3af","sha256:0505b91b3b3860f3be4b5f161bc0e6eeea74ba500c671dda8e61697db07e9e5a"],"state_sha256":"22623f315562b91621c29ffae07b72e263c298a804e51d99de05f6a9da869cc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xAD9HAJcmhOmjQbuckAhSwG2EBllp7EJaezTY1ZSegv06SruVXAmjzp1TDZg68/fi3Jp9QI7/ombFs7iNAerDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:38:49.252563Z","bundle_sha256":"098e1f1195dea14e6639c00c328aff67e6ff9071252a01252464d1da11569d3d"}}