Pith. sign in

REVIEW 32 cited by

ARC Prize 2024: Technical Report

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.04604 v2 pith:V2Q6IWMG submitted 2024-12-05 cs.AI

ARC Prize 2024: Technical Report

classification cs.AI
keywords benchmarkarc-agicompetitionprizescoretasksadvanceapproaches
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

As of December 2024, the ARC-AGI benchmark is five years old and remains unbeaten. We believe it is currently the most important unsolved AI benchmark in the world because it seeks to measure generalization on novel tasks -- the essence of intelligence -- as opposed to skill at tasks that can be prepared for in advance. This year, we launched ARC Prize, a global competition to inspire new ideas and drive open progress towards AGI by reaching a target benchmark score of 85\%. As a result, the state-of-the-art score on the ARC-AGI private evaluation set increased from 33\% to 55.5\%, propelled by several frontier AGI reasoning techniques including deep learning-guided program synthesis and test-time training. In this paper, we survey top approaches, review new open-source implementations, discuss the limitations of the ARC-AGI-1 dataset, and share key insights gained from the competition.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 32 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. MathConstraint: Automated Generation of Verified Combinatorial Reasoning Instances for LLMs

    cs.LG 2026-05 unverdicted novelty 8.0

    MathConstraint generates scalable, automatically verifiable combinatorial problems where LLMs achieve 18.5-66.9% accuracy without tools but roughly double that with solver access.

  2. Transferability for General Reasoning: An Automated Curriculum for Multi-Domain RLVR

    cs.AI 2026-06 unverdicted novelty 7.0

    TAC is a new online curriculum for multi-domain RLVR that estimates cross-domain transferability from gradient geometry to achieve up to 2.8 point macro-averaged accuracy gains over learnability-only baselines on six-...

  3. Transferability for General Reasoning: An Automated Curriculum for Multi-Domain RLVR

    cs.AI 2026-06 unverdicted novelty 7.0

    TAC is a bandit curriculum for multi-domain RLVR that prioritizes domains whose gradient updates align with and benefit other domains, yielding up to 2.8-point macro accuracy gains over learnability-only baselines on ...

  4. Knowledge Index of Noah's Ark

    cs.AI 2026-06 unverdicted novelty 7.0

    Introduces KINA benchmark with 899 items over 261 disciplines, formal (1-1/e) coverage guarantee and bonus-on-bar tournament theorem, plus evaluations of 42 models with top score 53.17%.

  5. Formal Conjectures: An Open and Evolving Benchmark for Verified Discovery in Mathematics

    cs.AI 2026-05 unverdicted novelty 7.0

    Formal Conjectures is a Lean 4 benchmark containing 2615 formalized problems with 1029 open conjectures, designed to evaluate automated mathematical reasoning and proof discovery.

  6. When to Re-Commit: Temporal Abstraction Discovery for Long-Horizon Vision-Language Reasoning

    cs.AI 2026-05 conditional novelty 7.0

    A vision-language policy learns state-conditioned commitment depth to Pareto-dominate fixed-depth baselines on long-horizon puzzles, achieving up to 12.5 pp higher solve rate with 25% fewer actions.

  7. When to Re-Commit: Temporal Abstraction Discovery for Long-Horizon Vision-Language Reasoning

    cs.AI 2026-05 conditional novelty 7.0

    State-conditioned commitment depth in a vision-language policy Pareto-dominates fixed-depth baselines on Sliding Puzzle and Sokoban, raising solve rates by up to 12.5 points while using 25% fewer actions and beating l...

  8. Factorization Regret mediates compositional generalization in latent space

    cs.LG 2026-03 unverdicted novelty 7.0

    Factorization Regret measures how latent variable interactions affect performance, and RCCs enable learning them to achieve compositional generalization in partially observable tasks.

  9. Cost-Effective Agent Harnesses for Abstract Reasoning and Generalization on ARC-AGI-1

    cs.AI 2026-07 conditional novelty 6.0

    Explorer-Definer and Reflective Orchestrator harnesses raise DeepSeek V3.2 from 15.5% to 67.25% pass@2 on ARC-AGI-1 public eval at $0.25–$0.62 per task without ARC-specific training.

  10. Modality-Driven Search with Holistic Trace Judging for ARC-AGI-2

    cs.AI 2026-06 unverdicted novelty 6.0

    A modality-driven search system with holistic trace judging for ARC-AGI-2 reaches 72.9% on the semi-private set and 76.1% on the public set, outperforming GPT-5.2 Pro and Gemini 3 Pro by 18.7 points while releasing full code.

  11. Learning the ARTS of Search for Automated Discovery

    cs.AI 2026-06 unverdicted novelty 6.0

    ARTS improves automated scientific discovery by using reasoning LMs with test-time training to separate hypothesis merit from execution quality in tree search, achieving 15.3% relative gains on 22 MLGym and MLEBench tasks.

  12. Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers

    cs.AI 2026-06 unverdicted novelty 6.0

    FPRM is a Transformer-based model using fixed-point convergence for adaptive halting in looped architectures, claimed effective on Sudoku, Maze, state-tracking, and ARC-AGI benchmarks.

  13. Slots, Transitions, Loops: Learning Composable World Models for ARC

    cs.CV 2026-06 unverdicted novelty 6.0

    Loop-OWM uses color-prototype slots, demonstration-conditioned task summaries, and looped transitions to model ARC rules as visual-symbolic state changes and outperforms baselines on ARC-1 and ARC-2.

  14. An Enigma of Artificial Reason: Investigating the Production-Evaluation Gap in Large Reasoning Models

    cs.AI 2026-05 conditional novelty 6.0

    LRMs show a large production-evaluation gap on the VAIR dataset with valid answers but invalid reasoning, driven by answer confirmation bias as evidenced by CoT analysis, linear probes, and causal patching.

  15. When to Re-Commit: Temporal Abstraction Discovery for Long-Horizon Vision-Language Reasoning

    cs.AI 2026-05 unverdicted novelty 6.0

    Learns state-conditioned commitment depth in a 7B vision-language policy that jointly predicts actions and replan intervals, outperforming fixed-depth baselines and larger models on Sliding Puzzle and Sokoban while pr...

  16. One Step Forward and K Steps Back: Better Reasoning with Denoising Recursion Models

    cs.LG 2026-04 unverdicted novelty 6.0

    Denoising Recursion Models train multi-step noise reversal in looped transformers and outperform the prior Tiny Recursion Model on ARC-AGI.

  17. Test-Time Matching: Unlocking Compositional Reasoning in Multimodal Models

    cs.AI 2025-10 unverdicted novelty 6.0

    Introduces group matching score for better evaluation of compositional reasoning and Test-Time Matching (TTM) algorithm for unsupervised self-improvement in multimodal models, achieving SOTA gains including surpassing...

  18. Artificial Phantasia: Emergent Mental Imagery in Large Language Models

    cs.AI 2025-09 unverdicted novelty 6.0

    LLMs achieve higher accuracy than humans on compositional imagery tasks previously argued to require pictorial representations, supporting emergent propositional mental imagery in AI.

  19. ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systems

    cs.AI 2025-05 unverdicted novelty 6.0

    ARC-AGI-2 adds a larger, more complex set of tasks to the original ARC-AGI benchmark to give finer-grained measurement of fluid intelligence in AI.

  20. Language-Guided Abstraction for Visual Reasoning

    cs.CV 2026-06 unverdicted novelty 5.0

    L-VARC is a LUPI framework that refines crowd-sourced language descriptions with an LLM and uses cross-attention to guide visual ARC models during training only, yielding SOTA results with a lightweight 18M-parameter network.

  21. Customizing an LLM for Enterprise Software Engineering

    cs.SE 2026-05 conditional novelty 5.0

    Gemini for Google, customized via continued pre-training on a trillion-token proprietary dataset, reduces mean iterations per turn by 23% and increases code survival rates by 17% in a blind study of 29,000 developers.

  22. Position: Let's Develop Data Probes to Fundamentally Understand How Data Affects LLM Performance

    cs.AI 2026-05 unverdicted novelty 5.0

    The authors propose creating data probes—synthetic sequences from defined random processes—to reveal how data properties drive LLM behavior across workflow stages.

  23. Beyond Tools and Persons: Who Are They? Classifying Robots and AI Agents for Proportional Governance

    cs.ET 2026-04 unverdicted novelty 5.0

    A CPST-based taxonomy sorts autonomous systems into Confined Actors, Socially-Aware Interactors, and CPST-Integrated Agents to enable proportional governance from enhanced liability to qualified personhood.

  24. Hierarchical Reasoning Model

    cs.AI 2025-06 unverdicted novelty 5.0

    HRM is a recurrent architecture with high-level planning and low-level execution modules that reaches near-perfect accuracy on complex Sudoku, maze navigation, and ARC benchmarks using 27M parameters and 1000 samples ...

  25. Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models

    cs.AI 2025-03 unverdicted novelty 5.0

    The paper unifies perspectives on Long CoT in reasoning LLMs by introducing a taxonomy, detailing characteristics of deep reasoning and reflection, and discussing emergence phenomena and future directions.

  26. Humanity's Last Exam

    cs.LG 2025-01 unverdicted novelty 5.0

    Humanity's Last Exam is a new 2,500-question benchmark at the frontier of human knowledge where state-of-the-art LLMs show low accuracy.

  27. A Compositional Framework for Open-ended Intelligence

    cs.LG 2026-06 unverdicted novelty 4.0

    Open-ended intelligence is formalized as the compositional closure L(P,C) of primitives P under operators C, with next primitive prediction proposed as an objective to acquire reusable primitives and grammar for lifel...

  28. Ling and Ring 2.6 Technical Report: Efficient and Instant Agentic Intelligence at Trillion-Parameter Scale

    cs.CL 2026-06 unverdicted novelty 4.0

    Technical report announcing Ling-2.6 and Ring-2.6 models with hybrid linear attention, evolutionary CoT, and KPop RL for efficient agentic intelligence at scale.

  29. OpenCompass: A Universal Evaluation Platform for Large Language Models

    cs.CL 2026-05 conditional novelty 4.0

    OpenCompass is a modular, high-concurrency platform for unified LLM evaluation across knowledge, reasoning, code, and other domains with support for rule-based, LLM-as-judge, and cascaded evaluators.

  30. Customizing an LLM for Enterprise Software Engineering

    cs.SE 2026-05 unverdicted novelty 4.0

    Gemini for Google, customized via continued pre-training on proprietary Google engineering data, delivers measurable productivity gains in a large internal developer study.

  31. Measuring AI Reasoning: A Guide for Researchers

    cs.AI 2026-05 unverdicted novelty 4.0

    Reasoning in language models should be measured by the faithfulness and validity of their multi-step search processes and intermediate traces, not final-answer accuracy.

  32. OpenCompass: A Universal Evaluation Platform for Large Language Models

    cs.CL 2026-05 unverdicted novelty 3.0

    OpenCompass is presented as a one-stop, scalable, high-concurrency LLM evaluation platform with modular architecture supporting multiple domains and evaluator types.