| { |
| "schema_version": 2, |
| "title": "Reproduction: Context-free Recognition with Transformers", |
| "emoji": "🎯", |
| "space_id": "SabaPivot/repro-context-free-recognition-with-transformers", |
| "paper": { |
| "arxiv_id": "2601.01754" |
| }, |
| "tags": [ |
| "icml2026-repro", |
| "paper-JOyxs9ElI7" |
| ], |
| "updated_at": "2026-07-29T01:49:57+00:00", |
| "root": { |
| "slug": "index", |
| "title": "Reproduction: Context-free Recognition with Transformers", |
| "file": "pages/index.md", |
| "children": [ |
| { |
| "slug": "executive-summary", |
| "title": "Executive summary", |
| "file": "pages/executive-summary/page.md", |
| "children": [] |
| }, |
| { |
| "slug": "claim-1-all-context-free-languages-are-recognizable-with-o-log-n-loops-and-o-n-6-padding-tokens", |
| "title": "Claim 1: General context-free recognition", |
| "file": "pages/claim-1-all-context-free-languages-are-recognizable-with-o-log-n-loops-and-o-n-6-padding-tokens/page.md", |
| "children": [] |
| }, |
| { |
| "slug": "claim-2-unambiguous-context-free-languages-are-recognizable-with-o-log-2-n-loops-and-o-n-3-padding-tokens", |
| "title": "Claim 2: Unambiguous context-free recognition", |
| "file": "pages/claim-2-unambiguous-context-free-languages-are-recognizable-with-o-log-2-n-loops-and-o-n-3-padding-tokens/page.md", |
| "children": [] |
| }, |
| { |
| "slug": "claim-3-unambiguous-linear-context-free-languages-are-recognizable-with-o-log-n-loops-and-o-n-2-padding-tokens", |
| "title": "Claim 3: Linear-unambiguous recognition", |
| "file": "pages/claim-3-unambiguous-linear-context-free-languages-are-recognizable-with-o-log-n-loops-and-o-n-2-padding-tokens/page.md", |
| "children": [] |
| }, |
| { |
| "slug": "claim-4-boolean-formula-evaluation-admits-an-o-log-n-step-parallel-pebbling-schedule", |
| "title": "Claim 4: Logarithmic Boolean-formula pebbling", |
| "file": "pages/claim-4-boolean-formula-evaluation-admits-an-o-log-n-step-parallel-pebbling-schedule/page.md", |
| "children": [] |
| }, |
| { |
| "slug": "claim-5-boolean-formula-value-problem-recognition-requires-zero-padding-tokens-at-logarithmic-depth", |
| "title": "Claim 5: Unpadded BFVP recognition", |
| "file": "pages/claim-5-boolean-formula-value-problem-recognition-requires-zero-padding-tokens-at-logarithmic-depth/page.md", |
| "children": [] |
| }, |
| { |
| "slug": "claim-6-the-padding-depth-tradeoff-systematically-improves-from-general-to-unambiguous-to-linear-unambiguous-grammars", |
| "title": "Claim 6: Padding–depth tradeoff", |
| "file": "pages/claim-6-the-padding-depth-tradeoff-systematically-improves-from-general-to-unambiguous-to-linear-unambiguous-grammars/page.md", |
| "children": [] |
| }, |
| { |
| "slug": "conclusion", |
| "title": "Conclusion", |
| "file": "pages/conclusion/page.md", |
| "children": [] |
| } |
| ] |
| }, |
| "traces": [], |
| "workspace": { |
| "file": "workspace.json", |
| "file_count": 0, |
| "total_size": 0, |
| "bucket_id": null |
| }, |
| "agent_view_tokens": 12027, |
| "trace_view_tokens": 10, |
| "workspace_view_tokens": 8, |
| "revision": "3d56e77a3f37afd7648f" |
| } |
