{"id":"ae3a9b18-1bbc-4467-a3ea-0a7cd9a57c1d","arxiv_id":"1908.05921","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Modules whose sum-essential graphs are complete, regular, triangle-free, or trees are classified in terms of their submodule structure, and vertices of degree one are characterized.","lead":"This paper places a graph on the submodules of an algebraic structure called a module: two submodules are connected when their sum is essential, meaning it meets every nonzero submodule. It then classifies which modules produce complete graphs, regular graphs, triangle-free graphs, or trees, and identifies submodules connected to only one other submodule.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the tree classification in Theorem 3.12 is internally consistent, and the terse 'M contains a simple submodule' step is fillable from the module-theoretic facts already established.","rationale":"The reader's weakest assumption flags the unsupported assertion in Theorem 3.12 that condition (2) yields a simple submodule. I agree that the printed proof is terse at that point, but the assertion is easily justified from condition (2) by taking a complement of any nonessential submodule, so it is not load-bearing. I checked the surrounding structure: Theorem 3.11 gives triangle-freeness and udim(M)=2; the strong-disjointness condition is used correctly; the cycle X-B-A-Y-X in the tree direction is valid because the nonessential vertices involved are uniform and essential over their nonzero submodules. The classification also matches the paper's own examples. No circular step, parameter fitting, or post-hoc selection appears. The absence of machine-checked proofs is a general limitation, not a specific defect in the central argument. Accordingly, the reader's ACCEPT verdict remains appropriate, with the caveat that Theorem 3.12 would benefit from a short added justification of the simple-submodule existence step.","tokens_in":13667,"tokens_out":15763,"duration_ms":170583,"concrete_test":"Independently re-derive Theorem 3.12, implication (2)=>(3), writing out explicitly: (a) existence of a simple submodule S from a chosen nonessential vertex and its complement; (b) in the case soc(M)=S, proof that any nonessential vertex A≠S has A∩S=0 and that A+S is essential in M, and that no two non-simple vertices can be adjacent. If this reconstruction succeeds for the sample modules Z⊕Z_q and Z_p⊕Z, the theorem stands as stated.","verdict_should_be":"UNCHANGED","load_bearing_attack":"No significant objection identified. The central claim, Theorem 3.12, appears sound: condition (2) forces a tree structure, and the converse is supported by the preceding triangle-free analysis. The one terse step in the proof of (2)=>(3) is the assertion that M contains a simple submodule. This is not circular: choose any A in V(PR(M)) and a complement C maximal with A∩C=0; then A and C are distinct nonessential submodules and A+C is essential in M, so condition (2) forces one of them to be simple. Thus a simple submodule S exists before the socle cases are considered. The later case soc(M)=S can also be completed: if a nonessential vertex A different from S existed with S⊆A, then A would be a proper essential extension of S; because PR triangle-free gives udim(M)=2, such an A is uniform, and one checks A is then essential in M, contradicting A∈V(PR(M)). Hence every other vertex avoids S, and the complement argument supplies A+S essential, making S universal. The remaining adjacencies among non-simple vertices are excluded by condition (2). The proof is terse but the omitted justification is recoverable from earlier lemmas; I did not find a genuine gap in the classification.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces two graphs associated with a left module M over a ring R: the sum-essential graph S_R(M), whose vertices are the nontrivial submodules of M with adjacency when the sum of two vertices is essential, and its induced subgraph P_R(M) on the non-essential submodules. The authors study the interplay between module-theoretic properties of M and graph-theoretic properties of these graphs. The main results include: connectedness with diameter at most 3 (Theorem 1.5); criteria for finiteness of degrees and of the graph (Theorems 2.1 and 2.3); a characterization of vertices of degree 1 in P_R(M) (Theorem 2.13); classification of modules for which S_R(M) or P_R(M) is complete (Theorems 3.2 and Corollary 3.3); the fact that k-regularity forces completeness (Theorem 3.6); classifications of triangle-free and tree graphs (Theorems 3.7, 3.11, and 3.12); and results on girth (Corollaries 3.8 and 3.13). The headline theorem (Theorem 3.12) states that P_R(M) is a tree if and only if any two non-essential submodules whose sum is essential are strongly disjoint and one of them is simple, and equivalently P_R(M) is a star with a simple center.","tokens_in":13930,"tokens_out":29055,"duration_ms":266549,"significance":"The central classification is a genuine contribution to the study of graphs from module structures. Theorem 3.12 elegantly ties the graph-theoretic notion of being a tree to the module-theoretic conditions of strong disjointness and simplicity. The proofs are mostly self-contained and use standard techniques such as uniform dimension, essential extensions, and complements. The paper also provides instructive examples, including Z-modules that illustrate the sharpness of the classifications. If the results are correct, they extend prior work on intersection graphs and essential ideal graphs in a natural way. The characterizations are clean, falsifiable, and likely to be of interest to researchers in module theory and algebraic graph Theory.","major_comments":[],"minor_comments":[{"comment":"In the proof of Theorem 2.3, the case P=0 in the definition of A_P is not handled by the given argument, because a complement to 0 in M is M itself, which is not a vertex of P_R(M). However, since soc(M) is essential by Lemma 2.2, we have A_0 = {0}; adding this observation would complete the proof.","section":"Theorem 2.3"},{"comment":"In the proof of (2) implies (3), the sentence 'The statement (2) implies that one of the simples, say S, does not have proper essential extensions in M' is terse. A short justification (e.g., if both simples had proper essential extensions, those extensions would be non-essential vertices whose sum is essential and neither is simple, contradicting (2)) would improve readability.","section":"Theorem 3.12"},{"comment":"The notation 'M =R R' is unclear; presumably it means M is R viewed as a left R-module. Please clarify.","section":"Example 2.16(1)"},{"comment":"There are several minor typographical issues, such as 'a nd' in the Introduction and inconsistent spacing in 'P R(M)' in a few places. A careful proofreading pass is recommended.","section":"Introduction and throughout"},{"comment":"The sentence 'Implications (2) ⇒ (3) ⇒ (1) are clear' could be slightly expanded for (2) ⇒ (3) to confirm that in both listed cases the graph has exactly two vertices.","section":"Theorem 3.7"}],"recommendation":"minor_revision","confidential_remarks":"The paper is a solid contribution to the graph-theoretic study of modules. The main theorems, especially Theorem 3.12, appear correct and well motivated. The issues I found are local and easily fixable, so I recommend minor revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a careful, honest module-theory paper that deserves a normal peer review, and I expect it to pass with minor revisions. The main thing you should know is that the headline result — Theorem 3.12, where P_R(M) is a tree iff the graph is a star centered at a simple submodule — is correct. I chased the one step that looked terse (the assertion that condition (2) yields a simple submodule), and the stress-test note is right: choose any nonessential A and a maximal complement C; then A+C is essential, A and C are both nonessential, and condition (2) forces one of them to be simple. No circularity.\n\nWhat is new: the paper extends Amjadi's sum-essential graph from a commutative ring viewed as a module over itself to arbitrary left modules, and it introduces the proper subgraph P_R(M) induced by nonessential submodules. The finiteness criteria (Theorems 2.1, 2.3), the degree-one characterization (Theorem 2.13), and the tree/star classification are genuinely new. The proofs are standard module theory, detailed enough to check comfortably, and I found no load-bearing gaps. The theorem that a k-regular S_R(M) must be complete is a nice observation.\n\nSoft spots, in proportion: the significance is honest p, not revolutionary — this is a niche construction and the classifications, while clean, do not crack a long-open problem. There are typos and occasional terseness (Theorem 2.13's equivalence (3)⇔(4) is delegated to Lemma 2.8; the simple-submodule step in Theorem 3.12 is abbreviated). All of these are fillable. The paper would benefit from a bit more exposition on the examples and on why the tree case matters. Citation pattern is fine; self-citation to [8] is relevant and not inflated.\n\nWho it is for: people working on graphs of ideals/submodules; it will be a useful reference for anyone generalizing essential-sum graphs. It is not a paper for the general mathematical reader.\n\nVerdict on reviewing: send it to a ref. I would not accept it as-is due to the terse bits, but there is a publishable paper here after minor tightening. My own verdict would be between accept and minor revision, leaning minor revision.","headline":"Solid, modest module-theory paper: the tree/star classification is correct and the generalization to arbitrary modules is genuinely new; refereeing should focus on tightening a few terse steps, not on correctness.","tokens_in":14442,"tokens_out":5541,"would_cite":true,"duration_ms":53518,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C25","05C40","16D99"],"pacs":[],"model":"deepseek-v4-flash","headline":"For modules, a tree-shaped proper sum-essential graph is always a star centered at a simple submodule.","keywords":["sum-essential graph","proper sum-essential graph","essential submodule","uniform dimension","tree graph","triangle-free graph","semisimple module","strongly disjoint submodules"],"falsifier":"Compute the adjacency structure of $\\mathcal{P}_\\mathbb{Z}(M)$ for $M=\\mathbb{Z}_{p^2}\\oplus\\mathbb{Z}_{q^2}$ with distinct primes $p,q$; the paper predicts a 4-cycle and hence not a tree, so if this computation instead produced a tree, Theorem 3.12 would be refuted. Alternatively, a single example of a tree-shaped $\\mathcal{P}_R(M)$ without a simple submodule at its center would refute the direction that identifies the tree's center as simple.","tokens_in":13470,"feed_emoji":"🌳","tokens_out":10425,"duration_ms":87938,"temperature":0.7,"pith_summary":"This paper studies two graphs attached to a module $M$: the sum-essential graph, whose vertices are the nontrivial submodules of $M$ and whose edges join submodules whose sum is an essential submodule (one meeting every nonzero submodule), and the proper sum-essential subgraph induced by nonessential submodules. The main result is a classification: if the proper sum-essential graph is a tree, then it is necessarily a star whose center is a simple submodule, and this happens exactly when any two nonessential submodules whose sum is essential are strongly disjoint and one of them is simple. Along the way the authors show that both graphs are connected with diameter at most 3, that finiteness of degrees forces finiteness of the graph, and that the full sum-essential graph is complete or regular only in very restricted forms. The paper thereby translates module-theoretic data, such as uniform dimension and the structure of the socle, into recognizable graph shapes and reads module structure back off graph properties.","feed_headline":"A tree-shaped submodule graph is always a star","feed_subtitle":"New classification: the proper sum-essential graph is a star with a simple center; girth can only be 3, 4, or infinity.","key_machinery":"The load-bearing mechanism is the proper sum-essential graph $\\mathcal{P}_R(M)$ together with the relation of strong disjointness: two submodules are strongly disjoint when they contain no nonzero isomorphic submodules. Lemma 3.10 recasts this as the condition that corresponding nonzero elements have different annihilators, and as a decomposition property for submodules of their sum. In Theorem 3.11 this relation filters out triangles: with uniform dimension 2, any essential-sum pair of nonessential submodules must be strongly disjoint or a triangle appears. Theorem 3.12 then shows that a tree forces one member of every essential-sum pair to be simple, which collapses the graph to a star centered at that simple submodule.","core_discovery":"The central discovery, on the paper's own terms, is Theorem 3.12: for a module $M$ with nonempty proper sum-essential graph $\\mathcal{P}_R(M)$, the graph is a tree if and only if every pair of nonessential submodules $A,B$ with $A+B$ essential is strongly disjoint and at least one of $A,B$ is simple; equivalently, $\\mathcal{P}_R(M)$ is a star graph whose center is a simple submodule. The proof builds on the triangle-free characterization of Theorem 3.11, which forces uniform dimension 2 and strong disjointness for essential-sum pairs, and then rules out configurations that would create a 4-cycle unless one summand is simple. The resulting module structure is an extension of a simple submodule by a semisimple complement with no isomorphic copies of that simple elsewhere; the paper's examples include $\\mathbb{Z}$-modules such as $\\mathbb{Z}\\oplus \\mathbb{Z}_q$ and $\\mathbb{Z}_{p^n}\\oplus\\mathbb{Z}_q$ for distinct primes $p,q$.","pith_inferences":["The equivalence in Theorem 3.12 suggests a recipe for building modules with a prescribed star-shaped proper sum-essential graph: start with a simple submodule $S$ with no isomorphic copies elsewhere, add a semisimple complement, and check that every essential-sum pair is strongly disjoint; the paper does not present this as a construction, but it follows directly from the proof.","Because strong disjointness has an annihilator reformulation, the tree condition could be checked computationally for finitely generated modules once annihilators of elements are known; this is a test the paper does not carry out.","The result implies that a path with three or more vertices cannot occur as a proper sum-essential graph, which is a useful constraint for anyone trying to realize arbitrary graphs as submodule lattices."],"forward_implications":["If the proper sum-essential graph is a tree, the module has uniform dimension 2, so every nonessential submodule is uniform and the graph is a star with a simple center.","For any module with a nonempty proper sum-essential graph, the girth is 3, 4, or infinity; if the uniform dimension exceeds 2, the girth is 3.","If every vertex of the proper sum-essential graph has finite degree, the graph itself is finite; for the full sum-essential graph, the same condition forces the module to have only finitely many submodules.","The sum-essential graph is complete exactly when the module is uniform, or all nonessential submodules are simple with a socle that is a direct sum of two simples; for semisimple modules this reduces to a direct sum of two simple modules.","A $k$-regular sum-essential graph is necessarily complete, so regularity does not create genuinely new graph shapes."],"supporting_citations":[{"why":"Introduces the sum-essential graph in the commutative-ring case and supplies the original object the paper generalizes.","marker":"[5]"},{"why":"Provides the standard facts on essential submodules and uniform dimension used throughout the proofs.","marker":"[6]"},{"why":"Provides further background on modules, essentiality, and uniform dimension relied on in the arguments.","marker":"[7]"},{"why":"Its Lemma 1.1 counts submodules of a direct sum of simple modules, used in Example 1.4 and in Theorem 2.1.","marker":"[8]"}],"fun_headline_variants":["Tree submodule graphs are always stars","Sum-essential trees turn out to be stars","If the sum-essential graph is a tree, it's a star","Tree graphs of modules: only stars, girth 3,4,∞","Module trees are stars, no other shapes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The classification leans on the standard module-theoretic facts that every nonzero submodule of a uniform module is essential in it and that a proper submodule of a semisimple module is never essential; if those facts fail, the adjacency tests carrying the proof would stop working.","fun_headline_variants_meta":{"raw":{"variants":["Tree submodule graphs are always stars","Sum-essential trees turn out to be stars","If the sum-essential graph is a tree, it's a star","Tree graphs of modules: only stars, girth 3,4,∞","Module trees are stars, no other shapes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000213,"raw_usage":{"total_tokens":1374,"prompt_tokens":850,"completion_tokens":524,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":466,"completion_tokens_details":{"reasoning_tokens":444}},"tokens_in":466,"tokens_out":524,"duration_ms":5074,"temperature":1.0,"reasoning_tokens":444,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:04:09.415304+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the adjacency structure of $\\mathcal{P}_\\mathbb{Z}(M)$ for $M=\\mathbb{Z}_{p^2}\\oplus\\mathbb{Z}_{q^2}$ with distinct primes $p,q$; the paper predicts a 4-cycle and hence not a tree, so if this computation instead produced a tree, Theorem 3.12 would be refuted. Alternatively, a single example of a tree-shaped $\\mathcal{P}_R(M)$ without a simple submodule at its center would refute the direction that identifies the tree's center as simple.","supporting_citations":[{"cited_title":"Amjadi, The essential ideal graph of a commutative rin g, Asian-Eur","cited_arxiv_id":null,"evidence_quote":"Introduces the sum-essential graph in the commutative-ring case and supplies the original object the paper generalizes."},{"cited_title":"Lam, A First Course in Noncommutative Rings, Spring er-Verlag, New York, 2001","cited_arxiv_id":null,"evidence_quote":"Provides the standard facts on essential submodules and uniform dimension used throughout the proofs."},{"cited_title":"Lam, Lectures on Modules and Rings, Springer-Verla g, New York 1999","cited_arxiv_id":null,"evidence_quote":"Provides further background on modules, essentiality, and uniform dimension relied on in the arguments."},{"cited_title":"Matczuk, M","cited_arxiv_id":null,"evidence_quote":"Its Lemma 1.1 counts submodules of a direct sum of simple modules, used in Example 1.4 and in Theorem 2.1."}],"review_version":1}