Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-12T02:24:31.059515Z
Paper Citation Record · LEDGER
As of 16 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 1 inbound Pith citation observation for arXiv:2605.09798.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-12T02:24:31.059515Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-07-11T19:43:41.049552Z
A source-named dated measurement, never combined with another source.
Source: cited_works
6 of 6 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 51158570-95c9-4191-886d-ab851fc062de · outbound
The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof and Ma, J
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation a4f9293f-c1ee-4adf-9289-5c24dd67d547 · outbound
The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof and Zeng, Q
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 372ca85d-3ced-44fc-83d6-20821c8cf4c5 · outbound
The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof Springer , year=
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 7cbf79c8-58f0-4814-82d3-e1b58724d2e6 · outbound
The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof Paths of length five with equal-degree endpoints
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d839ddec-524e-483a-b06d-9a75fa5dbe24 · outbound
The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof and Wang, Y
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation cc4e76f5-c391-417d-8f61-1c1bedff9a86 · outbound
The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof Graph theory, combinatorics, and applications, Vol
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation bff62a62-fa79-4952-ae52-fab32ac0e231 · inbound
Paths of even length with equal-degree endpoints The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof
Reference 2
Source-reported events for the cited work
Unavailable: canonical work link unavailable.