{"id":"7b4ca797-4a5a-44a1-9f27-63b0af76abde","arxiv_id":"2607.14312","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Unilateral metric graphs built from Ramanujan expanders disprove geometric upper bounds on the spectral gap and show the Pólya–Szegő inequality is asymptotically sharp.","lead":"This paper shows that no universal upper bound on a metric graph's spectral gap can be expressed in terms of its volume, diameter, girth, or mean distance, and that the classical Pólya–Szegő inequality for torsional rigidity is asymptotically sharp. It uses Ramanujan expander graphs as counterexamples, resolving an open problem about mean distance and sharpening earlier failure results.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified — external dependencies are robust; minor proof gaps do not touch central claims.","rationale":"The reader's ACCEPT verdict is correct. The paper's main theorems (Theorem 3.8, Theorem 3.11, Theorem 4.6) are supported by a transparent mechanism: fixed-degree Ramanujan graphs give a spectral gap bounded below, while the relevant metric quantities diverge logarithmically (or faster) with the number of vertices. I checked the key derivations. Lemma 3.9 is a valid probabilistic coupling; the Loewner inversion in (4.14) has the correct direction; the asymptotic lower bound in (4.17) indeed tends to 1 for #V_D=1 as d,q→∞. The reader's weakest-assumption concern about [38, Formula (5)] does not land, because the needed divergence follows from the elementary Moore bound and is far stronger than required. The torsional rigidity formula [31, Theorem 3.9] is exact and can be verified on single-edge examples. I did find two small proof-writing issues: Lemma 4.3's assertion that u⊥ vanishes on V_D is false (u⊥ is the constant −c on V_D), and Definition 2.3 as written does not state the full-spectrum Ramanujan property used in Lemma 4.3. Neither affects the central claims: Theorem 4.6 uses only non-bipartite LPS graphs, and LPS graphs satisfy the standard full Ramanujan property. Thus no load-bearing concern remains, and the verdict should remain ACCEPT/UNCHANGED.","tokens_in":16575,"tokens_out":29754,"duration_ms":301993,"concrete_test":"Independently re-derive (3.10) for arbitrary d-regular graphs from the Moore bound: show that for each vertex, at most O((d−1)^k) vertices lie within distance k, hence average distance grows at least logarithmically in #V. If this derivation fails and only an O(1) lower bound is available, Theorem 3.8 would collapse; if it succeeds, the external citation is not load-bearing.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central expander mechanism is sound. The two genuinely external inputs are the mean-distance lower bound ρ(G) ≥ log_{d−1}(#V) − O(1) cited from [38, Formula (5)] and the torsional rigidity formula T = d#V/24 + (d/4)⟨L_{G;V_D}^{-1}1,1⟩ from [31, Theorem 3.9]. Neither is load-bearing: the first follows from elementary Moore-bound ball counting and any divergent lower bound would already make Theorem 3.8 work, since λ2 stays bounded below along LPS; the second is an exact formula whose constants can be checked directly on simple examples (e.g., a single interval). The internal steps — von Below transference (Theorem 3.1), Lemma 3.9, the Loewner inversion in (4.14), and the double limit in Theorem 4.6 — are consistent. I note a minor proof gap in Lemma 4.3: u⊥ does not vanish on V_D (it equals −c there), so the bipartite-case justification is incorrect as written; however Theorem 4.6 uses non-bipartite LPS expanders, where the eigenvalue-2 eigenspace is absent and the argument goes through. Definition 2.3 also states the Ramanujan bound only for ν2 and ν_{#V}, whereas Lemma 4.3 needs the standard full-spectrum bound; LPS graphs satisfy that stronger property, so this is an exposition issue, not a correctness threat.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies unilateral metric graphs (all edges of length one) and shows that expander constructions, especially LPS Ramanujan graphs, disprove natural upper bounds on the spectral gap in terms of volume, diameter, girth, mean distance, and products of these quantities. Its main results are: (i) Theorem 3.8, resolving an open problem of Baptista–Kennedy–Mugnolo by showing that no bound λ2 ≤ C/ρ(G)^2 can hold for the mean distance; (ii) Theorem 3.11, a unified statement about products of geometric quantities with the correct (−2)-homogeneity; and (iii) Theorem 4.6, which proves that the Pólya–Szegő inequality λ1 T < |G| is asymptotically sharp: no constant C < 1 can replace 1. The paper also discusses limitations of the expander method for Dirichlet inradius/mean-distance bounds, leaving two conjectures open.","tokens_in":16812,"tokens_out":12969,"duration_ms":129621,"significance":"The results, if correct, are significant for spectral geometry of metric graphs. They give a clean, systematic mechanism—Ramanujan graphs plus the von Below/Nicaise transference—for producing counterexamples to plausible bounds, and they settle a concrete open problem and a conjecture from the literature. A particular strength is that the main arguments do not fit parameters or use circular reasoning: the lower bound on λ2 comes from the Ramanujan property and Alon–Boppana, and the diverging geometric quantities come from standard logarithmic growth of diameter, girth, and mean distance. The probabilistic proof of Lemma 3.9 is elegant and correct, and the double-limit computation in Theorem 4.6 is nontrivial. The paper is largely self-contained in its review portions, and the external dependencies (LPS existence, Alon–Boppana, torsional rigidity formula) are well established.","major_comments":[],"minor_comments":[{"comment":"The proof of the bipartite case is not correct as written. The vector u⊥ = (Id_V − #V^{-1}J_V)Eu does not vanish on V_D; at v ∈ V_D, Eu(v)=0 gives u⊥(v) = −#V^{-1}∑_{w∈eV} u(w), which is generally nonzero. The sentence about an 'eigenvalue −d' is also inconsistent with the normalized Laplacian spectrum lying in [0,2]. Since Theorem 4.6 uses non-bipartite LPS expanders, the central argument survives, but Lemma 4.3 and Corollary 4.5 need either a corrected bipartite proof or an explicit restriction to the non-bipartite case.","section":"§4, Lemma 4.3"},{"comment":"Definition 2.3 bounds only ν2 (and ν#V in the non-bipartite case), while the proof of Lemma 4.3 invokes the estimate for all nontrivial eigenvalues. For non-bipartite graphs the two-point bound suffices by monotonicity of eigenvalues, and for bipartite regular graphs spectral symmetry would give the rest, but this should be stated explicitly so that (4.6) is justified for every i.","section":"§2.2, Definition 2.3"},{"comment":"The step '#N_{k+1} ≥ #N_k + #(N(N_k)\\N_k) ≥ (1+ε)#N_k' uses the edge Cheeger constant, but the passage from edge expansion to vertex expansion requires a factor of 1/d (each new vertex can account for up to d boundary edges). The claim is plausible and can be repaired by replacing ε with ε/d, but the proof as written skips this point.","section":"§4.2, Lemma 4.10(2)"},{"comment":"The sentence citing '[19, Theorem 7.1](existence of an upper bound by 4|G|−3 diam(G) diam(G)^3 [6, Proposition 1.8 and Theorem 1.9]' is garbled and missing punctuation; please reformat the references and formulas.","section":"Remark 3.12(1)"},{"comment":"The notation 'girth(G) (resp., G)' is confusing; the metric girth should be defined clearly and distinguished from the combinatorial girth throughout.","section":"§3.3"}],"recommendation":"minor_revision","confidential_remarks":"The central claims appear sound, and the issues identified are local and fixable. The manuscript's unusual acknowledgments of 'AI-assisted proof' and a 2026 'private communication' are not mathematical concerns, but the editor may wish to ask the author to clarify the role of the AI in accordance with journal policy."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThis is a useful paper and I think it deserves a real referee. The headline: the expander mechanism works, and the main claims are true as far as I can tell. Theorem 3.8 settles the mean-distance open problem from Baptista–Kennedy–Mugnolo by showing λ2 ≤ C/ρ^2 fails; Theorem 3.11 packages the product no-go results; Theorem 4.6 shows the Pólya–Szegő bound λ1 T < |G| is asymptotically sharp. I checked the key steps: the lower bound λ2 ≥ arccos(2√(d−1)/d)^2 via Ramanujan plus von Below, the logarithmic growth of diameter, girth and mean distance along LPS graphs, and the probabilistic comparison in Lemma 3.9. All hold.\n\nThe paper is honest about its limits — Section 4.2 explicitly says the method does not resolve the inradius/mean-distance-to-Dirichlet-set conjectures. That is a real plus.\n\nSoft spots, in slightly decreasing order of importance. First, Lemma 4.3 has a gap in the bipartite case: the argument says u⊥ vanishes on V_D, but actually u⊥ equals −c there (c the mean of Eu), so the eigenvalue-2 eigenspace is not excluded. The conclusion may still be true, but not by that argument. Since Theorem 4.6 uses only non-bipartite LPS expanders, the main result survives. Second, Definition 2.3 defines Ramanujan graphs via only ν2 and ν_{#V}, but the proof of Lemma 4.3 needs the full spectrum bound |1−ν_i| ≤ 2√(d−1)/d. LPS graphs satisfy that stronger property; the paper just needs to say so. Third, the paper relies on two external formulas — the mean-distance lower bound from Shimizu and the torsional rigidity formula from Mugnolo–Plümer. Both look solid; the stress-test note correctly says they are not load-bearing.\n\nThe AI attribution is unusual but not a problem in itself; a public artifact or a human-checked proof of Lemma 3.9 would make it less fragile.\n\nWho should read it? People working on spectral bounds for quantum graphs will want Theorems 3.8 and 4.6. It's a small subfield, but the paper is clean and the counterexample mechanism is reusable. I'd send it to a competent referee, ask for the Lemma 4.3 fix and the Definition 2.3 clarification, and expect acceptance after minor revision.","headline":"Clean, publishable expander-based disproofs of geometric spectral-gap bounds for metric graphs; two minor proof-hygiene issues in Section 4, but the central results hold.","tokens_in":17433,"tokens_out":3711,"would_cite":true,"duration_ms":39042,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["34B45","05C50","81Q35"],"pacs":[],"model":"deepseek-v4-flash","headline":"Expander graphs prove that metric spectral gaps cannot be bounded by size, diameter, girth, or mean distance, and that a classical inequality is sharp.","keywords":["metric graphs","spectral gap","expanders","Ramanujan graphs","mean distance","torsional rigidity","Laplacian eigenvalues","Pólya–Szegő inequality"],"falsifier":"Take a sequence of d-regular Ramanujan expander graphs with growing vertex count and compute, for their unilateral metric versions, the spectral gap λ2(G) via the scalar equation 1−cos√λ = ν2(G) and the metric mean distance ρ(G) by integrating the shortest-path metric. The paper predicts λ2 stays bounded below by a positive constant while ρ(G) grows logarithmically; if λ2 ρ^2 remains bounded, Theorem 3.8 is false. For the sharpness result, evaluate λ1(G;{v})T(G;{v})/|G| on the same graphs with one Dirichlet vertex: the claim is that these ratios approach 1, so finding a uniform constant C<1 th","tokens_in":16358,"feed_emoji":"🕸️","tokens_out":10583,"duration_ms":100172,"temperature":0.7,"pith_summary":"The paper aims to show that the low-frequency behaviour of the Laplacian on a metric graph—the spectral gap that governs diffusive mixing—cannot be predicted from the graph's gross size or shape. It proves that for unilateral metric graphs (all edges length one) there is no universal upper bound λ2 ≤ C/Φ^2 when Φ is volume, diameter, girth, or mean distance, nor for any product of these with the correct scaling; the counterexamples are metric versions of Ramanujan graphs, which keep a positive spectral gap while the geometric quantities grow without bound. In the Dirichlet setting, it shows the classical Pólya–Szegő inequality λ1 T < |G| is asymptotically sharp, so the factor 1 cannot be improved. The intended significance is that any genuine spectral-geometric bound must involve finer information than these basic metric invariants.","feed_headline":"Expanders prove metric spectral gaps evade every size-based bound","feed_subtitle":"Ramanujan graphs defeat spectral-gap bounds from volume, diameter, girth, and mean distance; the Pólya–Szegő inequality is sharp.","key_machinery":"The engine is the discrete-to-continuous transfer principle for unilateral metric graphs: λ is a metric Laplacian eigenvalue exactly when 1−cos√λ is an eigenvalue of the discrete normalized Laplacian, so λ2(G) = arccos(1−ν2(G))^2. On a d-regular Ramanujan graph the nontrivial discrete eigenvalues stay within 2√(d−1)/d of 1, giving a degree-only lower bound on the metric spectral gap that persists as the number of vertices grows. The second engine is a set of comparison estimates showing that metric volume equals d#V/2 and that metric diameter, girth, and mean distance stay within O(1) of their combinatorial counterparts on d-regular graphs. For the Dirichlet results, the paper uses the close","core_discovery":"The central discovery is a negative one with a positive mechanism: expanding families of regular graphs, viewed as unilateral metric graphs, have a spectral gap λ2(G) that converges to arccos(2√(d−1)/d)^2 — a constant depending only on the graph degree d — while volume, diameter, girth, and mean distance all diverge (volume linearly, the other three logarithmically). Consequently λ2 cannot be bounded above by C times the inverse square of any of those quantities. A transfer principle converts the discrete spectral gap ν2 into the metric gap via λ2 = arccos(1−ν2)^2, and comparison lemmas show the combinatorial and metric versions of the geometric quantities differ by at most a constant. The s","pith_inferences":["A likely upshot is that any successful upper bound on the metric spectral gap must encode information beyond global metric invariants—for example, the profile of local volumes or the geometry of the graph's 'filling'—since the expander examples show that size alone is irrelevant.","The comparison lemmas suggest that for regular graphs the continuous and discrete mean distances are interchangeable up to an additive constant; this could allow future spectral-geometric estimates to be computed purely combinatorially.","The double-asymptotic technique used for torsional rigidity (degree and vertex count both tending to infinity) might be adapted to test optimality of other strict inequalities, such as the conjectured failure of the inradius bound, where the paper's single-asymptotic method stalls.","A direct numerical check on explicit small-degree Ramanujan graphs (e.g., d=3, moderate vertex count) computing λ2 and ρ from the edgewise eigenvalue equations would confirm the predicted logarithmic divergence of λ2 ρ^2, and would make the mechanism concrete."],"forward_implications":["No universal upper bound on λ2 in terms of volume, diameter, girth, mean distance, or any (−2)-homogeneous product of them can exist for unilateral metric graphs; an open problem on mean distance is settled negatively.","For each fixed degree d, every sufficiently large Ramanujan unilateral metric graph has spectral gap essentially equal to arccos(2√(d−1)/d)^2, so the gap is determined by local degree alone, decoupled from global geometry.","The Pólya–Szegő inequality λ1 T < |G| is asymptotically sharp: for any C<1 some metric graph with Dirichlet conditions violates λ1 T ≤ C|G|, so the strict inequality's constant 1 is optimal.","The same expander argument also rules out universal lower bounds: when the product involves volume with positive exponent and a logarithmic quantity, no constant c>0 can bound λ2 from below for all unilateral metric graphs.","The triameter, whose order of growth matches the diameter, inherits all the failure-of-upper-bound results."],"fun_headline_variants":["Metric spectral gaps evade volume, diameter, girth bounds","Expanders disprove size-based spectral gap bounds on metric graphs","No geometric size bound can limit metric graph spectral gap","Spectral gap on metric graphs immune to volume, diameter, girth","Metric expanders break the link between spectral gap and size"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The load-bearing premise is that infinite families of d-regular Ramanujan graphs exist for each fixed degree with arbitrarily many vertices, and that the cited logarithmic lower bound on the average vertex distance of d-regular graphs is valid; if that mean-distance bound were weaker than logarithmic, the mean-distance counterexample would collapse.","fun_headline_variants_meta":{"raw":{"variants":["Metric spectral gaps evade volume, diameter, girth bounds","Expanders disprove size-based spectral gap bounds on metric graphs","No geometric size bound can limit metric graph spectral gap","Spectral gap on metric graphs immune to volume, diameter, girth","Metric expanders break the link between spectral gap and size"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000327,"raw_usage":{"total_tokens":1597,"prompt_tokens":608,"completion_tokens":989,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":352,"completion_tokens_details":{"reasoning_tokens":919}},"tokens_in":352,"tokens_out":989,"duration_ms":8920,"temperature":1.0,"reasoning_tokens":919,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-02T02:30:03.130021+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a sequence of d-regular Ramanujan expander graphs with growing vertex count and compute, for their unilateral metric versions, the spectral gap λ2(G) via the scalar equation 1−cos√λ = ν2(G) and the metric mean distance ρ(G) by integrating the shortest-path metric. The paper predicts λ2 stays bounded below by a positive constant while ρ(G) grows logarithmically; if λ2 ρ^2 remains bounded, Theorem 3.8 is false. For the sharpness result, evaluate λ1(G;{v})T(G;{v})/|G| on the same graphs with one Dirichlet vertex: the claim is that these ratios approach 1, so finding a uniform constant C<1 th","supporting_citations":[],"review_version":1}