Pith. sign in

Paper Citation Record · LEDGER

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof

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.

pith.paper-citation-record.v1
2605.09798 v1

Coverage vector

measured 6 of 6 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-12T02:24:31.059515Z

measured 7 of 7 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-11T19:43:41.049552Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

6 of 6 outbound references displayed

  • verified exact0
  • verified fuzzy5
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 51158570-95c9-4191-886d-ab851fc062de · outbound

This paper cites and Ma, J.

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof and Ma, J

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-12T22:51:56.365149Z

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.

source=arxiv_source observed=2026-05-12T02:24:31.059515Z digest=sha256:b1a60f78ecaddc7a3895b817abfbb9d8e31165e76a9a07466f70653d30021fa1

Observation a4f9293f-c1ee-4adf-9289-5c24dd67d547 · outbound

This paper cites and Zeng, Q.

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof and Zeng, Q

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-05-12T22:51:56.360381Z

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.

source=arxiv_source observed=2026-05-12T02:24:31.059515Z digest=sha256:aef274acf5b33ce6f40697f1953aeba40a09fc5b81b11f0df71e406196d5906b

Observation 372ca85d-3ced-44fc-83d6-20821c8cf4c5 · outbound

This paper cites Springer , year=.

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof Springer , year=

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-12T22:51:56.353002Z

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.

source=arxiv_source observed=2026-05-12T02:24:31.059515Z digest=sha256:9c6a9dc5a125ec0cbba660ce3d6fdf19ebe2cb145405f443eabeec839b3ef4fd

Observation 7cbf79c8-58f0-4814-82d3-e1b58724d2e6 · outbound

This paper cites Paths of length five with equal-degree endpoints.

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

Resolution
metadata mismatch
local_arxiv, observed 2026-05-12T07:41:25.270392Z

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.

source=arxiv_source observed=2026-05-12T02:24:31.059515Z digest=sha256:32dd433d885ebde87a181b0771de36f15e14345bbc7d2df64072d8b5f639855b

Observation d839ddec-524e-483a-b06d-9a75fa5dbe24 · outbound

This paper cites and Wang, Y.

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof and Wang, Y

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-05-12T22:51:56.348952Z

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.

source=arxiv_source observed=2026-05-12T02:24:31.059515Z digest=sha256:bd80ff75b9e50febcb115ad8b421f9790df5244544d570153f7bd8a77e409cbf

Observation cc4e76f5-c391-417d-8f61-1c1bedff9a86 · outbound

This paper cites Graph theory, combinatorics, and applications, Vol.

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof Graph theory, combinatorics, and applications, Vol

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-05-12T22:51:56.356633Z

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.

source=arxiv_source observed=2026-05-12T02:24:31.059515Z digest=sha256:87398ad250c8de8161ed2fa60bb89a88f81e94154abd0139d287f1b35d316fb1

Pith citing papers

Observation bff62a62-fa79-4952-ae52-fab32ac0e231 · inbound

Paths of even length with equal-degree endpoints cites this paper.

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

Resolution
unresolved
no resolver link, observed 2026-07-11T19:43:41.049552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T19:43:41.049552Z digest=sha256:b181bf53f479e46b0a8caf447f4f1209c4c88e2762bd99df120bddcc705b1c8f