Paper Citation Record · LEDGER

Halin's grid theorem for digraphs

As of 12 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2412.03482.

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

pith.paper-citation-record.v1
2412.03482 v2

Coverage vector

measured 11 of 11 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T22:34:04.197893Z

measured 11 of 11 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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

11 of 11 outbound references displayed

verified exact2
verified fuzzy5
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2aacb3db-e7d3-4619-96fb-c53df4e6095e · outbound

This paper cites The Erdos-Posa Property for Directed Graphs.

Halin's grid theorem for digraphs The Erdos-Posa Property for Directed Graphs

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-11T22:34:04.164060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56b11438-41f5-45f3-8b92-ad776c8441d8 · outbound

This paper cites Connectoids I: a universal end space theory.

Halin's grid theorem for digraphs Connectoids I: a universal end space theory

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-11T22:34:04.168553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed7f7e5e-938c-455c-8fa3-9fe188c1d3ad · outbound

This paper cites Ends of digraphs I: basic theory.

Halin's grid theorem for digraphs Ends of digraphs I: basic theory

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-08-11T22:34:04.313314Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6bee95dc-1061-49ce-8348-5f21dcf82d69 · outbound

This paper cites Diestel,Graph Theory, 6th ed., Springer (print edition); Reinhard Diestel (eBooks), 2024.

Halin's grid theorem for digraphs Diestel,Graph Theory, 6th ed., Springer (print edition); Reinhard Diestel (eBooks), 2024

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T22:34:04.389179Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation eb552b99-b87c-4677-8126-f8c8e960c5e9 · outbound

This paper cites Georgakopoulos and M.

Halin's grid theorem for digraphs Georgakopoulos and M

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T22:34:04.378910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ebb48b32-4d67-4c4e-9a2e-d8670cc58902 · outbound

This paper cites Halin, ¨Uber die Maximalzahl fremder unendlicher Wege in Graphen, Mathematische Nachrichten30 (1965), no.

Halin's grid theorem for digraphs Halin, ¨Uber die Maximalzahl fremder unendlicher Wege in Graphen, Mathematische Nachrichten30 (1965), no

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T22:34:04.368572Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 15820505-d010-4f7a-b962-3bc6562174bb · outbound

This paper cites Hamann and K.

Halin's grid theorem for digraphs Hamann and K

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-11T22:34:04.185934Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf920ec5-5e7a-4fd4-9f93-7ea26e77b42e · outbound

This paper cites Heuer,Excluding a full grid minor, Abhandlungen aus dem Mathematischen Seminar der Universit¨ at Hamburg, 2017, pp.

Halin's grid theorem for digraphs Heuer,Excluding a full grid minor, Abhandlungen aus dem Mathematischen Seminar der Universit¨ at Hamburg, 2017, pp

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T22:34:04.358430Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2a1d0410-9fa1-4317-8989-4ed31bfafa63 · outbound

This paper cites Kurkofka, R.

Halin's grid theorem for digraphs Kurkofka, R

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T22:34:04.347367Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 71b30afe-1a32-4d9f-8abb-8e0a4187ea12 · outbound

This paper cites A star-comb lemma for infinite digraphs.

Halin's grid theorem for digraphs A star-comb lemma for infinite digraphs

Reference 10

Resolution: verified exact; local_arxiv, observed 2026-08-11T22:34:04.230101Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5d93d85f-d41b-41e3-9b5e-0d1d047de796 · outbound

This paper cites Zuther,Ends in digraphs, Discrete mathematics184(1998), no.

Halin's grid theorem for digraphs Zuther,Ends in digraphs, Discrete mathematics184(1998), no

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-11T22:34:04.197893Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.