Pith. sign in

REVIEW 3 major objections 5 minor 26 references

On an inverse problem for tree-like networks of elastic strings

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The response measured at the leaves of a tree of elastic strings determines the tree completely: lengths, wave speeds, topology, and the angles at every branching.

desk verdict The in-plane two-channel setup is a genuinely new extension of the BC method, but the central angle-recovery claim is underdetermined by a pi/2-rotation/velocity-swap gauge, so Theorems 1-3 overclaim as stated. read the letter →

arxiv 2505.22115 v1 pith:7D46GEEB submitted 2025-05-28 math.AP math.SP

S.A. Avdonin , G. Leugering , V.S. Mikhaylov This is my paper
classification math.APmath.SP MSC 34B2034E0534L2534E4047B2081Q10
keywords inverseproblemtree-likenetworkelasticstringsTitchmarsh-Weylmatrixboundarycontrolmethodtwo-velocitywavesystemin-planemotionbranchingangles
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper treats the in-plane vibrations of elastic strings arranged on a tree-shaped network, observed only at the leaves. It claims that the response operator — the map from boundary pulses to the resulting boundary forces — determines the network completely: the length of every edge, the two wave speeds on each edge, the tree topology (which edges meet at which vertex), and the angles between edges at every branching point. The proof uses the boundary control method: send delta-function inputs at the leaves, read off first-arrival coefficients from the diagonal of the response, then solve algebraically for the stiffness matrices and angles. With one boundary cluster resolved, the authors recompute the Titchmarsh–Weyl matrix of the reduced tree and peel off the resolved edges, iterating until the whole tree is recovered. If correct, a finite set of boundary observations carries full information about both material properties and geometry of tree-like elastic structures.

What carries the argument

The carrying object is the Titchmarsh–Weyl (TW) matrix M(λ), a matrix of 2×2 blocks built from boundary derivatives of two independent solutions, together with its time-domain counterpart, the response operator R(t); the two are related by Fourier transform. The argument proceeds by a recursive peeling scheme: delta-function inputs at a boundary vertex produce reflected and transmitted pulses whose arrival times and amplitudes, read from diagonal blocks of R(t), yield that edge's length and both velocities; the algebraic equations (5.2)–(5.4), from displacement continuity and force balance at the internal vertex, then determine the rotated stiffness matrices and the angles via trace and determinant invariants. With one boundary cluster resolved, equations (6.12)–(6.15) recompute the TW matrix for the smaller tree obtained by deleting the resolved edges, and the process repeats. This reduction to a strictly smaller tree is what extends the result from stars to arbitrary trees.

What would settle it

Construct two two-edge trees that are identical except that on the second edge k21 = k22 and the angle at the internal vertex differs; with a delta pulse at the first leaf, equations (4.11) and (4.12) contain no angle, so the full response operator R11(t) is the same for both trees, contradicting the uniqueness claimed in Theorem 1 unless the equal-velocity case is explicitly excluded.

Watch

Extended reading notes

Core claim

The central claim is Theorem 3: for an arbitrary tree Ω, the elements (2×2 matrices) Mij(λ), 1 ≤ i,j ≤ n−1, of the Titchmarsh–Weyl matrix — equivalently, the dynamical response matrix Rij(t) for t > d(Ω) measured at all leaves except a fixed root — determine the tree and the parameters of the two-velocity wave system (2.13), (2.14), (2.10). This means the lengths of all edges, the two wave velocities k_{i1}, k_{i2} on each edge, the connectivity of the tree, and the angles α_{ij} between branching edges are all encoded in leaf-boundary measurements. The novelty relative to earlier scalar (out-of-plane) string-network results is that the in-plane coupling conditions depend on the local geometry, so the response data carry the joint angles, and the paper shows how to extract them.

Load-bearing premise

The recovery of a branching angle relies on an unstated generic assumption that each edge has two distinct wave speeds; if the speeds coincide on an edge, the angle does not enter the response equations, and the stated theorems do not cover that case.

Editorial extensions

If this is right

  • For a tree with m leaves, measurements at the m−1 leaves other than a fixed root, over a long enough time horizon, determine all edge lengths, both wave speeds on every edge, the connectivity, and all branching angles.
  • The dynamical response operator R(t) and the spectral TW matrix M(λ) carry the same inverse data, so the recovery can be performed in either time or frequency domain.
  • The two-edge and star cases are solved as explicit first steps, showing that even the simplest two-velocity tree requires solving a pair of matrix equations to isolate the angle.
  • The method gives a non-invasive route to recover material and geometric parameters of truss-like and tube-like elastic structures modeled as in-plane string networks.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The theorems as stated do not exclude the case where an edge has equal wave speeds in both channels (D_i = γI), since then the angle-dependent equations (4.11)–(4.12) lose their α dependence; an explicit genericity hypothesis on distinct channel velocities would make the uniqueness claim precise.
  • Because the angle is extracted from eigenspaces of a recovered conjugated matrix, the reconstruction may determine the joint angle only modulo π unless further sign information is used; this possible orientation ambiguity is not discussed in the paper.
  • For networks containing a cycle, the peeling step deletes a resolved boundary cluster and leaves a smaller graph that is no longer a tree, so the recursion stops; the paper notes this case as open, and a different invariant would be needed to determine cyclic networks from leaf data.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies the inverse problem of recovering the geometry and material parameters of a tree-like network of elastic strings from boundary measurements at all leaves except a fixed root. The model is a two-velocity in-plane system on each edge, with continuity and force-balance conditions at vertices that depend on the angles between incident edges. The authors use the boundary control method and Titchmarsh-Weyl (TW) matrices, treating the two-edge case explicitly and then presenting an induction for star graphs and arbitrary trees. The main theorems (Theorems 1-3) claim that the diagonal (or full) TW matrix associated with the leaves determines the edge lengths, the two wave speeds on each edge, the topology, and the angles at branching vertices. The abstract qualifies the result as holding 'under generic assumptions,' but no such assumptions appear in the theorem statements.

Significance. If the result were established with precise hypotheses, it would be a valuable extension of the boundary control method to in-plane elastic networks, where the coupling conditions at vertices genuinely depend on the angles, unlike the out-of-plane scalar model. The paper provides an explicit two-edge analysis and a clear reduction scheme for trees, and it correctly identifies the added difficulty of angle recovery. However, the central claim as stated is compromised by a genuine angle/velocity swap ambiguity and by unstated generic hypotheses, so the significance can only be assessed after substantial revision.

major comments (3)
  1. [Section 4, Eqs. (4.11)-(4.14); Theorems 1-3] This is the central identifiability issue and blocks the main claim.
  2. [Theorems 1-3; abstract] This is a load-bearing omission because the stated theorems assert unconditional determinacy.
  3. [Section 6, paragraph after (6.1)] This concerns the core induction and needs to be addressed explicitly.
minor comments (5)
  1. [Section 4, after Eq. (4.9)] The text 'using the {R11}12, {R11}12 components' should read '{R11}12, {R11}21 components'.
  2. [Section 5, before Eq. (5.5)] The phrase 'completely determines the matrixe s Ai' contains a typo; it should be 'completely determines the matrices Ai'.
  3. [Section 6, Theorem 3] The statement 'Let Ω be the an arbitrary tree' contains a typo; it should be 'Let Ω be an arbitrary tree'.
  4. [Sections 2 and 4, notation] The notation for the stiffness matrices is inconsistent: (2.7) defines D'_i with squared entries k_{i1}^2, k_{i2}^2, while Section 4 defines D_i = diag(k_{i1}, k_{i2}) without squares. This should be unified to avoid confusion.
  5. [Section 2, Eq. (2.3)] The term c_i r_i appears in the general system (2.3), but the two-velocity system (2.13)-(2.14) and all subsequent analysis set it to zero. The authors should state explicitly that c_i = 0 is assumed from Section 2.2 onward.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the recovery of lengths, velocities, and angles is a direct inversion of the measured response data, not a fit of the predicted quantities.

full rationale

The derivation chain is self-contained in the relevant sense: the inverse data are the response operator or TW matrix, and the recovered parameters are obtained from explicit forward equations. In Section 4, the coefficients k11, k12, a1, b1, l1 are read off from the measured delta-response amplitudes and arrival times; equations (4.11) and (4.12) then determine the matrix A = R_alpha D2 R_{-alpha} as a solution of linear systems whose coefficients are already known from the data. The trace and determinant of A give the unordered pair (k21, k22), and the spectral theorem is invoked to obtain an angle alpha. This is a mathematical inversion step, not a circular one: the predicted angle is not inserted into the data or defined in terms of the value it is supposed to determine. Similarly, the star and tree reductions compute new TW components from previously recovered quantities and known data, and each component is then used to recover only the remaining edge length, not to re-fit a quantity already used. The cited BC-method results in [3,5] and the controllability/well-posedness results in [16] are independently established theorems with proofs external to this paper, so the self-citations are not load-bearing in a circular way. The reader/skeptic concerns about the angle recovery, including the swap gauge R_{alpha+pi/2} diag(k22,k21) R_{-(alpha+pi/2)} = R_alpha diag(k21,k22) R_{-alpha} and the degenerate case D2 = gamma I, are genuine uniqueness/correctness issues for the stated theorems, but they are not cases in which a prediction reduces by construction to its input. Accordingly, no circular step is identified.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No free parameters are fitted ad hoc; all material parameters are either inputs to the forward model or recovered from the response data. The main unstated burden is the generic non-degeneracy assumption, without which the theorems overclaim. No new physical entities are introduced.

assumptions (4)
  • domain assumption The spectral problem S (2.10)-(2.12) has a discrete spectrum and the eigenfunctions form an orthonormal basis in L2(Ω).
    Invoked in Section 2.1 as a known result; cited to [16,7,24]. This is standard for elliptic systems on metric graphs.
  • domain assumption State controllability of the wave dynamics on a rooted tree with controls at the leaves, which underpins the boundary control method.
    Used implicitly throughout; established in prior work [3,5,2,10]. The reconstruction relies on controllability to reduce the full tree to smaller subtrees.
  • ad hoc to paper Generic non-degeneracy of the velocities and angles so that branch angles can be recovered from the spectral decompositions of A_k and A_l.
    The paper notes in Section 4 that if D2=γI, the angle α is not determined, but this exclusion is not stated as a hypothesis in Theorems 1-3. The proofs depend on this unstated generic assumption.
  • domain assumption The response operator R(t) is known exactly as a distribution and its delta-prime coefficients can be isolated cleanly without overlap from multiple reflections.
    The reconstruction reads coefficients of δ' terms in (4.9)-(4.10) and analogous formulas; this assumes ideal boundary measurements and that the first-arrival structure is identifiable.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On an inverse problem for tree-like networks of elastic strings." pith.science (2026). https://pith.science/paper/7D46GEEB

@misc{pith2026250522115,
  author       = {Pith},
  title        = {Pith review of: On an inverse problem for tree-like networks of elastic strings},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7D46GEEB}},
  note         = {Machine review of arXiv:2505.22115}
}
read the original abstract

We consider the in-plane motion of elastic strings on tree-like network, observed from the 'leaves'. We investigate the inverse problem of recovering not only the physical properties i.e. the 'optical lengths' of each string, but also the topology of the tree which is represented by the edge degrees and the angles between branching edges. To this end use the boundary control method for wave equations established in~\cite{AK,B}. It is shown that under generic assumptions the inverse problem can be solved by applying measurements at all leaves, the root of the tree being fixed.

Figures

Figures reproduced from arXiv: 2505.22115 by the authors.

Figure 1
Figure 1. The tree [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Representation of planar displacement Since the graph under consideration is a tree, for every a, b ∈ Ω, a 6= b, there exist the unique path π[a, b] connecting these points. The density determines the optical metric and the optical distance d σ2 := ρ(x)|d x| 2 , x ∈ Ω\V, σ(a, b) = Z π[a, b] p ρ(x)|d x|, a, b ∈ Ω, The optical diameter of the graph Ω is defined as d(Ω) = max a, b∈Γ σ(a, b). The graph Ω and the optical… view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    Amrein and D.B

    W.O. Amrein and D.B. Pearson, M operators: a generalization of Weyl-Titchmarsh theory J. Comput. Appl. Math. 171 (2004), no. 1-2, 1–26

    work page 2004

  2. [2]

    Avdonin and S.A

    S.A. Avdonin and S.A. Ivanov, Families of exponentials. The method of moments in con- trollability problems for distributed parameter systems . Cambridge Univ. Press. xv, 302 p., 1995

    work page 1995

  3. [3]

    S. A. Avdonin and P. B. Kurasov, Inverse problems for quantum trees, Inverse Problems and Imaging. 2 (2008), no. 1, 1–21

    work page 2008

  4. [4]

    S. A. Avdonin, V. S. Mikhaylov and A. V. Rybkin, The boundary control approach to the Titchmarsh-Weyl m−function, Comm. Math. Phys. 275 (2007), no. 3, 791–803

    work page 2007

  5. [5]

    Belishev, Boundary spectral inverse problem on a class of graphs (tree s) by the BC method, Inverse Problems 20 (2004), 647–672

    M.I. Belishev, Boundary spectral inverse problem on a class of graphs (tree s) by the BC method, Inverse Problems 20 (2004), 647–672

    work page 2004

  6. [6]

    Belishev, A.F

    M.I. Belishev, A.F. Vakulenko, Inverse problems on graphs: recovering the tree of strings b y the BC-method , J. Inv. Ill-Posed Problems 14 (2006), 29–46

    work page 2006

  7. [7]

    von Below, A characteristic equation associated to an eigenvalue prob lem on c2-networks, Linear Algebra and Appl

    J. von Below, A characteristic equation associated to an eigenvalue prob lem on c2-networks, Linear Algebra and Appl. 71 (1985), 309–325

    work page 1985

  8. [8]

    Behrndt, M.M

    J. Behrndt, M.M. Malamud and H. Neidhardt, Scattering matrices and Weyl functions , Proc. Lond. Math. Soc. (3) 97 (2008), no. 3, 568–598

    work page 2008

Show all 26 references
  1. [9]

    Brasche, M.M

    J.F. Brasche, M.M. Malamud and H. Neidhardt, Weyl function and spectral properties of self-adjoint extensions , Integral Equations Operator Theory 43 (2002), no. 3, 264–289

    2002

  2. [10]

    D´ ager and E

    R. D´ ager and E. Zuazua, Wave propagation, observation and control in 1- d flexible multi- structures. Series: Math´ ematiques & Applications 50. Springer-Verlag, Berlin. ix, 219 p. 2006

    2006

  3. [11]

    Kac, Can one hear the shape of a drum? , Am

    M. Kac, Can one hear the shape of a drum? , Am. Math. Mon. 73 (1966), No.4, Part II, 1-23

    1966

  4. [12]

    Kachalov, Y

    A. Kachalov, Y. Kurylev, M. Lassas and N. Mandache, Equivalence of time-domain inverse problems and boundary spectral problems , Inverse Problems, 20 (2004), 491–436

    2004

  5. [13]

    Kostrykin and R

    V. Kostrykin and R. Schrader, Kirchhoff ’s rule for quantum wires , J. Phys A: Math. Gen. 32 (1999), 595–630

    1999

  6. [14]

    Kuchment, Quantum graphs: an introduction and a brief survey , in: Analysis on Graphs and its Applications , P

    P. Kuchment, Quantum graphs: an introduction and a brief survey , in: Analysis on Graphs and its Applications , P. Exner, J. Keating, P. Kuchment, T. Sunada, A. Teplyaev (e ds.), Proceedings of Symposia in Pure Mathematics, AMS, to appear

  7. [15]

    Kurasov and F

    P. Kurasov and F. Stenberg, On the inverse scattering problem on branching graphs , J. Phys. A: Math. Gen. 35 (2002), 101–121

    2002

  8. [16]

    Lagnese, G

    J.E. Lagnese, G. Leugering and E.J.P.G Schmidt, Modeling, analysis and control of dynamic elastic multi-link structures , Birkh¨ auser Boston, Systems and Control: Foundations and Ap- plications 1994

    1994

  9. [17]

    Lagnese, G

    J.E. Lagnese, G. Leugering and E.J.P.G. Schmidt, On the analysis and control of hyperbolic systems associated with vibrating networks . Proc. R. Soc. Edinb., Sect. A 124, No.1, 77-104 (1994)

    1994

  10. [18]

    Lagnese, G

    J.E. Lagnese, G. Leugering and E.J.P.G. Schmidt, Control of planar networks of Timoshenko beams. SIAM J. Control Optimization 31, No.3, 780-811 (1993)

    1993

  11. [19]

    Lagnese, J. E. and Leugering, G., Domain decomposition methods in optimal control of partial differential equations. , ISNM. International Series of Numerical Mathematics 148. Basel: Birkhauser. xiii, 443 p.,2004

    2004

  12. [20]

    Leugering and E

    G. Leugering and E. Zuazua, On exact controllability of generic trees. , ESAIM, Proc. 8 (2000),95-105

    2000

  13. [21]

    Leugering, Reverberation analysis and control of networks of elastic s trings.,in: Casas, Eduardo (ed.), Control of partial differential equations an d applications

    G. Leugering, Reverberation analysis and control of networks of elastic s trings.,in: Casas, Eduardo (ed.), Control of partial differential equations an d applications. Proceedings of the IFIP TC7/WG-7.2 international conference, Laredo, Spain, 1994. New York, NY: Marcel Dekker...

    1996

  14. [22]

    Leugering and J

    G. Leugering and J. Sokolowski, Topological sensitivities for elliptic problem on graphs , Con- trol and Cybernetics (2009) to appear

    2009

  15. [23]

    Ali Mehmeti, A characterization of generalized C1 notion on nets , Integral Eq

    F. Ali Mehmeti, A characterization of generalized C1 notion on nets , Integral Eq. and Op- erator Theory 9 (1986), 753–766

    1986

  16. [24]

    Nicaise, Elliptic problems on polygonial domains , Pitman 1995

    S. Nicaise, Elliptic problems on polygonial domains , Pitman 1995

    1995

  17. [25]

    Pokornyi, O.M

    Yu.V. Pokornyi, O.M. Penkin, V.L. Pryadev, A.V. Borovs kikh, K.P. Lazarev, and S.A. Shabrov, Differential Equations on Geometric Graphs , Fizmatlit, Moscow, (2005) (in Rus- sian). 19

    2005

  18. [26]

    V. Yurko, Inverse Sturm-Lioville operator on graphs , Inverse Problems 21 (2005) 1075-1086 1Department of Mathematics and Statistics, University of Alas ka F airbanks, PO Box 756660, F airbanks, AK 99775 2Department Mathematik, Lehrstuhl Angew andte Mathematik II, Friedrich-Al...

    2005

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.