{"id":"8f9422fb-5d53-46fa-8fde-21139f650688","arxiv_id":"2606.29958","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":8.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A group G is locally finite precisely when every bijective cellular automaton A^G to A^G is reversible for every alphabet A.","lead":"The paper proves that a group G is locally finite if and only if every bijective cellular automaton on configurations over any alphabet A is reversible. This resolves an open problem on when bijectivity implies reversibility for cellular automata over infinite alphabets.","discovery_kind":"unification","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest_assumption correctly isolates the chain construction as the pivotal step for the negative direction; the supplied abstract shows that step is realized precisely by the group-theoretic hypothesis, so the concern does not land.","tokens_in":1701,"tokens_out":334,"duration_ms":109402,"concrete_test":"Extract the explicit local rule (the function A^F → A for finite F) from the construction section; instantiate it on a configuration containing a single chain of length 10 and verify by direct computation that the global map is bijective while any candidate inverse rule with radius < 10 fails to recover the original data track on that chain.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is an if-and-only-if characterization. The negative direction constructs, for any infinite A, a bijective CA whose inverse fails to be a CA by encoding finite directed chains of arbitrary length in a three-track alphabet (rank, direction, binary data). The forward map acts triangularly along these chains (local rule shifts data according to direction and rank). Because non-local-finiteness supplies an infinite f.g. subgroup, configurations can realize chains of unbounded finite length with distinct positions; the inverse must therefore inspect an arbitrarily distant chain start and therefore cannot have uniform finite radius. The positive direction follows because locally finite groups bound the possible chain lengths inside each f.g. subgroup, allowing a uniform memory bound once bijectivity is given. The abstract supplies a coherent, self-contained argument with no evident internal gap or hidden assumption that would falsify the equivalence.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper proves that a group G is locally finite if and only if, for every alphabet A, every bijective cellular automaton A^G → A^G is reversible. Equivalently, when G is not locally finite, for every infinite A there exists a bijective CA whose inverse fails to be a CA. The negative direction constructs an explicit counterexample on a countable alphabet via a three-track local rule (rank, direction, binary data) that implements a triangular forward map along finite directed chains of arbitrary length; bijectivity holds but the inverse requires inspecting arbitrarily distant chain origins and thus lacks uniform finite radius. The positive direction follows because local finiteness bounds chain lengths within each finitely generated subgroup, yielding a uniform memory bound once bijectivity is assumed.","tokens_in":1858,"tokens_out":378,"duration_ms":38534,"significance":"If the details hold, the result supplies a complete group-theoretic characterization resolving Open Problem 2 of Ceccherini-Silberstein–Coornaert without any periodicity hypothesis. The construction is direct, parameter-free, and self-contained, with an explicit local rule and a falsifiable distinction between bounded versus unbounded chain lengths; this constitutes a clean equivalence in the theory of cellular automata over groups.","major_comments":[],"minor_comments":[{"comment":"The abstract states that the counterexample works on a countable alphabet; the main text should explicitly record the cardinality of A used in the construction (e.g., in the paragraph introducing the three-track alphabet) to facilitate immediate verification.","section":null},{"comment":"A brief sentence recalling the precise wording of Open Problem 2 (including its page reference in the monograph) would improve accessibility for readers who have not consulted the source.","section":null}],"recommendation":"accept","confidential_remarks":"The reader's low-confidence note stems from abstract-only access; the provided argument sketch and the statement that full text is available indicate the concern does not land. No citation-pattern or scope issues are apparent."},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the careful reading and for the positive assessment of the manuscript. The report correctly summarizes the main result and its relation to Open Problem 2. We are pleased that the referee finds the construction direct and the equivalence clean.","responses":[],"tokens_in":1266,"tokens_out":67,"duration_ms":11592,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main result is the characterization: a group G is locally finite if and only if, for every alphabet A, every bijective cellular automaton on A^G is reversible. This directly answers Open Problem 2 from the Ceccherini-Silberstein–Coornaert book and removes the periodicity restriction on the negative side.\n\nThe construction for the negative direction is the clearest new piece. When G is not locally finite it has an infinite finitely generated subgroup, which supplies finite directed chains of arbitrary length. The authors encode these on a three-track countable alphabet (rank, direction, binary data) and define a triangular forward map that shifts data along the chains. The map is bijective because it is invertible pointwise, yet the inverse must reach back to the head of a chain whose length is unbounded, so it cannot have a uniform finite radius. The positive direction follows because local finiteness bounds chain lengths inside each finitely generated subgroup, giving a uniform memory bound once bijectivity is assumed.\n\nThe argument is direct and avoids circularity or fitted parameters. The stress-test sketch shows no internal gap in the equivalence. One small thing worth checking in the full text is whether the local rule is written with an explicit finite radius that works uniformly across all configurations; the description suggests it does, but the verification matters for the claim that the forward map is genuinely a cellular automaton.\n\nThe paper is short, focused, and aimed at people who work on cellular automata over groups or algebraic symbolic dynamics. Anyone who has cited the open problem will want the details. It is worth sending to referees because the central claim is a clean, falsifiable group-theoretic statement backed by an explicit construction.","headline":"The paper settles the open problem with an if-and-only-if: G is locally finite exactly when every bijective CA over any alphabet is reversible.","tokens_in":2326,"tokens_out":415,"would_cite":true,"duration_ms":25842,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"A group is locally finite exactly when every bijective cellular automaton on its configurations is reversible over any alphabet.","keywords":["locally finite groups","cellular automata","reversibility","bijective maps","configuration spaces","group actions"],"falsifier":"An explicit locally finite group together with a bijective cellular automaton on some alphabet whose inverse cannot be realized by any finite-radius local rule would falsify the characterization.","tokens_in":2586,"feed_emoji":"","tokens_out":704,"duration_ms":29932,"temperature":0.7,"pith_summary":"The paper establishes that local finiteness of a group G is the precise group-theoretic condition guaranteeing that every bijective cellular automaton from A^G to A^G remains reversible, no matter how large the alphabet A is chosen. For finite alphabets the implication from bijectivity to reversibility is already known to hold in general; the new result removes any periodicity assumption and handles infinite alphabets by showing that non-local-finiteness always produces a counterexample. The counterexample is built on a countable alphabet whose local rule uses three tracks to produce a triangular shift along arbitrarily long finite chains; the resulting map is bijective yet its inverse cannot be realized by any finite-radius local rule. This directly answers the open question whether the implication survives without periodicity.","feed_headline":"Locally finite groups make every bijective CA reversible","feed_subtitle":"A group admits a non-reversible bijective cellular automaton over some alphabet precisely when it fails to be locally finite.","key_machinery":"Triangular forward map along finite directed chains of arbitrary length, realized by a three-track local rule (rank, direction, binary data) that exploits the existence of such chains precisely when G is not locally finite.","core_discovery":"A group G is locally finite if and only if, over every alphabet, every bijective cellular automaton A^G→A^G is reversible. Equivalently, if G is not locally finite, then for every infinite alphabet A there exists a bijective cellular automaton A^G→A^G whose inverse is not a cellular automaton. The counterexample is already obtained on a countable alphabet whose local rule has a rank track, a direction track and a binary data track; the forward map is triangular along finite directed chains of arbitrary length, so its inverse is defined pointwise but has no uniform finite memory.","pith_inferences":["The same chain-length obstruction may control other dynamical properties such as the existence of continuous inverses for injective maps on configuration spaces.","Analogous characterizations could be sought for reversibility of cellular automata on semigroups or other algebraic structures that admit directed chains of unbounded length."],"forward_implications":["Every bijective cellular automaton over a locally finite group is reversible for alphabets of any cardinality.","The periodicity hypothesis is unnecessary for constructing counterexamples when the group is not locally finite.","Open Problem 2 receives an affirmative answer: bijectivity implies reversibility precisely on locally finite groups.","The same counterexample construction works already on countable alphabets."],"fun_headline_variants":["Local finiteness characterizes reversible bijective CA","Non-locally finite groups admit non-reversible bijective CA","Bijective CA are reversible exactly for locally finite groups","Group local finiteness iff bijective CA reversibility","Bijective CA reversible only for locally finite groups"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"When a group fails to be locally finite it contains finite directed chains of arbitrary length that can be used to build a triangular map whose inverse requires unbounded memory.","fun_headline_variants_meta":{"raw":{"variants":["Local finiteness characterizes reversible bijective CA","Non-locally finite groups admit non-reversible bijective CA","Bijective CA are reversible exactly for locally finite groups","Group local finiteness iff bijective CA reversibility","Bijective CA reversible only for locally finite groups"]},"model":"grok-4.3","cost_usd":0.008501,"raw_usage":{"total_tokens":3857,"prompt_tokens":698,"num_sources_used":0,"completion_tokens":65,"cost_in_usd_ticks":85012000,"prompt_tokens_details":{"text_tokens":698,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3094,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":698,"tokens_out":65,"duration_ms":41068,"temperature":1.0,"reasoning_tokens":3094,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-30T04:07:28.701227+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit locally finite group together with a bijective cellular automaton on some alphabet whose inverse cannot be realized by any finite-radius local rule would falsify the characterization.","supporting_citations":[],"review_version":1}