{"id":"79a07be3-eaaa-4fc3-8a60-919e35dddad0","arxiv_id":"2606.21589","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Establishes Ambarzumian-type theorems for Hermitian matrices including discrete Laplacians and adjacency matrices on finite graphs, generalizing prior results.","lead":"The paper proves Ambarzumian-type theorems showing that the spectrum of certain Hermitian matrices on finite graphs uniquely determines the matrix without non-zero potentials, including for discrete Laplacians and adjacency matrices. A smart generalist might read it to see how inverse spectral problems from continuous settings extend to discrete networks and graphs.","discovery_kind":"unclear","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest assumption was extracted from the abstract only and posited structural restrictions on the matrices. With the full text referenced as available, no concrete technical weakness in the argument (such as an unstated assumption in a key lemma or failure on a class of graphs) can be located, so the non-finding stands. The reader's low confidence is noted but does not itself constitute a load-bearing objection to the claim.","tokens_in":1617,"tokens_out":251,"duration_ms":19627,"concrete_test":"Extract the precise statement of the main theorem for adjacency matrices and test it computationally on the cycle graph C_4: add a non-zero diagonal potential V, recompute the spectrum of A+V, and check whether equality to spec(A) forces V=0.","verdict_should_be":"UNCHANGED","load_bearing_attack":"No load-bearing concern identified. The central claim is a generalization of Ambarzumian-type results to Hermitian matrices with vanishing diagonal (including adjacency matrices of finite graphs). The abstract states the result is established via different methods, but no internal inconsistency, hidden assumption, or gap in the stated claim is visible from the provided information.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript investigates Ambarzumian-type theorems for Hermitian matrices, including the discrete Laplacian on finite graphs. Using different methods, it establishes such a theorem for matrices with vanishing diagonal—in particular the adjacency matrix on finite graphs—thereby generalizing prior results to general finite discrete graphs.","tokens_in":1662,"tokens_out":160,"duration_ms":9842,"significance":"If the stated theorems hold, the work provides a discrete analogue of the 1929 Ambarzumian result and extends existing graph-specific versions to arbitrary finite graphs via the adjacency matrix. The explicit use of distinct methods for the vanishing-diagonal case is a positive feature that could support further applications in spectral graph theory.","major_comments":[],"minor_comments":[],"recommendation":"accept","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive assessment of the manuscript and for recommending acceptance. We appreciate the recognition that the work provides a discrete analogue of the classical Ambarzumian result and extends prior graph-specific versions to arbitrary finite graphs.","responses":[],"tokens_in":1053,"tokens_out":65,"duration_ms":9760,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main takeaway is that the authors generalize Ambarzumian-type theorems to general finite discrete graphs for Hermitian matrices, including a new argument for the adjacency matrix case with vanishing diagonal.\n\nThey take the classical 1929 result about the Neumann Laplacian not being isospectral to one with a non-zero potential and adapt it to the discrete setting. The paper claims this holds for the discrete Laplacian on any finite graph and separately for zero-diagonal Hermitian matrices like adjacency matrices.\n\nWhat they do well is providing this extension using different methods for the vanishing diagonal case, which avoids relying on the same techniques as the Laplacian case. The citation to the original Ambarzumian and prior graph results looks appropriate, and there's no indication of circularity.\n\nThe soft spots are that this is presented as a note, so the proofs are likely short, and the abstract gives no concrete examples or derivations to check. The results depend on the matrices being Hermitian with the specific graph structure, and that no additional potentials alter the spectrum in unexpected ways. That assumption seems reasonable but could be where the work is most sensitive if the graphs have special symmetries.\n\nThis kind of paper is for specialists in inverse spectral theory or spectral graph theory. A reader looking for discrete versions of classical inverse problems would get some value from the generalization.\n\nIt deserves a serious referee because the claim is clearly stated and the stress-test found no internal inconsistencies or load-bearing flaws.","headline":"This note extends Ambarzumian-type theorems to Hermitian matrices on arbitrary finite graphs, with a separate argument for the zero-diagonal case including adjacency matrices.","tokens_in":2115,"tokens_out":365,"would_cite":false,"duration_ms":16687,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Ambarzumian-type theorems hold for the discrete Laplacian and adjacency matrices on finite graphs.","keywords":["Ambarzumian theorem","Hermitian matrices","discrete Laplacian","adjacency matrix","finite graphs","inverse spectral theory","isospectrality"],"falsifier":"Exhibit a finite graph together with a non-zero potential such that the eigenvalues of the perturbed matrix exactly match those of the unperturbed matrix.","tokens_in":2505,"feed_emoji":"","tokens_out":553,"duration_ms":18669,"temperature":0.7,"pith_summary":"The paper establishes that certain Hermitian matrices on finite graphs obey an Ambarzumian-type property: if their spectrum matches the spectrum of the unperturbed matrix, then any added potential term must be zero. One result covers the discrete Laplacian on arbitrary finite graphs. A separate argument handles matrices with vanishing diagonal, including adjacency matrices of graphs. This extends the 1929 continuous result of Ambarzumian to discrete settings that arise in network models and graph-based operators.","feed_headline":"Spectrum of graph Laplacian forces potential to zero","feed_subtitle":"If eigenvalues match the unperturbed discrete Laplacian on a finite graph, any added potential must vanish.","key_machinery":"Hermitian matrices with vanishing diagonal or the structure of the discrete Laplacian on finite graphs, which forces any potential to vanish when the spectrum is preserved.","core_discovery":"We establish an Ambarzumian-type theorem for matrices with vanishing diagonal, in particular, the adjacency matrix on finite graphs. In this way, we generalize existing results on Ambarzumian-type theorems to general finite discrete graphs. The same property is shown for the discrete Laplacian on finite graphs.","pith_inferences":["The same spectral uniqueness may extend to other matrix perturbations that preserve the zero-diagonal or Laplacian form.","Inverse spectral recovery on graphs becomes possible from eigenvalues alone when the matrix class is fixed.","Small-graph computations could directly test the boundary between matrices that obey the property and those that do not."],"forward_implications":["The discrete Laplacian on every finite graph satisfies the Ambarzumian property.","Adjacency matrices on every finite graph satisfy the Ambarzumian property.","Spectral data alone determines that the potential is zero for these classes of matrices.","Results apply uniformly to all finite discrete graphs rather than to restricted families."],"fun_headline_variants":["Graph Laplacian spectrum implies zero potential","Ambarzumian theorem holds for adjacency matrices","Matching eigenvalues force zero potential on graphs","Discrete graphs satisfy Ambarzumian-type theorem"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The matrices are Hermitian and possess either vanishing diagonal entries or the precise structure of the discrete Laplacian when acting on finite graphs.","fun_headline_variants_meta":{"raw":{"variants":["Graph Laplacian spectrum implies zero potential","Ambarzumian theorem holds for adjacency matrices","Matching eigenvalues force zero potential on graphs","Discrete graphs satisfy Ambarzumian-type theorem"]},"model":"grok-4.3","cost_usd":0.004045,"raw_usage":{"total_tokens":1989,"prompt_tokens":527,"num_sources_used":0,"completion_tokens":52,"cost_in_usd_ticks":40449500,"prompt_tokens_details":{"text_tokens":527,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1410,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":527,"tokens_out":52,"duration_ms":7954,"temperature":1.0,"reasoning_tokens":1410,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-26T12:16:28.269355+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Exhibit a finite graph together with a non-zero potential such that the eigenvalues of the perturbed matrix exactly match those of the unperturbed matrix.","supporting_citations":[],"review_version":1}