Paper Citation Record · LEDGER

Strong orientation of a connected graph for a crossing family

As of 13 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2411.13202.

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

pith.paper-citation-record.v1
2411.13202 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T16:57:33.447335Z

measured 14 of 14 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

14 of 14 outbound references displayed

verified exact9
verified fuzzy4
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6e18eefa-e507-4cdc-a186-9d32ce43eacc · outbound

This paper cites Combinatorica, 2024.

Strong orientation of a connected graph for a crossing family Combinatorica, 2024

Reference 1

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.674248Z

Source-reported events for the cited work

correction dated 2024-08-05. Source: crossref record 10.1007/s00493-024-00121-3->10.1007/s00493-024-00108-0:correction, observed 2026-07-11T03:10:50.572383+00:00. This notice travels one citation hop only.

Observation c31d97d5-2e44-49dd-9420-cb9bdf2690ef · outbound

This paper cites On packing dijoins in digraphs and weighted digraphs.

Strong orientation of a connected graph for a crossing family On packing dijoins in digraphs and weighted digraphs

Reference 2

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.660162Z

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 2e5c7add-456c-4e1f-a6cc-a562373423ee · outbound

This paper cites Disjoint dijoins.

Strong orientation of a connected graph for a crossing family Disjoint dijoins

Reference 3

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.641748Z

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 a00736c5-64d3-44a9-b439-6f73836c7be6 · outbound

This paper cites On dijoins.Discrete Mathematics, 243(1):213– 216, 2002.

Strong orientation of a connected graph for a crossing family On dijoins.Discrete Mathematics, 243(1):213– 216, 2002

Reference 4

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.611814Z

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 e12d4b57-2193-4eae-bae1-ea71d3a0a6b7 · outbound

This paper cites an unresolved cited work.

Strong orientation of a connected graph for a crossing family Unresolved cited work

Reference 5

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.592339Z

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 ac554412-c24c-4137-9e37-a29e69728638 · outbound

This paper cites A min-max relation for submodular functions on graphs.

Strong orientation of a connected graph for a crossing family A min-max relation for submodular functions on graphs

Reference 6

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.563179Z

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 79c62583-0a10-4abd-85a4-86a2a5841375 · outbound

This paper cites Connections in Combinatorial Optimization.

Strong orientation of a connected graph for a crossing family Connections in Combinatorial Optimization

Reference 7

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.543411Z

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 a02d69a0-2fc8-40ae-935a-5e7b557e5598 · outbound

This paper cites Observations on Woodall’s conjec ture.

Strong orientation of a connected graph for a crossing family Observations on Woodall’s conjec ture

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:57:33.734156Z

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 553e790b-166a-46b2-be3e-6d88c21a6db2 · outbound

This paper cites A counterexample to a conjecture o f Edmonds and Giles.

Strong orientation of a connected graph for a crossing family A counterexample to a conjecture o f Edmonds and Giles

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-12T16:57:33.418099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d65bbaf-7644-4726-a04a-4fc09e25e013 · outbound

This paper cites Combinatorial Optimization: Polyhedra and Eﬃciency Volume 1.

Strong orientation of a connected graph for a crossing family Combinatorial Optimization: Polyhedra and Eﬃciency Volume 1

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:57:33.720656Z

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 1b8a5b5d-172b-4852-8f47-d9b9490b215e · outbound

This paper cites Combinatorial Optimization: Polyhedra and Eﬃciency Volume 2.

Strong orientation of a connected graph for a crossing family Combinatorial Optimization: Polyhedra and Eﬃciency Volume 2

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:57:33.706365Z

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 9c5ab586-fbca-47c5-bca1-a9c34fa6b40e · outbound

This paper cites Visualizing, ﬁnding a nd packing dijoins.

Strong orientation of a connected graph for a crossing family Visualizing, ﬁnding a nd packing dijoins

Reference 12

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.509091Z

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 6f370208-d658-4334-b70b-49febd8a2210 · outbound

This paper cites Packing directed joins.

Strong orientation of a connected graph for a crossing family Packing directed joins

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T16:57:33.687575Z

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 258e891c-4078-4c69-b133-43e1f093da36 · outbound

This paper cites an unresolved cited work.

Strong orientation of a connected graph for a crossing family Unresolved cited work

Reference 14

Resolution: verified exact; doi, observed 2026-08-12T16:57:33.490441Z

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.

Pith citing papers

No inbound Pith citation observations are available.