{"id":"2d8abd92-33d7-4147-bb7e-377279f7955f","arxiv_id":"2512.22794","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For strictly factorisable operadic categories, the pita nerve is a coherent top-lax simplicial category, and a decomposition space when all quasibijections are invertible.","lead":"The authors show that in categories with a unique 'pita' factorisation of every map, a naturally associated pita nerve is coherent even though it is not a strict simplicial object. The result supports a planned simplicial theory of operadic categories and yields a new combinatorial coalgebra for finite sets.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 9.5's n>0 coherence check rests entirely on Lemma 7.5, whose proof is a one-sentence appeal to a sketched Diagram (25); if uniqueness of the lift fails, the reduction to n=0 is invalid.","rationale":"I read the paper in good faith: the overall strategy is coherent, the n=0 computations are explicit, and the claimed theorem plausibly follows from strict factorisability. The reader's weakest assumption is exactly the reduction via Lemma 7.5, and I agree this is the most load-bearing point. The proof of Lemma 7.5 is not actually supplied: it references Diagram (25), whose construction is itself only sketched in Proposition 7.3. Since Theorem 9.5 uses this lemma to reduce all higher coherence checks to the n=0 case, a gap here directly affects the main technical result. I am not claiming the theorem is false, nor that the authors are mistaken; I am identifying the precise point where the argument is least secure. The proposed concrete test—fully proving Lemma 7.5 for n=2 and checking it in a non-invertible-quasibijection example—would settle whether the reduction is valid. If the lemma holds, the n>0 coherence equations follow by faithfulness, and the paper's conditional acceptance is justified. I therefore recommend no change to the reader's CONDITIONAL verdict.","tokens_in":25203,"tokens_out":26667,"duration_ms":263481,"concrete_test":"Give a complete proof of Lemma 7.5 for n=2: start with a locally order-preserving chain T2→T1→T0 and a quasibijection σ0:T0→S0, construct the lifted chain S2→S1→S0 and horizontal quasibijections σ1,σ2, and prove uniqueness. Apply the construction in a strictly factorisable category with non-invertible quasibijections (e.g., the n-ordinals of [2]): if two distinct lifts exist for some σ0, then P2→P0 is not a discrete opfibration and the reduction in Theorem 9.5 via Diagram (31) is invalid. If uniqueness holds, the remaining task is to verify Equation (27) for n>0 explicitly.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim Theorem A is proved by checking the coherence equations (26) and (27) in degree 0 and then asserting the higher-degree cases reduce to the same computation via Lemma 7.5. Lemma 7.5 claims that the functor P(O)_n → P(O)_0 sending a locally order-preserving chain to its final object is a discrete opfibration. Its proof is a single sentence: 'any σ0:T0→S0 admits a unique lifting ... using Diagram (25).' But Diagram (25) is itself only a sketch from Proposition 7.3, justified by 'an induction similar to the case n=2.' The reduction in Theorem 9.5 requires more than existence: it requires faithfulness, so that the two composite 2-cells in Diagram (31) can be identified from equality of their bottom quasibijections. This is precisely where strict factorisability must force uniqueness, but the argument is not given. In particular, when the π-factors involved are not epimorphic, it is not obvious that the top vertical maps in the lifted chain are uniquely determined by commutativity and fibrewise order-preservation. If Lemma 7.5 fails, the proof of Theorem 9.5 for n>0 collapses. Equation (27) is also only checked for n=0, again with 'the other cases are similar.'","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a theory of 'pita factorisation' in strictly factorisable operadic categories. It defines, for such a category O, a sequence of categories P(O)_n of locally order-preserving chains, assembled via reflection functors into a 'top-lax simplicial category' called the pita nerve. The main result, Theorem A, states that the pita nerve of a strictly factorisable operadic category is a coherent top-lax simplicial category. In the case where all quasibijections are invertible, the paper proves (Theorem B) that this pita nerve is a decomposition space (a 2-Segal space). It also computes the resulting incidence bialgebra for the operadic category Fin_surj. The central construction is motivated by a companion paper [4] where the operadic nerve of any operadic category is shown to be coherent via Theorem A.","tokens_in":25529,"tokens_out":4612,"duration_ms":47564,"significance":"If correct, Theorem A is a substantial and useful result: it shows that strict factorisability compensates for the failure of pita factorisations to form an orthogonal factorisation system, and yields a coherent weak simplicial structure on the pita nerve. This is a key technical ingredient for the authors' broader programme, as stated in the introduction. Theorem B, giving a decomposition-space structure in the invertible-quasibijection case, is also interesting and provides a new family of decomposition spaces with an explicit incidence coalgebra. The paper's treatment of the motivating example Fin, the notion of locally order-preserving chains, and the explicit n=0 verifications in Theorem 9.5 are valuable. However, the proof of the main theorem is not fully written out: several reduction steps are asserted rather than proved, and these steps are load-bearing for the central claim.","major_comments":[{"comment":"Lemma 7.5 asserts that P(O)_n → P(O)_0 is a discrete opfibration, with the proof being a single sentence: 'any σ0:T0→S0 admits a unique lifting ... using Diagram (25).' But Diagram (25) is only a sketch, justified at the end of Proposition 7.3 by 'an induction similar to the case n=2', whose n=2 verification itself has a gap: the commutativity of the top square in the diagram after Eq. (22) is resolved by invoking uniqueness in Proposition 6.8(1), but the relevant naturality and uniqueness properties for arbitrary chains are not proved. This lemma is used in Theorem 9.5 to reduce the n>0 coherence checks to n=0; for that reduction one needs not just existence but also faithfulness—i.e., genuine uniqueness of the lifting. As written, the lemma is not established, and the proof of Theorem 9.5 therefore does not go through for n>0.","section":"§7, Lemma 7.5 and Proposition 7.3"},{"comment":"Equation (26)/(34) is verified only in the case n=0. The text states: 'For n>0, a direct calculation ... would lead to long and complicated relations ... Fortunately Lemma 7.5 shows that it is not necessary ... Those calculations then amount to exactly the same calculations as for n=0.' This is not a proof unless Lemma 7.5 is fully established, which it is not (see previous comment). In particular, identifying the two sides of (34) for n>0 requires the discrete opfibration property, including the uniqueness of the lifting, to compare 2-cells by looking only at their bottom quasibijections. The same issue affects Equation (27), which is checked only for n=0 with 'the other cases are similar'. Since Theorem A is the central result, this is a load-bearing gap; a complete proof or a precise reduction is needed.","section":"§9, Theorem 9.5, Equations (26) and (34)"},{"comment":"The proof of Theorem 10.4 checks the required pullback squares only for n=0, asserting that 'All the higher cases are analogous, only with longer chains.' The core of the n=0 argument is Lemma 10.5, whose proof is itself incomplete: the claimed adjunction is stated with 'We leave checking naturality of this morphism to the reader as an exercise', and functoriality of F is asserted to 'follow easily from Proposition 6.8(1)'. Moreover, the discreteness of C2 is justified by saying that a fibrewise order-preserving quasibijection w between order-preserving maps 'must be an identity', but this uses a uniqueness property that is not proved in the stated generality. Since Theorem B is a main theorem, these steps should be written out.","section":"§10, Theorem 10.4 and Lemma 10.5"}],"minor_comments":[{"comment":"The title in the manuscript reads 'PITA F ACTORISATION' in the header; this appears to be a typo for 'PITA FACTORISATION'.","section":"Title"},{"comment":"The displayed diagrams for Equations (26) and (27) are difficult to read because several morphism labels appear missing or misplaced; for instance, the right-hand side of (27) seems to have a stray '1' and an ambiguous 'sn+1'. Please re-render for clarity.","section":"§8, Definition 8.1"},{"comment":"The 'Apology 9.2' is unconventional in a research paper; the indexing convention is understandable and the explanation is helpful, but formatting it as a formal remark would be more appropriate.","section":"§9, Apology 9.2"},{"comment":"The companion paper [4] is cited as 'MAIN PAPER' without an arXiv identifier or full bibliographic data. This makes it hard to audit the claimed application of Theorem A; please add a reference or at least state that it is in preparation.","section":"Introduction"},{"comment":"In the computation of the incidence bialgebra for Fin_surj, the notation B(n,k)(A1,A2,...) is used without spelling out the precise convention for the Bell polynomials; a short definition or reference would help.","section":"§10"}],"recommendation":"major_revision","confidential_remarks":"The paper develops an interesting and likely correct theory, and the main results are plausible. However, the proofs of Theorems A and B contain repeated appeals to 'similar' or 'analogous' cases and to an unproved discrete-opfibration lemma (Lemma 7.5). These are not mere presentation issues: Lemma 7.5 is explicitly the mechanism that reduces the coherence equations in Theorem 9.5 to the verified n=0 case. The companion paper [4], which is the advertised application, is not available to the referee, so the full programme cannot be audited here. I recommend major revision: the authors should write out the missing uniqueness proof in Lemma 7.5, give a complete reduction in Theorem 9.5 for all n, and complete the proof of Theorem 10.4 via a detailed proof of Lemma 10.5. The mathematical ideas are sound enough to warrant this work being done."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear —,\n\nPunchline: the pita nerve is a genuinely new construction, and Theorem A is likely correct. The paper is worth refereeing, but the harder n>0 part of the coherence proof is sketched more than proved, and a referee should push for the missing details.\n\nWhat is actually new: the strict-factorisability condition, the pita nerve as a top-lax simplicial category, and the decomposition-space theorem in the invertible case. The Finsurj incidence bialgebra with the k! factors is new to me, and the explicit n=0 computations of the two coherence equations are real work, not filler. The connection to decalage and to Jardine's supercoherence is also well explained.\n\nWhere it is soft: Lemma 7.5 is the load-bearing step for reducing the n>0 coherence equations to the n=0 calculation, and its proof is a single sentence plus a reference to Diagram (25), which itself is justified only by \"induction similar to the case n=2.\" The stress-test worry is fair: the reduction needs faithfulness, not merely existence, of the lift, and that faithfulness has to come from strict factorisability. My guess is the lemma is true — the fibrewise order-preserving squares and uniqueness of η(f/g) are exactly the right ingredients — but the sentence \"those calculations then amount to exactly the same calculations\" in Theorem 9.5 is not a proof. Lemma 10.5 similarly leaves naturality to the reader, and \"the other cases are similar\" appears more than once. These are all fixable gaps, but together they make the central theorem harder to audit than it should be.\n\nAlso worth noting honestly: the headline application lives in the unpublished companion paper [4]. That is not a flaw in the mathematics here, but it means the motivation cannot currently be checked independently.\n\nBottom line: the reader's conditional verdict is about right. I would send it to a referee — the construction is novel and the main theorem matters for the operadic-category program — but I would ask the referee to focus on Lemma 7.5 and on making the n>0 coherence verification explicit. If the uniqueness argument can be written out, this is a solid contribution.","headline":"Theorem A is probably true and the pita nerve is a real new construction, but the n>0 coherence proof leans on a lemma whose proof is one sentence; the paper deserves a serious referee, not a desk rejection.","tokens_in":25977,"tokens_out":1908,"would_cite":true,"duration_ms":20803,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["18M60","18N50"],"pacs":[],"model":"deepseek-v4-flash","headline":"The pita nerve of any strictly factorisable operadic category is a coherent top-lax simplicial category, and it becomes a decomposition space when quasibijections are invertible.","keywords":["pita factorisation","operadic categories","top-lax simplicial objects","decomposition spaces","2-Segal spaces","quasibijections","pita nerve","incidence coalgebras"],"falsifier":"Compute both sides of coherence equation (35), π(η(f3/f2))π(f2f3) = π(π(f2)η(f3))π(f3), in the strictly factorisable category of finite ordinals for a pair of maps f3: T3→T2 and f2: T2→T1; a single pair for which the two composites differ would disprove Theorem A. More globally, search for a strictly factorisable operadic category whose pita nerve fails the two β-coherence axioms (26) and (27).","tokens_in":25087,"feed_emoji":"🥙","tokens_out":9863,"duration_ms":87480,"temperature":0.7,"pith_summary":"In a strictly factorisable operadic category, every morphism factors uniquely as an order-preserving map preceded by a quasibijection — the pita factorisation. This factorisation is not an orthogonal factorisation system, because the quasibijection condition is local to the codomain, so the usual machinery for building simplicial objects from factorisation systems cannot be applied directly. The paper shows that the pita factorisation is nevertheless enough: the pita nerve, whose n-simplices are locally order-preserving chains, is a coherent top-lax simplicial category. The only non-strictness sits in the top face operators, and it measures a real phenomenon: the fibres of a composite morphism are not literally the fibres of the fibres, but are canonically reordered versions of them. In the case where all quasibijections are invertible, the pita nerve is a decomposition space and thus carries an incidence coalgebra; the paper works out a new example for surjections of finite sets. The motivation is that this coherence is exactly what is needed to show that every operadic category has a coherent operadic nerve in a simplicial approach.","feed_headline":"Strict factorisation makes operadic nerves coherent","feed_subtitle":"A unique pita splitting gives a coherent weak simplicial object, key to simplicial operadic categories.","key_machinery":"The key object is the pita factorisation: each morphism f factors uniquely as f = η_f ∘ π_f with η_f order-preserving and π_f a quasibijection that is order-preserving on fibres. Strict factorisability adds a unique filler η(f/g) for every composable pair f,g, making the choice functorial. The paper builds the pita nerve by first forming W(O)_n, the category of all chains of n composable morphisms (a strict simplicial category), then passing to the reflective subcategory P(O)_n of locally order-preserving chains via reflection functors r_n. The top face operator d_n is defined as t_{n-1} δ_n, the reflection of an omitted last object, which creates the non-strictness. The coherence of the res","core_discovery":"The paper proves Theorem A: for every strictly factorisable operadic category, the pita nerve — n-simplices are locally order-preserving chains of n morphisms — is a coherent top-lax simplicial category. All simplicial identities hold strictly except those for two consecutive top face operators, replaced by 2-cells satisfying two coherence axioms. Strict factorisability makes the reflection from all chains back to locally order-preserving chains unique, and the non-strictness records that fibres of a composite are equal to fibres of fibres only up to a canonical reordering. Theorem B: when quasibijections are invertible, the pita nerve is a decomposition space, hence carries an incidence coa","pith_inferences":["The construction suggests a general template: any category with a unique pita-style factorisation, such as the category of vines with braidings replacing permutations, should admit a coherent top-lax nerve by the same reflection method.","The new incidence coalgebra for finite-set surjections, with factorial partition-polynomial comultiplication, may admit a symmetric-function or plethystic interpretation that the classical composition bialgebra does not have.","A testable extension: the decomposition-space property should persist for strictly factorisable operadic categories where quasibijections become invertible only after localisation, which would connect the pita nerve to homotopy-coherent 2-Segal spaces."],"forward_implications":["Strict factorisability compensates for the failure of the pita factorisation to be an orthogonal factorisation system, yielding a coherent weak simplicial structure for every strictly factorisable operadic category.","The coherence of the pita nerve implies that the operadic nerve of every operadic category is coherent, as used in the companion paper's simplicial approach.","When all quasibijections are invertible, the pita nerve is a decomposition space, so it carries an incidence coalgebra; the paper exhibits a new coalgebra for finite-set surjections with a comultiplication governed by factorial partition polynomials.","The non-strictness is a feature, not a defect: it encodes the axiom that 'fibres of fibres are fibres' only up to a canonical reordering, which is exactly the pita factorisation."],"fun_headline_variants":["Pita factorisation yields coherent operadic nerves","Unique pita splitting gives coherent weak simplicial object","Strict factorisability makes pita nerve coherent","Pita nerve: coherent lax simplicial category from strict factorisation","Invertible quasibijections turn pita nerve into decomposition space"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The argument depends on strict factorisability: for every composable pair f,g there is exactly one filler morphism η(f/g) between the middle objects, and on the reduction of coherence checks to the length-zero case via a discrete opfibration property; if only a non-unique or non-functorial choice of fillers exists, the pita nerve may fail to be coherent.","fun_headline_variants_meta":{"raw":{"variants":["Pita factorisation yields coherent operadic nerves","Unique pita splitting gives coherent weak simplicial object","Strict factorisability makes pita nerve coherent","Pita nerve: coherent lax simplicial category from strict factorisation","Invertible quasibijections turn pita nerve into decomposition space"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00073,"raw_usage":{"total_tokens":3097,"prompt_tokens":728,"completion_tokens":2369,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":472,"completion_tokens_details":{"reasoning_tokens":2299}},"tokens_in":472,"tokens_out":2369,"duration_ms":16123,"temperature":1.0,"reasoning_tokens":2299,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T13:46:17.505084+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute both sides of coherence equation (35), π(η(f3/f2))π(f2f3) = π(π(f2)η(f3))π(f3), in the strictly factorisable category of finite ordinals for a pair of maps f3: T3→T2 and f2: T2→T1; a single pair for which the two composites differ would disprove Theorem A. More globally, search for a strictly factorisable operadic category whose pita nerve fails the two β-coherence axioms (26) and (27).","supporting_citations":[],"review_version":1}