{"id":"5861ac54-a965-4fbe-945e-b585fb815b6a","arxiv_id":"1908.07854","paper_version":9,"verdict":"REJECT","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For the Cayley/Toeplitz graph Λ on D_{2n} with n even, the paper claims metric dimension n, minimum doubly resolving set size n, strong metric dimension 2n-2, and that Λ is not distance regular.","lead":"This mathematics paper works out exact metric parameters for a family of graphs built from the dihedral group: the graphs look like complete bipartite networks with extra matching edges. The results give the number of vertices needed to identify every vertex by its distances to a chosen set, but several proof steps are missing or logically incomplete.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.3's proof of strong metric dimension 2n−2 is a non sequitur: it only rules out one (2n−4)-vertex set and supplies no valid lower or upper bound.","rationale":"I agree with the reader's REJECT verdict, and the load-bearing concern is the same one the reader flagged under Theorem 3.3: the lower bound 2n−2 is asserted, not proved. I focus on Theorem 3.3 rather than Theorem 3.1 or 3.2 because it is the cleanest non sequitur: the exhibited failure of one (2n−4)-vertex set implies only sdim > 2n−4, leaving 2n−3 open, and no upper-bound set is exhibited. The same-part resolution lemma is true (checking the distance cases shows no third vertex strongly resolves a same-part pair), so the theorem is repairable, but the manuscript as written does not support the claim. The other gaps (Theorem 3.2 Case 3 uses 'V−R is resolving' to conclude R is doubly resolving; Theorem 3.1 never proves the lower bound n) are real but secondary and similarly repairable. The proposed finite check settles whether the strong metric dimension value is correct; if it passes, the fix is a rewritten proof rather than a change of result, which is consistent with the reader's moderate-confidence REJECT.","tokens_in":7492,"tokens_out":28710,"duration_ms":253069,"concrete_test":"For a fixed n (start with n=4 and n=6), check the missing lemma directly: for every pair u,v in V1 (and in V2) and every w outside {u,v}, compute whether u lies on a shortest v–w path or v lies on a shortest u–w path. This is a finite check using only the distance rules: cross-part pairs have distance 1, same-part non-matched pairs have distance 2, matched pairs have distance 1. If any third vertex w strongly resolves a same-part pair, the lower bound |S∩V1|≥n−1 and |S∩V2|≥n−1 fails and the value 2n−2 is false; if, as expected, no such w exists, the theorem can be repaired by proving this lemma and giving the upper-bound set S=V(Λ)\\{x,y} for one x∈V1 and one y∈V2.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The most load-bearing gap is the proof of Theorem 3.3 (strong metric dimension = 2n−2). The proof takes N={a^n,a^{n/2},a^n b,a^{n/2} b} and S=V(Λ)−N, then shows S is not a strong resolving set: for u=a^n and v=a^{n/2}, every w∈S∩V2 has d(u,w)=d(v,w)=1 and every w∈S∩V1 has d(u,w)=d(v,w)=2, so no w∈S strongly resolves u,v. This establishes only that a strong resolving set cannot omit all four vertices of N; it does not rule out a strong resolving set of size 2n−3, and it gives no construction of a strong resolving set of size 2n−2. The concluding sentence \"From the above cases, we can be concluded that the minimum cardinality...\" is a non sequitur. The missing lemma is that two vertices in the same part V1 (or V2) are strongly resolved only by one of the two vertices themselves; without it, the lower bound could be as low as 2n−3. The claimed value may be correct and repairable, but the proof as written does not establish it.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper considers the Cayley graph Λ = Cay(D_{2n}, Ψ) on the dihedral group D_{2n}, where n is even and n ≥ 4, with generating set Ψ = {ab, a^2b, ..., a^{n-1}b, b} ∪ {a^{n/2}}. It claims that Λ is not distance regular, determines its automorphism group, and computes three resolving parameters: metric dimension n (Theorem 3.1), cardinality of a minimum doubly resolving set n (Theorem 3.2), and strong metric dimension 2n-2 (Theorem 3.3). The paper also gives two small examples for n = 6 illustrating the metric-dimension statements.","tokens_in":7727,"tokens_out":15261,"duration_ms":201798,"significance":"If the results are correct, they provide exact values of three resolving parameters for a concrete infinite family of Cayley/Toeplitz graphs, and they contrast ordinary metric dimension with strong metric dimension in a diameter-2 setting. The claimed values are plausible, and the n = 6 examples in the paper are consistent with the metric-dimension claims. However, the proofs as written contain substantial gaps: no valid lower bound is produced for any of the three main theorems, and the proof of the strong metric dimension result is essentially a non sequitur. The paper would be a useful contribution if these gaps are repaired, but in its current form the central claims are not established.","major_comments":[{"comment":"The proof never establishes the lower bound β(Λ) ≥ n. Cases 1 and 2 only show that certain n-element sets are not resolving, and Case 3 exhibits one n-element resolving set; no argument rules out resolving sets of cardinality n−1. A missing argument would use the fact that for each i, the pair {a^i, a^{i+n/2}} in V1 (and similarly in V2) is resolved only by one of the two vertices themselves, since every vertex in V2 is at distance 1 from both and every other vertex in V1 is at distance 2 from both. As written, the conclusion that the metric dimension is n does not follow.","section":"Theorem 3.1 (metric dimension)"},{"comment":"The reduction 'We may assume R1 = {a, a^2, ..., a^{n/2}}' is not justified. It requires an automorphism of Λ mapping an arbitrary independent half-set of V1 to the standard half-set; the paper does not prove this transitivity (it may be derivable from Proposition 3.2, but the derivation is absent). The same unproved normalization is used again in Theorem 3.2.","section":"Theorem 3.1, Case 3"},{"comment":"The proof gives no lower bound: it attempts to show only that one particular n-element set R is doubly resolving, and even that demonstration is incomplete. In Case 3, the statement that 'by Theorem 3.1, V(Λ)−R is also a resolving set' does not imply that R doubly resolves two vertices outside R: double resolution requires x, y ∈ R with d(u,x)−d(u,y) ≠ d(v,x)−d(v,y), and a resolving vertex lying outside R cannot be used for this purpose. The normalization 'We may assume' for the representative pairs is also not proved.","section":"Theorem 3.2 (doubly resolving set)"},{"comment":"The proof establishes only that the particular set S = V(Λ)−N, with N = {a^n, a^{n/2}, a^n b, a^{n/2} b}, is not a strong resolving set. This shows that a strong resolving set must contain at least one vertex of N; it does not rule out strong resolving sets of size 2n−3 and it does not construct a strong resolving set of size 2n−2. The final sentence 'From the above cases, we can be concluded...' is therefore a non sequitur. A valid proof would need structural lemmas characterizing, for diameter-2 vertices, which third vertices strongly resolve a given pair, and then a matching construction of a strong resolving set of size 2n−2.","section":"Theorem 3.3 (strong metric dimension)"},{"comment":"The spectrum {n+1, 1−n, 1^{(n−2)}, −1^{(n)}} is asserted by analogy with Proposition 11 of [12]; no eigenvalues or eigenvectors for Λ are computed in this manuscript. Since the four-eigenvalue count is the entire evidence for non-distance-regularity, this assertion is not supported within the paper, and it cannot be checked without reproducing the cited proof in the present setting.","section":"Proposition 3.1 (non-distance-regularity)"}],"minor_comments":[{"comment":"Reference [15] points to 'https://arxiv.org/submit/3838712', a submission URL rather than a citable published item; it should be replaced by the final published version or removed.","section":"References"},{"comment":"There are many typographical corruptions (for example, '/nequal' instead of ≠, and exponent expressions such as 'a^{n+2i\\over 2}' without parentheses). The manuscript needs a careful proofreading pass before it can be published.","section":"Throughout"},{"comment":"The abstract promises that the class 'cannot be edge transitive', but the body contains no proof of non-edge-transitivity; either prove this claim or remove it from the abstract.","section":"Abstract"},{"comment":"The automorphism group statement is asserted with a brief reference to [14] and a computation of the complement; for completeness, the composite wreath-product notation should be expanded, since this statement is later used implicitly in the normalization steps of Theorems 3.1 and 3.2.","section":"Proposition 3.2"}],"recommendation":"major_revision","confidential_remarks":"For the editor: the paper has a notable self-citation pattern (references [8], [12], [13], and [15] involve the authors), and reference [15] is the manuscript's own submission URL, which suggests the reference list was not finalized. My recommendation is based on the scientific content above, not on the citation pattern. The claimed values are plausible and the missing arguments appear repairable, so I recommend major revision rather than rejection; however, the authors should be asked to supply complete proofs of all three main theorems rather than localized patches."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's a quick read. The graph family is a genuine, simple object: two n-sets V1 and V2 with all cross edges, plus a perfect matching inside each part (which makes the complement two cocktail-party graphs). What the paper does well: the construction is clean, the automorphism-group observation in Prop. 3.2 is nice, and the small examples check out. The explicit resolving set in Theorem 3.1 — the first half of V1 and the first half of V2 — is an honest, verifiable upper bound.\n\nThe soft spots are in the lower bounds. Theorem 3.1 never rules out a resolving set of size n−1; it only shows some size-n sets fail. Theorem 3.2's Case 3 says 'by Theorem 3.1, V−R is also resolving' — that does not imply R is doubly resolving for the pair you need. And Theorem 3.3 is a genuine non sequitur: showing that S=V−N is not a strong resolving set for one 4-clique N only proves that a strong resolving set must meet N. It neither constructs a strong resolving set of size 2n−2 nor proves a lower bound. The stress-test note is accurate.\n\nMinor issues: the spectrum in Prop. 3.1 is asserted by reference to a similar proof in another paper, and several 'we may assume' moves in the case analyses are not justified by automorphisms, though they are likely fixable. The self-citation pattern is not itself a problem, but key facts are delegated to the authors' own earlier work.\n\nBottom line: the claims may all be true, and this is a natural little family, but the manuscript does not establish them. I would not send this version to a referee. I'd tell the authors to repair the lower bounds and resubmit. If all you want is to know whether the values are correct, a referee could check that quickly, but that's not the same as the paper being ready.","headline":"Plausible values for resolving parameters in a clean Cayley/Toeplitz family, but the lower-bound proofs are missing and Theorem 3.3 is a non sequitur.","tokens_in":8226,"tokens_out":9659,"would_cite":false,"duration_ms":78257,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C12","05E30","05C50"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every even $n\\ge4$, the Cayley graph $\\Lambda=\\mathrm{Cay}(D_{2n},\\Psi)$ has metric dimension $n$, doubly resolving number $n$, and strong metric dimension $2n-2$, and is not distance regular.","keywords":["Cayley graph","metric dimension","doubly resolving set","strong metric dimension","Toeplitz graph","dihedral group","distance-regular graph","cocktail-party graph"],"falsifier":"Run an exhaustive search over all subsets of the $2n$ vertices of $\\Lambda$ for $n=4$ (the smallest case) and check whether any subset of size $5$ strongly resolves every pair; if yes, the claimed $2n-2=6$ is false. A direct spot-check is whether $a^{n/2+1}$, which lies outside $N$, strongly resolves the adjacent pair $\\{a^n,a^{n/2}\\}$ by lying on a shortest path from $a^n$ to $a^{n/2+1}$.","tokens_in":7283,"feed_emoji":"📐","tokens_out":12417,"duration_ms":262639,"temperature":0.7,"pith_summary":"Working with the graph $\\Lambda=\\mathrm{Cay}(D_{2n},\\Psi)$ obtained from the dihedral group $D_{2n}$ by taking as connection set every reflection together with the half-turn rotation $a^{n/2}$ (for even $n\\ge4$), the paper determines three resolving parameters exactly. The metric dimension is $n$, the minimum size of a doubly resolving set is $n$, and the strong metric dimension is $2n-2$. The same $n$-vertex half-set $R=\\{a,\\dots,a^{n/2}; ab,\\dots,a^{n/2}b\\}$ is shown to be both metric and doubly resolving. Along the way the paper shows $\\Lambda$ is vertex-transitive but not distance regular, gives its spectrum, and identifies its automorphism group. Exact resolving parameters for non-distance-regular vertex-transitive graphs are comparatively rare, so the value of the paper is a complete answer for a natural infinite family.","feed_headline":"Exactly n vertices identify every point in this Cayley graph family","feed_subtitle":"The same n probes doubly resolve it; strong metric dimension is 2n-2 for every even n at least 4.","key_machinery":"The load-bearing object is the graph $\\Lambda=\\mathrm{Cay}(D_{2n},\\Psi)$ with $\\Psi=\\{ab,a^2b,\\dots,a^{n-1}b,b\\}\\cup\\{a^{n/2}\\}$; it has diameter 2 and its complement is the disjoint union of two copies of the cocktail-party graph $CP(n/2)$ (the complete graph on $n/2$ pairs with each pair's edge deleted). The argument runs on the partition of the vertex set into rotations $V_1$ and reflections $V_2$, the half-set $R$, and the fact that distances inside $\\Lambda$ are only 1 or 2, which makes distance vectors to $R$ short and explicit. Two structural facts carry the non-metric conclusions: the spectrum $\\{n+1,1-n,1^{(n-2)},-1^{(n)}\\}$, whose four distinct eigenvalues rule out distance regularity, and the complement's cocktail-party structure, which determines $\\mathrm{Aut}(\\Lambda)$ as an iterated wreath product $Z_2 \\wr \\mathrm{Sym}(n/2) \\wr \\mathrm{Sym}(2)$.","core_discovery":"Let $V_1$ be the rotations and $V_2$ the reflections of $D_{2n}$. The paper's central discovery is that, for even $n\\ge4$, the $n$-vertex set $R=\\{a,\\dots,a^{n/2}; ab,\\dots,a^{n/2}b\\}$ resolves $\\Lambda$: every vertex outside $R$ has a different vector of distances to the vertices of $R$, and the same $R$ also doubly resolves every pair of vertices. The lower bounds are argued by partitioning any candidate resolving set into its intersections with $V_1$ and $V_2$ and showing that unequal sizes, or adjacent vertices inside one half, leave two vertices with identical distance vectors. For strong resolution, the paper contends that deleting any four-vertex clique $N=\\{a^n,a^{n/2};a^n b,a^{n/2}b\\}$ leaves a set that cannot strongly resolve the pair $\\{a^n,a^{n/2}\\}$, so every strong resolving set must have size at least $2n-2$. It also computes the adjacency spectrum $\\{n+1,1-n,1^{(n-2)},-1^{(n)}\\}$ and, since a distance-regular graph of diameter $2$ can have at most three distinct eigenvalues, concludes that $\\Lambda$ is not distance regular.","pith_inferences":["One could test the strong-metric bound computationally for $n=4,6$: an exhaustive search for strong resolving sets of size less than $2n-2$ would either confirm the claimed pattern or locate a smaller set, giving a concrete check of the proof's lower-bound step.","The construction suggests a wider family: replace the dihedral group by any split group with a similar 'all coset elements plus one central involution' connection set; the same distance-2 argument might yield analogous exact resolving parameters.","Because the complement splits into two cocktail-party graphs, the metric and resolving behaviour may be governed by a product-like structure; exploring whether $R$ and $V(\\Lambda)-R$ always form complementary resolving sets could give a transfer principle for other Cayley graphs whose complements are disjoint unions."],"forward_implications":["For every even $n\\ge4$, the family $\\Lambda$ is a sharp example where the metric dimension equals the order of the generating half-set: no resolving set of size $n-1$ exists, and $R$ achieves $n$.","The doubly resolving number of $\\Lambda$ coincides with its metric dimension, both being $n$, so any minimum metric basis here is automatically minimum doubly resolving.","A four-eigenvalue spectrum forces $\\Lambda$ to be non-distance-regular, so the exact resolving parameters are examples in the harder, non-distance-regular setting rather than in the well-understood distance-regular setting.","The automorphism group is explicitly $\\mathrm{Aut}(\\Lambda)\\cong Z_2 \\wr \\mathrm{Sym}(n/2) \\wr \\mathrm{Sym}(2)$, which gives a concrete symmetry description of the whole family.","Since $\\Lambda$ is isomorphic to the Toeplitz graph $T_{2n}(\\{1,3,5,\\dots,2n-1;n\\})$, the same exact parameters apply to that drawing of the graph."],"supporting_citations":[{"why":"Defines the metric dimension and resolving set that the paper's Theorem 3.1 computes.","marker":"[2]"},{"why":"Independent definition of the same resolving-set notion, establishing the invariant being studied.","marker":"[3]"},{"why":"Supplies the distance-regular graph theory used in Proposition 3.1: a distance-regular graph of diameter $d$ has exactly $d+1$ distinct eigenvalues.","marker":"[9]"},{"why":"Introduces doubly resolving sets; the paper's Theorem 3.2 computes this parameter.","marker":"[10]"},{"why":"Introduces strong resolving sets and strong metric dimension; Lemma 3.1 and Theorem 3.3 use this definition.","marker":"[11]"},{"why":"Supplies the spectral argument that Proposition 3.1 adapts to compute the four-eigenvalue spectrum of $\\Lambda$.","marker":"[12]"},{"why":"Gives the isomorphism between the cocktail-party graph $CP(n/2)$ and a Cayley graph on $\\mathbb{Z}_n$, used to identify the complement and automorphism group.","marker":"[13]"},{"why":"Gives the automorphism-group result for repeated graphs that determines $\\mathrm{Aut}(\\Lambda)$ in Proposition 3.2.","marker":"[14]"}],"fun_headline_variants":["n points resolve every vertex in this Cayley graph family","Strong metric dimension 2n-2 for this Cayley graph family","Resolving set of size n found for even-order Cayley graphs","Resolving number n, strong metric dimension 2n-2 in a Cayley graph family"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The strong-metric-dimension lower bound depends on the unproved claim that, for the adjacent pair $\\{a^n,a^{n/2}\\}$ in $V_1$, no vertex outside $\\{a^n,a^{n/2},a^n b,a^{n/2}b\\}$ can strongly resolve it; if an outside vertex can lie on a shortest path between the two, the value $2n-2$ could be too large.","fun_headline_variants_meta":{"raw":{"variants":["n points resolve every vertex in this Cayley graph family","Strong metric dimension 2n-2 for this Cayley graph family","Resolving set of size n found for even-order Cayley graphs","Resolving number n, strong metric dimension 2n-2 in a Cayley graph family"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000975,"raw_usage":{"total_tokens":4162,"prompt_tokens":980,"completion_tokens":3182,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":596,"completion_tokens_details":{"reasoning_tokens":3102}},"tokens_in":596,"tokens_out":3182,"duration_ms":21958,"temperature":1.0,"reasoning_tokens":3102,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:55:40.580732+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run an exhaustive search over all subsets of the $2n$ vertices of $\\Lambda$ for $n=4$ (the smallest case) and check whether any subset of size $5$ strongly resolves every pair; if yes, the claimed $2n-2=6$ is false. A direct spot-check is whether $a^{n/2+1}$, which lies outside $N$, strongly resolves the adjacent pair $\\{a^n,a^{n/2}\\}$ by lying on a shortest path from $a^n$ to $a^{n/2+1}$.","supporting_citations":[{"cited_title":"Harary and R","cited_arxiv_id":null,"evidence_quote":"Defines the metric dimension and resolving set that the paper's Theorem 3.1 computes."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Independent definition of the same resolving-set notion, establishing the invariant being studied."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the distance-regular graph theory used in Proposition 3.1: a distance-regular graph of diameter $d$ has exactly $d+1$ distinct eigenvalues."},{"cited_title":"C´ aceres, C","cited_arxiv_id":null,"evidence_quote":"Introduces doubly resolving sets; the paper's Theorem 3.2 computes this parameter."},{"cited_title":"Seb¨ o and E","cited_arxiv_id":null,"evidence_quote":"Introduces strong resolving sets and strong metric dimension; Lemma 3.1 and Theorem 3.3 use this definition."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the spectral argument that Proposition 3.1 adapts to compute the four-eigenvalue spectrum of $\\Lambda$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the isomorphism between the cocktail-party graph $CP(n/2)$ and a Cayley graph on $\\mathbb{Z}_n$, used to identify the complement and automorphism group."},{"cited_title":"Frucht, On the groups of repeated graphs, Bulletin of the American Ma thematical Society, vol.55, pp.418–420, 1949","cited_arxiv_id":null,"evidence_quote":"Gives the automorphism-group result for repeated graphs that determines $\\mathrm{Aut}(\\Lambda)$ in Proposition 3.2."}],"review_version":1}