{"id":"b1839c2a-4359-4931-b1ad-589bad7e18a1","arxiv_id":"2501.18705","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The fine k-curve graph is hyperbolic; the finitary curve graph has diameter 2, a contractible flag complex, all countable graphs as induced subgraphs, and automorphism group equal to the homeomorphism group of the surface.","lead":"This paper studies graphs whose vertices are all simple closed curves on a surface, with edges joining curves that meet in at most k points. It shows these graphs are simultaneously hyperbolic, universal enough to contain every countable graph, and rigid enough that the automorphism group of the limiting finitary graph is exactly the surface's homeomorphism group.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.8 depends on the unproved Proposition 3.4/Corollary 4.2; the proof of Corollary 4.2 never establishes the finite, crossing intersections with Γ, so the rigidity reduction is not currently supported.","rationale":"Agree with the reader's weakest-assumption diagnosis. The reader selected Corollary 4.2 via Lemma 4.1 and Proposition 3.4 as the load-bearing unproved input; my reading confirms that the printed proof of Corollary 4.2 omits the essential step of arranging finite and crossing intersections with Γ, and that Proposition 3.4 is asserted without proof. This matters most for Theorem 1.8 because Lemma 6.2, Proposition 6.1, and the reduction to Booth–Minahan–Shapiro all pass through Corollary 4.2. I also noted secondary issues: the nonexistent 'Lemma 3.4' in the proof of Lemma 4.1, the invalid universal-cover connectedness argument, and the incorrect-sounding claim that the link of a vertex in a flag complex is contractible. These are either typographical or readily repairable once Corollary 4.2 is established. No internal contradiction or counterexample to the main theorems was found; the conditional verdict is appropriate pending a complete proof of Proposition 3.4 and Corollary 4.2.","tokens_in":19718,"tokens_out":23889,"duration_ms":244267,"concrete_test":"Write a self-contained proof of Proposition 3.4 by the following route: take a representative α of the prescribed isotopy class in Σ, choose a closed annular/strip neighborhood A of α disjoint from P, verify (using tameness/local flatness of the γ_i) that Γ ∩ A is a finite union of arcs, apply Lemma 3.3 in A to obtain w with |w ∩ γ_i| < ∞ and crossing intersections, and then check that w is isotopic to α in Σ and is essential. If any of these steps fails for a specific tame Γ (e.g., S an annulus, C a Cantor set on a radial arc, Γ that radial arc, and α the core circle), Proposition 3.4 is false as stated and Theorem 1.8 loses its foundation. If the steps succeed, the concern reduces to a presentation gap.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Corollary 4.2 is the hinge of the rigidity argument: Lemma 6.2 uses it to build the curve α in the 'if' direction, and Proposition 6.1 and Theorem 1.8 inherit that dependence; it is also used in Lemma 5.2 and in Theorem 1.3 via Lemma 4.1. The stated proof of Corollary 4.2 constructs a curve γ in an annular/strip neighborhood of a representative α that is disjoint from P, and then stops. It never invokes Proposition 3.4 or Lemma 3.3 to arrange |γ ∩ γ_i| < ∞ or crossing intersections, so conditions (1)–(2) of the corollary are simply not proved. Proposition 3.4, asserted to 'directly follow' from Lemmas 3.1–3.3, is not a formal consequence of those lemmas as written: Lemmas 3.1–3.3 concern a single annulus/strip and assume Γ ∩ ν is already a union of arcs, while Proposition 3.4 must handle an arbitrary finite collection of curves/arcs and an arbitrary isotopy class in Σ = S \\ C. In addition, the proof of Lemma 4.1 cites 'Lemma 3.4', which does not exist in the paper, and the argument that Σ \\ E is connected from simple-connectivity of its universal cover is invalid as written. These are fixable gaps, but they are exactly the missing support that Theorem 1.8 and the contractibility theorem need.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies fine k-curve graphs C†_k(S), whose vertices are essential simple closed curves and whose edges join curves meeting in at most k points, together with the direct limit C†_<∞(S), where edges join curves meeting finitely many times. The main claims are: hyperbolicity of C†_k(S_g) for all k; diameter 2 for C†_<∞(S_g,b); contractibility of its flag complex; induced-subgraph universality for all countable graphs in C†_k(S_g,b) for k ≥ 2 and in C†_<∞(S_g,b); existence of finite graphs not appearing as induced subgraphs of fine curve graphs; and an isomorphism Aut(C†_<∞(S_g)) ≅ Homeo(S_g). The proofs rest on an asserted existence result (Proposition 3.4) for curves meeting finite collections of curves or arcs in finitely many crossing points, on reduction to Bowden–Hensel–Webb for hyperbolicity, and on Booth–Minahan–Shapiro for automorphisms of the fine 1-curve graph.","tokens_in":86,"tokens_out":6610,"duration_ms":728501,"significance":"The results are potentially strong: a countable-universal graph whose automorphism group recovers the full homeomorphism group of a surface is striking, and the explicit construction of finite inadmissible subgraphs of fine curve graphs is a valuable addition. The paper is also quite explicit, with worked examples, figures, and detailed constructions rather than parameter-fitting or black-box arguments. However, several load-bearing statements are currently asserted rather than proved, including Proposition 3.4, parts of Corollary 4.2, the inductive surgery step in Proposition 2.2, and the key automorphism-preservation step in Proposition 6.1. If these gaps are repaired, the results would be significant; as written, the central claims are not yet fully supported.","major_comments":[{"comment":"Proposition 3.4 is stated as 'directly follows from the above discussion,' but Lemmas 3.1–3.3 concern a single annulus or strip in which the intersection of the collection with the annulus is already a union of arcs. Proposition 3.4 must handle an arbitrary finite collection of curves and arcs in Σ = S \\ C and an arbitrary prescribed isotopy class, with only crossing intersections. This is not a formal consequence of the lemmas as written. Since Corollary 4.2, Lemma 4.1, Theorem 1.3, Lemma 5.2, Lemma 6.2, and Theorem 1.8 all depend on this existence result, a complete proof is needed.","section":"§3, Proposition 3.4"},{"comment":"The proof of Corollary 4.2 constructs a curve γ in an annular or strip neighborhood A of a representative α that is disjoint from P, and then stops. It never invokes Proposition 3.4 or Lemma 3.3 to arrange |γ ∩ γ_i| < ∞ or that all intersections are crossing, so conditions (1) and (2) of the corollary are not proved. In addition, Lemma 4.1 cites 'Lemma 3.4', which does not exist in the paper, and its claim that Σ' is connected is justified by saying that the universal cover of Σ \\ E is simply connected, which does not imply that the base is connected. These gaps are load-bearing for Theorem 1.3 and for the rigidity argument in Section 6.","section":"§4, Corollary 4.2 and Lemma 4.1"},{"comment":"The proof establishes only that any two vertices a and b are joined by a length-two path a–c–b, so diam(C†_<∞(S_g,b)) ≤ 2. To prove diam = 2 the paper must also exhibit two curves with infinite intersection whose vertices are not adjacent; no such pair is constructed and the lower bound is not otherwise established.","section":"§3, proof of Theorem 1.2"},{"comment":"In the essential-intersection case, the proof asserts that if ui and ui+1 meet k+1 times and are in minimal position, then 'conventional surgery techniques' produce a path of length two in C†_k(S_g). No detailed argument or precise reference is given. This is the inductive step on which hyperbolicity of all fine k-curve graphs rests, so the surgery construction needs to be written out for this graph or replaced by a citation that covers exactly this statement.","section":"§2, Proposition 2.2, Case 3"},{"comment":"The proof consists of the sentence 'The proposition now follows from Lemma 6.3.' That is not sufficient: Lemma 6.3 gives a topological characterization of |u ∩ v| ≤ 1 via absence of essential simple closed curves in u ∪ v, but the proof does not explain why this property is preserved by an arbitrary automorphism of C†_<∞(S_g), nor how the link-containment Lemma 6.2 is used to convert the presence of such a curve into a graph-theoretic invariant. Since Proposition 6.1 is the key reduction to Booth–Minahan–Shapiro in Theorem 1.8, a complete argument is required.","section":"§6, Proposition 6.1"}],"minor_comments":[{"comment":"The title contains a typo: 'COMBINA TORICS' should be 'COMBINATORICS'; 'hoemeomorphic' appears in Section 1; and 'we will are ready' appears in Section 5.2.","section":"Title and front matter"},{"comment":"The reference to 'Lemma 3.4' should be corrected to 'Proposition 3.4' or to whichever statement is actually intended.","section":"§4, Lemma 4.1"},{"comment":"The graph notation # is defined just before Lemma 5.6, but the proof of Theorem 1.7 would benefit from a sentence explaining why any realization must be supported on 2g+b−1 pairwise disjoint subsurfaces, since that is the key counting step.","section":"§5, Theorem 1.7 proof"},{"comment":"The figures are schematic and helpful, but several, especially Figures 5 and 9, are referenced without a precise explanation of how the handles or cone vertices behave under the isotopies; a sentence or two in the captions would improve readability.","section":"Figures"}],"recommendation":"major_revision","confidential_remarks":"For the editor: the paper has a promising core and several genuinely interesting ideas, but it is clearly in an early state. The missing proofs of Proposition 3.4, the connectivity claim in Lemma 4.1, condition (1)–(2) of Corollary 4.2, and the reduction in Proposition 6.1 are not mere exposition; they are exactly the support needed for the contractibility, universality, and rigidity theorems. I would send the manuscript back for a substantive revision with these points spelled out rather than rejecting it, because the overall strategy appears salvageable and the intended results are significant."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThis paper is worth engaging: it contains genuinely new constructions and a nice bridge between fine curve graphs and graph universality. But the central rigidity theorem and the contractibility result lean on an unproved lemma, so the paper needs a serious revision before I'd trust those claims.\n\nWhat's new: Theorem 1.5 (countable graph universality for fine k-curve graphs, k≥2, and the finitary graph) is a solid new result, and the construction using an annulus with disks is concrete. The inadmissible graph constructions in Section 5.2 are genuinely interesting and show the fine curve graph is more constrained than one might expect. The reduction of hyperbolicity for all k to the Bowden–Hensel–Webb base case is a good observation, though the inductive step is sketched. The automorphism rigidity statement is striking.\n\nThe biggest soft spot is Proposition 3.4. It is stated as \"directly follows from the above discussion,\" but the preceding lemmas assume a single annulus with the intersection pattern already a union of arcs; the proposition has to handle an arbitrary finite collection in an arbitrary isotopy class after removing a closed subset of a Cantor set. That step is doing real work. Corollary 4.2 inherits the problem: its proof constructs a curve in an annular neighborhood avoiding P, but never shows the curve meets each γ_i finitely many times with crossing intersections. Lemma 4.1 then cites \"Lemma 3.4,\" which doesn't exist in the paper, and uses a connectivity argument for Σ\\E that is stated backwards: knowing the universal cover is the hyperbolic plane doesn't tell you the space is connected unless you've already shown connectedness. These are fixable, but they are load-bearing: Lemma 6.2, Proposition 6.1, and Theorem 1.8 all depend on Corollary 4.2. The diameter proof for Theorem 1.2 only establishes the upper bound; to get diam = 2 you need to exhibit a non-adjacent pair. And in Proposition 2.2, Case 3 (\"conventional surgery techniques\") is too thin for an inductive step that carries the whole hyperbolicity claim.\n\nCredit where due: the paper is clearly written, the examples and figures help, and the literature is engaged. The author is not hiding the gaps; the missing pieces look like overcompressed arguments rather than fatal errors. But as it stands, the paper's main rigidity theorem isn't fully supported.\n\nThis is for geometric group theorists and anyone working on fine curve graphs; the universality section alone is worth a look. I'd send it to a serious referee, asking that Proposition 3.4 and Corollary 4.2 be proved properly and the diameter lower bound be fixed before acceptance.","headline":"New constructions in fine curve graphs are real, but Theorem 1.8 and the contractibility result rest on an unproved lemma, so the paper needs revision before its main rigidity claims can be trusted.","tokens_in":20539,"tokens_out":2585,"would_cite":false,"duration_ms":26336,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["57K20","05C63"],"pacs":[],"model":"deepseek-v4-flash","headline":"The finitary curve graph's automorphism group is exactly the surface's homeomorphism group.","keywords":["fine k-curve graph","finitary curve graph","Gromov hyperbolicity","countable universal graph","automorphism rigidity","flag complex","induced subgraph","surface homeomorphism group"],"falsifier":"Draw two curves whose intersection set is a Cantor set on a surface with a Cantor set removed, choose the isotopy class of a third curve that must thread between them, and check whether a representative exists meeting both curves finitely and only in crossings; any failure refutes Corollary 4.2 and with it the contractibility and automorphism theorems.","tokens_in":19493,"feed_emoji":"🕸️","tokens_out":9846,"duration_ms":115130,"temperature":0.7,"pith_summary":"This paper studies the fine k-curve graph of a surface: vertices are actual embedded essential closed curves, and two vertices are adjacent when the curves meet in at most k points. Its main positive claim is that caring only about finite intersection produces a single graph, the finitary curve graph, that is simultaneously a universal countable graph and a sharp geometric invariant: every countable graph embeds as an induced subgraph, while the automorphism group is exactly the surface homeomorphism group. The paper also proves hyperbolicity of each fine k-curve graph, computes diameter 2 for the finitary graph, shows its flag complex is contractible, and gives finite graphs that cannot be embedded in fine curve graphs. A reader should care because the results bundle two properties usually thought to fight each other — genericity and rigidity — into one explicitly geometric object.","feed_headline":"Homeomorphism group equals finitary curve graph automorphisms","feed_subtitle":"Finite-intersection curves build a graph that contains every countable graph yet recovers the whole surface.","key_machinery":"The load-bearing tool is a crossing representative lemma (Lemma 4.1 and Corollary 4.2): after deleting a compact totally disconnected set of messy intersections from a surface, any prescribed isotopy class still contains a curve or arc that meets each curve in a given finite family only finitely many times and only in crossings. This is proved by annular surgery arguments that push a curve off the bad intersections. The lemma supplies the common neighbor needed for contractibility, the induced embeddings of arbitrary graphs, and the link-inclusion criterion used in the automorphism proof. A second, smaller mechanism is the link characterization Lemma 6.2: a curve lies in the union of a finite set of curves exactly when every curve meeting each of those finitely also meets it finitely; this translates infinite intersection behavior into graph-theoretic link inclusion, allowing automorphisms of the finitary graph to preserve edges with one intersection and thereby reduce to rigidity of the fine 1-curve graph.","core_discovery":"The paper's central discovery is that the finitary curve graph $C^\\dagger_{<\\infty}(S_g)$ of a closed oriented surface is a strangely extreme object: it has diameter 2, its flag complex is contractible, and it contains every countable graph as an induced subgraph, yet its automorphism group is exactly the homeomorphism group of $S_g$ under the natural action. Theorem 1.8 states that the map $\\Phi\\colon \\mathrm{Homeo}(S_g)\\to \\mathrm{Aut}(C^\\dagger_{<\\infty}(S_g))$ is an isomorphism. Along the way the paper proves that every fine $k$-curve graph is Gromov hyperbolic for all $k$, and that finite graphs can be embedded into fine curve graphs only with genus quadratic in the number of vertices, while certain finite graphs such as wheels and doubled pants obstructions are inadmissible.","pith_inferences":["If the same argument can be rerun for compact surfaces with boundary, the expected automorphism group would be a relative homeomorphism group that fixes or permutes boundary components; testing that extension is a direct next step.","The proof's reliance on the crossing representative lemma suggests the whole package could be tested by checking Corollary 4.2 for wild pairs of curves whose intersection set is a Cantor set, since a counterexample there would isolate a failure even if the automorphism theorem itself is not directly contradicted.","The combination of containing every countable graph while failing the extension property that characterizes the countable random graph points toward a family of countable universal graphs whose automorphism groups are large geometric groups rather than the full symmetric group of a countable set."],"forward_implications":["The finitary curve graph is quasi-isometric to a point, so all large-scale geometry is trivial and the group rigidity must come from local graph structure.","Every countable graph, including the countable random graph, occurs as an induced subgraph of the finitary curve graph and of every fine k-curve graph with k at least 2.","For the fine curve graph with k equal to 0, finite graphs embed only with genus quadratic in the number of vertices, and explicit finite graphs are forbidden as induced subgraphs.","The flag complex of the finitary curve graph is contractible, so the clique complex loses all topological information about the surface.","Automorphisms of the finitary curve graph are exactly the homeomorphisms, so the graph is not highly symmetric: some isomorphisms between induced subgraphs do not extend to automorphisms."],"supporting_citations":[{"why":"Supplies the theorem that automorphisms of the fine 1-curve graph are induced by surface homeomorphisms, which Theorem 1.8 invokes as its outside rigidity input.","marker":"[6]"},{"why":"Establishes hyperbolicity of the fine curve graph, the base case for Theorem 1.1's induction.","marker":"[7]"},{"why":"Provides the surgery and path lemmas for curve graphs used in the inductive quasi-isometry step between fine k and fine (k+1)-curve graphs.","marker":"[10]"},{"why":"Gives the countable-random-graph embedding criterion and the finite-genus inadmissibility construction that the paper's finite obstructions extend.","marker":"[3]"},{"why":"Defines the half-graph complexity measure for curve graphs that the paper shows does not obstruct embeddings in annuli.","marker":"[2]"}],"fun_headline_variants":["Homeo group equals automorphisms of a graph containing all graphs","All countable graphs sit inside a graph with homeo automorphisms","Diameter 2, contractible, homeo group as automorphisms","Graph containing every countable graph, only homeo symmetries"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that a curve can always be repositioned in any chosen winding pattern so that it meets each curve of a finite collection only finitely many times, crossing at every meeting; the paper asserts this follows without a full proof.","fun_headline_variants_meta":{"raw":{"variants":["Homeo group equals automorphisms of a graph containing all graphs","All countable graphs sit inside a graph with homeo automorphisms","Diameter 2, contractible, homeo group as automorphisms","Graph containing every countable graph, only homeo symmetries"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.002176,"raw_usage":{"total_tokens":8384,"prompt_tokens":849,"completion_tokens":7535,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":465,"completion_tokens_details":{"reasoning_tokens":7461}},"tokens_in":465,"tokens_out":7535,"duration_ms":53443,"temperature":1.0,"reasoning_tokens":7461,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-09T22:49:50.738905+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Draw two curves whose intersection set is a Cantor set on a surface with a Cantor set removed, choose the isotopy class of a third curve that must thread between them, and check whether a representative exists meeting both curves finitely and only in crossings; any failure refutes Corollary 4.2 and with it the contractibility and automorphism theorems.","supporting_citations":[{"cited_title":"The random graph embeds in the curve graph of any infinite genus surface","cited_arxiv_id":null,"evidence_quote":"Gives the countable-random-graph embedding criterion and the finite-genus inadmissibility construction that the paper's finite obstructions extend."},{"cited_title":"On the complexity of finite subgraphs of the curve graph","cited_arxiv_id":null,"evidence_quote":"Defines the half-graph complexity measure for curve graphs that the paper shows does not obstruct embeddings in annuli."}],"review_version":1}