{"id":"7a288bb6-644e-4c37-bf3a-9e613259c18f","arxiv_id":"1908.08647","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"The paper proves that any phylogenetic tree metric of height h can be displayed by an HGT network with h-1 reticulation arcs, so tree-likeness does not rule out many reticulate events.","lead":"The paper shows that tree-like distance data can be carried by horizontal gene transfer networks with many reticulation events, not just by single-transfer networks. The result matters because it weakens the common inference that a tree-shaped metric rules out a network-shaped evolutionary history.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5.4's existence proof for positive ℓ_j is asserted, not shown; the proof's later inequalities are not consequences of the stated equations, so Corollary 5.5 lacks verified support.","rationale":"The reader's weakest-assumption analysis identifies exactly the point on which the paper's central claim depends: Theorem 5.4 asserts, without proof, the existence of positive solutions to a system of linear equations. My stress-test confirms that this is the most load-bearing concern and sharpens it. The missing argument is not merely a routine detail: the equations defining γ± are coupled in both directions, the boundary condition is unusual, and the proof subsequently uses inequalities that do not follow from the displayed definitions without additional constraints on βΣ and m. Moreover, the equality chain in the i>b case appears inconsistent with the stated γ−(j) formula, so the proof as written has an internal mismatch. Corollary 5.5 depends entirely on Theorem 5.4, so the central claim that every tree metric can be exhibited by an HGT network with h−1 reticulations is not fully established. This does not show the theorem is false; it shows the current write-up leaves a critical existence step unverified. A targeted computational check on small caterpillar networks would settle whether the asserted positive solutions always exist. Since the reader already assigned CONDITIONAL, my recommendation is UNCHANGED.","tokens_in":19866,"tokens_out":16432,"duration_ms":155630,"concrete_test":"For n=5 and n=6, instantiate the caterpillar network with concrete positive values: choose m_j as small rationals (e.g., 1, 1/2) and reticulation probabilities α_j in (0,1) (e.g., 0.3, 0.5, 0.7). Compute βΣ(T_i) by summing over all 2^{n−2} choices of reticulation arcs according to the paper's convention that the display tree is determined by the lowest retained HGT arc. For each target i, solve the stated linear system for the ℓ_j exactly or with high-precision arithmetic. Check (i) existence of a strictly positive solution, (ii) the extra equality coupling ℓ_{i−1} and ℓ_{i+1}, (iii) the inequalities βΣ(T_j)γ+(j) > βΣ(T_{j+1})ℓ_{j+1} and βΣ(T_j)γ−(j) > βΣ(T_{j−1})ℓ_{j−1}, and (iv) Lemma 3.2 for every quartet {x_a,x_b,x_c,x_n}.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central construction rests on Theorem 5.4, whose proof contains the line 'It is a simple exercise in linear algebra that there exist strictly positive values of ℓ_j for all j ≠ i that satisfy these equations.' This is not a routine triangular system: γ+(j) and γ−(j) are defined in terms of ℓ_{j−1} and ℓ_{j+1} respectively, the boundary condition sets ℓ_{n−3}=ℓ_{n−2}, and the extra equality couples ℓ_{i−1} and ℓ_{i+1}. Positivity is therefore a genuine constraint, not an automatic consequence. The proof then relies on inequalities such as βΣ(T_j)γ+(j) > βΣ(T_{j+1})ℓ_{j+1}, but substituting the definition gives βΣ(T_j)γ+(j) = βΣ(T_{j−1})ℓ_{j−1} − Σ_{k=j+1}^{n−1} βΣ(T_k)m_{k−1}, which is not obviously larger than βΣ(T_{j+1})ℓ_{j+1} for arbitrary positive βΣ and m. Similarly, the equality chain in the case i>b uses the recurrence βΣ(T_b)ℓ_b = βΣ(T_{b−1})ℓ_{b−1}+Σ_{k=1}^b βΣ(T_k)m_k, which is not what the displayed γ−(j) equation gives (its numerator has Σ_{k=1}^{j−1}, not Σ_{k=1}^j). Thus the proof has an internal mismatch as written. Since the βΣ values themselves are not arbitrary but must come from independent reticulation probabilities α, the feasibility of the whole system is genuinely open. Corollary 5.5 inherits this gap.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies horizontal gene transfer (HGT) networks whose distance metric, defined as a convex combination of distances on displayed trees, satisfies the four-point condition and is therefore a tree metric. Such networks are called tree-metrizable. The authors extend earlier work on single-reticulation networks by constructing tree-metrizable HGT networks with many non-trivial reticulation arcs. The main tools are a quartet-based characterization (Lemma 3.2), a replacement lemma for deleting an HGT arc between siblings (Lemma 3.4), a leaf-grafting theorem (Theorem 4.3), and a construction of 'caterpillar networks' claimed to be tree-metrizable on every displayed tree (Theorem 5.4). The headline consequence is Corollary 5.5: every rooted tree of height h > 2 admits a T-metrizable HGT network with h-1 non-trivial reticulation arcs. A final section studies leaf grafts with network scions and gives a partial classification result for level-2 networks.","tokens_in":20242,"tokens_out":38073,"duration_ms":331218,"significance":"If the main construction is correct, the paper gives a strong and somewhat surprising answer to a natural question: a tree metric alone cannot certify the absence of complex reticulate histories, because every tree metric of height h can be realized by a network with many independent HGT arcs. This substantially extends the single-reticulation examples of Francis and Steel. The paper also introduces useful conceptual tools, especially the leaf-grafting replacement theorem and the caterpillar network family. A clear strength is that Lemmas 3.2 and 3.4 have detailed appendix proofs. However, the central theorem currently rests on unproven algebraic existence assertions and on displayed formulas that do not match the accompanying case analysis; the significance is therefore conditional on a successful repair of the proof of Theorem 5.4.","major_comments":[{"comment":"The formulas for int(C,xaxb|xcxn) and int(C,xaxn|xbxc) are not consequences of the case analysis in the proof and are incorrect as displayed. For example, for n=6 and q={x2,x4,x5,x6} (a=2, b=4, c=5), the proof's description of internal arcs gives int(C,x2x6|x4x5) = βΣ(T2)ℓ2 + (βΣ(T1)+βΣ(T2))m2 + (βΣ(T1)+βΣ(T2)+βΣ(T3))m3, while the displayed formula gives βΣ(T2)ℓ2 + (Σ_{t=1}^{3}βΣ(Tt))m3 + (Σ_{t=1}^{4}βΣ(Tt))m4 -- a spurious m4 term and no m2 term. Similarly, for n=7, b=4, c=6, the correct coefficient of m4 is βΣ(T5)+βΣ(T6) and that of m5 is βΣ(T6), but the displayed formula gives βΣ(T5) for m4 and 2βΣ(T6) for m5. Since Theorem 5.4 explicitly invokes Lemma 5.3 to verify the hypotheses of Lemma 3.2, the main construction is not supported as written.","section":"Section 5, Lemma 5.3"},{"comment":"The proof asserts 'It is a simple exercise in linear algebra that there exist strictly positive values of ℓ_j for all j ≠ i that satisfy these equations' without supplying the argument. The system is not triangular: γ+(j) depends on ℓ_{j−1}, γ−(j) depends on ℓ_{j+1}, the boundary conditions set ℓ_{n−3}=ℓ_{n−2} and ℓ_2=ℓ_1, and the extra equality couples the two chains through ℓ_{i−1} and ℓ_{i+1}. Because the affine expressions have negative constant terms, positivity is a genuine constraint rather than an automatic consequence. The proof also does not address how the chosen ℓ_i is accommodated by pendant arc lengths. A constructive feasibility argument, or an explicit solution, is required before Theorem 5.4 can be accepted.","section":"Section 5, proof of Theorem 5.4"},{"comment":"The proof treats the probabilities βΣ(T_j) as free positive parameters, but in the HGT network model they are not free. For a caterpillar network with independent reticulation probabilities α_i, one has βΣ(T_i)=α_i∏_{j≠i}(1−α_j) for i=1,...,n−2 and βΣ(T_{n−1})=∏_{j=1}^{n−2}(1−α_j). These relations do not fill the whole probability simplex: for n=4, the uniform distribution (1/3,1/3,1/3) is not attainable, since the formulas force α1=β1/(β1+β3), α2=β2/(β2+β3), and the resulting β1 is not 1/3. The proof never constructs the α_i or verifies that the βΣ values used in the linear system and inequalities are realizable by independent reticulation probabilities. Without this, the claimed existence of reticulation probabilities satisfying Lemma 3.2 is not established.","section":"Section 5, proof of Theorem 5.4"}],"minor_comments":[{"comment":"The sentence 'Fix all aj to be some arbitrary non-zero lengths' uses an undefined symbol aj; it should refer to the m_j defined just before, and the lengths should be strictly positive, not merely non-zero.","section":"Section 5, proof of Theorem 5.4"},{"comment":"The proof refers to 'Lemma 6.2', but no such lemma exists; the intended reference is Theorem 6.2.","section":"Section 6, proof of Theorem 6.5"},{"comment":"The phrase 'the subtree of T induced by δ(y_i)' is not defined when δ(y_i) is a leaf; the intended construction appears to be to graft, at each vertex of the chosen length-h path, the rooted subtree attached to the off-path child, and to handle the terminal leaf separately.","section":"Section 5, Corollary 5.5"},{"comment":"The displayed condition uses '≥' while Lemma 3.2 requires a strict inequality '>' for T1-metrizability; please correct the example to match the lemma.","section":"Section 3, Example 3.3"},{"comment":"In Case (3), the statement 'It is immediate that the inequality holds' is terse; writing the three quartet sums explicitly would make the proof easier to verify.","section":"Section 4, proof of Theorem 4.3"},{"comment":"The paper alternates between 'tree-metrized' (title and abstract) and 'tree-metrizable' (body); please standardize the terminology.","section":"General"}],"recommendation":"major_revision","confidential_remarks":"The central construction appears to be a good idea, but the proof of Theorem 5.4 currently has incorrect displayed formulas in Lemma 5.3, an unproven positivity step for the ℓ_j, and no argument that the βΣ values are realizable by independent reticulation probabilities. These issues look fixable by correcting indices and adding a constructive existence proof, rather than being fundamentally wrong, but they are load-bearing for Corollary 5.5. I would ask the authors to supply a complete proof of Theorem 5.4 before publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Interesting paper, but the main theorem has a proof gap that needs fixing.\n\nThe core question is worth asking: Francis and Steel showed single-reticulation HGT networks can be tree-metrizable; this paper asks how far that goes. The answer it wants is bold: any tree of height h is compatible with an HGT network with h-1 non-trivial reticulations. If that holds, then a tree metric is even weaker evidence against complex HGT histories than previously known. That is a genuinely new conceptual point, not just a parameter sweep.\n\nWhat the paper does well: Lemma 3.2 gives a clean quartet criterion for three-display-tree networks, and the appendix proof is explicit. Lemma 3.4, which removes a sibling HGT arc while preserving distances, is also concretely proven with adjusted weights. The leaf-grafting Replacement Theorem (4.3) is plausible and the case breakdown is the right shape. Section 6's classification of when network-scions graft onto trees is ambitious, and the root-relocation trick for enhanced caterpillar networks is clever.\n\nThe problem is Theorem 5.4. The proof asserts that strictly positive l_j exist for the displayed linear system as \"a simple exercise\" and never shows it. That alone would be an omission, but the proof then claims inequalities like betaSum(T_j)gamma+(j) > betaSum(T_{j+1})l_{j+1} without deriving them from the equations; as written, the left side has a subtracted sum that can make it smaller than the right side. The equality chain in the i>b case uses a recurrence with sum_{k=1}^b betaSum(T_k)m_k, while the gamma-(j) equations give sum_{k=1}^{j-1}. That looks like an index error, and it is load-bearing because Corollary 5.5 is built entirely on Theorem 5.4. The headline result is not yet verified.\n\nNone of this is fatal to the underlying idea. The construction may well be salvageable with a proper choice of l_j and a cleaned-up recurrence. But as it stands, the central proof is incomplete.\n\nWho this is for: mathematical phylogenetics, particularly people working on identifiability of reticulate evolution from tree-like distances. It deserves a serious referee, and I would accept it for review, but only with major revision. I would not cite it until the proof is fixed.","headline":"Bold and interesting, but the main theorem's proof has a real gap and the headline result is not yet established.","tokens_in":20775,"tokens_out":5526,"would_cite":false,"duration_ms":47859,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["92D15","05C05","05C20"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every tree metric can also come from an HGT network with h−1 reticulation arcs.","keywords":["tree metric","four-point condition","HGT network","horizontal gene transfer","tree-metrizable","caterpillar network","reticulation","phylogenetic network"],"falsifier":"Run the Theorem 5.4 construction on a five-leaf caterpillar network: fix positive values for the internal arc lengths $m_2,m_3$ and for the probabilities $\\beta_1,\\dots,\\beta_4$, then solve the displayed linear equations for $\\ell_1,\\ell_2,\\ell_3$ (including the extra equality connecting $\\ell_{i+1}$ and $\\ell_{i-1}$). If any choice of positive parameters forces a nonpositive $\\ell_j$, the asserted positivity claim fails for those parameters; a computer search over the parameter range would settle whether the proof's claim is universally true.","tokens_in":19618,"feed_emoji":"🧬","tokens_out":11603,"duration_ms":101326,"temperature":0.7,"pith_summary":"This paper asks whether distances that satisfy the four-point condition—and therefore fit a unique phylogenetic tree—can also be produced by a phylogenetic network that contains horizontal gene transfer (HGT) events. The authors prove that the answer is yes in a strong form: for every rooted binary tree $T$ of height $h>2$, there is a non-trivial HGT network whose underlying tree is $T$ and that carries exactly the same leaf-to-leaf distances as $T$, while containing $h-1$ reticulation arcs. The construction starts from caterpillar networks, whose display trees are explicitly listed, and extends them by leaf-grafting. The consequence is that satisfying the four-point condition is not evidence against a reticulate evolutionary history: every tree metric is also a metric of some many-reticulation HGT network.","feed_headline":"Tree metrics can also come from networks with many gene transfers","feed_subtitle":"A construction with h−1 reticulation arcs reproduces any tree of height h, so distance data alone cannot rule out reticulate history.","key_machinery":"The load-bearing object is the caterpillar network: a network whose underlying tree is a caterpillar tree (a tree with one cherry, leaves ordered $x_1,\\dots,x_n$), with an HGT arc from each leaf $x_i$ ($1\\le i\\le n-2$) to the last leaf $x_n$. It has exactly $n-1$ display trees $T_1,\\dots,T_{n-1}$, which makes the four-point condition manageable. Lemma 3.2 turns tree-metrizability of a four-leaf network into an inequality between probability-weighted sums of internal-arc lengths of the three quartet splits; Lemma 5.3 computes those sums for caterpillar networks; Theorem 5.4 chooses the edge lengths $\\ell_j$ so that the required inequalities hold, making the network tree-metrizable on every displayed tree. The Replacement Theorem 4.3, which says that grafting a tree onto a leaf preserves tree-metrizability, then lifts the caterpillar result to arbitrary trees in Corollary 5.5. A second construction, the enhanced caterpillar network, is shown to remain tree-metrizable when grafted onto any tree (Theorem 6.7).","core_discovery":"The central claim is that tree-likeness of a distance matrix does not limit the number of reticulation events that could have generated it. For any rooted binary phylogenetic tree $T$ of height $h>2$, Corollary 5.5 constructs a non-trivial HGT network with underlying tree $T$ and exactly $h-1$ non-trivial reticulation arcs that is $T$-metrizable: the network's convex combination of display-tree metrics equals the metric of $T$. The proof goes through caterpillar networks $C$ on $n$ leaves, in which each of the first $n-2$ leaves sends an HGT arc to the last leaf. Theorem 5.4 shows such a network is tree-metrizable on every tree it displays by choosing the edge lengths $\\ell_j$ to satisfy a linear system built from Lemma 5.3's formulas for internal-arc sums; Corollary 5.5 then grafts pendant subtrees onto the caterpillar leaves via the Replacement Theorem 4.3 to realize an arbitrary tree $T$ of height $h$.","pith_inferences":["If Corollary 5.5 is right, then the four-point condition cannot be used as evidence against HGT: every tree-like distance is also explained by a network with up to $h-1$ transfers, so detecting reticulation from distances alone is impossible in principle.","The explicit caterpillar construction suggests an algorithm for building such networks: for a given tree $T$, embed a caterpillar of the same height into it, solve the linear system of Theorem 5.4 for edge lengths, and leaf-graft the pendant subtrees; a natural test is to run this on random trees and check that positive solutions exist.","The root-relocation observation in Theorem 6.7 hints that the class of tree-metrizable networks may be invariant under moving the root along an arc when all pairwise distances are preserved; if so, the tree-versus-network distinction in distance data depends only on unrooted quartet structure.","Since the network distance is a convex combination of display-tree metrics, the construction also implies that the set of tree metrics is contained in the convex hull of display-tree metric sets for suitably chosen HGT networks; this convex-geometric view might connect to reconstruction algorithms based on convex mixture models."],"forward_implications":["Every rooted binary tree of height $h>2$ admits a non-trivial HGT network with the same metric and $h-1$ reticulation arcs (Corollary 5.5).","Tree-metrizability is preserved when a tree is grafted onto any leaf of a tree-metrizable network, so the class of tree-metrizable networks is closed under adding arbitrary pendant subtrees (Theorem 4.3).","Caterpillar networks are tree-metrizable on every tree they display, so the metric alone cannot single out the underlying tree among a network's display trees (Theorem 5.4).","Networks formed by leaf-grafting an enhanced caterpillar network onto a tree are tree-metrizable, giving a broad positive class for the network-onto-tree grafting question (Theorem 6.7).","Single-reticulation restrictions from earlier work do not extend: tree metrics are compatible with arbitrarily many HGT events."],"supporting_citations":[{"why":"It states the four-point condition, the criterion for a distance to be a tree metric that the paper's definition of tree-metrizability is built on.","marker":"[1]"},{"why":"It defines the lowest stable ancestor, which Theorem 4.3 uses to check the four-point condition across quartets in leaf-grafted networks.","marker":"[3]"},{"why":"It provides the unrooted analogue $B_N$ that motivates the minimal support network construction in Definition 6.4.","marker":"[4]"},{"why":"It introduced tree-metrized networks, the convex-combination distance model, and the single-reticulation results this paper extends.","marker":"[5]"},{"why":"It supplies the notion of a base tree that underlies the definition of the underlying tree $T_N$ and the observation that the underlying tree is not the only display tree.","marker":"[6]"},{"why":"It gives the induced-network concept used to define minimal support networks in Definition 6.4.","marker":"[8]"}],"fun_headline_variants":["Many gene transfers can still yield a tree metric","Tree metrics don't limit reticulation count in HGT","Any tree metric can arise from many HGT events","Reticulate histories can mimic pure tree distances","Distance data cannot rule out many reticulations"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction's load-bearing premise is that, for each display tree $T_i$, the linear system in Theorem 5.4 has a strictly positive solution for the edge lengths $\\ell_j$ (the $\\gamma_\\pm$ equations plus the extra equality); the paper asserts this is a simple exercise in linear algebra without exhibiting the solution or proving positivity. If some parameter choices force a nonpositive $\\ell_j$, the caterpillar construction—and with it Corollary 5.5—fails.","fun_headline_variants_meta":{"raw":{"variants":["Many gene transfers can still yield a tree metric","Tree metrics don't limit reticulation count in HGT","Any tree metric can arise from many HGT events","Reticulate histories can mimic pure tree distances","Distance data cannot rule out many reticulations"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000233,"raw_usage":{"total_tokens":1480,"prompt_tokens":916,"completion_tokens":564,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":532,"completion_tokens_details":{"reasoning_tokens":491}},"tokens_in":532,"tokens_out":564,"duration_ms":6155,"temperature":1.0,"reasoning_tokens":491,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:33:47.654545+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the Theorem 5.4 construction on a five-leaf caterpillar network: fix positive values for the internal arc lengths $m_2,m_3$ and for the probabilities $\\beta_1,\\dots,\\beta_4$, then solve the displayed linear equations for $\\ell_1,\\ell_2,\\ell_3$ (including the extra equality connecting $\\ell_{i+1}$ and $\\ell_{i-1}$). If any choice of positive parameters forces a nonpositive $\\ell_j$, the asserted positivity claim fails for those parameters; a computer search over the parameter range would settle whether the proof's claim is universally true.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"It states the four-point condition, the criterion for a distance to be a tree metric that the paper's definition of tree-metrizability is built on."},{"cited_title":"Huson, New common ancestor problems in trees and directed acyclic graphs, Information Processing Letters 110 (2010), no","cited_arxiv_id":null,"evidence_quote":"It defines the lowest stable ancestor, which Theorem 4.3 uses to check the four-point condition across quartets in leaf-grafted networks."},{"cited_title":"Huber, and Vincent Moulton, Tree-based unrooted phylogenetic networks, Bulletin of Mathematical Biology 80 (2018), no","cited_arxiv_id":null,"evidence_quote":"It provides the unrooted analogue $B_N$ that motivates the minimal support network construction in Definition 6.4."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"It introduced tree-metrized networks, the convex-combination distance model, and the single-reticulation results this paper extends."},{"cited_title":"5, 768–777","cited_arxiv_id":null,"evidence_quote":"It supplies the notion of a base tree that underlies the definition of the underlying tree $T_N$ and the observation that the underlying tree is not the only display tree."},{"cited_title":"Huson, Regula Rupp, and Celine Scornavacca, Phylogenetic networks: concepts, algorithms and applications , Cambridge University Press, 2010","cited_arxiv_id":null,"evidence_quote":"It gives the induced-network concept used to define minimal support networks in Definition 6.4."}],"review_version":1}