{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DY7JRQJ4GCRWMH5CKVZCMICZRI","short_pith_number":"pith:DY7JRQJ4","canonical_record":{"source":{"id":"2404.00880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-01T03:18:42Z","cross_cats_sorted":[],"title_canon_sha256":"ef2a10d0d7df89bbe4b1a09101d57c6b61eef3cd21de66da8669bcff81f6cdc4","abstract_canon_sha256":"2a3507d078356f4d4a0d4086d22a3ced0ad2b57458970bd396704ae5782416ff"},"schema_version":"1.0"},"canonical_sha256":"1e3e98c13c30a3661fa255722620598a0c12f4fda1808b43a41e65cfcbff95e1","source":{"kind":"arxiv","id":"2404.00880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.00880","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"2404.00880v1","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00880","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"DY7JRQJ4GCRW","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"pith_short_16","alias_value":"DY7JRQJ4GCRWMH5C","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"pith_short_8","alias_value":"DY7JRQJ4","created_at":"2026-07-05T08:02:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DY7JRQJ4GCRWMH5CKVZCMICZRI","target":"record","payload":{"canonical_record":{"source":{"id":"2404.00880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-01T03:18:42Z","cross_cats_sorted":[],"title_canon_sha256":"ef2a10d0d7df89bbe4b1a09101d57c6b61eef3cd21de66da8669bcff81f6cdc4","abstract_canon_sha256":"2a3507d078356f4d4a0d4086d22a3ced0ad2b57458970bd396704ae5782416ff"},"schema_version":"1.0"},"canonical_sha256":"1e3e98c13c30a3661fa255722620598a0c12f4fda1808b43a41e65cfcbff95e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:57.907962Z","signature_b64":"mHRCDljoyTbRPkK6CRlzjL9vsausVbbaSHy60oo9wlOONCxbpQZe5377+fAfVw8YNeHwzmexF3aLPeB4o9nzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e3e98c13c30a3661fa255722620598a0c12f4fda1808b43a41e65cfcbff95e1","last_reissued_at":"2026-07-05T08:02:57.907422Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:57.907422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.00880","source_version":1,"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-07-05T08:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qlCR5N/qXHHQho/srEvX86GvlkiJh7YcpenB7tkQgfBbyvE8SBa9h5boAL2smlFWPYHW/TYOmcj98JRg7eTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:07:05.596057Z"},"content_sha256":"696c32f8e1ce814a8b410656c25bd9e27fa74a24bc12bdbbaf7c3f97ff64faeb","schema_version":"1.0","event_id":"sha256:696c32f8e1ce814a8b410656c25bd9e27fa74a24bc12bdbbaf7c3f97ff64faeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DY7JRQJ4GCRWMH5CKVZCMICZRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rethinking the Relationship between Recurrent and Non-Recurrent Neural Networks: A Study in Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Harsh Pathak, Quincy Hershey, Randy Paffenroth, Simon Tavener","submitted_at":"2024-04-01T03:18:42Z","abstract_excerpt":"Neural networks (NN) can be divided into two broad categories, recurrent and non-recurrent. Both types of neural networks are popular and extensively studied, but they are often treated as distinct families of machine learning algorithms. In this position paper, we argue that there is a closer relationship between these two types of neural networks than is normally appreciated. We show that many common neural network models, such as Recurrent Neural Networks (RNN), Multi-Layer Perceptrons (MLP), and even deep multi-layer transformers, can all be represented as iterative maps.\n  The close relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00880","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.00880/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"enfwuMLJIC4hJZwWTjwDSfQ8KZ1HFPxxvsKcvWHATHGmkfo15HNXJOr3DOe7MbtT+rdn0wbPa/WmGxQOENT4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:07:05.596573Z"},"content_sha256":"e67f76c1ab58b560138c7906608429ae9e6f29c55c1f3624abe2129d1e7425fb","schema_version":"1.0","event_id":"sha256:e67f76c1ab58b560138c7906608429ae9e6f29c55c1f3624abe2129d1e7425fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DY7JRQJ4GCRWMH5CKVZCMICZRI/bundle.json","state_url":"https://pith.science/pith/DY7JRQJ4GCRWMH5CKVZCMICZRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DY7JRQJ4GCRWMH5CKVZCMICZRI/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-10T19:07:05Z","links":{"resolver":"https://pith.science/pith/DY7JRQJ4GCRWMH5CKVZCMICZRI","bundle":"https://pith.science/pith/DY7JRQJ4GCRWMH5CKVZCMICZRI/bundle.json","state":"https://pith.science/pith/DY7JRQJ4GCRWMH5CKVZCMICZRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DY7JRQJ4GCRWMH5CKVZCMICZRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DY7JRQJ4GCRWMH5CKVZCMICZRI","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":"2a3507d078356f4d4a0d4086d22a3ced0ad2b57458970bd396704ae5782416ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-01T03:18:42Z","title_canon_sha256":"ef2a10d0d7df89bbe4b1a09101d57c6b61eef3cd21de66da8669bcff81f6cdc4"},"schema_version":"1.0","source":{"id":"2404.00880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.00880","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"2404.00880v1","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00880","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"DY7JRQJ4GCRW","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"pith_short_16","alias_value":"DY7JRQJ4GCRWMH5C","created_at":"2026-07-05T08:02:57Z"},{"alias_kind":"pith_short_8","alias_value":"DY7JRQJ4","created_at":"2026-07-05T08:02:57Z"}],"graph_snapshots":[{"event_id":"sha256:e67f76c1ab58b560138c7906608429ae9e6f29c55c1f3624abe2129d1e7425fb","target":"graph","created_at":"2026-07-05T08:02:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.00880/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural networks (NN) can be divided into two broad categories, recurrent and non-recurrent. Both types of neural networks are popular and extensively studied, but they are often treated as distinct families of machine learning algorithms. In this position paper, we argue that there is a closer relationship between these two types of neural networks than is normally appreciated. We show that many common neural network models, such as Recurrent Neural Networks (RNN), Multi-Layer Perceptrons (MLP), and even deep multi-layer transformers, can all be represented as iterative maps.\n  The close relat","authors_text":"Harsh Pathak, Quincy Hershey, Randy Paffenroth, Simon Tavener","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-01T03:18:42Z","title":"Rethinking the Relationship between Recurrent and Non-Recurrent Neural Networks: A Study in Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00880","kind":"arxiv","version":1},"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:696c32f8e1ce814a8b410656c25bd9e27fa74a24bc12bdbbaf7c3f97ff64faeb","target":"record","created_at":"2026-07-05T08:02:57Z","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":"2a3507d078356f4d4a0d4086d22a3ced0ad2b57458970bd396704ae5782416ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-01T03:18:42Z","title_canon_sha256":"ef2a10d0d7df89bbe4b1a09101d57c6b61eef3cd21de66da8669bcff81f6cdc4"},"schema_version":"1.0","source":{"id":"2404.00880","kind":"arxiv","version":1}},"canonical_sha256":"1e3e98c13c30a3661fa255722620598a0c12f4fda1808b43a41e65cfcbff95e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e3e98c13c30a3661fa255722620598a0c12f4fda1808b43a41e65cfcbff95e1","first_computed_at":"2026-07-05T08:02:57.907422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:02:57.907422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mHRCDljoyTbRPkK6CRlzjL9vsausVbbaSHy60oo9wlOONCxbpQZe5377+fAfVw8YNeHwzmexF3aLPeB4o9nzAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:02:57.907962Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.00880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:696c32f8e1ce814a8b410656c25bd9e27fa74a24bc12bdbbaf7c3f97ff64faeb","sha256:e67f76c1ab58b560138c7906608429ae9e6f29c55c1f3624abe2129d1e7425fb"],"state_sha256":"82bdbbfb109b1414d7bb00895a65c2851a6f692910fbec1e0aa08bbb854bc259"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6NMb/eMGVsTsaUk5NhZfWzxj8RtyGbzuGA9HhquS6HqRRDmAEzW27W5oINlsHi3uGpM0ztcwrPI/lAYIOvpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:07:05.600105Z","bundle_sha256":"d0c89bc03b2e1f27c06e138e2ebbf4ba2cf155a4d5f4bb7f6cb4e477037e574a"}}