Pith. sign in

REVIEW 2 cited by

CAX: Cellular Automata Accelerated in JAX

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 2410.02651 v2 pith:ZJ2Q4WSV submitted 2024-10-03 cs.LG cs.AI

CAX: Cellular Automata Accelerated in JAX

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

Cellular automata have become a cornerstone for investigating emergence and self-organization across diverse scientific disciplines. However, the absence of a hardware-accelerated cellular automata library limits the exploration of new research directions, hinders collaboration, and impedes reproducibility. In this work, we introduce CAX (Cellular Automata Accelerated in JAX), a high-performance and flexible open-source library designed to accelerate cellular automata research. CAX delivers cutting-edge performance through hardware acceleration while maintaining flexibility through its modular architecture, intuitive API, and support for both discrete and continuous cellular automata in arbitrary dimensions. We demonstrate CAX's performance and flexibility through a wide range of benchmarks and applications. From classic models like elementary cellular automata and Conway's Game of Life to advanced applications such as growing neural cellular automata and self-classifying MNIST digits, CAX speeds up simulations up to 2,000 times faster. Furthermore, we demonstrate CAX's potential to accelerate research by presenting a collection of three novel cellular automata experiments, each implemented in just a few lines of code thanks to the library's modular architecture. Notably, we show that a simple one-dimensional cellular automaton can outperform GPT-4 on the 1D-ARC challenge.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

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

  1. Evolving Many Worlds: Towards Open-Ended Discovery in Petri Dish NCA via Population-Based Training

    cs.NE 2026-04 unverdicted novelty 6.0

    PBT-NCA evolves PD-NCAs via a composite novelty-diversity objective to generate sustained emergent lifelike behaviors including waves, spore scattering, and migrating macro-structures at the edge of chaos.

  2. Evolving Many Worlds: Towards Open-Ended Discovery in Petri Dish NCA via Population-Based Training

    cs.NE 2026-04 unverdicted novelty 6.0

    PBT-NCA evolves populations of Petri Dish NCAs under novelty-plus-diversity pressure, yielding sustained lifelike waves, spore-like colonization, and migrating macro-structures at the edge of chaos.