{"id":"916f8e46-6961-4fcb-955f-340fa6fe6c71","arxiv_id":"2607.16971","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"On a b-ary tree, a vertex-reinforced walk with sublinear memory undergoes a condensation transition at finite β_c: above it, one vertex holds an O(1) fraction of visits while the visited range still grows, with β_c ∝ b−1.","lead":"Simulations of a sublinearly vertex-reinforced random walk on a b-ary tree show a transition: below a reinforcement strength β_c the walk spreads and visits new sites at a linear rate, while above β_c one vertex absorbs a fixed fraction of visits even though the walk keeps discovering new sites, slowly. The paper maps the phase boundary in the (a, β) plane and finds that the boundary scales as b−1, an organizing rule for a previously open regime.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The sharpness of the transition rests on finite-time extrapolation: t≤3×10^7 and 24 realizations cannot exclude a slow drift of β_c, which would reduce the central claim to a crossover.","rationale":"The paper is a carefully hedged numerical study; its central claim—a sharp condensation transition stable in observation time—is exactly the claim that outruns the numerics. The reader's weakest assumption identifies the most load-bearing issue: the extrapolation from t≤3×10^7. The crossing sequence is consistent with no drift, but with 24 realizations and scatter ~0.1, a slow drift—logarithmic approach to a different asymptotic value, or even β_c=0 with exponentially delayed condensation—cannot be excluded. This is not a manufactured concern: the paper itself concedes that the coexistence signatures 'can equally reflect a broad distribution of trapping and escape times' and that 'observation time is not equivalent to an equilibrium system size.' The alternative scenario (β_c=0, any positive reinforcement eventually condenses after a divergent time) is physically natural for sublinear reinforcement and would invalidate the central claim of a finite-β_c sharp transition while preserving all finite-time observations. Other potential weaknesses—the 'parameter-free' language around Eq. (11), the small counts behind the log-vs-power distinction—are secondary: they affect the phase diagram's theoretical closure and the description of the slow phase, not the existence of the transition. The paper's internal consistency, explicit tests of the neighbor coupling, and release of code and seeds are real strengths, but they do not remove the need for longer-time verification. I therefore do not see a reason to change the reader's conditional verdict; it remains conditional, with the concrete test being an order-of-magnitude extension of the observation time and a quantitative drift fit.","tokens_in":11652,"tokens_out":5039,"duration_ms":51433,"concrete_test":"Extend the observation-time series at a=0.6, b=2 by two orders of magnitude (to 3×10^9 steps) for β near the apparent crossing (1.4≤β≤1.7), using at least 100 realizations. Estimate β_c(t_max) from both the ν_R=1/2 crossing and the m1 half-height at t_max=3×10^7, 3×10^8, 3×10^9. Fit the sequence to β_c + c t^{-ω} versus β_c + c/log t (and versus β_c=0). If the crossing moves by more than ~0.1 between 3×10^7 and 3×10^9, or the m1 half-height fails to converge, the sharp-transition claim is not supported; if it remains within scatter, the concern is settled. A cheaper complementary check: perform a scaling collapse of m1 vs (β−β_c)t^ω and test whether the collapse improves with t.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is a sharp condensation transition at finite β_c, stable in observation time. The evidence is the ν_R=1/2 crossing sequence β_c(t_max)=1.56,1.69,1.50,1.55 at t_max=10^5,10^6,10^7,3×10^7 (Section 6, Figure 4), with scatter ~0.1 over 24 realizations. This bounds but does not exclude a slow drift: a change of ~0.1 per decade would be invisible on this window, yet would make the 'threshold' a finite-time crossover that moves with t. The authors themselves state in Section 6 that the coexistence signatures 'at finite observation time can equally reflect a broad distribution of trapping and escape times' and that they 'do not claim a proven first-order transition.' If the true β_c is zero (any β>0 eventually condenses after a divergent time) or if β_c(t) continues to drift upward, the central claim of a sharp finite-β_c condensation fails, even though the finite-time phenomenology—m1 stability, growing susceptibility, bimodality—remains. Since the entire phase diagram is mapped using ν_R=1/2 at finite time, and the m1 markers are demonstrated at only one point (a=0.6,b=2), the finite-time extrapolation is the load-bearing assumption.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies a vertex-reinforced random walk on the rooted b-ary tree with sublinear reinforcement weights w_v=1+β n_v^a. It claims a condensation transition at finite β_c(a,b): below β_c the range grows linearly and the occupation spreads; above β_c a single vertex carries an O(1) fraction of the time while the range still grows very slowly, better described by log t than by a power. The authors identify the transition via the ν_R=1/2 crossing of the range exponent, confirm it with four independent estimators at one parameter point (a=0.6,b=2), and report no systematic drift out to t=3×10^7. They also derive a reversible stationary measure for the frozen condensed core, μ_v∝w_v∑_{u∼v}w_u, test the neighbour coupling non-circularly through the ratio Q(d), and propose a branching-number law β_c∝b−1, validated by collapse of the measured lines for b=2,3,4.","tokens_in":11975,"tokens_out":4647,"duration_ms":43947,"significance":"If the finite-time extrapolation is correct, this is a valuable contribution to the largely open regime of sublinear vertex reinforcement. The paper supplies a numerical phase diagram, a reversible quasi-stationary measure for the condensed core, a direct test of the neighbour coupling that avoids the obvious self-counting inflation, and a b−1 scaling law with bootstrap confidence intervals. The authors are unusually careful: they distinguish occupation condensation from finite-range localization, state that the frozen-environment argument is an adiabatic scaling ansatz, and explicitly disclaim a proven first-order transition. The promise of reproducible code and scripts is a further strength. The main reservation is that the central 'sharp transition' claim rests on finite-time, small-sample extrapolation; the paper would be stronger if the language were matched to what the data actually establish.","major_comments":[{"comment":"The β_c(t_max) sequence 1.56, 1.69, 1.50, 1.55 over t_max=10^5 to 3×10^7, with only 24 realizations and scatter ~0.1, bounds but does not exclude a slow drift of order 0.1 per decade. The abstract's 'sharp transition' and 'no systematic drift' overstate what the data show. The authors' own caveat that the coexistence signatures may reflect a broad distribution of trapping and escape times is the correct reading. Please either add per-point uncertainties and phrase the claim as 'no detectable drift within resolution', or explicitly recast the transition as an effective finite-time crossover whose asymptotic nature is unresolved.","section":"Section 6, Fig. 4"},{"comment":"The branching-number law β_c=(b−1)/\\bar m(a)^a is closed through \\bar m(a), which is defined by inverting the measured β_c; it is not measured independently. The b-collapse in Table 1 therefore demonstrates self-consistency of the one-parameter scaling ansatz, but it does not validate the frozen-environment criterion as a predictive mechanism. The abstract's wording 'predicting β_c ∝ b−1' is too strong. Either measure \\bar m microscopically from the frontier visit-count distribution, or present \\bar m explicitly as an effective fitted parameter and describe the b-collapse as a consistency check.","section":"Section 5, Eq. (11)"},{"comment":"The entire phase map in Figure 1 is based on only 8 realizations, with no error bars, and the ν_R=1/2 definition is used as a proxy for the condensation transition. The four-estimator agreement that justifies this proxy is demonstrated at a single point, a=0.6, b=2, with no check that the m_1-based markers coincide with ν_R=1/2 elsewhere in the (a,β) plane or for other b. To support the comprehensive phase diagram, at least one additional (a,b) point with the full set of markers, and error estimates for the Figure 1 sweeps, are needed.","section":"Section 3 and Section 6"},{"comment":"Above β_c the range counts are very small: at β=6, R grows only from 19 at t=4×10^4 to 48 at t=3×10^7. The held-out extrapolation favouring log t over a power law is based on these small counts, so the claim that growth is 'better described by log t than by any power' is not established as an asymptotic statement. Because the distinction between condensation and bounded-range localization depends on whether the range continues to grow, this needs confidence intervals on the extrapolation errors or longer data before it can be used as a central conclusion.","section":"Section 6, range growth"}],"minor_comments":[{"comment":"The caption should state the number of realizations (8) and explicitly note that no error bars are shown. The fit interval for ν_R used in this figure is given in Section 2 but should be repeated in the caption.","section":"Figure 1"},{"comment":"The statement 'four estimators locate the same threshold' appears in the abstract without qualification; the agreement is demonstrated at a=0.6, b=2. Rephrase to avoid implying the full check was done in the whole phase plane.","section":"Section 6"},{"comment":"The bootstrap confidence intervals would be clearer if the resampling scheme were stated explicitly (e.g., resampling over realizations or over time blocks).","section":"Section 5, Table 1"},{"comment":"The normalization constant C and the boundary conditions of the recursion (at the root and at the edge of the core) are not specified. A short explanation would help the reader reproduce the numerical relaxation described in the text.","section":"Section 4, Eq. (6)"},{"comment":"The repository is 'made public on acceptance'; to substantiate the reproducibility claim at review time, consider providing a reviewer link or stating that code is available on request.","section":"Data availability"}],"recommendation":"major_revision","confidential_remarks":"This is a well-written numerical study with honest caveats, but the central claim of a sharp transition is stronger than the finite-time evidence supports. The revision should temper the title/abstract language, add error bars or uncertainties to the drift analysis, and clarify that the b−1 law is a self-consistent scaling ansatz rather than an independently verified prediction. With those changes, the paper would be a solid contribution to the sublinear VRRW literature."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague — this one is worth engaging, but keep the abstract's 'sharp transition' in quotes when you summarize it. The paper is honest: it repeatedly flags what is ansatz and what is open, it does not claim a bounded range or a proven first-order transition, and it ships code and data (on acceptance). The genuinely new pieces: sublinear VRRW on b-ary trees was open; the reversible-core description µ ∝ w_v W_v is tested by the Q(d) estimator, which is non-circular and flat across the core; and the β_c ∝ b−1 collapse in Table 1 holds with bootstrap CIs across b=2,3,4 at several values of a. That collapse is an empirical scaling law — the closure through \\bar m(a,b) is read backward from the data, so the 'parameter-free prediction' label overstates the evidence, but the collapse itself is real. The a=1/2 marginal-profile statement from the recursion is exact and clean.\n\nThe soft spots are where you'd expect them. The sharpness of the transition rests on 24 realizations out to 3×10^7: the ν_R=1/2 crossings (1.56, 1.69, 1.50, 1.55) bound but do not exclude a slow drift in β_c, and the authors themselves concede that the coexistence signatures could be a broad distribution of trapping times. That is acceptable for a numerical paper, but the title and abstract overstate the asymptotics. The four-estimator agreement is at one parameter point; Figure 1 uses 8 realizations without error bars; and the slow-phase range counts (19 to 48) make the log-vs-power comparison suggestive, not decisive.\n\nOne thing that will annoy the subfield: the introduction and Remark 1 say Chen–Kozma left a∈[1/2,1) open on Z. That is wrong — Basdevant, Schapira and Singh, cited as [9] but never mentioned in the text, proved localization for a>1/2. The paper's own condensation-vs-localization distinction is exactly their territory and needs to be engaged.\n\nVerdict: send it to a serious referee. Reproducible numerics, a non-circular core test, and a clean citable scaling law. Fix the literature error and soften the sharp-transition language and it is a solid contribution to the self-interacting random walk literature.","headline":"Genuinely new numerics for sublinear VRRW on trees, honest hedging, but the sharp-transition claim is finite-time and the paper misstates what is known on Z (a>1/2 was settled by Basdevant–Schapira–Singh).","tokens_in":12482,"tokens_out":6395,"would_cite":true,"duration_ms":59467,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60K35","82C41","60J10"],"pacs":[],"model":"deepseek-v4-flash","headline":"A sublinearly reinforced random walk on a b-ary tree condenses its occupation onto one vertex above a finite strength β_c(a,b), with the range still growing slowly — a sharp transition stable out to t=3×10^7.","keywords":["vertex-reinforced random walk","condensation transition","occupation measure","regular tree","branching number","reversible Markov chain","range exponent","sublinear reinforcement"],"falsifier":"Run the same walk at a=0.6, b=2 to t ≥ 10^8 with hundreds of realizations and check whether the ν_R=1/2 crossing keeps moving; or measure the waiting-time distribution between discoveries of new vertices in the condensed phase — if the hazard of discovering a new vertex decays so that R(t) saturates, the 'slowly unbounded range' picture would fail; alternatively, if m1 at β>β_c decays toward zero at longer times, there is no stable condensate.","tokens_in":11487,"feed_emoji":"🌳","tokens_out":7646,"duration_ms":60906,"temperature":0.7,"pith_summary":"The paper tries to establish that the sublinear vertex-reinforced random walk on a regular tree — a walk that favors revisiting neighbors in proportion to 1+β n^a — has a genuine condensation transition in the occupation measure. Below a finite critical reinforcement β_c(a,b), the walk spreads: the most-visited vertex holds a vanishing fraction of time and the range grows linearly. Above β_c, a single vertex captures an order-one fraction of the walk's time, stable over the observation window, while the walk continues to discover new vertices at a very slow, effectively logarithmic, rate. The authors argue this is occupation condensation, not finite-range localization, because the support keeps growing. If true, it provides a computable example of a self-built environment condensing a random walk's occupation, and it separates the role of the geometry (branching number b) from the memory exponent a.","feed_headline":"A tree walk with memory condenses onto one vertex past a threshold","feed_subtitle":"Below the threshold the walk spreads; above it one site dominates, yet the walk keeps discovering new vertices.","key_machinery":"The argument runs on three linked objects. (1) The frozen-environment reversibility: for fixed weights w_v=1+β n_v^a, the walk is reversible with stationary measure μ_v ∝ w_v W_v, W_v=∑_{u∼v} w_u, and edge conductances c_uv=w_u w_v. (2) The core recursion: on the backbone, μ_v ∝ w_v W_v reduces to the nonlinear three-term recursion μ(d)=C μ(d)^a [μ(d−1)^a + μ(d+1)^a], which fixes the shape of the condensed droplet and identifies a=1/2 as the marginal exponent for geometric tails. (3) The frontier balance: reading the frozen walk via the branching-number criterion for biased walks on trees — escape while the backtrack weight λ_eff=1+β n_p^a is below b — gives n* = ((b−1)/β)^{1/a} and, through","core_discovery":"The central discovery is a sharp condensation transition for the occupation measure of the sublinear VRRW on the rooted b-ary tree. At β below β_c(a,b), the range exponent ν_R tends to 1 (linear spreading) and m1, the maximum visit fraction, tends to zero. Above β_c, m1 tends to an O(1) constant — e.g. 0.27 at β=2.5, t=10^5, and 0.28 at t=10^7 — while the range R(t) keeps growing, with local exponent ν_R ≈ 0.1 and held-out fits favoring log t over power laws; R is not found to be bounded. Four estimators (m1 half-height, susceptibility peak, Binder crossing, and ν_R=1/2) locate the same threshold, with the ν_R=1/2 crossing showing no systematic drift for t up to 3×10^7. In the condensed phas","pith_inferences":["If the transition is genuine, the condensation-versus-localization distinction should matter on Z^d: the natural order parameter is the condensate fraction, not the range, and sublinear reinforcement may produce a condensate with unbounded support there as well.","The recursion (6) is of the type that generates non-uniform scaling; the occupation measure on the core may be multifractal, and computing its spectrum would be a natural test of the recursion's universality.","The scaling law β_c ∝ b−1 invites a test on non-regular trees: replace b−1 by the branching number br(T) of the tree and check collapse on Galton–Watson or other random trees.","The apparent threshold near a≈0.4 could be either a genuine a_c>0 or a steep divergence of β_c; distinguishing them requires probing larger β or developing a dynamic (non-frozen) treatment, perhaps along the lines of exactly solvable edge-reinforced cases."],"forward_implications":["The occupation measure of the sublinear VRRW on a tree has two distinct long-time regimes separated by a finite β_c: linear spreading and condensate-plus-slow-spreading; the condensate fraction, not the range, is the right order parameter.","The transition line obeys β_c ∝ b−1 over the tested range, so the branch factor sets the threshold while the memory exponent a shapes it; the same law predicts β_c→0 as b→1.","The condensed core is described by the reversible measure μ_v ∝ w_v W_v, allowing quantitative predictions of occupation profiles, including the non-monotone droplet shape peaked a few levels below the root.","The a=1/2 exponent from the one-dimensional problem is not the threshold on trees; it governs only the marginal shape of the core, decoupled from the frontier escape that sets β_c.","Near the transition, run-to-run fluctuations do not vanish with time (non-self-averaging, bimodal m1, negative Binder cumulant), a coexistence-type signature that would carry over to a genuine first-order transition if the finite-time modes stabilize."],"fun_headline_variants":["Tree walk with memory condenses onto one vertex past a threshold","Reinforced walk on trees: occupation condenses, but range keeps growing","Sharp condensation of vertex-reinforced walk on b-ary tree","Memory-heavy walk on tree: one vertex dominates, yet never localizes"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The central claim of a sharp, stable transition rests on finite-time simulations with 24 realizations up to t=3×10^7; the crossing-point scatter of order 0.1 bounds but does not exclude a slow drift, and the distinction between logarithmically growing and slowly power-law-growing range is made on very small counts.","fun_headline_variants_meta":{"raw":{"variants":["Tree walk with memory condenses onto one vertex past a threshold","Reinforced walk on trees: occupation condenses, but range keeps growing","Sharp condensation of vertex-reinforced walk on b-ary tree","Memory-heavy walk on tree: one vertex dominates, yet never localizes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000803,"raw_usage":{"total_tokens":3467,"prompt_tokens":949,"completion_tokens":2518,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":693,"completion_tokens_details":{"reasoning_tokens":2441}},"tokens_in":693,"tokens_out":2518,"duration_ms":18718,"temperature":1.0,"reasoning_tokens":2441,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T19:23:00.113147+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same walk at a=0.6, b=2 to t ≥ 10^8 with hundreds of realizations and check whether the ν_R=1/2 crossing keeps moving; or measure the waiting-time distribution between discoveries of new vertices in the condensed phase — if the hazard of discovering a new vertex decays so that R(t) saturates, the 'slowly unbounded range' picture would fail; alternatively, if m1 at β>β_c decays toward zero at longer times, there is no stable condensate.","supporting_citations":[],"review_version":1}