Paper Citation Record · LEDGER

Tight lower bound for the spectral radius of connected graphs with given matching number

As of 15 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2607.11061.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.11061 v2

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T07:20:42.616737Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

16 of 16 outbound references displayed

verified exact0
verified fuzzy0
unresolved16
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation fa582c81-3677-4b73-8323-b237850830f0 · outbound

This paper cites Aouchiche, P.

Tight lower bound for the spectral radius of connected graphs with given matching number Aouchiche, P

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.134413Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 523096c9-610c-4a60-914d-a7f4121c9fc1 · outbound

This paper cites Chang, On the largest eigenvalue of a tree with perfect matchings, Discrete Math.

Tight lower bound for the spectral radius of connected graphs with given matching number Chang, On the largest eigenvalue of a tree with perfect matchings, Discrete Math

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.198974Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a17f6c9-0e2a-4098-85d0-38b7fd956f7b · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.341958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 557a40d5-48d5-47f5-b4f2-f681016ed7c9 · outbound

This paper cites Collatz, U.

Tight lower bound for the spectral radius of connected graphs with given matching number Collatz, U

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.418769Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d2fe2cc-a244-4ae3-a92a-d20fa5084aa0 · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.452420Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4cec7a47-082d-486d-a03f-655d1c5f11df · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.611405Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 483873af-a47e-4ae0-8097-1af03336e401 · outbound

This paper cites König, Graphok és matrixok (Graphs and matrices), Matematikai és Fizikai Lapok 38 (1931) 116–119.

Tight lower bound for the spectral radius of connected graphs with given matching number König, Graphok és matrixok (Graphs and matrices), Matematikai és Fizikai Lapok 38 (1931) 116–119

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.714184Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12851d89-e9e0-4012-8973-7aadaa50bd54 · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.809181Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0c06850-e9ce-410f-8a5e-eb19b23c9069 · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:41.928309Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d52ad62-d3ad-4557-b3e0-cdccfc173965 · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:42.023781Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b0a33b5-7ea8-4390-b508-17c8fe04820d · outbound

This paper cites Stevanović.

Tight lower bound for the spectral radius of connected graphs with given matching number Stevanović

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:42.142640Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f099c1f2-4c95-4565-a4a8-b718653a3e9c · outbound

This paper cites Sun, T.M.

Tight lower bound for the spectral radius of connected graphs with given matching number Sun, T.M

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:42.220676Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 934e4563-a29d-4185-be65-69068588d7d7 · outbound

This paper cites Constructions in combinatorics via neural networks.

Tight lower bound for the spectral radius of connected graphs with given matching number Constructions in combinatorics via neural networks

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:42.299283Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c136d7e6-05df-453c-8f7e-7e74e6f01541 · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:42.382843Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ae61961-43b9-4714-a90d-4b2a082fb853 · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:42.510802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 990cd4cb-b7c0-404f-a08c-acfb476ffb8b · outbound

This paper cites an unresolved cited work.

Tight lower bound for the spectral radius of connected graphs with given matching number Unresolved cited work

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-02T07:20:42.616737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.