File size: 1,894 Bytes
86a18fb 377513f 09a801d 86a18fb 7b67fee 86a18fb d80b108 09a801d 86a18fb | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 | {
"schema_version": 1,
"title": "Repro - Why Are Linear RNNs More Parallelizable?",
"emoji": "🎯",
"space_id": "vimarsh/repro-why-linear-rnns-more-parallelizable",
"paper": {
"openreview_id": "29sn1uqWn3",
"arxiv_id": "2603.03612"
},
"tags": [
"icml2026-repro",
"paper-29sn1uqWn3"
],
"updated_at": "2026-07-17T06:40:56+00:00",
"root": {
"slug": "index",
"title": "Repro - Why Are Linear RNNs More Parallelizable?",
"file": "pages/index.md",
"children": [
{
"slug": "claim-1-lrnn-arithmetic-circuits",
"title": "Claim 1: LRNN arithmetic circuits",
"file": "pages/claim-1-lrnn-arithmetic-circuits/page.md",
"children": []
},
{
"slug": "claim-2-nc-depth",
"title": "Claim 2: NC depth",
"file": "pages/claim-2-nc-depth/page.md",
"children": []
},
{
"slug": "claim-3-nonlinear-rnns-and-l",
"title": "Claim 3: Nonlinear RNNs and L",
"file": "pages/claim-3-nonlinear-rnns-and-l/page.md",
"children": []
},
{
"slug": "claim-4-poly-precision-p",
"title": "Claim 4: Poly-precision P",
"file": "pages/claim-4-poly-precision-p/page.md",
"children": []
},
{
"slug": "claim-5-dplr-matrix-products",
"title": "Claim 5: DPLR matrix products",
"file": "pages/claim-5-dplr-matrix-products/page.md",
"children": []
},
{
"slug": "claim-6-graph-generalization",
"title": "Claim 6: Graph generalization",
"file": "pages/claim-6-graph-generalization/page.md",
"children": []
},
{
"slug": "conclusion",
"title": "Conclusion",
"file": "pages/conclusion/page.md",
"children": []
}
]
},
"agent_view_tokens": 2350,
"revision": "1784270456634764156"
} |