{"id":"ce4c9630-9069-4288-9e81-07d9d2f53ee4","arxiv_id":"2607.15789","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The giant component of G(n,n,p) with np→c>1 satisfies a central limit theorem with variance 2σ².","lead":"This paper proves that the size of the giant connected component in a sparse random bipartite graph is asymptotically normal above the phase transition. It sketches a coupling argument that reduces the problem to the classical Erdős-Rényi random graph case.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 2.1's proof relies on unproved residual relation: Proposition 2.6 is asserted in one sentence, and the identity Y_n/(1−c(1−β)) ≈ |C1−C2| is not derived in Proposition 2.5's proof despite being attributed to it.","rationale":"The paper is honest that Theorem 1.4 also follows from Clancy's work, so the external result supports the claim. The internal proof, however, is a sketch. The reader's CONDITIONAL verdict correctly asks for complete proofs of Propositions 2.5 and 2.6. Our stress-test sharpens this: the missing Y_n residual identity is not merely a detail in Prop 2.6's proof but a separate unproved assertion in the proof of Lemma 2.1. Because the theorem is true and externally verified, a REJECT is not warranted. The gaps are fillable, so ACCEPT would be premature. The appropriate verdict is CONDITIONAL, unchanged from the reader.","tokens_in":7213,"tokens_out":13829,"duration_ms":89385,"concrete_test":"Independently derive the residual identity: for two independent G(n,p) explorations started at one vertex each, show Y_n/(1−c(1−β)) − |C1−C2| = o_P(√n), where Y_n is the active-set size in the larger exploration at time min(C1,C2). One route: prove a uniform strong approximation A_t = n(1 − t/n − e^{−ct/n}) + O_P(√n) for t in a √n-neighborhood of βn, using the exploration-process random walk (e.g., Donsker or martingale CLT). If the identity follows only from Theorem 1.2 plus this approximation, the gap is fillable; otherwise the final algebra in §2.2 needs revision.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central lemma (Lemma 2.1) is derived in §2.2 via Propositions 2.5 and 2.6. Proposition 2.6 is the load-bearing coupling: it asserts that (τ_n, Z_n) is distributionally equal to (min(C1,C2), Y_n) up to o_P(√n) errors. Its proof (§2.3) is a single sentence: the O(n^{1/3}) initial active sets at t0 are said not to change the limiting distribution. This ignores that τ_n and Z_n are functionals of a stochastic process with √n fluctuations; one must show that an n^{1/3} perturbation of the initial state, propagated through the exploration, changes these functionals by o(√n). That is plausible (the deterministic active-frontier ODE is exponentially contracting) but is not demonstrated. More concretely, §2.2's final step claims 'from the proof of Proposition 2.5' that Y_n/(1−c(1−β)) = |C1−C2| + o_P(√n). The proof of Prop 2.5 contains no such statement; it only treats σ_n and Z_n in the bipartite process. The residual identity for the independent ER explorations — essentially that the active-set size at time min(C1,C2) is proportional to |C1−C2| — is a separate claim, not proven. Prop 2.5's proof also cites Prop 2.6 to assert Z_n = O_P(√n), so the two propositions are entangled. Thus Lemma 2.1, and hence Theorem 1.4, is not fully established by the text as written.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves a central limit theorem for the size L_1(n) of the largest component of the sparse random bipartite graph G(n,n,p) when np→c>1: √n(L_1(n)/n − 2β) ⇒ N(0, 2σ²), with β and σ defined as in the Erdős–Rényi giant component. The proof strategy is to reduce the bipartite problem to the classical Stepanov CLT for G(n,p) by showing (Lemma 2.1) that L_1(n) is equal in distribution to C_1(n)+C_2(n)+o_P(√n), where C_1,C_2 are the largest component sizes of two independent Erdős–Rényi graphs. The argument uses a parallel exploration process on the two parts of the bipartite graph, introduces a stopping time τ_n when one side has no active vertices, and claims (Propositions 2.5 and 2.6) that the bipartite exploration is, up to o_P(√n) errors, the same as the simultaneous exploration of two independent G(n,p) graphs. The final theorem then follows from the classical CLT and the decomposition |C_1−C_2| + 2min(C_1,C_2) = C_1+C_2. The paper is written as a proof sketch: the key coupling statement and one residual identity are asserted rather than proved.","tokens_in":7680,"tokens_out":7061,"duration_ms":57138,"significance":"If fully established, Theorem 1.4 would be a clean extension of a classical result to the bipartite model, with the attractive feature of a coupling proof that reduces the bipartite CLT to the Erdős–Rényi one. The result itself is plausible and, as the authors note, also follows from the recent general stochastic block model CLT [13]; the present contribution is intended to provide a more elementary, self-contained route. That motivation is reasonable. The manuscript does not contain machine-checked proofs or code, and the theoretical argument is explicitly a sketch. The main claims are clearly stated and externally testable, but the proof as written leaves load-bearing steps in Propositions 2.5 and 2.6 without rigorous support.","major_comments":[{"comment":"The proof of Proposition 2.6 is a single sentence. It asserts that after t0 the parallel process is identical to the simultaneous exploration of two independent G(n,p), and that the O(n^{1/3}) extra starting active vertices do not change the limiting distribution because the CLT holds at the √n scale. This is not automatic: τ_n and Z_n are functionals of a stochastic process with √n fluctuations, so one must show that an n^{1/3} perturbation of the initial state changes these functionals by o_P(√n). The manuscript supplies no quantitative argument, e.g., via contraction of the deterministic active-frontier equations or a coupling that absorbs the extra vertices as additional seeds. This step is load-bearing for Lemma 2.1.","section":"§2.3, Prop. 2.6"},{"comment":"The final step of the proof of Lemma 2.1 states that 'from the proof of Proposition 2.5' the identity Y_n/(1−c(1−β)) = |C^(1)(n) − C^(2)(n)| + o_P(√n) follows. The proof of Proposition 2.5, however, contains no such statement; it only treats σ_n and Z_n in the bipartite process. The analogous relation for two independent Erdős–Rényi explorations—that the active-set size at the completion time of the smaller giant component is proportional to |C_1−C_2|—is a separate claim and is not proven. This identity is essential for converting the coupling into L_1(n)+ξ_n = C_1(n)+C_2(n).","section":"§2.2, Lemma 2.1 proof"},{"comment":"The proof writes σ_n = Σ_{j=1}^{Z_n} ξ_j(n), treating the subcritical explorations launched from distinct active vertices as disjoint. In a subcritical random graph, two such explorations can collide and merge; the expected number of collisions is O(Z_n^2 (log n)^2 / n), which is o_P(1) when Z_n = O_P(√n), but this estimate is not supplied. The asserted independence of Z_n and the ξ_j(n) also needs a careful conditional statement on the state at time τ_n. These omissions affect the derivation of Proposition 2.5 and hence of Lemma 2.1.","section":"§2.3, Prop. 2.5"}],"minor_comments":[{"comment":"The sentence 'Thus for t∈(t0,τ_n) our process looks like a parallel exploration of two random graphs G(n,p)' is stated before Proposition 2.6 and effectively duplicates it; a formal coupling is not given there.","section":"§2.1, inline claim"},{"comment":"The phrase 'the conditional probability ... equals β(1+o(1)) regardless of the past' is imprecise; the uniformity of the o(1) error over the relevant events should be stated explicitly, although the conclusion is plausible.","section":"§2.3, Prop. 2.2"},{"comment":"Reference [10] is a Master's thesis; if a published version exists, it would be preferable to cite it. Remark 1.5 could also be more precise about the overlap with [13].","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The stress-test concern lands: the proof is a sketch and the two identified gaps are real and load-bearing. The theorem itself is credible and externally supported, and the gaps appear repairable with a quantitative coupling argument and a proof of the independent-ER residual identity. I therefore recommend major revision rather than rejection. The priority claim in Remark 1.5 is not part of the mathematical assessment and I did not weigh it."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the theorem is very likely true and already known, and the authors are honest about that. Read it for the coupling strategy, not for a finished proof.\n\nWhat's actually new: the paper offers a proof of asymptotic normality for the bipartite giant component size by coupling the exploration process with two independent Erdős–Rényi graphs. The strategy is elegant and plausible: run the explorations in parallel, show they match independent ER explorations up to o_P(√n) errors, then transfer Stepanov's CLT. The structure is clear, and Remark 1.5 explicitly acknowledges that the same result follows from Clancy's more general stochastic block model, noting that the Russian version of this paper appeared earlier. That is honest and earns credit.\n\nSoft spots, in proportion:\n\n1. Proposition 2.6 is the load-bearing coupling, and its proof is literally one sentence: the O(n^{1/3}) initial active sets are said not to change the limiting distribution because Stepanov's theorem holds for any np→c. That is not a proof. One must show that a perturbation of this size, propagated through the exploration, changes the stopping time and active-vertex count by o_P(√n). Plausible via contraction of the active-frontier ODE, but not demonstrated.\n\n2. The final step of Lemma 2.1, where Y_n/(1−c(1−β)) is identified with |C1−C2|, is attributed to the proof of Proposition 2.5, but that proof nowhere states or proves it. It is a separate claim and it is simply missing.\n\n3. Minor: Proposition 2.2's proof asserts that the conditional probability of starting the giant component is β(1+o(1)) regardless of the past, without argument. Probably fixable.\n\nThe theorem itself is externally supported by Clancy [13], so the main claim is almost certainly true. But this paper's own derivation does not establish it as written. The proof needs to be completed before the paper is rigorous.\n\nVerdict: it deserves a serious referee, with the expectation of major revision. The result is worth having, and the coupling method, once fully written, could be a useful alternative path. I would not cite this as a proof yet; I would cite Clancy for the theorem.","headline":"Clean result, honest provenance, but the coupling proof is sketched to the point that the paper's own argument does not establish the theorem.","tokens_in":8020,"tokens_out":2257,"would_cite":false,"duration_ms":25538,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C80","60F05"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves a central limit theorem for the giant component size in a sparse random bipartite graph, with fluctuations matching two independent one-sided giants.","keywords":["random bipartite graph","giant component","asymptotic normality","central limit theorem","phase transition","component exploration","sparse random graphs","two-type random graphs"],"falsifier":"For a fixed c>1 (say c=2), generate many samples of G(n,n,p) with n large and compare the empirical distribution of √n(L1/n − 2β) with a normal of variance 2σ²; a statistically significant mismatch would refute Theorem 1.4. A sharper check is to test Proposition 2.6 directly: simulate both the bipartite graph and two independent one-sided graphs and compare L1 with C1+C2; the coupling predicts their normalized difference converges to 0 in probability.","tokens_in":7122,"feed_emoji":"📊","tokens_out":6943,"duration_ms":53059,"temperature":0.7,"pith_summary":"This paper establishes a central limit theorem for the size of the giant component in a random bipartite graph G(n,n,p), where np→c>1. Concretely, it proves that L1(n), the number of vertices in the largest component, satisfies √n(L1/n − 2β) → N(0, 2σ²), with β and σ² explicitly determined by c. The result matters because it upgrades the known law-of-large-numbers phase transition in the bipartite model to a precise fluctuation statement, and it shows the bipartite giant fluctuates exactly like two independent one-sided giants. The key coupling identifies the bipartite component, up to o_P(√n), with the sum of the largest components of two independent copies of the standard one-part random graph.","feed_headline":"Giant component of bipartite random graph is normally distributed","feed_subtitle":"Its fluctuations match two independent one-sided giants, doubling the variance of the known normal limit.","key_machinery":"The parallel component-exploration process, which maintains one queue of active vertices on each side of the bipartition and reveals edges only between the two sides, is the central object. The load-bearing identity is Lemma 2.1, L1(n)+ξ_n =d C^(1)(n)+C^(2)(n) with ξ_n/√n→0, which transfers a known central limit theorem for one-part random graphs to the bipartite model. The formulas for β and σ² arise from the branching-process phase transition and are inherited unchanged from the one-part model.","core_discovery":"Theorem 1.4: if np→c>1, then √n(L1(n)/n − 2β) converges in distribution to a centered normal with variance 2σ², where β is the unique solution in (0,1) of β+e^{−βc}=1 and σ² = β(1−β)/(1−c(1−β))². The proof rests on a coupling: with a negligible error of order o_P(√n), the size of the giant component in G(n,n,p) has the same law as the sum of the giant components of two independent copies of the standard one-part random graph with the same edge probability.","pith_inferences":["A natural extension of the same two-sided coupling would give Gaussian fluctuations for the giant component in other two-type random graph models, such as balanced stochastic block models, where the variance would be the sum of the two community contributions.","The coupling strategy is specific to the supercritical regime; extending it to the critical window np−1 = O(n^{−1/3}) would require different rescaling and is left open.","The paper's own remark that a more general recent result implies the theorem indicates the bipartite normal law is not an isolated phenomenon; the value here is an earlier, self-contained proof tailored to the model."],"forward_implications":["The giant component of G(n,n,p) exhibits Gaussian fluctuations of order √n above the phase transition.","The asymptotic variance is exactly twice the one-sided random graph variance, so the bipartite giant behaves like the sum of two independent giants.","The law of large numbers L1/n→2β is strengthened to a full distributional limit.","The limiting parameters β and σ are the same functions of c as in the one-sided model, just doubled in center and variance."],"fun_headline_variants":["Bipartite giant component size is asymptotically normal","Bipartite random graph: giant component is normal","Giant component in bipartite graph is Gaussian","Bipartite giant: size distribution approaches normal","Bipartite giant doubles variance: normal limit proven"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The load-bearing step is Proposition 2.6, which asserts that after an initial warm-up the parallel exploration of the bipartite graph is distributionally equivalent, to within o_P(√n), to exploring two independent one-sided random graphs; the extra O(n^{1/3}) active start vertices are argued to be negligible in a single sentence, and the whole transfer of the normal limit depends on that equivalence.","fun_headline_variants_meta":{"raw":{"variants":["Bipartite giant component size is asymptotically normal","Bipartite random graph: giant component is normal","Giant component in bipartite graph is Gaussian","Bipartite giant: size distribution approaches normal","Bipartite giant doubles variance: normal limit proven"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000227,"raw_usage":{"total_tokens":1208,"prompt_tokens":542,"completion_tokens":666,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":286,"completion_tokens_details":{"reasoning_tokens":592}},"tokens_in":286,"tokens_out":666,"duration_ms":6098,"temperature":1.0,"reasoning_tokens":592,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T22:18:10.862734+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a fixed c>1 (say c=2), generate many samples of G(n,n,p) with n large and compare the empirical distribution of √n(L1/n − 2β) with a normal of variance 2σ²; a statistically significant mismatch would refute Theorem 1.4. A sharper check is to test Proposition 2.6 directly: simulate both the bipartite graph and two independent one-sided graphs and compare L1 with C1+C2; the coupling predicts their normalized difference converges to 0 in probability.","supporting_citations":[],"review_version":1}