NC1-complete: A complexity class of problems solvable by logarithmic-depth circuits; implies that fixed-depth transformers (which are in TC0) generally cannot solve these problems without intermediate steps
TC0: A complexity class containing problems solvable by constant-depth circuits with majority gates; standard transformers are theoretically limited to this class
Shell Game: A gambling game where a ball is hidden under one of three cups which are then shuffled; used here as a proxy for object permanence and tracking tasks
SGCoT: Spatiotemporal Grounded Chain-of-Thought—a reasoning strategy where the model generates explicit object coordinates and timestamps before the final answer
VET-Bench: Visual Entity Tracking Benchmark—a synthetic dataset designed to test tracking of visually identical objects, removing appearance-based shortcuts
Nyquist criterion: A sampling principle; here applied to video to ensure frame rate is high enough (2 frames per swap) to resolve object motion unambiguously
Three-Card Monte: A card game similar to the shell game requiring the tracking of a specific card (e.g., Queen of Hearts) after shuffling
S5: The symmetric group of degree 5; its word problem is NC1-complete, serving as the basis for the paper's hardness proof