{"id":"dd3eaf78-2ed7-44f4-adc1-4d0e1683aba7","arxiv_id":"2603.29815","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For a robust algebraic pattern, exponentiable weak Segal fibrations are exactly those satisfying a Conduché-style factorization condition.","lead":"This paper identifies exactly when generalized operad-like objects admit Day convolution, a way to give functor categories a monoidal structure. The result unifies known cases for ordinary and equivariant operads and extends to virtual double categories, with a necessity proof under a robustness condition.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Robustness proof for equivariant operads relies on a pullback-preservation claim that appears false.","rationale":"The reader correctly located the robustness package as the weakest assumption, and the exclusion of non-symmetric operads is an explicit limitation. My concern is narrower and more concrete: the robustness proof for the equivariant example, which is one of the three headline applications of Theorem B, appears to contain a false pullback-preservation claim. The orbit-set functor from finite G-sets to sets does not preserve pullbacks, so Example 7.24's verification of condition (4b) is not sound as written. Since Theorem B for G-∞-operads is derived from robustness of Span(FG)^♭, the necessity half of the central characterization is not established for that example without an additional argument. The rest of the paper may be correct, and the gap may be repairable—for instance, by a different proof of strongness of π0 or by a direct necessity argument for G-operads—so I would not reject, but I would ask for the robustness verification to be fixed before accepting the full claimed scope. This changes the reader's ACCEPT to CONDITIONAL, pending the concrete check.","tokens_in":61907,"tokens_out":27139,"duration_ms":285005,"concrete_test":"Specialize Definition 7.10(4b) to G = C2 and test the comparison map π0(gf) ⇒ π0(g)∘π0(f) for the composable pair where f: X → Z is the active map from the regular C2-set X to the two-fixed-point set Z (constant at a fixed point) and g: Z → Y is the inert map picking the same fixed point, with Y regular. Work out π0|O^el(gf)| directly from Construction 7.6 rather than from orbit sets of the middle span, and check whether it is equivalent to the composition of the two spans of orbit sets. If it is not equivalent, Example 7.24 fails and Span(C2)^♭ is not robust as claimed; if it is equivalent, the burden is to exhibit the missing verification, since the stated pullback preservation of the orbit functor is false in the ordinary category of G-sets.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The necessity direction (Theorem B) is the genuinely new part of the paper, and for equivariant ∞-operads it is routed entirely through robustness of Span(FG)^♭ (Example 7.24, used in Example 8.25). Example 7.24 defines O: F_G → F by sending a finite G-set to its set of orbits and asserts that O commutes with pullbacks, so that it induces a pattern map Span(FG)^♭ → Span(F)^♭ equal to π0. This assertion is not correct for orbit sets in general. For G = C2, let X and Y be the two-element regular G-set and let Z be the two-element G-set with trivial action. Let f,g: X,Y → Z be the constant maps at a fixed point z0. These are G-equivariant. In G-Set, X ×_Z Y is X × Y with the diagonal action, whose orbit set has two elements, whereas O(X) = O(Y) = 1 and both induced maps to O(Z) pick the same fixed point, so O(X) ×_{O(Z)} O(Y) ≅ 1. Thus O does not preserve this pullback. Because composition in Span(FG) is defined by pullback, the claimed functor Span(FG)^♭ → Span(F)^♭ is not obtained by the stated argument, and the verification of condition (4b) in Definition 7.10 is incomplete as written. Since Theorem B for equivariant ∞-operads depends on this robustness claim, the paper as written does not establish the advertised necessary direction for this headline example.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a general theory of Day convolution for algebraic patterns by characterizing exponentiable objects (algebrads) over a pattern O. Its main results are: Theorem A gives a sufficient Conduché-type criterion (CC) for exponentiability of an object in Algad(O); Theorem B asserts that for robust patterns the criterion is also necessary; Theorem D describes Algad(O) as complete Segal presheaves on a tree category Ω[O]; and Theorem C states that the underlying-graph functor preserves exponential objects. The paper also works out the criterion for ∞-operads, equivariant ∞-operads, generalized operads, and virtual double ∞-categories, and it gives an explicit counterexample showing that the sufficient criterion is strictly weaker than exponentiability of the underlying categorical functor on active morphisms.","tokens_in":62168,"tokens_out":5257,"duration_ms":51816,"significance":"If correct, the paper would substantially advance the subject: it provides the first necessary-and-sufficient Conduché criterion for exponentiability in several important ∞-categorical contexts, establishes a tree-category model for algebrads, and proves compatibility of exponential objects with underlying graphs. The proof strategy, passing through complete Segal presheaves on Ω[O], is genuinely different from the Lurie–Hinich–Nardin–Shah approach and is clearly explained. The paper also gives concrete worked examples and an explicit counterexample showing that the general criterion is sharp. However, one load-bearing example needed for the equivariant conclusion is not proved correctly as written, and this affects the advertised necessity theorem for equivariant ∞-operads.","major_comments":[{"comment":"Example 7.24 asserts that the orbit-set functor O: F_G → F, sending a finite G-set to its set of orbits, commutes with pullbacks, and uses this to conclude that the functor Span(F_G)^♭ → Span(F)^♭ is the pattern map π0 and that condition (4b) of Definition 7.10 holds. This pullback-preservation claim is false in general. For G = C2, let X and Y be the two-element regular G-set and let Z be the two-element G-set with trivial action. Let f,g: X,Y → Z be the constant maps at a fixed point z0. These are G-equivariant maps. In G-Set, the pullback X ×_Z Y is X × Y with the diagonal G-action, whose orbit set has two elements. But O(X) and O(Y) are singletons, while O(Z) has two elements, and the two induced maps O(X) → O(Z) and O(Y) → O(Z) both pick the same fixed point, so O(X) ×_{O(Z)} O(Y) is a singleton. Thus O does not preserve this pullback, and the claimed pattern map Span(F_G)^♭ → Span(F)^♭ is not obtained by the stated argument. Since Example 8.25 invokes exactly this robustness of Span(F_G)^♭ to deduce the necessary direction of the Conduché criterion for G-operads, Theorem B is not established for the equivariant case as written. This is a load-bearing gap in the proof of the paper's headline equivariant application, although it does not by itself invalidate the general framework or the other examples.","section":"§7.4, Example 7.24 and §8.5, Example 8.25"}],"minor_comments":[{"comment":"The proof of Proposition 4.22 invokes Example 7.30 and Corollary 8.6 before those results are introduced. The reference is not circular—Corollary 8.6 is proved independently of Proposition 4.22—but the forward dependence should be stated explicitly and ideally reorganized to avoid the appearance of circularity.","section":"§4.3, Proposition 4.22"},{"comment":"In condition (4c), the phrase “if x ∈ O lies over n” is not defined before it is used. It would be clearer to state explicitly that this means under the composed functor O → Span(F)^♭, or to spell out the intended projection to finite sets.","section":"§7.2, Definition 7.10"},{"comment":"The toy example is described mainly through diagrams and picture references. A precise set-theoretic definition of the maps A → B, or at least an explicit description of the corresponding graph maps in Fun(G,Cat), would make the counterexample easier to verify independently.","section":"§9.3, Construction 9.7"}],"recommendation":"major_revision","confidential_remarks":"The main obstacle to acceptance is the incorrect claim in Example 7.24 that the orbit-set functor preserves pullbacks. This is a localized error, but it directly affects the robustness proof for Span(F_G)^♭ and hence the necessity theorem for equivariant ∞-operads in Example 8.25. If the authors can prove robustness of Span(F_G)^♭ by a different argument, or replace the example with a correct verification, the paper's main theorems may well be salvageable. I would also recommend that an expert reader check the use of [Blo24, Corollary 6.2] in Construction 7.6, since that external result is load-bearing for the construction of π0 and the paper does not reproduce its proof."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a substantial paper, but the necessity theorem for equivariant operads is not currently proven as written. The stress-test concern is correct. Example 7.24 asserts that the orbit functor O:F_G→F commutes with pullbacks. It does not. For G=C2, take X=Y to be the regular two-element G-set and Z the trivial two-element G-set. Let f,g:X,Y→Z be constant at a fixed point of Z. In G-Set, X×_Z Y is X×Y with the diagonal action and has two orbits, while O(X)=O(Y)=* and O(Z) has two points, so the set-theoretic pullback O(X)×_{O(Z)}O(Y) is a point. Since composition in Span(F_G) is defined by pullback, the claimed pattern map Span(F_G)^♭→Span(F)^♭ is not obtained by the stated argument, and condition (4b) in Definition 7.10 is unverified. Consequently Example 8.25 does not establish Theorem B for G-∞-operads. This is load-bearing, because necessity for equivariant operads is one of the paper's headline claims.\n\nThe rest of the paper has real value. Theorem D, the description of algebrads as complete Segal presheaves on the tree category, is a genuine and useful new formulation. Theorem A cleanly unifies known sufficiency results, and Theorem C on underlying graphs is a nice observation. The virtual double category example, Δ^op,♮, is robust by a different and more convincing argument, so the flaw seems specific to the equivariant G-set example rather than to the general framework. The proof architecture is coherent overall, although many ∞-categorical details are delegated to external sources and I could not fully verify all of them. The forward reference from Proposition 4.22 to Corollary 8.6 is awkward, but the parenthetical alternative proof suggests it is not a real circularity.\n\nThis paper deserves a serious referee, but the referee should ask for a corrected or replaced robustness proof for Span(F_G)^♭ before the equivariant necessity claim is accepted. If that gets fixed, this will be a strong contribution to the algebraic patterns literature.","headline":"A serious paper in which the advertised necessity theorem for equivariant operads currently rests on a false pullback-preservation claim in Example 7.24.","tokens_in":62728,"tokens_out":5673,"would_cite":true,"duration_ms":56033,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["18N60","18N70"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that for robust algebraic patterns, an algebrad is exponentiable if and only if it satisfies the Conduché criterion (CC).","keywords":["algebraic patterns","weak Segal fibrations","algebrads","Day convolution","exponentiable objects","Conduché criterion","∞-operads","virtual double categories"],"falsifier":"Find an exponentiable algebrad over a robust algebraic pattern for which some factorization ∞-category Fact(f|g∘h) over an active composite ending at an elementary object is not weakly contractible; that would refute Theorem B. For the non-robust non-symmetric pattern Δ^op,♭, an exponentiable non-symmetric ∞-operad violating condition (CC) would show robustness is genuinely needed and would delimit the theorem's scope.","tokens_in":61681,"feed_emoji":"♾️","tokens_out":8711,"duration_ms":78798,"temperature":0.7,"pith_summary":"This paper asks when Day convolution exists for operad-like structures beyond ∞-operads. Working in the framework of algebraic patterns, where such structures are packaged as weak Segal fibrations (renamed algebrads), it proves that an algebrad over a pattern O is exponentiable precisely when a Conduché-style condition holds: for every composable pair of active maps ending at an elementary object, the ∞-category of factorizations of a lift is weakly contractible. The sufficiency direction works for every algebraic pattern, while the necessity direction is proved under an extra robustness package of hypotheses that the standard examples satisfy. If the characterization is correct, Day convolution is available inside the categories of (equivariant) ∞-operads and virtual double ∞-categories, and the underlying structures of exponential objects can be computed from the underlying structures of their factors.","feed_headline":"A single criterion tells when operad-like structures are exponentiable","feed_subtitle":"A factorization-category condition is necessary and sufficient for ∞-operads, equivariant ∞-operads, and virtual double categories.","key_machinery":"The load-bearing mechanism is the tree ∞-category Ω[O] of an algebraic pattern O: its objects are strings t0⇝⋯⇝tn of active morphisms such that tn is elementary, and Theorem D presents O-algebrads as complete Segal presheaves on Ω[O]. This turns exponentiability into a question about whether a right adjoint between presheaf categories preserves complete Segal objects, which can be handled by simplicial combinatorics. The Conduché criterion (CC) itself asks that the factorization ∞-category Fact(f|g∘h) over active composites ending at an elementary object be weakly contractible. Robustness—a package of soundness, saturation, inert-map detection, and finiteness conditions on the π0 functor—supplies the partial-composite (grafting) construction used to prove the necessity direction.","core_discovery":"The central claim is that exponentiable objects in the ∞-category Algad(O) of O-algebrads are exactly the maps P→O satisfying condition (CC): for any composable active pair x⇝y⇝e with e elementary and any lift f of the composite, the factorization ∞-category Fact(f|g∘h) is weakly contractible. Theorem A establishes sufficiency for all algebraic patterns; Theorem B establishes necessity for robust algebraic patterns, giving complete characterizations for ∞-operads, equivariant ∞-operads, and virtual double ∞-categories. In the same framework, Theorem D identifies Algad(O) with the ∞-category of complete Segal presheaves on a tree category Ω[O] whose objects are strings of active morphisms ending in an elementary object, and Theorem C shows that the underlying-graph functor Γ preserves exponential objects: Γ[P,Q] is the internal hom [ΓP,ΓQ].","pith_inferences":["A natural next step this opens up is to use the exponentials constructed here to define presheaf algebrads and develop Yoneda, Kan extension, and cocompletion technology for generalized operads and virtual double categories; the paper indicates such a sequel but leaves the development implicit.","Because the non-symmetric operad pattern Δ^op,♭ is explicitly not robust, the necessity direction for non-symmetric ∞-operads remains open; a natural test is whether another robust replacement or a sharpened robustness condition can cover it.","The tree-category presentation suggests that any algebraic pattern admits Segal-space models with the same formal behavior as Rezk's complete Segal spaces, which may let the exponentiability criterion be checked purely combinatorially in examples beyond those listed."],"forward_implications":["For ∞-operads, equivariant ∞-operads, and virtual double ∞-categories, exponentiable objects are completely characterized by condition (CC); for ∞-operads this recovers the flatness criterion of Hinich.","If P is exponentiable, the underlying graph of the exponential object [P,Q] is the internal hom [ΓP,ΓQ], generalizing the familiar fact that the underlying ∞-category of a Day convolution is a functor category.","Every algebraic pattern O admits the equivalence Algad(O)≃CSeg(Ω[O]), and iterating the tree construction produces a tower of inclusions Algad(O)→Algad(Ω[O]^op)→⋯ whose images consist of exponentiable objects.","Every Segal O-category, viewed as an O-algebrad, is exponentiable; in particular, every double category is exponentiable as a virtual double category.","For any ∞-category C, the virtual cospan double category Cospan^virt(C) is an exponentiable virtual double category, even when C lacks pushouts."],"supporting_citations":[{"why":"Introduced algebraic patterns and weak Segal fibrations, the framework whose exponentiability question the paper answers.","marker":"[CH21]"},{"why":"Supplies ∞-operads, the Conduché criterion in Cat∞/B, and the earlier Day convolution and underlying-∞-category results that this paper extends.","marker":"[Lur17]"},{"why":"Proved the sufficient criterion for ∞-operads via flatness, the baseline that Theorem A generalizes and that Theorem B makes necessary.","marker":"[Hin20]"},{"why":"Gave the previous sufficient criterion for equivariant G-∞-operads and the pattern FG,∗ used in the equivariant examples.","marker":"[NS22]"},{"why":"Provides the Conduché criterion and factorization-category methods used throughout, including the simplicial replacement strategy.","marker":"[AF20]"},{"why":"Supplies soundness, enveloping, and the equivalences between F∗-patterns and Span(F)-patterns used to verify robustness and transfer necessity results.","marker":"[BHS25]"},{"why":"Provides the double-∞-categorical reformulation of factorization systems used to construct Ω[O] and simplify the arguments.","marker":"[Jur25]"},{"why":"Established the operator-category analogue of describing Segal structures as presheaves on tree categories, a precedent for Theorem D.","marker":"[Bar18]"},{"why":"Identifies the tree category for F∗ and proves nerve equivalences used to check the complete Segal conditions in examples.","marker":"[CHH18]"},{"why":"Supplies the theory of complete Segal spaces that underlies the completeness condition in CSeg(Ω[O]).","marker":"[Rez01]"}],"fun_headline_variants":["One criterion decides exponentiability for ∞-operads","Exponentiability in algebraic patterns: one condition","Tree categories give new view of weak Segal fibrations","Underlying graph for exponential objects in ∞-categories"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The necessity direction (Theorem B) rests on the robustness conditions of Definition 7.10; if a pattern is not robust, the paper does not establish that the Conduché criterion is necessary, and the non-symmetric operad pattern is explicitly left uncovered.","fun_headline_variants_meta":{"raw":{"variants":["One criterion decides exponentiability for ∞-operads","Exponentiability in algebraic patterns: one condition","Tree categories give new view of weak Segal fibrations","Underlying graph for exponential objects in ∞-categories"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000734,"raw_usage":{"total_tokens":3257,"prompt_tokens":892,"completion_tokens":2365,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":508,"completion_tokens_details":{"reasoning_tokens":2301}},"tokens_in":508,"tokens_out":2365,"duration_ms":15653,"temperature":1.0,"reasoning_tokens":2301,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T15:36:35.328445+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find an exponentiable algebrad over a robust algebraic pattern for which some factorization ∞-category Fact(f|g∘h) over an active composite ending at an elementary object is not weakly contractible; that would refute Theorem B. For the non-robust non-symmetric pattern Δ^op,♭, an exponentiable non-symmetric ∞-operad violating condition (CC) would show robustness is genuinely needed and would delimit the theorem's scope.","supporting_citations":[],"review_version":1}