{"id":"8750b65a-a6b7-4ca2-866a-1c16ebbf27cb","arxiv_id":"2411.18544","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":2.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"An expository survey introducing 2-Segal sets through graph and tree examples, with worked Hall algebra and discrete Waldhausen S-construction applications.","lead":"This survey explains a mathematical framework, 2-Segal sets, in which combining objects can be partially defined or have several answers, while remaining associative. Using graphs and trees as concrete examples, it shows how such structures support Hall algebras and a discrete version of Waldhausen's S-construction, giving newcomers a combinatorial entry point.","discovery_kind":"review","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Tree section rests on an unpublished preprint and on the explicitly informal Definition 5.3, so the tree Hall algebra example cannot be independently checked as written.","rationale":"The reader's weakest assumption identified Definition 5.3 and the unpublished status of [2] as the critical point, and my review finds that this is indeed the load-bearing concern. The graph examples and the double-category equivalence are supported by published references and internally consistent, so the paper's expository value is genuine. The tree section is the only place where a central example depends on a definition that the author explicitly warns is informal. I do not see a further internal inconsistency in the graph material: for instance, the Hall algebra computation in Example 6.3 matches the definition of multiplication in Definition 6.1. I also do not think this concern warrants rejection, because the defect is an expository gap and a citation to an unreleased preprint rather than a demonstrated mathematical error. However, as written the tree example cannot be fully verified by a reader, so the conditional verdict is appropriate. My analysis does not move the reader's verdict, hence UNCHANGED; supplying the precise definition or a stable public reference for [2] would make ACCEPT the appropriate verdict.","tokens_in":10160,"tokens_out":6961,"duration_ms":67234,"concrete_test":"Obtain the precise definition of admissible subforest from [2] (or from the author) and use it to compute X^T_1 for the rooted two-vertex tree with root a. Check whether X^T_1 is exactly {∅, a, b, G} and whether the Hall product a·b equals G alone. If the precise definition admits a ⨿ b or produces additional 2-simplices, then Example 6.6 and Proposition 6.7 must be revised.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central expository promise is that a reader can understand and reproduce the examples and Hall computations. That promise is met for the graph material (Theorem 4.3 is quoted from the published [3] and supported by a concrete 3-simplex argument) and for the double-category material (Theorem 7.10 is quoted from [3] with a proof sketch). It is not met for the tree material. Definition 5.4 defines X^T using 'admissible subforests', but Definition 5.3 defines an admissible subforest as 'any forest (or tree) obtained from face maps along admissible cuts'. This is circular as written: face maps are part of the simplicial set X^T whose 1-simplices are the admissible subforests, and admissible cuts were defined only for rooted trees (Definition 5.1), not for forests, even though the paragraph immediately before Definition 5.3 says that top face maps can produce forests. The author explicitly flags the gap: 'We refer the reader to [2] for a more nuanced definition, and simply suggest here that the following one can be made more precise.' Since [2] is an unpublished preprint, a reader cannot check whether Definition 5.3 matches the real definition. The load-bearing computation is Example 6.6: it asserts that for the rooted two-vertex tree with root a, X^T_1 = {∅, a, b, G}, excluding a ⨿ b, and that a·b = G. This conclusion depends directly on the precise notion of admissible subforest. If [2]'s definition differs, for example by allowing disconnected upper forests or by treating the upper part of a cut differently, the basis and multiplication change and Proposition 6.7 may fail. Theorem 5.5 and Proposition 5.6 are also quoted from [2], and the illustrative Figure 1 is not a proof. This is a missing-support and circularity concern, not a demonstration that the result is false.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper is an expository introduction to 2-Segal sets in the discrete setting. It reviews simplicial sets, 1-Segal sets, and 2-Segal sets; presents two families of examples, the simplicial sets X^G attached to a finite graph (Section 4) and X^T attached to a rooted tree (Section 5), quoting the 2-Segal property for these from the author's earlier papers [3] and [2]; and then applies these examples to Hall algebras (Section 6) and to the discrete Waldhausen S_•-construction, including the equivalence S_• ≃ P between pointed stable double categories and reduced 2-Segal sets (Section 7, quoted from [3]). The main contribution is expository: it collects these constructions and provides worked computations such as the Hall algebra of a two-vertex graph and of the same graph viewed as a rooted tree.","tokens_in":10405,"tokens_out":4813,"duration_ms":41066,"significance":"If the exposition were fully self-contained, the paper would serve a useful purpose: the 2-Segal literature is largely homotopical, and this manuscript makes the definition and its algebraic consequences accessible through finite examples. The graph material (Theorem 4.3 with the 3-simplex argument, Examples 6.3 and 6.4, Proposition 6.5) and the S_•-material (Theorems 7.6 and 7.10, Examples 7.11 and 7.12) give concrete, reproducible computations grounded in the published paper [3]. The paper is also honest about what it quotes and what it only sketches. However, the tree section does not meet the same standard of self-containedness, and since the tree Hall computation in Example 6.6 is one of the two advertised families of examples, this is a substantive gap rather than a cosmetic one.","major_comments":[{"comment":"The definition of 'admissible subforest' is not a definition as written. It says an admissible subforest is 'any forest (or tree) obtained from face maps along admissible cuts,' but face maps belong to the simplicial set X^T of Definition 5.4, which is itself defined in terms of the set of admissible subforests. The paper explicitly states that the reader should consult [2] for 'a more nuanced definition' and that the given one 'can be made more precise.' Since [2] is an unpublished preprint, the tree examples in Sections 5 and 6 cannot be checked from the manuscript. I recommend giving a precise recursive definition of admissible subforest and of layering, or quoting the exact definition from [2] and proving that it is equivalent to the sketch.","section":"Section 5, Definition 5.3"},{"comment":"The computation that H(X^T) is 4-dimensional, with a·b = G and b·a = 0, depends critically on excluding a ⊔ b from X^T_1. That exclusion is a consequence of the informal Definition 5.3. If the precise definition in [2] differs in any way, for example by allowing disconnected upper forests or by treating the root differently, the basis and multiplication in Example 6.6 and the statements in Proposition 6.7 would change. Since the paper's expository promise is that a reader can reproduce the Hall algebra computations, this load-bearing computation must be supported by a precise definition inside the paper, not merely by a pointer to an unpublished preprint.","section":"Section 6, Example 6.6"},{"comment":"The 2-Segal property for X^T is quoted from the unpublished preprint [2] and is only illustrated for one 3-simplex shape in Figure 1. Without a precise definition of admissible subforest, the statement of the theorem is not fully well-posed for a reader of this paper. This is not a criticism of the theorem itself, but of the exposition: either the precise definition and a proof sketch should appear here, or the tree section should be explicitly framed as conditional on [2]. As it stands, the graph examples are self-contained, but the tree examples are not.","section":"Section 5, Theorem 5.5"}],"minor_comments":[{"comment":"The displayed maps that are asserted to be bijections are missing: the text reads 'so that the maps and are bijections' with no maps shown. Please insert the omitted diagrams or a precise description of the source and target maps.","section":"Section 7, Definition 7.3"},{"comment":"The diagram defining S_n(C) is visibly garbled in the text; the rows and columns do not render as an array. A clean commutative diagram or a formal description of the diagrams in terms of functors from W2 would improve readability.","section":"Section 7, Definition 7.5"},{"comment":"The sentence 'Similarly to graphs equipped with an ordered partition of their edges' should presumably say 'vertices', since the graph construction X^G in Definition 4.1 uses partitions of vertices, not edges.","section":"Section 5, after Definition 5.2"},{"comment":"The phrase 'an admissible cut between H and K' in the bullet list is used without definition; please add a definition or a reference to make the statement precise.","section":"Section 6, Proposition 6.7"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is essentially a survey of the author's own prior work, with most theorems quoted from [3] or [2]. This is acceptable for an expository article, but the reliance on the unpublished preprint [2] for the tree examples is a verifiability problem that should be resolved before publication. The editor may also wish to confirm that a primarily expository paper of this type is appropriate for the journal's scope; if so, the revision should make the tree definitions and computations self-contained."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take on Bergner, arXiv:2411.18544. It's an honest, clearly written survey of 2-Segal sets with worked combinatorial examples. There are no new theorems; nearly everything is quoted from the author's own earlier papers [3] and the unpublished [2], or from Dyckerhoff-Kapranov and Gálvez-Carrillo-Kock-Tonks. That's fine for an introduction, but it sets a ceiling: the value is pedagogical, not research.\n\nWhat works well: the review of simplicial sets and Segal conditions is crisp, the graph examples are concrete and check out (e.g., Example 6.3's a·b = (a⊔b)+G matches Prop 6.5(3)), and the double-category material in Section 7 is a genuinely useful walk through the discrete S-construction and the equivalence S• ⊣ P, all tracked to [3]. A newcomer can reproduce the graph Hall algebra and the double category examples by hand.\n\nThe soft spot is the tree section. Definition 5.3 defines an admissible subforest as 'any forest (or tree) obtained from face maps along admissible cuts.' As written this is circular: face maps are part of the simplicial set X^T whose 1-simplices are the admissible subforests, and admissible cuts were defined only for trees, not forests, even though the text notes top face maps can produce forests. The author explicitly says 'We refer the reader to [2] for a more nuanced definition' — so the paper flags that its own definition is informal. That matters because Example 6.6 and Proposition 6.7 (the tree Hall algebra) depend on exactly which subforests count as admissible. If [2]'s definition differs, the basis of H(X^T) and the multiplication change. Theorem 5.5 and Prop 5.6 are also quoted from [2], with an illustrative picture rather than a proof. This is a missing-support and circularity problem, not a demonstrated falsehood; but it means a reader cannot independently verify the tree content from this manuscript alone.\n\nMy bottom line: this is a useful entry point, especially for the graph and double-category examples, and it's worth a serious referee. But the tree section needs a fix: either include the precise definition from [2], state clearly that it's only an expository sketch, or give a stable public reference. Without that, the tree Hall algebra example is on shaky ground. I'd send it to review with that request, and I'd probably cite it for the graph examples even though I wouldn't rely on the tree material.","headline":"A clear, honest survey of 2-Segal sets with worked graph and double-category examples that check out; the tree section rests on an unpublished preprint and an informal, circular definition, so the tree Hall algebra material cannot be independently verified as written.","tokens_in":11113,"tokens_out":2532,"would_cite":true,"duration_ms":21953,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["55U10","18N50"],"pacs":[],"model":"deepseek-v4-flash","headline":"Finite graphs and rooted trees carry explicit 2-Segal sets whose Hall algebras can be computed by hand.","keywords":["2-Segal sets","Hall algebras","Waldhausen S-construction","simplicial sets","rooted trees","finite graphs","double categories","decomposition spaces"],"falsifier":"Compute the 1-simplices and the 2-Segal map of $X^T$ for a small labeled rooted tree, such as a three-vertex chain, using the cited precise definition of admissible subforest; if the resulting set of subforests differs from the list generated by Definition 5.3, then Example 6.6 and Proposition 6.7 would need correction. Alternatively, check whether $X^T_3 \\to X^T_2 \\times_{X^T_1} X^T_2$ is a bijection for that tree under the face-map definition; any failure would contradict Theorem 5.5.","tokens_in":9833,"feed_emoji":"🌲","tokens_out":9429,"duration_ms":79440,"temperature":0.7,"pith_summary":"This is an introduction to 2-Segal sets aimed at readers who want to see the structure without heavy homotopy theory. The paper's central assertion is that the 2-Segal condition, a weakening of Segal's condition under which composition need not exist or be unique, is realized by two concrete families: simplicial sets $X^G$ attached to finite graphs and $X^T$ attached to rooted trees. Both families are shown to be 2-Segal, and the paper works out what the two main constructions, Hall algebras and a discrete Waldhausen $S_\\bullet$-construction, return on these examples. If the exposition is correct, a reader can compute Hall algebra products such as $a\\cdot b$ in the graph case and $a\\cdot b=G$ in the rooted-tree case directly from the simplicial structure, and can see how reduced 2-Segal sets correspond to pointed stable double categories.","feed_headline":"Graphs and trees give concrete 2-Segal sets and Hall algebras","feed_subtitle":"Worked examples show how Hall algebra products and a discrete Waldhausen S-construction work on explicit simplicial sets.","key_machinery":"The central objects are the simplicial sets $X^G$ and $X^T$ built from subobjects of a graph or tree, together with the 2-Segal maps $X_n \\to X_2 \\times_{X_1} \\cdots \\times_{X_1} X_2$ induced by triangulations of an $(n+1)$-gon. The mechanism is that a 2-simplex with faces $d_2(x)$ and $d_0(x)$ supplies a possibly non-unique composite $d_1(x)$, and a 3-simplex with given boundary 2-simplices supplies associativity; the 2-Segal condition says every polygon triangulation determines a unique top simplex. The paper also uses the path space criterion: a simplicial set is 2-Segal exactly when its left and right path spaces (décalages) are 1-Segal, which turns the condition into a check about nerves of categories. Finally, the equivalence $S_\\bullet \\simeq P$ carries reduced 2-Segal sets to pointed stable double categories, where stability means each square is uniquely determined by its span of sources and independently by its cospan of targets.","core_discovery":"The discovery, on the paper's own terms, is that 2-Segal sets form a combinatorial, hand-computable setting rather than only a homotopical one. For a finite graph $G$, the simplicial set $X^G$ has a single 0-simplex, subgraphs as 1-simplices, and $n$-simplices given by a subgraph together with an ordered partition of its vertices into $n$ possibly empty parts; the paper asserts that each such $X^G$ is 2-Segal, with face maps cutting and merging blocks of the partition. For a rooted tree $T$, the same shape is built from admissible subforests and layers of admissible cuts, and again $X^T$ is 2-Segal, with the Segal map injective but not surjective. The Hall algebra of a 2-Segal set counts 2-simplices with prescribed faces; on graph examples this makes $a\\cdot b$ the sum of all subgraphs on the two vertices $\\{a,b\\}$, while on the rooted-tree example $a\\cdot b=G$ and $b\\cdot a=0$, exhibiting noncommutativity. The paper also presents the discrete Waldhausen construction $S_\\bullet$ and the path-space construction $P$, together with the equivalence $S_\\bullet \\simeq P$ between pointed stable double categories and reduced 2-Segal sets, so that each graph or tree example comes with an explicit double-categorical description.","pith_inferences":["Extension: If Definition 5.3 matches the precise definition in the cited earlier work, the tree Hall algebra is essentially the incidence algebra of the poset of admissible subforests ordered by inclusion, with structure constants recording cut layers; the paper does not name this poset.","Extension: The graph construction suggests a general template: any incidence structure with a notion of disjoint union and a notion of vertex sets will produce a 2-Segal set by ordered partitions of a base set, and the Hall product becomes a convolution over that incidence structure; testing this on other families, such as matroids, would be a natural next step.","Extension: Because the paper's proof of the tree theorem is delegated to an unpublished source, a reader cannot yet verify the tree combinatorics from this paper alone; a self-contained proof of Theorem 5.5 would be needed before the tree Hall algebras can be treated as fully established."],"forward_implications":["Every finite graph $G$ yields an associative, unital Hall algebra whose basis is the subgraphs of $G$, with product $H\\cdot K$ nonzero only when $H$ and $K$ are vertex-disjoint, in which case it is the sum of all subgraphs obtained by adding edges between $H$ and $K$.","Every nontrivial rooted tree yields a noncommutative Hall algebra with 0/1 structure constants: $H\\cdot K$ is the sum of trees admitting an admissible cut separating $H$ from $K$, and reversing the order changes the cut direction.","The equivalence between reduced 2-Segal sets and pointed stable double categories makes the graph and tree examples into concrete instances of the discrete Waldhausen construction, so their associated double categories can be described explicitly from simplices.","The path space criterion gives a finite check for 2-Segal-ness: verify that $P^\\triangleleft X$ and $P^\\triangleright X$ are nerves of categories, which is how the partial monoid nerve $M_\\bullet$ is seen to be 2-Segal but not 1-Segal."],"supporting_citations":[{"why":"Supplies the graph construction $X^G$, the theorem that it is 2-Segal, and the discrete Waldhausen equivalence used in Section 7.","marker":"[3]"},{"why":"Supplies the tree construction $X^T$, the theorem that it is 2-Segal, Proposition 5.6, and the precise admissible-subforest notion behind Definition 5.3.","marker":"[2]"},{"why":"Introduces 2-Segal spaces and the Hall algebra construction; Proposition 6.2 on associativity is quoted from it.","marker":"[5]"},{"why":"Provides the decomposition space viewpoint and, together with [5], the Path Space Criterion (Theorem 7.8).","marker":"[7]"}],"fun_headline_variants":["Graphs and trees yield hand-computable 2-Segal algebras","2-Segal sets from graphs and trees with explicit Hall products","Combinatorial 2-Segal sets: Hall algebras and Waldhausen construction","Discrete Waldhausen construction on 2-Segal sets from graphs and trees","Noncommutative Hall products from 2-Segal sets on graphs and trees"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the paper's informal Definition 5.3, which says admissible subforests are whatever comes out of face maps along admissible cuts, faithfully captures the more precise definition in the cited earlier work; the tree theorem and the tree Hall algebra computations change if those two notions differ.","fun_headline_variants_meta":{"raw":{"variants":["Graphs and trees yield hand-computable 2-Segal algebras","2-Segal sets from graphs and trees with explicit Hall products","Combinatorial 2-Segal sets: Hall algebras and Waldhausen construction","Discrete Waldhausen construction on 2-Segal sets from graphs and trees","Noncommutative Hall products from 2-Segal sets on graphs and trees"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000859,"raw_usage":{"total_tokens":3696,"prompt_tokens":880,"completion_tokens":2816,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":496,"completion_tokens_details":{"reasoning_tokens":2718}},"tokens_in":496,"tokens_out":2816,"duration_ms":17364,"temperature":1.0,"reasoning_tokens":2718,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T11:06:27.725801+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the 1-simplices and the 2-Segal map of $X^T$ for a small labeled rooted tree, such as a three-vertex chain, using the cited precise definition of admissible subforest; if the resulting set of subforests differs from the list generated by Definition 5.3, then Example 6.6 and Proposition 6.7 would need correction. Alternatively, check whether $X^T_3 \\to X^T_2 \\times_{X^T_1} X^T_2$ is a bijection for that tree under the face-map definition; any failure would contradict Theorem 5.5.","supporting_citations":[{"cited_title":"Bergner, Ang´ elica M","cited_arxiv_id":null,"evidence_quote":"Supplies the graph construction $X^G$, the theorem that it is 2-Segal, and the discrete Waldhausen equivalence used in Section 7."},{"cited_title":"Bergner, Olivia Borghi, Pinka Dey, Imma G´ alvez-Carrillo, and Teresa Hoekstra-Mendoza, 2-Segal sets from cuts of rooted trees, preprint","cited_arxiv_id":null,"evidence_quote":"Supplies the tree construction $X^T$, the theorem that it is 2-Segal, Proposition 5.6, and the precise admissible-subforest notion behind Definition 5.3."},{"cited_title":"Dyckerhoff and M","cited_arxiv_id":null,"evidence_quote":"Introduces 2-Segal spaces and the Hall algebra construction; Proposition 6.2 on associativity is quoted from it."},{"cited_title":"Math.331 (2018) 952–1015","cited_arxiv_id":null,"evidence_quote":"Provides the decomposition space viewpoint and, together with [5], the Path Space Criterion (Theorem 7.8)."}],"review_version":1}