{"id":"5bc2b5d7-3f1a-487e-a557-8427b11e7c4c","arxiv_id":"2606.24415","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Ancestor-based and anchored triples allow polynomial-time solutions to consistency problems in phylogenetic networks, with construction of realizing DAGs and networks.","lead":"The paper defines ancestor-based rooted triples and anchored triples for phylogenetic networks and shows that consistency problems with required and forbidden triples can be solved in polynomial time, along with constructing realizing networks. A smart generalist might read it to see how local genomic closeness data can be turned into global evolutionary network histories efficiently.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Definition of triple display assumes unique LCAs, but construction may produce networks where they are not unique","rationale":"Reader's weakest assumption concerns biological fidelity of the ancestor-based model. The load-bearing technical risk for the central poly-time claim is internal: whether the LCA-constraint realization step preserves the uniqueness presupposed by the display definition. This is a distinct, concrete gap in the argument that would invalidate the claimed equivalence even if the biological modeling were accepted.","tokens_in":1837,"tokens_out":318,"duration_ms":20566,"concrete_test":"Take the smallest instance that forces a reticulation (e.g., a forbidden triple set whose only solutions contain a vertex with in-degree 2); run the claimed construction algorithm; for every pair of leaves compute the set of minimal common ancestors; if any pair has cardinality >1, the reduction is incomplete.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The ancestor-based display condition for xy|z requires that \"the unique least common ancestor (LCA) of x and y lies strictly below the unique LCA of x and z\" (and symmetrically for y,z). The reduction translates triple consistency into realization of required/forbidden LCA-constraints and claims this yields a valid phylogenetic network in polynomial time. However, general DAG realizations of LCA constraints can admit multiple minimal common ancestors for a leaf pair when reticulations are present; in such cases the predicate \"unique LCA\" is undefined and the equivalence between the triple instance and the constraint instance may not hold in both directions.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The paper defines an ancestor-based display condition for rooted triples xy|z (and anchored variants) in phylogenetic networks, requiring unique LCAs with the LCA of x,y strictly below the coinciding LCAs of the other pairs. It studies consistency problems for sets of such triples (with and without forbidden triples) and claims that all variants are solvable in polynomial time by translation to required/forbidden LCA-constraint realization problems on DAGs; moreover, a realizing phylogenetic network can be constructed in the same time bound whenever a solution exists.","tokens_in":1964,"tokens_out":307,"duration_ms":12207,"significance":"If the reduction is valid, the results supply the first polynomial-time algorithms and constructions for these local, biologically interpretable constraints on networks (as opposed to trees), addressing a previously unstudied class of problems with direct applicability to inference from genomic data.","major_comments":[{"comment":"Abstract (and the definition of triple display): the ancestor-based condition explicitly requires that LCAs are unique for the relevant leaf pairs. However, the claimed polynomial-time reduction to general LCA-constraint realization on DAGs does not appear to guarantee uniqueness of LCAs in the output networks (especially when reticulations are present). This raises a question about whether the equivalence between triple consistency and constraint satisfaction holds in both directions, which is load-bearing for the polynomial-time claim.","section":"Abstract"}],"minor_comments":[],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their careful reading of the manuscript and for highlighting this important point about the uniqueness of LCAs. We address the comment below.","responses":[{"response":"The definition in the manuscript does require unique LCAs, as the referee correctly notes. Our reduction translates the ancestor-based (and anchored) triple conditions into a collection of required and forbidden LCA constraints on a DAG; these constraints are formulated so that any realizing DAG must contain, for each constrained triple, a single vertex that serves as the unique LCA satisfying the stated ancestor relations (equality of the two higher LCAs and strict descent of the lower one). The known polynomial-time algorithm for LCA-constraint realization constructs precisely such a minimal DAG, in which the constrained pairs have unique LCAs by construction of the partial order on ancestor vertices. Reticulations are permitted but do not create additional minimal common ancestors for the constrained pairs because the equality and descent constraints force a unique meeting point. We will revise the manuscript to add an explicit paragraph clarifying this direction of the equivalence and confirming that the output networks satisfy the uniqueness requirement in the original definition.","revision_made":"yes","referee_comment":"[Abstract] Abstract (and the definition of triple display): the ancestor-based condition explicitly requires that LCAs are unique for the relevant leaf pairs. However, the claimed polynomial-time reduction to general LCA-constraint realization on DAGs does not appear to guarantee uniqueness of LCAs in the output networks (especially when reticulations are present). This raises a question about whether the equivalence between triple consistency and constraint satisfaction holds in both directions, which is load-bearing for the polynomial-time claim."}],"tokens_in":1411,"tokens_out":356,"duration_ms":24382,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main point is a new formulation of triple consistency in networks based on LCA relations rather than the usual tree display, plus an anchored relaxation, with the claim that all variants (with or without forbidden triples) reduce to LCA-constraint problems solvable in polynomial time, including construction of a realizing DAG and network.\n\nWhat is actually new is the ancestor-based interpretation (LCA(x,y) strictly below the common LCA of the other pairs) and the anchored version that drops the symmetry requirement. The abstract notes these questions have not been addressed before despite their direct link to sequence data, which seems plausible. The reduction strategy itself is a clean move if the underlying LCA realization problem is already known to be tractable.\n\nThe soft spot is the one flagged in the stress-test. The definitions explicitly require unique LCAs for the relevant pairs, yet general DAGs realizing LCA constraints can have multiple minimal common ancestors once reticulations are allowed. If the construction step does not enforce uniqueness or adjust the equivalence, the reduction may not be bidirectional. The abstract supplies no proof outline or algorithm details, so it is impossible to check whether they handle this or simply assume the output networks stay in the unique-LCA regime. The biological modeling assumption is also taken as given without further justification here.\n\nThis is for people working on algorithmic reconstruction of phylogenetic networks from local constraints. A reader who already knows the LCA-realization literature would get the most out of it. The work deserves peer review so the reduction and uniqueness issue can be examined in the full proofs.","headline":"The paper defines ancestor-based and anchored triple consistency problems for phylogenetic networks and reduces them to poly-time LCA-constraint realization, but the unique-LCA assumption in the definitions looks like a potential weak point in the reduction.","tokens_in":2417,"tokens_out":398,"would_cite":false,"duration_ms":16056,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Phylogenetic networks can realize consistent sets of rooted and anchored triples under an LCA interpretation, with the realizing network constructible in polynomial time.","keywords":["phylogenetic networks","rooted triples","anchored triples","least common ancestor","consistency problems","polynomial time","directed acyclic graphs","evolutionary networks"],"falsifier":"An input set of triples (ordinary or anchored, with or without forbidden triples) for which the polynomial-time algorithm outputs a DAG or network that fails to display the required LCA relationships as defined in the paper.","tokens_in":2754,"feed_emoji":"🌳","tokens_out":612,"duration_ms":17331,"temperature":0.7,"pith_summary":"The paper shows that consistency problems for ordinary rooted triples and anchored triples in phylogenetic networks, including versions with forbidden triples, reduce to realization problems for required and forbidden least common ancestor constraints. These problems are all solvable in polynomial time, and a suitable directed acyclic graph together with a phylogenetic network can be built within the same bound whenever a solution exists. A reader would care because such triples encode local information about evolutionary closeness that can be extracted from genomic sequences, so an efficient construction method supports building network models of evolutionary history from incomplete data. The ancestor-based definition handles the fact that networks allow asymmetric ancestral relationships unlike trees.","feed_headline":"Phylogenetic networks from triples built in polynomial time","feed_subtitle":"LCA-constraint reduction solves consistency for rooted and anchored triples and constructs the network efficiently","key_machinery":"The reduction of triple consistency questions (with and without forbidden triples) to realization problems for required and forbidden LCA-constraints.","core_discovery":"By translating the consistency questions for ordinary and anchored triples into realization problems for required and forbidden LCA-constraints, we show that all resulting problems can be solved in polynomial time. Moreover, whenever a solution exists, a suitable realizing DAG and phylogenetic network can be constructed within the same time bound.","pith_inferences":["The approach may extend to consistency problems involving other local constraints on ancestral relationships in networks.","It suggests that local LCA information extracted from sequences is often sufficient to determine global network structure under these definitions.","Similar reductions might apply to network inference tasks that incorporate additional data types beyond triples."],"forward_implications":["All variants of the consistency problems for triples and anchored triples are solvable in polynomial time.","A realizing directed acyclic graph exists and can be constructed in polynomial time when the constraints are consistent.","A phylogenetic network realizing the constraints can be constructed in polynomial time when a solution exists.","The same polynomial-time bound holds whether or not forbidden triples are present."],"fun_headline_variants":["Poly time from triples to phylogenetic networks via LCA","Triple consistency in networks solved with LCA constraints","Networks built from anchored triples in polynomial time","LCA realizes networks from required and forbidden triples"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The ancestor-based interpretation of triples and the anchored relaxation accurately model the biological information inferable from genomic sequences about relative evolutionary proximity.","fun_headline_variants_meta":{"raw":{"variants":["Poly time from triples to phylogenetic networks via LCA","Triple consistency in networks solved with LCA constraints","Networks built from anchored triples in polynomial time","LCA realizes networks from required and forbidden triples"]},"model":"grok-4.3","cost_usd":0.002749,"raw_usage":{"total_tokens":1584,"prompt_tokens":754,"num_sources_used":0,"completion_tokens":55,"cost_in_usd_ticks":27487000,"prompt_tokens_details":{"text_tokens":754,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":775,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":754,"tokens_out":55,"duration_ms":5889,"temperature":1.0,"reasoning_tokens":775,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-25T21:33:47.301229+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An input set of triples (ordinary or anchored, with or without forbidden triples) for which the polynomial-time algorithm outputs a DAG or network that fails to display the required LCA relationships as defined in the paper.","supporting_citations":[],"review_version":1}