{"id":"8d9358d4-8ede-4010-a934-39fc3d2aae10","arxiv_id":"2607.20132","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The shuffle product on faces of strict families of nestohedra equals a sum over intervals of the new generalized flip order, which also admits an inversion characterization.","lead":"The paper defines the generalized flip order, a partial order on all faces of nestohedra, and proves that certain shuffle products on these faces can be computed by summing over intervals of this order. It also characterizes the order via generalized inversions for 'right-filled' hypergraphs, unifying and extending earlier orders such as the weak Bruhat, Tamari, and flip orders.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.5's interval description relies on the unproved root-fusion case of Lemma 2.45; the gap is genuine and should be closed.","rationale":"The reader's weakest_assumption pinpoints Lemma 2.45's root-fusion case and Lemma 4.6(b)'s omitted proof. I agree. After reading the proof of Theorem 4.5, Lemma 2.45 is used in property (A) to transfer interval bounds to restrictions: from ⧸(δ)≤U≤⧹(δ) one gets U⌈Hi=Ci via Lemma 4.6(b) and antisymmetry. Without the root-fusion case, this implication is unverified. A computational enumeration for small hypergraphs would either find a counterexample (breaking the theorem) or, more likely, confirm the lemma, in which case the missing proof should be supplied. This is a concrete gap, not a vague worry. The paper is otherwise remarkably explicit, with many detailed proofs and examples, so the omitted case stands out. The central claim is plausible; the verdict should remain CONDITIONAL until the gap is closed.","tokens_in":39677,"tokens_out":8103,"duration_ms":66153,"concrete_test":"Enumerate all connected ordered hypergraphs on ≤4 vertices; for each pair of constructs S,T with S⋖T a root fusion and every connected K⊆H, compute S⌈K and T⌈K and check S⌈K≤T⌈K in the GFO (by BFS on the Hasse diagram). If a violation is found, Lemma 2.45 fails and Theorem 4.5 collapses; if none is found, supply the missing proof of the root-fusion case (and the ⧸ half of Lemma 4.6(b)) to close the gap.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central interval theorem (Theorem 4.5) rests on Lemma 2.45, which states that the generalized flip order (GFO) commutes with restriction: S⋖T implies S⌈K ≤ T⌈K for connected K. In the proof of Theorem 4.5, property (A) uses exactly this lemma to pass from ⧸(δ)≤U≤⧹(δ) to U⌈Hi=Ci: Lemma 4.6(b) supplies ⧸(δ)⌈Hi=⧹(δ)⌈Hi=Ci, and Lemma 2.45 then forces U⌈Hi=Ci by antisymmetry. However, Lemma 2.45 has three cases and its root-fusion case is explicitly left to the reader ('This case is treated much like the previous one and is left to the reader'). If this case is false, there could be U in the interval whose Hi-restriction is not Ci, so the interval sum would contain extra terms and (25) would fail. The proof of Lemma 4.6(b) for ⧸ is also 'similar and left to the reader,' adding a second gap in the same chain. The hereditarily-ordered condition is used throughout, but the omitted case is the specific place where the argument is incomplete.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper defines a generalized flip order (GFO) on the faces of nestohedra, extending the Barnard–McConville flip order from vertices to all faces. It proves that the GFO is a partial order, shows that on vertices it agrees with the flip order under a hereditarity condition, gives an inversion-characterization of the GFO for right-filled hypergraphs, and proves that the shuffle product on faces of nestohedra, in the ordered strict associative clan setting, can be expressed as a sum over intervals in the GFO. The final sections compare the GFO with the facial weak order and Ronco's generalized Tamari order.","tokens_in":40124,"tokens_out":3067,"duration_ms":32359,"significance":"If the main claims are correct, this is a substantial and valuable contribution: it provides a uniform interval description for shuffle products on a broad class of nestohedra and a general inversion criterion for the GFO, unifying and extending results of Palacios–Ronco, Barnard–McConville, and others. The paper contains genuinely useful structural results, including a detailed proof of acyclicity of the GFO (Proposition 2.12), a comparison with the Barnard–McConville flip order (Proposition 2.29), and an algorithmic characterization for right-filled hypergraphs (Theorem 2.43). The writing is generally clear and the numerous examples and Hasse diagrams are helpful. However, several load-bearing proofs are incomplete: key lemmas are either left to the reader or only partially proved, and the main interval theorem depends directly on those gaps. These issues are fixable within the paper's framework, but they must be addressed before the central claims can be considered established.","major_comments":[{"comment":"The root-fusion case of Lemma 2.45 is explicitly 'left to the reader'. This case is load-bearing: Theorem 4.5, direction (A), uses Lemma 2.45 together with antisymmetry to conclude that every U in the interval [\\⧸(δ), \\⧹(δ)] satisfies U⌈H_i = C_i. If the omitted case fails, there could be interval terms whose restrictions do not match the delegation, and Equation (25) would be false. A full proof of the root-fusion case must be supplied.","section":"2.4, Lemma 2.45"},{"comment":"The proof of Lemma 2.41 ends with 'The verification of the required properties of U uses similar (lengthy) arguments ... and are omitted.' This lemma is essential for the converse direction of Theorem 2.43: it is the only step that produces a construct U with Inv_H(S) ⊆ Inv_H(U) ⊊ Inv_H(T) and fInv_H(S) ⊆ fInv_H(U) ∪ Inv_H(U). Without a complete proof, the inversion characterization of the GFO is not established. The omitted verification is not a routine detail; it is the technical core of the induction.","section":"2.3, Lemma 2.41"},{"comment":"In the proof of Lemma 4.6(b), the equality ⧸(δ)⌈H_i = C_i is 'similar and left to the reader', and the equalities for ⧸_B(δ) and ⧹_B(δ) are deduced from the previous equalities using Lemma 2.45 and Proposition 2.12. This creates a second gap in the same chain that supports Theorem 4.5: the omitted proof of ⧸(δ)⌈H_i = C_i, combined with the omitted root-fusion case of Lemma 2.45, means the restriction properties of both interval endpoints are not fully verified. Please provide complete arguments.","section":"4, Lemma 4.6(b)"},{"comment":"The statement of Theorem 4.5, Equation (26), contains what appears to be a typographical error: the right-hand side is written as ∗⋖_B(δ), but the definition in Equation (24) and the proof use ∗≤_B(δ). This should be corrected, since the notation suggests a covering-sum rather than the interval sum that the theorem intends.","section":"4, Theorem 4.5"}],"minor_comments":[{"comment":"The heading 'Generalised flip order isthe generalised flip order' has a missing space; also Section 2.4's heading contains 'heretirraly ordered', which should be 'hereditarily ordered'.","section":"2.2, heading"},{"comment":"The phrase 'satisfy a connectness condition' contains a typo ('connectedness').","section":"3.1, Remark 3.7"},{"comment":"The proof of associativity of ⧹ and ⧸ is omitted and the result is stated as not used in the sequel. Consider moving it to an appendix or explicitly marking it as auxiliary, so the reader is not left expecting a proof of a stated proposition in the main text.","section":"4, Proposition 4.3"},{"comment":"The example is described as showing failure outside the strict setting, but it would be helpful to state explicitly that the preteam ({C_{1}},{C_{2,3}}, C_{1,2,3}) is not a strict team and therefore does not contradict Theorem 4.5, which is restricted to ordered strict associative clans.","section":"4, Example 4.9"},{"comment":"The proof of Lemma 2.40 is very dense and refers to properties (♡), (♣), (♠) that are only proved informally. Some steps, especially the base case m=1 in the proof of (♣)/(♠), would benefit from explicit details or a reference to a more extended version.","section":"2.3, Lemma 2.40"}],"recommendation":"major_revision","confidential_remarks":"The paper relies heavily on the authors' own prior work [3] and [5], and the central theorem is stated in the framework of 'ordered strict associative clans' introduced there. The novelty relative to those papers should be clearly delineated in the introduction. The main technical gaps (Lemma 2.45 root-fusion case, Lemma 2.41, Lemma 4.6(b)) are substantial but seem repairable; if the authors can supply complete proofs, the paper would be a strong candidate for acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take on Curien–Delcroix-Oger–Obradović. This is a genuine attempt to unify face-order phenomena on nestohedra, and the parts that are actually written out are solid. The generalised flip order is a natural extension of Barnard–McConville's order from vertices to all faces, and Proposition 2.12 (it's a poset) is proved with a clean induction. The comparisons in Section 5—especially the concrete counterexamples separating it from Ronco's generalised Tamari order and from the facial weak order—are honest and useful.\n\nThe genuinely new results are Theorem 2.43 (inversion characterization in the right-filled case) and Theorem 4.5 (interval description of the shuffle product). Together they promise a nice bridge between polytopal order theory and the algebraic shuffle-product framework. The proposed quasi-associahedra family is a nice addition.\n\nMy reservation is not about plausibility but about proof completeness. Three lemmas in the chain leading to Theorem 4.5 are only partially proved. Lemma 2.45, the commutation of GFO with restriction, leaves the root-fusion case to the reader; that case is exactly what direction (A) of Theorem 4.5 uses. If it fails, the interval sum would contain extra terms. Lemma 4.6(b) has a similar gap. And Lemma 2.41, a key step in the inversion characterization, ends with 'the verification is omitted' after a long construction. These are not cosmetic omissions. The stress-test note is right to flag them.\n\nIn proportion, the rest of the paper is careful: the examples check out, the Hasse diagrams are consistent, and the discussion of the limits (Example 4.9) is frank. The self-citation is understandable—the authors are completing a program from their earlier work—and the new theorems are not forced by the definitions.\n\nI suspect the missing cases are indeed routine, as the authors claim, but in a paper this intricate 'left to the reader' is not enough for load-bearing lemmas. My recommendation: send it to a serious referee, but with an expectation that these cases will be written out before publication. Once that is done, it would be a reliable reference for both the order theory and the algebra.","headline":"Genuinely useful unification of face orders on nestohedra, but the main theorem has omitted proof cases—especially Lemma 2.45's root-fusion case—that must be supplied before the results are fully trustworthy.","tokens_in":40495,"tokens_out":3846,"would_cite":true,"duration_ms":41596,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52B11","06A07"],"pacs":[],"model":"deepseek-v4-flash","headline":"The shuffle product on faces of nestohedra coincides with a sum over an interval in the generalised flip order, a partial order generated by splitting and fusing nodes of the tree-like constructs that encode faces.","keywords":["nestohedra","hypergraph polytopes","generalised flip order","shuffle products","constructs","generalised inversions","associahedra","permutohedra"],"falsifier":"Compute the shuffle product ∗(δ) and the interval sum ∗≤(δ) for a small delegation in a strict clan—for instance, two constructs in a quasi-associahedron with B={1,2}—and check equality (25); a single construct appearing on one side but not the other would disprove Theorem 4.5. Alternatively, verify the omitted root-fusion subcase of Lemma 2.45: find a hypergraph H, a connected K⊆H, and a covering S⋖T that is a root fusion with S⌈K ≤ T⌈K failing; that single counterexample would break direction (A) in the proof.","tokens_in":39651,"feed_emoji":"🔀","tokens_out":7566,"duration_ms":72754,"temperature":0.7,"pith_summary":"This paper is trying to establish a uniform description of the shuffle product on the faces of nestohedra—polytopes built from hypergraphs—as a sum over an interval in a single partial order. That order, called the generalised flip order, is generated by elementary split and fusion moves on the tree-like objects ('constructs') that encode faces, and it extends the classical flip order from vertices to all faces. The paper further claims that, for right-filled hypergraphs, the order can be read off from sets of generalised inversions, giving a simple inclusion criterion for comparing faces. The payoff is that the interval description was previously known only for associahedra and permutohedra; here it is obtained in a broad framework ('ordered strict associative clans') that includes teleassociahedra and quasi-associahedra, and the limits of the framework are also exhibited.","feed_headline":"Shuffle products become interval sums under a new face order","feed_subtitle":"One partial order on all faces of nestohedra unifies earlier interval descriptions for associahedra and permutohedra.","key_machinery":"The load-bearing object is the generalised flip order (GFO): the reflexive-transitive closure of covering relations in which either an edge of a construct is fused (parent U, child V, with U > V in the ambient vertex order) or a node is split into U(V) under a connectivity condition. Constructs are the rooted, non-planar trees whose nodes are labelled by hyperedges and which encode the faces of a nestohedron; restriction cuts a construct down to a connected sub-hypergraph and is used to state the interval description. Squashing, a controlled sequence of splits allowed in hereditarily ordered hypergraphs, is the technical device that makes the inversion characterisation work.","core_discovery":"The central claim is Theorem 4.5: for any delegation δ in an ordered strict associative clan of hypergraphs, the shuffle product ∗(δ) equals ∗≤(δ), the sum over all constructs U lying between two canonically defined endpoints ⧸(δ) and ⧹(δ) in the generalised flip order; the same holds for the B-restricted product ∗B(δ) between ⧸B(δ) and ⧹B(δ). The endpoints are built recursively from the leftmost and rightmost participating constructs, and the equality is proved by showing that the restriction-based and interval-based descriptions of the product generate the same set of constructs. A second pillar is Theorem 2.43: in right-filled hypergraphs, S ≤ T holds exactly when Inv_H(S) ⊆ Inv_H(T) and","pith_inferences":["Editorial extension: if the interval description is as robust as claimed, the q-tridendriform algebras on nestohedron faces could be read off directly from interval combinatorics, yielding new bases or monomial descriptions.","Editorial extension: the right-filled inversion criterion suggests an efficient face-comparison algorithm, but the paper's own non-right-filled example shows a good pair can be destroyed by a split, so any algorithm would need extra correction data outside that class.","Editorial extension: since the new order differs from the facial weak order and from a previously proposed generalised order on small polytopes, the three face orders are inequivalent; which one aligns with which algebraic structure is left open.","Editorial extension: a natural test is whether the interval description survives outside strict clans (e.g., for simplices or hypercubes) under a modified order; the hypercube counterexample suggests the order, not the product, would need adjustment."],"forward_implications":["All shuffle products in ordered strict associative clans of nestohedra—including teleassociahedra and quasi-associahedra—can be computed by summing over explicit intervals, so the algebraic product is reduced to poset data.","The generalised flip order supplies a single partial order on all faces of any nestohedron, extending the known vertex-level flip order from vertices and unifying the face orders previously known for associahedra and permutohedra.","For right-filled hypergraphs, comparing two faces is decidable by checking two set inclusions of generalised inversions, no longer requiring chain search in the Hasse diagram.","The interval description is tight: it fails for hypercubes, where the relevant preteams are not strict clans, so the theorem marks the exact boundary of this phenomenon.","The new order is distinct from the facial weak order on hypercubes and from a previously proposed generalised order on associahedra with non-standard vertex orderings, so the new order is not redundant."],"fun_headline_variants":["All faces, one order: shuffle products become interval sums","Nestohedra faces: new order turns shuffles into interval sums","Generalised flip order on all faces unifies shuffle interval sums","From vertices to all faces: shuffle products meet interval order","Interval description for shuffle products on every nestohedra face"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The whole interval description depends on the framework of ordered strict associative clans of hereditarily ordered hypergraphs, and on a commutation lemma whose hardest case is left to the reader; if that unproved case fails, the main theorem loses its support.","fun_headline_variants_meta":{"raw":{"variants":["All faces, one order: shuffle products become interval sums","Nestohedra faces: new order turns shuffles into interval sums","Generalised flip order on all faces unifies shuffle interval sums","From vertices to all faces: shuffle products meet interval order","Interval description for shuffle products on every nestohedra face"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000271,"raw_usage":{"total_tokens":1475,"prompt_tokens":765,"completion_tokens":710,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":509,"completion_tokens_details":{"reasoning_tokens":634}},"tokens_in":509,"tokens_out":710,"duration_ms":7129,"temperature":1.0,"reasoning_tokens":634,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T10:40:13.306070+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the shuffle product ∗(δ) and the interval sum ∗≤(δ) for a small delegation in a strict clan—for instance, two constructs in a quasi-associahedron with B={1,2}—and check equality (25); a single construct appearing on one side but not the other would disprove Theorem 4.5. Alternatively, verify the omitted root-fusion subcase of Lemma 2.45: find a hypergraph H, a connected K⊆H, and a covering S⋖T that is a root fusion with S⌈K ≤ T⌈K failing; that single counterexample would break direction (A) in the proof.","supporting_citations":[],"review_version":1}