{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KJB7WZMOBQCWXUZUNBICAP4O5N","short_pith_number":"pith:KJB7WZMO","schema_version":"1.0","canonical_sha256":"5243fb658e0c056bd3346850203f8eeb61f36bc0ca4c1ef20644bbfc98cedd5c","source":{"kind":"arxiv","id":"2603.03612","version":3},"attestation_state":"computed","paper":{"title":"Why Are Linear RNNs More Parallelizable?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CL","cs.FL"],"primary_cat":"cs.LG","authors_text":"Anthony Lin, Ashish Sabharwal, Hongjian Jiang, William Merrill, Yanhong Li","submitted_at":"2026-03-04T00:51:08Z","abstract_excerpt":"The community is increasingly exploring linear RNNs (LRNNs) as language models, motivated by their expressive power and parallelizability. While prior work establishes the expressivity benefits of LRNNs over transformers, it is unclear what makes LRNNs -- but not traditional, nonlinear RNNs -- as easy to parallelize in practice as transformers. We answer this question by providing a tight connection between types of RNNs and standard complexity classes. We show that LRNNs can be viewed as log-depth (bounded fan-in) arithmetic circuits, which represents only a slight depth overhead relative to "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2603.03612","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-03-04T00:51:08Z","cross_cats_sorted":["cs.CC","cs.CL","cs.FL"],"title_canon_sha256":"dd0cca411763705e0b5a355d16157da4c2bbb810d059a2139360f94ad427e721","abstract_canon_sha256":"252cfb8436d690dd225dda6a7bcbb07f85d415649a820fbde50fa3c05cdd3a99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:11.197345Z","signature_b64":"6MIYhiL2UkXvFbgCIbHREmI+nrevN19VEGTHp/r87v4nPaJK+W70Evdq/j22QqcvM+PefKpgol6uPidGq7iLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5243fb658e0c056bd3346850203f8eeb61f36bc0ca4c1ef20644bbfc98cedd5c","last_reissued_at":"2026-06-03T01:05:11.196866Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:11.196866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Why Are Linear RNNs More Parallelizable?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CL","cs.FL"],"primary_cat":"cs.LG","authors_text":"Anthony Lin, Ashish Sabharwal, Hongjian Jiang, William Merrill, Yanhong Li","submitted_at":"2026-03-04T00:51:08Z","abstract_excerpt":"The community is increasingly exploring linear RNNs (LRNNs) as language models, motivated by their expressive power and parallelizability. While prior work establishes the expressivity benefits of LRNNs over transformers, it is unclear what makes LRNNs -- but not traditional, nonlinear RNNs -- as easy to parallelize in practice as transformers. We answer this question by providing a tight connection between types of RNNs and standard complexity classes. We show that LRNNs can be viewed as log-depth (bounded fan-in) arithmetic circuits, which represents only a slight depth overhead relative to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.03612","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.03612/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.03612","created_at":"2026-06-03T01:05:11.196924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.03612v3","created_at":"2026-06-03T01:05:11.196924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.03612","created_at":"2026-06-03T01:05:11.196924+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJB7WZMOBQCW","created_at":"2026-06-03T01:05:11.196924+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJB7WZMOBQCWXUZU","created_at":"2026-06-03T01:05:11.196924+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJB7WZMO","created_at":"2026-06-03T01:05:11.196924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N","json":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N.json","graph_json":"https://pith.science/api/pith-number/KJB7WZMOBQCWXUZUNBICAP4O5N/graph.json","events_json":"https://pith.science/api/pith-number/KJB7WZMOBQCWXUZUNBICAP4O5N/events.json","paper":"https://pith.science/paper/KJB7WZMO"},"agent_actions":{"view_html":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N","download_json":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N.json","view_paper":"https://pith.science/paper/KJB7WZMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.03612&json=true","fetch_graph":"https://pith.science/api/pith-number/KJB7WZMOBQCWXUZUNBICAP4O5N/graph.json","fetch_events":"https://pith.science/api/pith-number/KJB7WZMOBQCWXUZUNBICAP4O5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N/action/storage_attestation","attest_author":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N/action/author_attestation","sign_citation":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N/action/citation_signature","submit_replication":"https://pith.science/pith/KJB7WZMOBQCWXUZUNBICAP4O5N/action/replication_record"}},"created_at":"2026-06-03T01:05:11.196924+00:00","updated_at":"2026-06-03T01:05:11.196924+00:00"}