{"id":"ddbf783a-9ba1-4367-a722-4ec17bb5bd4f","arxiv_id":"2411.15794","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"For regular, diameter-2, and diameter-3 cut-vertex character degree graphs metric dimension formulas are given; the Fitting-height-2 formula is contradicted by a graph satisfying the paper's own Lewis criterion.","lead":"Metric dimension formulas are claimed for four families of character degree graphs of solvable groups. The main formula for groups of Fitting height 2 is false, so the central new theorem fails.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.2 is false: for the Lewis graph whose complement is two K1,2 stars, the proposed resolving set W0 does not resolve, and the actual metric dimension is 3, not n2 - s = 2.","rationale":"The reader's weakest_assumption identifies exactly the step I find load-bearing: the unproved assertion that the lower-bound set W0 is a resolving set in Theorem 4.2. I verified the counterexample independently. The graph whose complement is two K1,2 stars satisfies Lewis's criterion: X = {x1,x2,x3,x4} consists of vertices of degree n-2 = 4, Y = {y1,y2} induces a clique, and there are no universal vertices. By [21, Theorem A] it is realizable as Δ(G) for a solvable group of Fitting height 2. The twin lower bound forces any resolving set of size 2 to contain one leaf from each star; every such pair leaves the two other leaves, one from each star, with identical all-ones representations because X is a clique and the star centers are not in the set. Thus the predicted value 2 is unattainable, and the actual metric dimension is 3. This is a direct internal counterexample, not a disagreement with prevailing opinion. Since Theorem 4.2 is the main Fitting-height-2 result and Theorem 5.8 uses it to equate base size, metric dimension, and adjacency dimension for those graphs, the central claim of the paper does not stand. I therefore see no reason to alter the reader's rejection.","tokens_in":12825,"tokens_out":15467,"duration_ms":132486,"concrete_test":"Run an exhaustive finite check on the 6-vertex graph with vertex set {x1,x2,x3,x4,y1,y2}, a clique on X, the edge y1y2, and all X-Y edges except x1y1, x2y1, x3y2, and x4y2. Compute all-pairs distances and test every 2-subset as a candidate resolving set; if no 2-subset resolves while {x1,x2,x3} does, the metric dimension is 3, contradicting the value n2 - s = 2 predicted by Theorem 4.2 for this Lewis graph.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing flaw is in the upper-bound half of Theorem 4.2, in the paragraph beginning 'However, it is straightforward to check that, if W0 consists just of these vertices.' The claim that W0 is a resolving set fails whenever two different X-stars both have at least two leaves: the omitted leaf from one star and the omitted leaf from the other are each adjacent to every vertex of W0 (all selected X-leaves and all universal vertices; the star centers are absent from W0), so both have the all-ones distance vector. Concretely, take the connected Lewis graph with n1 = 0, n2 = 4, n3 = 2 whose complement is two K1,2 stars with centers y1, y2 and leaves {x1,x2}, {x3,x4}. It satisfies Lewis's criterion, so by [21, Theorem A] it is a character degree graph of a solvable group of Fitting height 2. Theorem 4.2 predicts dim(Γ) = n2 - s = 4 - 2 = 2. But every allowed 2-set W0 contains one leaf from each star, and for W0 = {x1,x3} the omitted leaves x2 and x4 both have representation (1,1); no 2-subset resolves, while {x1,x2,x3} does, so dim(Γ) = 3. Theorem 5.8 inherits this error because it relies on Theorem 4.2 for the Fitting-height-2 dimension.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript studies the metric dimension (and the related base size and adjacency dimension) of the prime character degree graph Δ(G) of a finite solvable group. It announces formulas for four families: (n−2)-regular graphs, diameter-2 non-block graphs of the form K_{n−m−1} − v − K_m, diameter-3 graphs with a cut vertex, and graphs of groups of Fitting height 2 (Lewis graphs). The proofs combine known classification results of Lewis, Wolf–Manz–Willems, and others with elementary metric-dimension arguments. I evaluated the reader's concern about Theorem 4.2 and found it correct; I additionally found a counterexample to Theorem 3.4. The paper is clearly written and some auxiliary results, such as Theorem 5.5 and Proposition 5.6, are sound, but two of the four principal formulas are false as stated. I did not find a comparable defect in Theorem 3.5: the uniform-distance assertions used there follow from the structure in Remark 2.5 together with the diameter-3 partition.","tokens_in":13085,"tokens_out":30900,"duration_ms":273289,"significance":"If the announced formulas were correct, the paper would give a useful graph-theoretic toolkit for character degree graphs, and the connection between base size, metric dimension, and adjacency dimension for Fitting-height-2 groups would be an interesting contribution. The paper also has genuine virtues: the twin-class argument in Theorem 5.5 is elegant, the use of Lewis's theorem to reduce Fitting-height-2 graphs to complement-stars is natural, and the examples are mostly helpful. However, the central claims in Theorems 3.4 and 4.2 are false, and Theorem 5.8 is invalidated along with Theorem 4.2. Since these are the paper's main results, the contribution in its current form is not reliable.","major_comments":[{"comment":"The formula in Theorem 4.2 is false. Take the Lewis graph with n1=0, n2=4, n3=2 whose complement is two disjoint K1,2 stars, with centers y1,y2 and leaves {x1,x2},{x3,x4}. The theorem gives dim = n2 − s = 4 − 2 = 2. But no two-vertex set resolves: if the two selected vertices lie in X, the two omitted leaves have the same distance vector; if a star center is selected instead, two leaves still collide (for example, with W={y1,y2}, x1 and x2 both have representation (2,1), and with W={x1,y1}, x3 and x4 both have (1,1)). The set {x1,x2,x3} does resolve, so dim = 3. This graph satisfies Lewis's criterion in Theorem 4.1, hence it is Δ(G) for a solvable group of Fitting height 2. The flaw is in the paragraph beginning 'However, it is straightforward to check...': the proposed set W0 contains leaves and universal vertices but no star centers, so two omitted leaves from different stars are both adjacent to every vertex of W0 and have identical all-ones representations. Moreover, the paper's own Example 4.3 contradicts the theorem: its parameters n1=1, n2=3, n3=2 force s=1, so Theorem 4.2 would predict dim=2, while the example asserts that {v4,v5,v6} is a minimum resolving set of size 3.","section":"Section 4, Theorem 4.2"},{"comment":"The formula dim = n − 3 in Theorem 3.4 is false for m=1. Let Γ have vertices a,b,v,c with edges ab, av, bv, vc. This is the graph K2 − v − K1 with n=4,m=1, so it is within the theorem's hypotheses. It also satisfies Lewis's criterion with X={a,b}, Y={c}, U={v}, so it is a character degree graph of a solvable group of Fitting height 2. But dim(Γ)=2: no one-vertex set resolves, because {v} gives distance 1 to a,b,c, {a} gives distance 1 to both b and v, and {c} gives distance 2 to both a and b, while {a,c} has representations a=(0,2), b=(1,2), v=(1,1), c=(2,0). The proposed resolving set W=V∖{v1,v_{m+1},v_n} has size n−3=1 in this case and fails, because the cut vertex and the vertex of K_{n−m−1} omitted from W have the same representation; for m=1 and any n≥4 the same collision occurs. The theorem therefore needs an additional hypothesis, and the proof does not supply a correct resolving set in the m=1 case.","section":"Section 3, Theorem 3.4"},{"comment":"The asserted equality b(Δ(G)) = dim(Δ(G)) = adim(Δ(G)) for all Fitting-height-2 groups is false. For the two-star Lewis graph from the first major comment, the automorphism group is S2×S2, so a base must contain one vertex from each twin pair, and {x1,x3} is a base; hence b = 2. But dim = 3 as shown above, and since the graph has diameter 2, adim = dim = 3. Thus the three invariants are not equal. The proof of Theorem 5.8 relies directly on the incorrect dimension computation in Theorem 4.2.","section":"Section 5, Theorem 5.8"}],"minor_comments":[{"comment":"The notation switches between W and W1 in the proof; the vectors labelled r(v1|W1), r(v_{m+1}|W1), and r(v_n|W1) should refer to the same set W used in the claim. This makes the argument hard to follow.","section":"Section 3, Theorem 3.4 proof"},{"comment":"The statement should read b(Δ(G)) = dim(Δ(G)) = adim(Δ(G)); the closing parenthesis is missing after 'b(Δ(G)'.","section":"Section 5, Theorem 5.8"},{"comment":"The phrase 'both equal to n/2' should be 'all three invariants equal to n/2', since three quantities are being compared.","section":"Section 5, Proposition 5.6"},{"comment":"In the proof, 'adim(S) ≤ n − r' should be 'adim(Γ) ≤ n − r'.","section":"Section 5, Theorem 5.5 proof"},{"comment":"Theorems 4.2 and 5.8 do not explicitly assume Γ is connected, but metric dimension and adjacency dimension are normally defined only for connected graphs; Lewis graphs can be disconnected (for example, n1=0, n2=2, n3=1), so a connectedness hypothesis should be stated.","section":"Sections 4 and 5"}],"recommendation":"reject","confidential_remarks":"This manuscript is a clear case for rejection. The central results are not merely unproved; explicit finite counterexamples are realizable as character degree graphs of solvable groups, so the announced formulas are false as stated. The paper might be worth a resubmission only after a substantial re-derivation of the metric dimension formulas in Sections 3 and 4 and a re-examination of the consequences in Section 5."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe headline is simple: the paper's main new theorem is false. Theorem 4.2, which gives metric dimension for Lewis graphs (Fitting height 2 character degree graphs), asserts dim = n2 − s when n1 = 0. Take the connected Lewis graph with n1=0, n2=4, n3=2 whose complement is two K1,2 stars. This satisfies Lewis's criterion, so it's a character degree graph of a solvable group of Fitting height 2. The theorem predicts dim = 2. But no 2-set resolves the graph: any two selected leaves (one from each star) leave the two omitted leaves from different stars with identical distance vectors, and the centers are not resolving either. The actual metric dimension is 3. The flaw is in the proof's upper-bound half, in the paragraph starting 'However, it is straightforward to check...' — the proposed W0 fails because the two omitted leaves are both adjacent to every vertex of W0.\n\nThat's the load-bearing result for Section 5, so Theorem 5.8 falls with it.\n\nThere's a second soft spot. Theorem 3.5, for diameter-3 graphs with a cut vertex, has a lower-bound proof that doesn't go through. In Case 3 of part (1), the claim that X1 ⊂ ρ3 ∪ ρ4 is not justified, and the representations of wi and xj are not generally equal when vertices from ρ1 or ρ2 remain in X1. The formula may be right, but the proof as written has a real gap.\n\nWhat the paper does well: the general twin-class result (Theorem 5.5) is clean and correct, and it yields a nice proof that regular character degree graphs on an even number of vertices have metric dimension n/2. Theorem 3.4, the two-clique case, is sound. The exposition is self-contained and the citation practice is fine — no circularity, and external results are credited properly.\n\nOverall: the regular and two-clique calculations are fine, but the paper's central Fitting-height-2 claim is false, and the diameter-3 proof needs work. This needs major revision, not acceptance. I would still send it to a referee — the topic is legitimate, there are correct parts worth keeping, and a referee should catch exactly these issues. But I wouldn't cite it in its current form.","headline":"Theorem 4.2 is false — the proposed resolving set fails for two K1,2 stars — and Theorem 3.5 has gaps, though the regular and two-clique results are sound.","tokens_in":13626,"tokens_out":4478,"would_cite":false,"duration_ms":38294,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C12","20C15","05C25"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves exact formulas for the metric dimension of character degree graphs of finite solvable groups in four structural classes, and shows that two related invariants coincide for Fitting-height-2 graphs.","keywords":["metric dimension","character degree graph","solvable group","Fitting height 2","Lewis graph","base size","adjacency dimension","twin vertices"],"falsifier":"Compute the metric dimension of the connected Lewis graph whose complement is two two-leaf stars $K_{1,2}$ with one universal vertex added. In that graph the candidate $W_0$ consisting of the universal vertex and one leaf from each star leaves two omitted leaves whose distance to every member of $W_0$ is 1; checking whether any other 2-vertex set resolves the graph would settle whether the formula $n_1+n_2-s-1$ remains correct.","tokens_in":12615,"feed_emoji":"📐","tokens_out":7136,"duration_ms":60206,"temperature":0.7,"pith_summary":"The paper asks how many primes must be pinned down before every prime divisor of an irreducible character degree of a finite solvable group is uniquely identified by its distances to those chosen primes. It proves that for four large classes of character degree graphs the answer is a simple function of the graph's shape. For groups of Fitting height 2, the metric dimension of the Lewis graph is $n_1+n_2-s-1$ when universal vertices exist and $n_2-s$ otherwise, where $n_1$ counts universal vertices, $n_2$ counts the degree-$(n-2)$ vertices, and $s$ counts the multi-edge stars in the complement. It also proves that regular character degree graphs of even order have metric dimension $n/2$, that diameter-2 non-block graphs have dimension $n-3$, and that diameter-3 graphs with a cut vertex have dimension $n-3$ or $n-4$. A sympathetic reader would care because the result turns a structural fact about group characters into a number that can be read directly off the graph.","feed_headline":"One formula fixes metric dimension for Fitting-height-2 graphs","feed_subtitle":"For solvable groups, the invariant is read off from universal vertices and star counts in the complement.","key_machinery":"The machinery is the Lewis partition of a Fitting-height-2 character degree graph: the vertex set splits into universal vertices $U$, a set $X$, and a set $Y$, so that in the complement the edges are stars with centers in $Y$ and leaves in $X$. The proof counts twin classes, where twins are vertices with identical neighborhoods (possibly except each other), since two twins cannot both be absent from a resolving set. The candidate set $W_0$ takes all but one vertex from each twin class, leaving out at most one universal vertex and at most one leaf from each multi-leaf star. For diameter-3 graphs, the Sass partition $\\rho_1\\cup\\rho_2\\cup\\rho_3\\cup\\rho_4$ plays the same role, and the cited structural result says $\\rho_2$ is a singleton when a cut vertex is present.","core_discovery":"The central claim is that metric dimension of $\\Delta(G)$ is controlled by the same partition structures already used to classify character degree graphs. For a Lewis graph, the graph attached to a solvable group of Fitting height 2, the paper proves that $\\dim(\\Gamma)=n_1+n_2-s-1$ when $n_1>0$ and $\\dim(\\Gamma)=n_2-s$ when $n_1=0$, with the parameters taken from the characterization of Fitting-height-2 graphs. The same twin-based argument shows $b(\\Gamma)=\\dim(\\Gamma)=\\operatorname{adim}(\\Gamma)$ for these graphs. For the other classes, the paper establishes $\\dim(\\Delta(G))=n/2$ for non-complete regular graphs on $n$ vertices, $\\dim(\\Delta(G))=n-3$ for diameter-2 graphs made of two cliques joined through a cut vertex, and $\\dim(\\Delta(G))=n-3$ or $n-4$ for diameter-3 graphs with a cut vertex according as the first part of the Sass partition is a singleton or larger.","pith_inferences":["Because the Lewis-graph formula depends only on $n_1,n_2,s$, one could enumerate all Lewis graphs on small vertex sets and computationally verify Theorem 4.2, which would either confirm the constructive proof or expose the graphs where the candidate $W_0$ is not resolving.","The equality of the three invariants for Fitting-height-2 graphs suggests testing whether the same twin-class collapse controls these invariants for other solvable groups whose character degree graphs have small twin quotients.","For diameter-3 graphs, the split between $n-3$ and $n-4$ mirrors the difference between one and several primes in the first Sass layer; a natural extension is to ask whether the same dichotomy appears for adjacency dimension."],"forward_implications":["For any solvable group of Fitting height 2, the metric dimension can be computed directly from the Lewis parameters $n_1,n_2,s$, with no further search.","For these groups, base size, metric dimension, and adjacency dimension are equal, so any algorithm bounding one bounds all three.","Regular character degree graphs of even order $n$ have metric dimension $n/2$, confirming the earlier existence result with an exact invariant.","Diameter-3 character degree graphs with a cut vertex have dimension determined by whether the first Sass layer is a singleton, so the cut-vertex structure controls resolvability.","The twin-class argument gives a general sufficient condition: any connected graph whose every vertex belongs to a twin class has $b=\\dim=\\operatorname{adim}=n-r$ with $r$ the number of twin classes."],"supporting_citations":[{"why":"Characterizes which graphs arise from groups of Fitting height 2, defining the Lewis graphs used throughout the main theorem.","marker":"[21]"},{"why":"Supplies the four-layer partition of diameter-3 character degree graphs used in the cut-vertex proof.","marker":"[28]"},{"why":"Identifies the unique cut vertex in a diameter-3 graph as the singleton layer $\\rho_2$, a key structural input.","marker":"[23]"},{"why":"Gives the two possible structures of a diameter-3 character degree graph with a cut vertex, which the metric-dimension proof then counts.","marker":"[14]"},{"why":"Provides the foundational metric-dimension definitions and known values for complete graphs, paths, and cycles.","marker":"[9]"},{"why":"Shows that a non-complete regular character degree graph is $(n-2)$-regular, the fact behind the regular-graph formula.","marker":"[26]"},{"why":"Shows every $(n-2)$-regular graph occurs as a character degree graph, so the regular case is realized for even $n$.","marker":"[30]"}],"fun_headline_variants":["Exact metric dimension for four graph families from solvable groups","Base size, metric, adjacency dimensions all equal for Lewis graphs","Metric dimension formula for Fitting-height-2 graphs","Diameter-2 and -3 character degree graphs get exact metric dimension","Non-complete regular character degree graphs have metric dimension n/2"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The Fitting-height-2 formula rests on the premise that twin equivalence classes are the only obstruction to resolving a vertex set, so that leaving exactly one vertex out of every twin class always yields a resolving set.","fun_headline_variants_meta":{"raw":{"variants":["Exact metric dimension for four graph families from solvable groups","Base size, metric, adjacency dimensions all equal for Lewis graphs","Metric dimension formula for Fitting-height-2 graphs","Diameter-2 and -3 character degree graphs get exact metric dimension","Non-complete regular character degree graphs have metric dimension n/2"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001204,"raw_usage":{"total_tokens":4921,"prompt_tokens":869,"completion_tokens":4052,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":485,"completion_tokens_details":{"reasoning_tokens":3966}},"tokens_in":485,"tokens_out":4052,"duration_ms":28520,"temperature":1.0,"reasoning_tokens":3966,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:59:30.322732+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the metric dimension of the connected Lewis graph whose complement is two two-leaf stars $K_{1,2}$ with one universal vertex added. In that graph the candidate $W_0$ consisting of the universal vertex and one leaf from each star leaves two omitted leaves whose distance to every member of $W_0$ is 1; checking whether any other 2-vertex set resolves the graph would settle whether the formula $n_1+n_2-s-1$ remains correct.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the four-layer partition of diameter-3 character degree graphs used in the cut-vertex proof."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Characterizes which graphs arise from groups of Fitting height 2, defining the Lewis graphs used throughout the main theorem."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Identifies the unique cut vertex in a diameter-3 graph as the singleton layer $\\rho_2$, a key structural input."},{"cited_title":"Hafezieh, M","cited_arxiv_id":null,"evidence_quote":"Gives the two possible structures of a diameter-3 character degree graph with a cut vertex, which the metric-dimension proof then counts."},{"cited_title":"Chartrand, L","cited_arxiv_id":null,"evidence_quote":"Provides the foundational metric-dimension definitions and known values for complete graphs, paths, and cycles."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Shows that a non-complete regular character degree graph is $(n-2)$-regular, the fact behind the regular-graph formula."},{"cited_title":"Sivanesan, C","cited_arxiv_id":null,"evidence_quote":"Shows every $(n-2)$-regular graph occurs as a character degree graph, so the regular case is realized for even $n$."}],"review_version":1}