{"id":"642012c4-e1bf-4d13-b29c-950f2b409bbc","arxiv_id":"2502.02535","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Explicit moment-generating-function conditions decide supercritical versus subcritical behavior in the Derrida-Retaux recursion with a random number of terms.","lead":"This paper proves simple tests on the initial distribution and the random number of copies that decide whether a tax-paying branching process grows without bound or collapses to zero. It extends the Derrida-Retaux model's known phase classification to the case where the number of terms is random.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1(1) silently assumes an exponential moment for N: with finite-mean heavy-tailed N, G(F_n(s)) is infinite for s>1 and the iterative inequality (5) cannot be started.","rationale":"The reader identified an implicit finiteness assumption on the mgf of X0. The same class of problem occurs one step deeper and is more load-bearing for the paper's stated goal of treating a random number of terms. The supercritical theorem deliberately allows unbounded N, and many distributions with finite mean have infinite exponential moments; for such N the generating-function recursion used in Lemma 1 produces infinite quantities immediately, independently of any regularity of F0. The paper's other inequalities are mostly sound: the Chebyshev bound vG'(v)≥EN G(v) is correct for v≥1, the convexity slip in the proof of Lemma 1 is a mislabeling rather than an error, and the tail argument in Lemma 2 is valid. The central claim is not disproved by this gap; a truncation-and-monotonicity argument appears to repair it. Hence the original conditional verdict remains appropriate: the theorem should either state an exponential-moment condition on N (or a finite-mean condition plus an approximation argument) before the proof as written can be accepted.","tokens_in":5514,"tokens_out":23368,"duration_ms":238297,"concrete_test":"Let a=1, X0~Bernoulli(p) with p=0.2, and let P(N=k)=C/k^3 for k≥1 normalized so EN=4. Then E X0<∞, F0 is entire, and D0(4,4)=12p-F0(4)=9p-1>0, so Theorem 1(1) applies. Verify directly that F_1(s)=E[s^{(Bin(N,p)-1)_+}}]=∞ for every s>1, so the recurrence (3) makes Lemma 1's D_1(s) undefined for s just below 4. To test whether the theorem survives, truncate N at K, define N_K=min(N,K), and compute Q_K for N_K using the paper's bounded-N argument; if Q_K>0 and Q is monotone nondecreasing in N, the result can be recovered, but this truncation argument is absent from the paper. If instead no uniform control is established, the proof is incomplete exactly where it treats unbounded N.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The proof of Theorem 1(1) in Section 3.2 iterates inequality (5), which contains G(F_n(s))/F_n(s) and uses G'(F_n(s)), where G is the generating function of N. For s>1, F_n(s)>1 whenever X_n is not almost surely zero, so the iteration requires G(z)=E[z^N] to be finite at z=F_n(s)>1. The model's stated assumptions (E X0<∞, P(N>1)>0) do not imply this: N can have finite mean and a power-law tail, e.g. P(N=k)~c/k^3, for which G(z)=∞ for every z>1. In that case equality (3) gives F_1(s)=∞ for every s>1, and the quantities D_1(s), F_1'(s) used in Lemma 1 are undefined. The theorem statement does not exclude such N; in fact part 1 is specifically for unbounded N. The reader's concern about F0 is real but secondary: even if F0 is entire, the proof breaks down one step later because of G(F_n(s)). This is a gap in the proof of the central sufficient condition, not merely a missing hypothesis on the initial variable. It is likely repairable, for example by truncating N at a large level and using monotonicity of Q in N, but as written the argument is not valid for a natural class of random N.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the Derrida–Retaux recursion X_{n+1} = (X_n^{(1)} + ... + X_n^{(N_{n+1})} - a)_+ with i.i.d. random family sizes N and a nonnegative integer initial value X_0. It defines the free energy Q as the limit of normalized expectations and proves Theorem 1, giving sufficient conditions for supercriticality (Q > 0) when D_0((EN)^{1/a}, EN) > 0 and, for bounded N with N <= M, for subcriticality (Q = 0) when D_0(1 + (M-1)/a, M) < 0. The proof uses moment generating functions, recursive inequalities for D_n(s) = (m-1)sF_n'(s) - aF_n(s), and elementary association inequalities. Theorem 2 specializes the result to a fixed number of terms n, recovering the known a = 1 case and giving a new result for a > 1.","tokens_in":5780,"tokens_out":8918,"duration_ms":85308,"significance":"The proposed conditions are explicit, involve no fitted parameters, and, if valid, provide a practical moment-generating-function test for the phase of the Derrida-Retaux model with random family sizes. The paper is self-contained and the main recursive inequalities in Lemmas 1 and 3 are essentially correct once the finiteness issues discussed below are resolved. The fixed-n specialization in Theorem 2 is a genuine extension of the a = 1 result in [2] to a > 1. The chief weakness is that Theorem 1(1) is not proved in the stated generality because the argument requires G(z) = E[z^N] to be finite at values z > 1, which is not implied by the stated assumptions on N.","major_comments":[{"comment":"The proof of the supercriticality criterion is not valid for the stated generality because it silently requires the generating function G(z) = E[z^N] to be finite at z = F_n(s) > 1. For an unbounded N with finite mean and tail P(N = k) ~ c/k^3, G(z) is infinite for every z > 1; then (3) gives F_1(s) = infinity and the quantities in (5) are undefined. The assumptions E X_0 < infinity and P(N > 1) > 0 do not exclude this case. In addition, the condition D_0((EN)^{1/a}, EN) requires F_0((EN)^{1/a}) to be finite, which also is not implied by E X_0 < infinity. The theorem should either add explicit hypotheses, for example F_0((EN)^{1/a}) < infinity and G finite on [1, F_0((EN)^{1/a})], or the proof should establish part (1) by a truncation and monotonicity argument that avoids evaluating G at values where it is infinite.","section":"Theorem 1(1), Section 3.2, Eq. (5)"},{"comment":"In the proof of Lemma 3, the chain vG'(v) <= E[N v^N] <= EN * E[v^N] <= M G(v) contains the false inequality E[N v^N] <= EN * E[v^N] for v > 1, because N and v^N are positively correlated. The desired bound vG'(v) <= M G(v) follows directly from the pointwise inequality N <= M, so the lemma is correct but the given justification must be replaced.","section":"Lemma 3, Section 3.3"}],"minor_comments":[{"comment":"The function f_1(y) = a(EN)^{y/a} is convex, not concave. The conclusion f_2(y) >= f_1(y) is nonetheless true because a convex function lies below its chord between the endpoints y = 0 and y = a; the proof should state this correctly.","section":"Lemma 1, Eq. (6)"},{"comment":"The left-hand side of (7) is written with s(EN - 1)F'_{n+1}(s) - aF_{n+1}(s), but for D_{n+1} it should be s(M - 1)F'_{n+1}(s) - aF_{n+1}(s).","section":"Inequality (7), proof of Lemma 3"},{"comment":"The sentence 'By assumption y >= 1, s >= 1 + 1/a' contains a typo; the hypothesis of Lemma 3 is s >= 1 + (M-1)/a, and the displayed implication should use this bound.","section":"Proof of Lemma 3"},{"comment":"The phrase 'Let it be D_0(s,m) = ...' is awkward; 'Let D_0(s,m) = ...' is the standard wording.","section":"Theorem 1 statement"},{"comment":"References [5] and [7] appear in the bibliography but are not cited in the body of the paper; the authors should add citations or remove the entries.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The paper is honest and self-contained, and I see no indication of circularity or parameter fitting. The main issue is a missing hypothesis on N in Theorem 1(1), which is load-bearing but likely repairable by adding an exponential-moment assumption or by a truncation argument. The two proof errors I found (the convexity statement and the false E[N v^N] inequality) are local and correctable. I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Chen, quick take: this paper extends Derrida–Retaux criticality criteria to a random number of terms N and to a>1 for fixed n. The theorems are new relative to what I know, and the generating-function machinery is the right tool. The proofs are largely sound: Lemma 4 is a neat Chebyshev-type rearrangement, and the monotonicity arguments in Sections 3.2 and 3.3 are convincing once the stated inequalities hold. The mislabeled concavity in Lemma 1 (f1 is convex, not concave) is a genuine typo, but the inequality f2(y) ≥ a(EN)^{y/a} is true for 0≤y≤a, so the proof survives. Credit where due: the paper does not rest on fitted parameters or circular normalization, and it openly cites the a=1 fixed-N antecedents.\n\nThe soft spot is real and slightly deeper than the reader flagged. The theorem’s supercritical criterion evaluates D0 at s=(EN)^{1/a}, which requires G(z)=E[z^N] finite at z>1. The model only assumes E N < ∞, and with a heavy-tailed N (e.g., P(N=k)~c/k^3), G(z)=∞ for every z>1. Then F1(s)=∞ for all s>1 and the entire iteration in inequality (5) cannot start. The same issue affects the subcritical side when N is bounded (then G is finite everywhere, so only the initial F0 matters there). The finite-mgf assumption on X0 is also unstated, but the N-mgf issue is the load-bearing one. Both are repairable: add a hypothesis on exponential moments of N, or prove a truncation argument using monotonicity of Q in N. As written, the theorem oversells its scope.\n\nWould I engage? Yes. The core idea is right, the paper is short and readable, and the gap is fixable without changing the architecture. For a referee: send it out, but insist the authors state the finiteness conditions precisely and either prove the heavy-tailed case or restrict to N with finite mgf near 1. If the fix is clean, this is a solid contribution to a small active literature; if not, it is still a useful lemma collection. My verdict mirrors the conditional: accept pending correction of the stated moment hypotheses.","headline":"A genuine but narrow extension of Derrida–Retaux criticality conditions; the main theorem is plausible and mostly provable, with a real but repairable gap about exponential moments for N.","tokens_in":6296,"tokens_out":595,"would_cite":true,"duration_ms":7704,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60J80","60K35"],"pacs":[],"model":"deepseek-v4-flash","headline":"Moment-generating-function tests give sufficient conditions for positive or zero free energy in the Derrida–Retaux model.","keywords":["Derrida–Retaux model","random number of terms","free energy","criticality","moment generating function","subcritical and supercritical regimes","hierarchical renormalization"],"falsifier":"Take $a=1$, $P(N=2)=1$, and $X_0$ equal to $0$ or $3$ with probabilities $1/2$ each; then $F_0(2)=4.5$, $F_0'(2)=6$, so $D_0(2)=2\\cdot 6-4.5=7.5>0$ and Theorem 1 predicts $Q>0$. Iterating the exact recurrence for the first $n$ steps and checking whether $\\mathbb{E}(X_n)/2^n$ stays bounded away from zero would directly confirm or contradict the prediction.","tokens_in":5302,"feed_emoji":"🎲","tokens_out":6530,"duration_ms":62023,"temperature":0.7,"pith_summary":"The paper studies the Derrida–Retaux recursion $X_{n+1}=(X_n^{(1)}+\\cdots+X_n^{(N_n)}-a)^+$ with a random number $N_n$ of terms, and asks when the normalized free energy $Q=\\lim \\mathbb{E}(X_n)/(\\mathbb{E}N)^n$ is positive or zero. The authors prove sufficient conditions on the initial distribution of $X_0$ and on the distribution of $N$. The test is expressed through the function $D_0(s,m)=(m-1)sF_0'(s)-aF_0(s)$, built from the moment generating function $F_0$ of $X_0$ and the mean or maximum of $N$. If $D_0((\\mathbb{E}N)^{1/a},\\mathbb{E}N)>0$ then $Q>0$; if $N$ is bounded by $M$ and $D_0(1+(M-1)/a,M)<0$ then $Q=0$. These are the first criticality conditions of this form for random numbers of terms and extend the known criterion for the fixed-number case.","feed_headline":"Moment test decides free-energy regime in Derrida–Retaux model","feed_subtitle":"Two inequalities on the initial distribution tell when random-term recursion has positive or zero energy.","key_machinery":"The argument runs through the generating functions $F_n(s)=\\mathbb{E}(s^{X_n})$ and their exact evolution under the recursion. The key object is the operator $D_n(s)=(m-1)sF_n'(s)-aF_n(s)$, which in expectation form is $(m-1)\\mathbb{E}(X_n s^{X_n})-a\\mathbb{E}(s^{X_n})$. Lemma 1 shows that when the initial value $D_0$ is positive at a suitable $s$, the corresponding expression grows exponentially in $n$; Lemma 2 shows that $Q=0$ forces the same expression to stay bounded, so positivity of the initial value implies $Q>0$. For the subcritical direction, Lemma 3 gives a monotonicity inequality for $D_n$ under the assumption that the starting value is negative and $s$ is large enough, and Lemma 4 supplies the Chebyshev-type inequality $\\mathbb{E}(X_n s^{X_n}) \\ge \\mathbb{E}(X_n)\\mathbb{E}(s^{X_n})$ that converts negativity of $D_n$ into a uniform upper bound on $\\mathbb{E}(X_n)$, hence $Q=0$.","core_discovery":"The central claim, Theorem 1, is that the sign of a single expression constructed from the initial generating function decides the regime of the model. Define $D_0(s,m)=(m-1)sF_0'(s)-aF_0(s)$, where $F_0(s)=\\mathbb{E}(s^{X_0})$. If $D_0((\\mathbb{E}N)^{1/a},\\mathbb{E}N)>0$, the model is supercritical, $Q>0$, and this holds without any boundedness assumption on $N$. If $N$ is almost surely at most $M$ and $D_0(1+(M-1)/a,M)<0$, the model is subcritical, $Q=0$. The theorem is stated as sufficient conditions: it does not claim to cover all cases where $Q$ has a sign. When the number of terms is fixed, the two thresholds coincide for $a=1$ and the statement reproduces the previously known criterion, while for $a>1$ it gives new sufficient conditions.","pith_inferences":["The authors' conditions are one-sided tests; a natural next step is to check whether the two thresholds bound the true critical surface, with $D_0=0$ marking a critical window in which finer asymptotics are needed.","When $F_0(s)$ is infinite at the test point, the theorem is not applicable even though $\\mathbb{E}X_0$ is finite; in that regime one would need a different normalization or a truncated-moment analogue of $D_0$.","For unbounded $N$, replacing the deterministic bound $M$ by a tail bound might yield an analogous subcritical test, since the proof of condition 2 uses only the inequality $\\mathbb{E}(N v^N) \\le M\\mathbb{E}(v^N)$."],"forward_implications":["If the first condition holds, the free energy $Q$ is positive and the normalized expectations $\\mathbb{E}(X_n)/(\\mathbb{E}N)^n$ decrease to a positive limit.","If $N$ is bounded and the second condition holds, $Q$ is zero and $\\mathbb{E}(X_n)$ stays bounded by $a/(\\mathbb{E}N-1)$.","For a fixed number of terms, Theorem 2 gives a concrete generating-function test, reducing to the known $a=1$ criterion and producing new conditions for $a>1$.","The first condition applies even when $N$ is unbounded; only the second requires the boundedness $N\\le M$.","Because the conditions are sufficient, there remains a range of distributions for which the theorem is silent; the critical case $D_0=0$ is not classified."],"supporting_citations":[{"why":"Introduces the Derrida–Retaux recurrence and the depinning-transition interpretation; defines the model whose free energy is studied.","marker":"[3]"},{"why":"Establishes the necessary and sufficient criterion for a=1 with a fixed number of terms, which Theorem 1 extends to random N and a>1.","marker":"[2]"},{"why":"Earlier work on the free energy of the Derrida–Retaux recursive model that supplies the conceptual and technical background for Q.","marker":"[6]"}],"fun_headline_variants":["One inequality flips criticality in Derrida–Retaux with random terms","Sufficient generating function test sets regime for random term recursion","One expression from initial generating function decides criticality","Random term Derrida–Retaux: sufficient test for free-energy sign"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The theorem requires the moment generating function $F_0$ and its derivative to be finite at the specific test points, but the model assumptions only guarantee that $\\mathbb{E}X_0$ is finite; for heavy-tailed $X_0$ the test expression can be undefined, so the conditions do not apply.","fun_headline_variants_meta":{"raw":{"variants":["One inequality flips criticality in Derrida–Retaux with random terms","Sufficient generating function test sets regime for random term recursion","One expression from initial generating function decides criticality","Random term Derrida–Retaux: sufficient test for free-energy sign"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000769,"raw_usage":{"total_tokens":3397,"prompt_tokens":924,"completion_tokens":2473,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":540,"completion_tokens_details":{"reasoning_tokens":2401}},"tokens_in":540,"tokens_out":2473,"duration_ms":20113,"temperature":1.0,"reasoning_tokens":2401,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-09T11:50:53.795482+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $a=1$, $P(N=2)=1$, and $X_0$ equal to $0$ or $3$ with probabilities $1/2$ each; then $F_0(2)=4.5$, $F_0'(2)=6$, so $D_0(2)=2\\cdot 6-4.5=7.5>0$ and Theorem 1 predicts $Q>0$. Iterating the exact recurrence for the first $n$ steps and checking whether $\\mathbb{E}(X_n)/2^n$ stays bounded away from zero would directly confirm or contradict the prediction.","supporting_citations":[{"cited_title":"and Retaux, M","cited_arxiv_id":null,"evidence_quote":"Introduces the Derrida–Retaux recurrence and the depinning-transition interpretation; defines the model whose free energy is studied."},{"cited_title":"and Shi, Z","cited_arxiv_id":null,"evidence_quote":"Establishes the necessary and sufficient criterion for a=1 with a fixed number of terms, which Theorem 1 extends to random N and a>1."},{"cited_title":"and Shi, Z","cited_arxiv_id":null,"evidence_quote":"Earlier work on the free energy of the Derrida–Retaux recursive model that supplies the conceptual and technical background for Q."}],"review_version":1}