{"id":"0179b122-4fa3-4ecb-9105-ee9869fb0a82","arxiv_id":"1908.03893","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The α-distance Estrada index is introduced and several bounds on α-distance spectral radius, energy, and Estrada index are proved for connected graphs.","lead":"This paper derives bounds for the spectral radius, energy, and a newly defined Estrada index of the α-distance matrix of a graph. The results express the bounds through vertex transmissions, the Wiener index, and the parameter α, extending known distance-spectrum inequalities.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 2.3 is false: D_{3/5}(P_3) has two distinct eigenvalues, so Theorem 3.10's equality case 'G ≅ K_n' fails despite the inequality itself holding.","rationale":"The reader's weakest assumption is exactly the load-bearing point, and the direct computation decides it: Proposition 2.3 is false, so Theorem 3.10's equality statement is false as written. I agree with the reader's CONDITIONAL verdict. The displayed inequality in Theorem 3.10 is not contradicted by the counterexample: it follows from Lemma 3.9 and the trace identity, and the equality condition in that lemma is simply that the n−1 smaller shifted eigenvalues coincide. That condition is equivalent to D_α having two distinct eigenvalues, not to completeness. The error is localized and fixable by deleting or correcting the equality claim, so I do not see grounds to escalate to REJECT on this concern alone. A secondary issue worth checking in revision is Theorem 3.15, whose proof uses nonnegativity of all σ_i in the δ-step and should state α ∈ [1/2, 1) if that is the intended range; this is less central than the false Proposition 2.3.","tokens_in":13392,"tokens_out":22579,"duration_ms":232605,"concrete_test":"Compute the exact spectrum of D_{3/5}(P_3) for the path on three vertices. If the eigenvalues are {14/5, 1, 1}, then Proposition 2.3 is refuted and the equality case of Theorem 3.10 fails for a non-complete connected graph; no other claims are needed to settle the issue.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Proposition 2.3 is not merely unproved; it is false. For G = P_3 and α = 3/5, D_α = [[9/5,2/5,4/5],[2/5,6/5,2/5],[4/5,2/5,9/5]], whose characteristic polynomial is (x − 14/5)(x − 1)^2. Thus D_α has exactly two distinct eigenvalues, 14/5 and 1, while P_3 is not complete. This is load-bearing: in Theorem 3.10 the equality condition from Lemma 3.9 is precisely σ_2 − μ = ⋯ = σ_n − μ, i.e. D_α has two distinct eigenvalues. With W(P_3) = 4, μ = 2αW/n = 8/5, σ_1 − μ = 6/5, and σ_2 − μ = σ_3 − μ = −3/5, so equality in Theorem 3.10 holds for this non-complete graph. The inequality in Theorem 3.10 survives, but the asserted equality characterization is false.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the α-distance matrix Dα(G)=αTr(G)+(1−α)D(G) of a connected graph and defines the α-distance Estrada index. It derives upper and lower bounds for the α-distance energy, for the spectral radius of Dα(G), and for the α-distance Estrada index, using trace identities, Perron-Frobenius theory, quotient-matrix interlacing, and standard inequalities. The α-distance spectrum and energy of stars are computed explicitly, and equality conditions are stated for several of the bounds.","tokens_in":13621,"tokens_out":15949,"duration_ms":154756,"significance":"If the results were fully correct, the paper would provide a useful parameterized family of bounds interpolating between distance and signless-Laplacian spectral invariants, together with a new Estrada-type invariant and explicit formulas for stars. The main inequalities are derived transparently from standard tools, and many of the trace computations (Lemma 2.12, Eq. (4)), Cauchy-Schwarz steps, and quotient-matrix arguments are sound in their inequality form. However, the equality characterization in Theorem 3.10 depends on a false proposition, so the paper needs a substantial correction before its central equality claims can be accepted.","major_comments":[{"comment":"Proposition 2.3 is false as stated. For G=P3 and α=3/5, Dα(G)=[[9/5,2/5,4/5],[2/5,6/5,2/5],[4/5,2/5,9/5]] has characteristic polynomial (x−14/5)(x−1)^2, so it has exactly two distinct eigenvalues although P3 is not complete. This proposition is exactly what converts the eigenvalue equality condition in Lemma 3.9 into the graph-theoretic equality case in Theorem 3.10, so the equality characterization G≅Kn is incorrect. Indeed, for this example μ=2αW/n=8/5, σ1−μ=6/5, and σ2−μ=σ3−μ=−3/5, which satisfies the equality condition of Lemma 3.9, so equality in Theorem 3.10 holds for a non-complete graph. The inequality in Theorem 3.10 appears correct, but the equality case must be restated in terms of the eigenvalue multiplicity condition or proved by a different argument.","section":"§2, Proposition 2.3; §3, Theorem 3.10"}],"minor_comments":[{"comment":"The claim that f(x) is monotonically decreasing on [0,4] is stated without proof and is in fact false; for α=1/2, n=3, W(G)=3, f(0)≈7.303 and f(2)≈7.506. The derived lower bound is already obtained by taking δ=0, so the monotonicity assertion should be removed or corrected.","section":"§3, Theorem 3.15"},{"comment":"The reference 'Lemma ??' should be to Lemma 2.1, and Corollary 3.17 cites 'Theorem 2.1', but no Theorem 2.1 exists in the paper.","section":"§3, Theorem 3.16 and Corollary 3.17"},{"comment":"In the proof of Proposition 3.12, 'λ1(BM), λ1(BM)' should read 'λ1(BM), λ2(BM)', and the displayed discriminant appears to contain typographical errors: 'αnTr2(vi)' should presumably be 'αnTr(vi)' and 'Tr2(vi)' should be 'Tr(vi)^2'; as printed, the formula does not match the characteristic polynomial of the displayed quotient matrix (for example, for K3 with α=1/2).","section":"§3, Proposition 3.12"},{"comment":"There are numerous typographical issues, including 'transimission' for 'transmission', 'greaterorequalslant' for '≥', and inconsistent notation 'T r' versus 'Tr'; these should be cleaned up before publication.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here is my take on arXiv:1908.03893 (Yang, Sun, Bu). The paper defines the α-distance Estrada index and proves a set of bounds on the α-distance spectral radius, energy, and Estrada index. The new index is a legitimate extension of the distance Estrada index, and the closed-form star energy formula in Theorem 2.8 is a concrete new result. Most proofs are standard: trace identities, Cauchy-Schwarz, Perron-Frobenius, and quotient-matrix interlacing. The bounds in Theorems 2.7, 2.11, 2.13, 3.8, and 3.14 look correct to me.\n\nBut the paper has a load-bearing false statement. Proposition 2.3 claims that for α∈[0,1), Dα(G) has two distinct eigenvalues only if G is complete. That is false. Take P3 with α=3/5. Dα has eigenvalues 14/5 and 1 (multiplicity 2), so two distinct eigenvalues, but P3 is not complete. This is not a curiosity: Theorem 3.10 uses Proposition 2.3 to conclude that equality in its spectral-radius bound occurs only for Kn. For the same P3 and α=3/5, equality in Theorem 3.10 does hold, so the claimed equality characterization is wrong. The inequality itself survives; the \"if and only if\" does not.\n\nOther soft spots: Theorem 3.15 asserts monotonicity of a function f(x) on [0,4] without proof; that step needs checking. Cross-references are broken in places (Theorem 3.16 cites Lemma ??). The typesetting is rough, making some formulas hard to verify, but that is secondary.\n\nThe derivations are otherwise self-contained and rely on external lemmas rather than circular reasoning. The novelty is extension-level, not conceptual.\n\nIs this worth a serious referee? Yes. The mistake in Proposition 2.3 is serious but localized; the principal inequalities appear to hold. A referee can send the authors back to correct equality conditions, prove or remove the false proposition, and fix the missing details. If revised, the paper could become a reasonable spectral graph theory contribution. As it stands, I would not accept it.","headline":"The inequality in Theorem 3.10 is true but its equality case is false, and Proposition 2.3 is contradicted by P_3 with α=3/5.","tokens_in":14133,"tokens_out":5923,"would_cite":false,"duration_ms":54635,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C50"],"pacs":[],"model":"deepseek-v4-flash","headline":"The $\\alpha$-distance spectrum of a connected graph obeys sharp bounds tied to its Wiener index.","keywords":["alpha-distance matrix","distance spectrum","graph energy","Estrada index","spectral radius","Wiener index","transmission regular","complete graph"],"falsifier":"For $\\alpha=1/2$, compute the eigenvalues of $D_{\\alpha}$ for every connected graph on up to six vertices, or for the cycle $C_5$ and the Petersen graph; if any non-complete graph has exactly two distinct eigenvalues, Proposition 2.3 is false and the equality statement of Theorem 3.10 collapses. Equivalently, evaluate both sides of Theorem 3.10 on a non-complete graph such as $C_5$; a single equality example would refute the claimed characterization.","tokens_in":13201,"feed_emoji":"📐","tokens_out":10308,"duration_ms":93151,"temperature":0.7,"pith_summary":"This paper studies the $\\alpha$-distance matrix $D_{\\alpha}(G)=\\alpha\\operatorname{Tr}(G)+(1-\\alpha)D(G)$, a one-parameter family that interpolates between the distance matrix, the distance signless Laplacian, and the transmission matrix of a connected graph. It proves bounds on the largest eigenvalue (the spectral radius), on the $\\alpha$-distance energy, and on a newly defined $\\alpha$-distance Estrada index, all expressed through the Wiener index, vertex transmissions, and the Frobenius norm of $D_{\\alpha}(G)$. The sharp results identify complete graphs as the unique extremal cases: equality in the spectral-radius upper bound and in the energy lower bound holds exactly for $K_n$. The paper matters because these bounds estimate spectral properties without computing the full spectrum and unify earlier distance-matrix and distance-signless-Laplacian inequalities as the special cases $\\alpha=0$ and $\\alpha=1/2$.","feed_headline":"Complete graphs hit new distance-spectrum bounds","feed_subtitle":"Inequalities link α-distance eigenvalues to Wiener index and transmissions, with K_n as the extremal graph.","key_machinery":"The load-bearing object is the $\\alpha$-distance matrix $D_{\\alpha}(G)=\\alpha\\operatorname{Tr}(G)+(1-\\alpha)D(G)$, a real symmetric nonnegative matrix whose Perron root is the spectral radius $\\sigma_1(G)$. The proofs repeatedly center the eigenvalues by subtracting their mean $2\\alpha W(G)/n$ and then feed them through variance-type inequalities, chiefly Lemma 3.9: if $x_1,\\dots,x_m$ have zero sum, then $x_1\\leq \\sqrt{\\frac{m-1}{m}\\sum_i x_i^2}$. Row-sum estimates for polynomials in $D_{\\alpha}(G)$, obtained from the Perron-Frobenius theorem, convert bounds on vertex transmissions into eigenvalue bounds. A quotient-matrix interlacing argument (Lemma 3.11) produces the spectral-spread estimate in Proposition 3.12.","core_discovery":"The central discovery is a set of sharp inequalities for the $\\alpha$-distance spectrum. Theorem 3.10 states that for every connected $n$-vertex graph $G$,\n$$\\sigma_1(G)\\leq \\frac{2\\$\\alpha$ W(G)}{n}+\\sqrt{\\frac{n-1}{n}\\left(\\|D_{\\$\\alpha$}(G)\\|$_F^{2}$-\\frac{4\\$alpha^{2}$W(G)^2}{n}\\right)},$$\nwith equality if and only if $G$ is the complete graph $K_n$. Theorem 2.7 gives the companion lower bound for the $\\alpha$-distance energy, $\\varsigma_{\\alpha}(G)\\geq 2(1-\\alpha)(n-1)$ for $\\alpha\\in[1/2,1)$, again with equality exactly for $K_n$. The paper also defines the $\\alpha$-distance Estrada index $\\operatorname{DEE}_{\\alpha}(G)=\\sum_i e^{\\sigma_i(G)}$ and proves upper and lower bounds for it, with transmission-regular graphs appearing as extremal cases. The proofs shift the eigenvalues by their mean $2\\alpha W(G)/n$ and apply variance-type inequalities, Perron-Frobenius row-sum estimates, and quotient-matrix interlacing.","pith_inferences":["If the equality characterization in Theorem 3.10 holds, complete graphs are the unique maximizers of $\\sigma_1(G)$ among connected graphs with fixed order and Wiener index; a similar extremal principle may extend to other distance-based spectral invariants by the same mean-shift argument.","Because the Estrada index is built from the whole spectrum, comparing the $\\alpha=0$ specialization of these bounds with known distance-Estrada bounds would quantify how much the parameter $\\alpha$ expands the theory.","A direct testable extension is to determine which graphs minimize $\\sigma_1(G)$ for fixed $n$ and $W(G)$; stars are natural candidates by analogy with Lemma 2.4, but this paper does not prove that.","A small exhaustive check of non-complete graphs could verify whether Proposition 2.3's 'two distinct eigenvalues iff complete' claim is true; if it fails, the inequalities survive but the equality cases need re-identification."],"forward_implications":["For complete graphs the new inequalities become equalities, so $K_n$ is the unique extremal connected graph for the $\\alpha$-distance spectral-radius bound and the $\\alpha$-distance energy lower bound.","Because $\\alpha=0$ gives the ordinary distance matrix and $\\alpha=1/2$ gives half the distance signless Laplacian, the bounds specialize to known and new inequalities for those matrices.","The $\\alpha$-distance Estrada index bounds provide computable estimates of $\\operatorname{DEE}_{\\alpha}(G)$ from the Wiener index, vertex transmissions, and the sum of squared distances, without computing eigenvalues.","The explicit star formulas (Theorem 2.8 and Proposition 2.5) give benchmarks for testing how close other trees come to extremal behavior."],"supporting_citations":[{"why":"Defines the generalized distance matrix $D_{\\alpha}(G)$ and supplies Lemmas 2.1 and 2.2 on the spectral radius and eigenvalue multiplicities used throughout.","marker":"[3]"},{"why":"Introduces the $\\alpha$-distance energy $\\varsigma_{\\alpha}(G)$ and gives the tree/star spectral-radius comparison used in Lemma 2.4.","marker":"[14]"},{"why":"Provides Lemma 3.9, the zero-sum variance inequality that drives Theorem 3.10's spectral-radius bound.","marker":"[26]"},{"why":"Supplies the Wiener index lower bound $W(G)\\geq n(n-1)/2$ used to pin down the equality case in Theorem 2.7.","marker":"[9]"},{"why":"Gives Lemma 2.9 and Lemma 3.1, the Frobenius-norm and zero-sum estimates behind the energy and spectral bounds.","marker":"[8]"},{"why":"Provides Lemma 3.5, the polynomial row-sum bound that motivates Proposition 3.6 and Theorem 3.8.","marker":"[22]"}],"fun_headline_variants":["α-distance spectrum: sharp bounds, K_n extremal","Complete graphs hit α-distance spectral limits","New α-distance bounds, equality for K_n","Sharp α-distance spectral inequalities for graphs","K_n extremal for α-distance spectrum bounds"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is Proposition 2.3, stated without proof: for $\\alpha\\in[0,1)$, the matrix $D_{\\alpha}(G)$ has exactly two distinct eigenvalues only when $G$ is complete. Theorem 3.10 uses this equivalence to turn its algebraic equality condition into the graph-theoretic equality case $G\\cong K_n$; if the proposition is false, the inequality can still hold but the equality characterization fails.","fun_headline_variants_meta":{"raw":{"variants":["α-distance spectrum: sharp bounds, K_n extremal","Complete graphs hit α-distance spectral limits","New α-distance bounds, equality for K_n","Sharp α-distance spectral inequalities for graphs","K_n extremal for α-distance spectrum bounds"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000733,"raw_usage":{"total_tokens":3273,"prompt_tokens":936,"completion_tokens":2337,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":552,"completion_tokens_details":{"reasoning_tokens":2268}},"tokens_in":552,"tokens_out":2337,"duration_ms":19023,"temperature":1.0,"reasoning_tokens":2268,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:00:14.454284+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For $\\alpha=1/2$, compute the eigenvalues of $D_{\\alpha}$ for every connected graph on up to six vertices, or for the cycle $C_5$ and the Petersen graph; if any non-complete graph has exactly two distinct eigenvalues, Proposition 2.3 is false and the equality statement of Theorem 3.10 collapses. Equivalently, evaluate both sides of Theorem 3.10 on a non-complete graph such as $C_5$; a single equality example would refute the claimed characterization.","supporting_citations":[{"cited_title":"Cui, J.X","cited_arxiv_id":null,"evidence_quote":"Defines the generalized distance matrix $D_{\\alpha}(G)$ and supplies Lemmas 2.1 and 2.2 on the spectral radius and eigenvalue multiplicities used throughout."},{"cited_title":"On the distance $\\alpha$-spectral radius of a connected graph","cited_arxiv_id":"1901.10180","evidence_quote":"Introduces the $\\alpha$-distance energy $\\varsigma_{\\alpha}(G)$ and gives the tree/star spectral-radius comparison used in Lemma 2.4."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides Lemma 3.9, the zero-sum variance inequality that drives Theorem 3.10's spectral-radius bound."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Wiener index lower bound $W(G)\\geq n(n-1)/2$ used to pin down the equality case in Theorem 2.7."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives Lemma 2.9 and Lemma 3.1, the Frobenius-norm and zero-sum estimates behind the energy and spectral bounds."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides Lemma 3.5, the polynomial row-sum bound that motivates Proposition 3.6 and Theorem 3.8."}],"review_version":1}