{"id":"aa718241-5341-4e26-bbaf-4e33486e7fbf","arxiv_id":"2607.08330","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Type I behavior holds exactly when the graph has the shrink property; otherwise Type F versus Type M is algorithmically decidable via finite enumeration of admissible confined configurations.","lead":"Zero-temperature Ising spin dynamics on infinite 1D quasi-transitive graphs has infinite fluctuations at every site if and only if the graph has the shrink property. When the property fails, a finite algorithm decides between total fixation and mixed regimes with blinkers.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The reader correctly isolates the p=1/2 restriction as the only substantive limitation and correctly judges that it does not affect the proved statements. The load-bearing technical steps—uniform lower bound via FKG/attractivity for the sufficiency of the shrink property, and the finite pigeonhole reduction for decidability of F versus M—are free of free parameters, circular reasoning, or unstated assumptions that would break inside the class G. The constructive large-blinker example further corroborates that the enumeration bound is not vacuous. Consequently no adjustment to the ACCEPT verdict is warranted.","tokens_in":18397,"tokens_out":445,"duration_ms":4439,"concrete_test":"Independently re-derive the cut-and-paste reduction of Theorem 2 (Case 2) for a concrete arithmetic-lattice example with L=2, K=2: enumerate all admissible windows of length N, confirm that any zero-energy flip on a longer admissible configuration reduces to one inside A_N, and verify that the reduced configuration remains admissible and still admits the flip. If the reduction fails for any such window the decidability claim collapses; otherwise the argument is confirmed.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claims of Theorems 1 and 2 hold under the paper’s stated hypotheses. The equivalence of the shrink property with Type I at p=1/2 rests on a standard attractivity/FKG + Lévy Borel–Cantelli argument that is correctly specialized to the one-dimensional quasi-transitive setting (Section 3). The algorithmic classification of Type F versus Type M for graphs without the shrink property is justified by an exhaustive finite enumeration of admissible confined configurations of length at most N=4K(M+1)+C_W together with a pigeonhole cut-and-paste reduction that preserves local fields and admissibility (Theorem 2). No hidden unboundedness, circularity, or missing case appears in either argument. The restriction of the Type-I statement to p=1/2 is already flagged by the authors as a conjecture and does not undermine the theorems that are proved.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper studies zero-temperature Glauber dynamics for the ferromagnetic Ising model on infinite one-dimensional quasi-transitive graphs G=(Z,E) with finite interaction range K. It proves that the I(G,1/2)-model is of Type I (every vertex flips infinitely often a.s.) if and only if G has the shrink property (no finite stable sets). Equivalence of the shrink property with right/left deformability of minimal icut-sets is established combinatorially (Lemma 1), and an algorithmic criterion via monotone interface advance is given (Proposition 1 and the greedy exploration). For graphs lacking the shrink property, the system is of Type F or Type M according to whether a finite set A_N of admissible confined configurations (bounded by fixed non-deformable walls) contains a zero-energy flip; this is decidable by exhaustive enumeration plus a pigeonhole cut-and-paste reduction (Theorem 2). The classification is independent of p in (0,1) and robust under fast quenching. Constructive examples of arbitrarily large blinkers and of rigid Type-F tilings are supplied.","tokens_in":18544,"tokens_out":738,"duration_ms":6393,"significance":"The work gives a complete, constructive trichotomy (I/F/M) for a natural class of one-dimensional quasi-transitive graphs, going beyond the planar quasi-transitive results of [6] that only separated Type I from non-I. The algorithmic decidability of both the shrink property and the F-versus-M distinction, together with the explicit spatial bound N=4K(M+1)+C_W and the cut-and-paste reduction that preserves local fields, is a genuine contribution that turns an asymptotic classification into a finite combinatorial procedure. The constructive example of blinkers of arbitrary size and the robustness under fast quenching further strengthen the result. The restriction of the Type-I statement to p=1/2 is already flagged as a conjecture and does not diminish the theorems that are proved.","major_comments":[],"minor_comments":[{"comment":"In the proof of Theorem 1 the mapping of parameters to Lemma 9/Theorem 4 of [6] is asserted but not written out; a short explicit dictionary (or a self-contained one-paragraph argument) would make the one-dimensional adaptation fully transparent.","section":null},{"comment":"Section 5.1 describes the decorated lattice supporting large blinkers and refers to Figure 1, yet the figure is only sketched in text; a properly typeset diagram would help the reader verify the field-cancellation construction.","section":null},{"comment":"The constant C_W that appears in the definition of N is described as depending only on the chosen walls W_L, W_R; a one-line bound in terms of K and the wall diameters would make the complexity estimate completely explicit.","section":null},{"comment":"A few minor typos appear (e.g., “icut-set” is sometimes written without the hyphen; “L´evy” accentuation is inconsistent). These are purely cosmetic.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is technically solid and fits the scope of a probability journal that publishes rigorous interacting-particle-system results. The heavy reliance on the author’s earlier planar work [6] is properly cited and does not raise novelty concerns; the one-dimensional decidability results are new. No ethical or citation-pattern issues."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This paper finishes the job for one-dimensional quasi-transitive graphs of finite range: Type I if and only if the graph has the shrink property (at p=1/2), and when it does not, a finite enumeration decides Type F versus Type M. That is the real advance over the earlier planar work.\n\nWhat is new is the combinatorial package. Lemma 1 equates the shrink property with deformability of minimal icut-sets; Proposition 1 turns that into a greedy algorithm that terminates after a bounded number of steps. Theorem 2 then shows that, once you fix two non-deformable walls, you only need to inspect admissible confined configurations of length at most N=4K(M+1)+C_W; a pigeonhole cut-and-paste argument reduces any larger blinker to one inside that bound. The explicit decorated lattice that supports blinkers of arbitrary size is a clean constructive example. The proofs stay elementary (attractivity, FKG, Lévy Borel–Cantelli, spatial ergodicity) and do not hide free parameters or circular definitions.\n\nThe soft spot is exactly the one the authors flag: the sufficiency half of Theorem 1 is written only for the symmetric density. The conjecture that the same geometric condition works for all p in (0,1) is left open; that is a genuine limitation, not a fatal one. Everything else—decidability of the three regimes, insensitivity to p once the shrink property fails, recurrence of consensus states inside blinkers—looks solid.\n\nThis is for people who work on coarsening, majority dynamics, or interacting particle systems on non-Euclidean graphs. The algorithmic criterion is concrete enough that someone could implement it for a concrete periodic graph tomorrow. I would send it to a serious referee without hesitation; the main theorems are ready for scrutiny and the open conjecture is honestly stated.","headline":"Clean, complete classification of zero-temperature Ising dynamics on 1D quasi-transitive graphs, with a genuine finite decision procedure for the three classical types.","tokens_in":19161,"tokens_out":473,"would_cite":true,"duration_ms":5146,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["82C20","82C22","37B15","68Q05"],"pacs":[],"model":"grok-4.5","headline":"Zero-temperature Ising dynamics on one-dimensional quasi-transitive graphs fluctuate forever exactly when the graph has the shrink property, and the three possible long-time regimes are algorithmically decidable.","keywords":["Coarsening","Zero-temperature dynamics","Quasi-transitive graphs","Decidability","Asynchronous cellular automata","Glauber dynamics","Shrink property","Blinkers"],"falsifier":"Produce a concrete one-dimensional quasi-transitive graph that possesses the shrink property yet, under product initial measure of density 1/2, has a positive-density set of sites that fixate almost surely; or exhibit a graph already known to be Type I (for example the ordinary integer line) that the greedy exploration algorithm incorrectly reports as lacking the shrink property.","tokens_in":19253,"feed_emoji":"🔄","tokens_out":951,"duration_ms":20836,"temperature":0.7,"pith_summary":"The paper classifies the long-time fate of zero-temperature majority spin-flip dynamics on infinite one-dimensional graphs that are invariant under a fixed translation and have finite interaction range. It proves that every site flips infinitely often almost surely if and only if the graph satisfies the shrink property: every finite set of vertices contains at least one vertex that is connected at least as strongly outside the set as inside it. When the shrink property fails, finite stable walls form and the dynamics fall into either complete local fixation or a mixed regime containing both frozen sites and perpetual zero-energy blinkers; which of the two occurs is decided by a finite enumeration of admissible configurations trapped between walls. The same geometric criteria remain valid under fast cooling to zero temperature, and an explicit construction produces blinkers of arbitrarily large size. The result therefore supplies a complete, computable phase diagram for any such graph.","feed_headline":"Ising spins flip forever exactly when the graph shrinks","feed_subtitle":"On 1-D quasi-transitive graphs the three long-time regimes are fully decidable from geometry alone","key_machinery":"The shrink property (equivalently, right- and left-deformability of every minimal infinite cut-set) together with the finite set A_N of admissible configurations confined between two fixed stable walls; the former decides Type I, while exhaustive inspection of A_N decides Type M versus Type F.","core_discovery":"For any one-dimensional quasi-transitive graph G of finite range, the zero-temperature Ising process at density 1/2 is of Type I (every vertex flips infinitely often) if and only if G has the shrink property. When the shrink property is absent the process is of Type M or Type F according as a finite, explicitly bounded set of admissible confined configurations contains a zero-energy flip; the distinction is algorithmically decidable in finite time.","pith_inferences":["The finite-check criterion suggests that analogous cut-set enumerations could decide zero-temperature phases on higher-dimensional quasi-transitive graphs once suitable notions of deformable interfaces are available.","If the paper’s conjecture that the shrink property implies Type I for every density p is true, the entire phase diagram becomes purely geometric and independent of the initial measure.","The reduction of blinker detection to an auxiliary spatial automaton links the Ising classification problem to classical decidability questions for one-dimensional cellular automata."],"forward_implications":["Any finite description of a one-dimensional quasi-transitive graph can be fed to an algorithm that returns whether the zero-temperature dynamics are Type I, Type F or Type M.","When the shrink property fails the asymptotic regime is independent of the initial density p in (0,1).","Blinkers need not be microscopic: graphs exist that support zero-energy fluctuating clusters of arbitrarily large finite size.","The geometric classification remains valid for any temperature schedule that cools to zero sufficiently fast that the total number of energy-increasing flips is almost surely finite."],"fun_headline_variants":["Ising spins flip forever iff the graph shrinks","Type I Ising holds exactly when graphs shrink","Zero-temp Ising: infinite flips on shrink graphs only","Graph shrink decides infinite spin flips at zero temp","Ising regimes fully decidable from graph geometry"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The proof that the shrink property forces perpetual flipping of every site relies on the symmetric initial density one-half and the FKG inequality to guarantee that favorable monochromatic boundaries of fixed width recur infinitely often.","fun_headline_variants_meta":{"raw":{"variants":["Ising spins flip forever iff the graph shrinks","Type I Ising holds exactly when graphs shrink","Zero-temp Ising: infinite flips on shrink graphs only","Graph shrink decides infinite spin flips at zero temp","Ising regimes fully decidable from graph geometry"]},"model":"grok-4.5","effort":"low","cost_usd":0.003068,"raw_usage":{"total_tokens":1062,"prompt_tokens":730,"num_sources_used":0,"completion_tokens":58,"cost_in_usd_ticks":30680000,"prompt_tokens_details":{"text_tokens":730,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":274,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":730,"tokens_out":58,"duration_ms":3298,"temperature":1.0,"reasoning_tokens":274,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T09:16:36.500221+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Produce a concrete one-dimensional quasi-transitive graph that possesses the shrink property yet, under product initial measure of density 1/2, has a positive-density set of sites that fixate almost surely; or exhibit a graph already known to be Type I (for example the ordinary integer line) that the greedy exploration algorithm incorrectly reports as lacking the shrink property.","supporting_citations":[],"review_version":1}