{"id":"af878468-d886-4258-b202-60335b1a2b19","arxiv_id":"1908.05678","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A connected bipartite graph whose edge ring has a q-linear resolution, q≥3, has exactly one minimal even cycle, so its edge ring is a hypersurface.","lead":"This paper proves that the edge ring of a connected bipartite graph with a q-linear resolution, for q at least 3, is a hypersurface. It confirms a conjecture for the bipartite case and shows such graphs are governed by exactly one defining relation.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Unproved classification of C1∪P as G^(e) or G^(o) is a real proof gap, but a short parity/arc-length argument confirms it, so the theorem survives.","rationale":"The reader's diagnosis is right: the classification in the proof of Theorem 0.2 is the only unproved load-bearing step. But it is not a correctness risk: the parity/arc-length argument above reconstructs exactly the two families, and the parameter inequalities in Lemmas 2.3 and 2.4 match the no-short-cycle condition. The displayed Ehrhart computations in the lemmas are internally consistent, and the final reduction to a unique 2q-cycle correctly yields a principal toric ideal and hence a hypersurface. No counterexample or hidden assumption emerged. The verdict should remain ACCEPT; at most the authors should add the short classification proof to remove the gap.","tokens_in":6659,"tokens_out":14789,"duration_ms":129551,"concrete_test":"Write out the missing case analysis in the proof of Theorem 0.2: for C1 a 2q-cycle and P a path internally disjoint from C1 with endpoints on C1, denote by r the length of the shorter arc of C1 between the endpoints and by L the length of P. Verify that the absence of even cycles of length <2q is equivalent to L ≥ 2q−r, that bipartiteness gives L ≡ r (mod 2), and that the cases r=2k, L=2m and r=2k−1, L=2m−1 correspond to G^(e)_{k,m} and G^(o)_{k,m} respectively, with the stated inequalities. If this case analysis is valid, the classification step is complete.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The single most load-bearing step is the assertion in the proof of Theorem 0.2 that a bipartite subgraph G' = C1 ∪ P with no odd cycles and no even cycles shorter than 2q is necessarily one of the families G^(e)_{k,m} or G^(o)_{k,m}. This assertion is not proved; it transfers the explicit degree computations of Lemmas 2.3 and 2.4 to every possible pair of overlapping 2q-cycles, so the contradiction deg P_G ≥ q depends entirely on it. The assertion is nevertheless correct: in the theta graph C1∪P, let r be the shorter C1-arc length between the endpoints of P and let L be the length of P. The no-short-even-cycle condition gives L+r ≥ 2q and L+(2q−r) ≥ 2q, hence L ≥ 2q−r; bipartiteness forces L ≡ r (mod 2). Thus (r,L) is (2k,2m) or (2k−1,2m−1), with exactly the parameter inequalities k+m≥q or k+m−1≥q used in Lemmas 2.3 and 2.4, and those data determine the graph up to isomorphism. So the gap is an omitted proof, not a false statement.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves Theorem 0.2: for a finite connected simple bipartite graph G whose edge ring K[G] has a q-linear resolution with q >= 3, K[G] is a hypersurface. The proof uses the fact that a q-linear resolution forces I_G to be generated in degree q, which by Lemma 1.2 means G has no even cycles shorter than 2q and I_G is generated by the binomials of its 2q-cycles. The author then shows that if G had two 2q-cycles, a subgraph argument would give deg(P_G) >= q, contradicting reg(K[G]) <= q-1 via Lemma 1.4. The remaining case is that G has exactly one 2q-cycle, and then Lemma 1.2 makes I_G principal, so K[G] is a hypersurface.","tokens_in":6900,"tokens_out":14867,"duration_ms":159888,"significance":"If the proof is completed, this is a clean positive solution of Conjecture 0.1 in the bipartite case, with an elementary combinatorial proof. The main strength is that the numerical certificates in Lemmas 2.1, 2.2, 2.3 and 2.4 are explicit convex combinations of edge vectors, so the degree lower bounds are directly verifiable. The reduction to a unique 2q-cycle is elegant, and the use of the monotonicity deg(P_G') <= deg(P_G) is appropriate. The only substantive weakness is that one load-bearing classification step in the proof of Theorem 0.2 is asserted without proof.","major_comments":[{"comment":"The sentence 'Hence G′ is G^(e)_{k,m} or G^(o)_{k,m} which appear in Lemmas 2.3 and 2.4' is asserted without proof, and this assertion is load-bearing: it transfers the degree lower bounds of Lemmas 2.3 and 2.4 from the two explicitly drawn families to an arbitrary pair of overlapping 2q-cycles. The author should supply the missing argument. Concretely, if P is the path whose endpoints w1,w2 lie on C1 and whose internal vertices lie outside C1, let r be the length of the shorter C1-arc between w1 and w2 and let L be the length of P. Bipartiteness forces L and r to have the same parity, and the condition that G′ has no even cycle shorter than 2q gives L+r >= 2q and L+(2q-r) >= 2q. These inequalities imply that (r,L) is either (2k,2m) with k+m >= q, or (2k-1,2m-1) with k+m-1 >= q, which are exactly the parameter ranges used in Lemmas 2.3 and 2.4, and the pair (r,L) determines the isomorphism type of G′. Until this parity/arc-length argument is written out, the main contradiction deg(P_G) >= q is not fully justified.","section":"Section 2, proof of Theorem 0.2"}],"minor_comments":[{"comment":"In the final paragraph, 'no even cycles of length < 2n' should read 'no even cycles of length < 2q'; the symbol n is not defined at that point.","section":"Section 2, proof of Theorem 0.2"},{"comment":"The subgraph G′ used in Lemma 2.1 is the disconnected disjoint union of two cycles, while the cited monotonicity lemma is stated for a subgraph of a connected graph. If Lemma 1.3 is only proved for connected subgraphs, the author should either state the version for disconnected subgraphs explicitly or replace G′ by a connected spanning subgraph of G containing the two disjoint cycles, since connectedness of G supplies edges between the cycles.","section":"Lemma 2.1"},{"comment":"In the proof of Lemma 2.2, 'It follows that dim PGk = 4q − 3' contains a typo; it should be dim P_{G′} = 4q − 3.","section":"Lemma 2.2"},{"comment":"In the proof of Lemma 2.3, the inequality 'deg(P_{G^(e)_{k,m}}) >= 3q/2 - 2' is stated, but for q = 3 the text writes 'deg >= 3 > 5/2'. Since degrees are integers, the conclusion deg >= 3 is clear, but the comparison to 5/2 is unnecessarily indirect.","section":"Lemma 2.3"}],"recommendation":"major_revision","confidential_remarks":"The only substantive obstacle is the missing proof of the classification of C1 ∪ P as one of the families G^(e) or G^(o). The omitted parity/arc-length argument appears short and standard, so I expect the theorem to survive a revision. The final step from 'precisely one 2q-cycle' to 'hypersurface' is justified by Lemma 1.2, not by an independent uniqueness of all cycles, so the authors need not add a separate argument excluding longer even cycles. I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The headline: this is a genuinely new result, not a repackaging. Tsuchiya proves that if a connected bipartite graph has a q-linear edge ring resolution for q≥3, then the edge ring is a hypersurface. That settles the bipartite slice of the Hibi–Matsuda–Tsuchiya conjecture, which was open for q≥4. The proof is short and mostly clean. The constructions G^(e) and G^(o) are the real work: two families of theta-like subgraphs built from a 2q-cycle and a chordal path, where explicit convex combinations show the h*-polynomial degree is at least q. Those identities check out numerically, and the bounds on m are correct. The paper also correctly uses the known monotonicity of h*-degree under subgraphs, so any such subgraph forces the whole graph to have degree ≥q, contradicting reg(K[G])=q−1.\n\nThe soft spot is exactly what the reader flagged: the proof of Theorem 0.2 asserts, without proof, that any connected bipartite subgraph consisting of a 2q-cycle C1 plus a path P between two of its vertices, with no odd cycles and no even cycles shorter than 2q, must be one of the two families. That is a real omission; it is load-bearing, because Lemmas 2.3 and 2.4 apply only to those families. The stress-test note shows the missing argument is short: let r be the shorter arc of C1 between the endpoints of P and let L be the length of P; the no-short-even-cycle condition forces L+r ≥ 2q and L+(2q−r) ≥ 2q, and bipartiteness forces L≡r mod 2, so (r,L) falls into the two families with exactly the parameter inequalities used. So the gap is an omitted proof, not a false statement. In a revision the author should expand this step; the current text simply says 'Hence G′ is G(e) or G(o)' with no justification.\n\nThe other minor issues are just typos and extraction artifacts (e.g., '2n' should be '2q' in one line of the theorem proof). The citation pattern is honest: Lemma 1.3 is from the author's previous joint paper, but it is an independent monotonicity result, not a restatement of the conjecture. No circularity.\n\nWho is this for? Researchers in toric rings, edge polytopes, and regularity of binomial ideals. It is a meaningful confirmation of a known conjecture in the bipartite case and gives a clean structural dichotomy. I would send this to a serious referee. The gap is fixable and the result is correct. Recommendation: accept after the author spells out the classification argument.","headline":"Proves the bipartite case of the q-linear resolution conjecture; solid result with a terse classification step that needs expanding.","tokens_in":7456,"tokens_out":3645,"would_cite":true,"duration_ms":32044,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E40","13H10","52B20"],"pacs":[],"model":"deepseek-v4-flash","headline":"A finite connected simple bipartite graph whose edge ring has a q-linear resolution, q ≥ 3, must be a hypersurface.","keywords":["edge ring","linear resolution","toric ideal","edge polytope","root polytope","h*-polynomial","bipartite graph","hypersurface"],"falsifier":"Build or search for a connected bipartite graph with two distinct 2q-cycles, no even cycle shorter than 2q, and whose union is not isomorphic to any $G^{(e)}_{k,m}$ or $G^{(o)}_{k,m}$; then compute the degree of the h*-polynomial of its edge polytope. A degree below q would refute the theorem, while a degree at least q in such a graph would show only that the classification step in the proof needs repair, not that the theorem fails.","tokens_in":6435,"feed_emoji":"🔄","tokens_out":14211,"duration_ms":134245,"temperature":0.7,"pith_summary":"This paper proves the bipartite case of a conjecture about edge rings: if the edge ring of a finite connected simple bipartite graph has a q-linear resolution with q ≥ 3, then the ring is a hypersurface. A hypersurface here means the toric ideal is generated by one binomial, so the graph cannot contain two distinct even cycles of length 2q. The author shows instead that any second 2q-cycle would push the degree of the h*-polynomial of the edge polytope to at least q, while a q-linear resolution forces that degree to be at most q−1. This turns a homological condition into a concrete graph-uniqueness statement and settles the conjecture for all bipartite graphs.","feed_headline":"One even cycle is all a q-linear bipartite edge ring can have","feed_subtitle":"The proof forces the toric ideal to have one generator, confirming the bipartite case of a standing conjecture.","key_machinery":"The mechanism is the pair of inequalities $\\deg(P_{G'}) \\leq \\deg(P_G)$ for subgraphs and $\\mathrm{reg}(K[G]) \\geq \\deg(P_G)$, together with the identity $\\deg(P) = \\dim P + 1 - \\operatorname{codeg}(P)$, where $\\operatorname{codeg}(P)$ is the smallest r with an interior lattice point in $rP$. To get degree at least q for each forbidden configuration, the author writes an explicit convex combination of edge vectors with coefficients 1/3 and 2/3 that lands in the interior of $rP_G$ for suitable r; this certifies $\\operatorname{codeg}(P_G) \\leq r$, hence $\\deg(P_G) \\geq \\dim P_G + 1 - r \\geq q$. The convex combinations are the load-bearing calculations, and the two families $G^{(e)}_{k,m}$ and $G^{(o)}_{k,m}$ are the parameterized subgraphs needed to cover the overlapping-cycle case.","core_discovery":"The central theorem, Theorem 0.2, states that for a finite connected simple bipartite graph G and a field K, if the edge ring K[G] has a q-linear resolution with q ≥ 3, then K[G] is a hypersurface. Equivalently, the toric ideal I_G is principal and G has exactly one even cycle, of length 2q; the single binomial generating I_G is the binomial f_C attached to that cycle. The proof runs by contradiction: a q-linear resolution implies I_G is generated in degree q, hence by Lemma 1.2 G has no even cycle shorter than 2q and every generator comes from a 2q-cycle. Assuming two distinct 2q-cycles exist, the paper builds a subgraph (disjoint cycles, cycles sharing one vertex, or one of the two families $G^{(e)}_{k,m}$ and $G^{(o)}_{k,m}$) and exhibits an interior lattice point in a small dilation of its edge polytope; the codegree identity then gives $\\deg(P_G) \\geq q$. Since regularity is at least this degree, the resolution cannot be q-linear, a contradiction.","pith_inferences":["The same codegree-certificate strategy would likely prove the full conjecture for any class of graphs whose toric ideal is generated by cycle binomials; for non-bipartite graphs, one would need analogues of Lemmas 2.3 and 2.4 involving odd-cycle binomials.","The classification statement that every allowed $C_1 \\cup P$ is one of the two drawn families is the only non-explicit step; making it explicit would yield a self-contained proof and might simplify the two parameter families.","A direct combinatorial reformulation emerges: for bipartite graphs, 'q-linear edge ring' is equivalent to 'exactly one cycle, of length 2q', giving an easy way to identify such edge rings from the graph alone without computing a resolution."],"forward_implications":["For q ≥ 3, any bipartite edge ring with a q-linear resolution has a principal toric ideal; in particular it is a hypersurface and its minimal free resolution has length one.","Conversely, by the generation statement of Lemma 1.1, a connected bipartite graph with exactly one even cycle of length 2q has edge ring with a q-linear resolution, so the theorem gives a complete combinatorial characterization: q-linear resolutions of bipartite edge rings are exactly the unicyclic graphs whose unique cycle has length 2q.","The h*-polynomial degree of the edge polytope of any graph with two 2q-cycles and no shorter even cycle is at least q, so regularity is at least q; this gives an obstruction that can be checked from the graph alone.","The result settles the q ≥ 3 bipartite case of Conjecture 0.1, leaving the non-bipartite case open."],"supporting_citations":[{"why":"Supplies the generation of the toric ideal of a bipartite graph by even-cycle binomials, which is what reduces q-linear generation to the absence of short cycles.","marker":"[5]"},{"why":"Proved the q=3 case and stated Conjecture 0.1, the conjecture this paper extends to bipartite graphs.","marker":"[7]"},{"why":"Gives the inequality reg(K[P_G]) ≥ deg(P_G) that converts the h*-degree lower bound into a regularity contradiction.","marker":"[8]"},{"why":"Provides the monotonicity of h*-degree under subgraphs, used to transfer the lower bounds from the built subgraphs to G.","marker":"[13]"},{"why":"Characterized 2-linear edge rings and established the background framework for edge polytopes and linear resolutions.","marker":"[12]"},{"why":"Gives the dimension formula dim P_G = N - c0(G) - 1 used throughout the degree calculations.","marker":"[15]"}],"fun_headline_variants":["One even cycle decides: q-linear bipartite edge rings are hypersurfaces","q-linear resolution forces a single even cycle in bipartite graphs","Bipartite edge rings: q-linear means one generator, one cycle","Hypersurface guarantee: single even cycle in q-linear bipartite edge rings","q-linear bipartite edge ring = hypersurface, courtesy of one even cycle"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that every connected bipartite subgraph made of a 2q-cycle plus a path joining two of its vertices, with no odd cycle and no even cycle shorter than 2q, is one of the two explicitly drawn families $G^{(e)}_{k,m}$ or $G^{(o)}_{k,m}$; the paper asserts this without giving the classification argument.","fun_headline_variants_meta":{"raw":{"variants":["One even cycle decides: q-linear bipartite edge rings are hypersurfaces","q-linear resolution forces a single even cycle in bipartite graphs","Bipartite edge rings: q-linear means one generator, one cycle","Hypersurface guarantee: single even cycle in q-linear bipartite edge rings","q-linear bipartite edge ring = hypersurface, courtesy of one even cycle"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000787,"raw_usage":{"total_tokens":3427,"prompt_tokens":853,"completion_tokens":2574,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":469,"completion_tokens_details":{"reasoning_tokens":2477}},"tokens_in":469,"tokens_out":2574,"duration_ms":17437,"temperature":1.0,"reasoning_tokens":2477,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:14:05.062371+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Build or search for a connected bipartite graph with two distinct 2q-cycles, no even cycle shorter than 2q, and whose union is not isomorphic to any $G^{(e)}_{k,m}$ or $G^{(o)}_{k,m}$; then compute the degree of the h*-polynomial of its edge polytope. A degree below q would refute the theorem, while a degree at least q in such a graph would show only that the classification step in the proof needs repair, not that the theorem fails.","supporting_citations":[{"cited_title":"Herzog, T","cited_arxiv_id":null,"evidence_quote":"Supplies the generation of the toric ideal of a bipartite graph by even-cycle binomials, which is what reduces q-linear generation to the absence of short cycles."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Proved the q=3 case and stated Conjecture 0.1, the conjecture this paper extends to bipartite graphs."},{"cited_title":"Hofscheier, L","cited_arxiv_id":null,"evidence_quote":"Gives the inequality reg(K[P_G]) ≥ deg(P_G) that converts the h*-degree lower bound into a regularity contradiction."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the monotonicity of h*-degree under subgraphs, used to transfer the lower bounds from the built subgraphs to G."},{"cited_title":"Ohsugi and T","cited_arxiv_id":null,"evidence_quote":"Characterized 2-linear edge rings and established the background framework for edge polytopes and linear resolutions."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the dimension formula dim P_G = N - c0(G) - 1 used throughout the degree calculations."}],"review_version":1}