Paper Citation Record · LEDGER

How to see the forest despite the trees

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

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

pith.paper-citation-record.v1
2510.23614 v2

Coverage vector

measured 51 of 51 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T09:45:41.270810Z

measured 51 of 51 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+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

51 of 51 outbound references displayed

verified exact0
verified fuzzy0
unresolved51
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e4facaa1-acf6-47f0-85ff-a40f684fa5fb · outbound

This paper cites Akrami, R.

How to see the forest despite the trees Akrami, R

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:35.859847Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b441eb3-7ae9-4ca9-9f40-1bf98e923f30 · outbound

This paper cites Alrabiah, Z.

How to see the forest despite the trees Alrabiah, Z

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:35.944815Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ad3a432-134e-47c8-aadd-4aee3ddea304 · outbound

This paper cites Ba ¨ ıou and F.

How to see the forest despite the trees Ba ¨ ıou and F

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.097395Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c28447fd-2978-4877-8c41-f4eb040dc351 · outbound

This paper cites Baron and W.

How to see the forest despite the trees Baron and W

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.178430Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b1f41fa-d560-4815-a487-95088b68a65b · outbound

This paper cites Bruno and L.

How to see the forest despite the trees Bruno and L

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.274288Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c4ec123-f793-4dd2-8fa4-418628f45dfc · outbound

This paper cites Connelly, T.

How to see the forest despite the trees Connelly, T

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.339725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f297022-a336-4bf5-8069-322ad8f831ef · outbound

This paper cites Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach.

How to see the forest despite the trees Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.478625Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b072ffc2-5895-4753-8c1d-9b27f1e63a1f · outbound

This paper cites Edmonds,Minimum partition of a matroid into independent sets,J.

How to see the forest despite the trees Edmonds,Minimum partition of a matroid into independent sets,J

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.620595Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56c6493d-a250-401e-a495-bb7865dad152 · outbound

This paper cites Edmonds,Lehman ’s switching game and a theorem of Tutte and Nash-Williams,J.

How to see the forest despite the trees Edmonds,Lehman ’s switching game and a theorem of Tutte and Nash-Williams,J

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.787672Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation edb9161a-f1e4-4529-b250-81fcdbd22d75 · outbound

This paper cites Edmonds,Matroid Partition, Mathematics of the Decision Sciences, Part I.

How to see the forest despite the trees Edmonds,Matroid Partition, Mathematics of the Decision Sciences, Part I

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.868592Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 726b6971-f0ca-4cd7-bb7c-2566d39251e2 · outbound

This paper cites Edmonds,Matroids and the greedy algorithm, Math.

How to see the forest despite the trees Edmonds,Matroids and the greedy algorithm, Math

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:36.985117Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7942bb5e-7dc4-4dbc-b977-de669d75fc54 · outbound

This paper cites Edmonds,Edge-disjoint branchings,in: Combinatorial Algorithms (B.

How to see the forest despite the trees Edmonds,Edge-disjoint branchings,in: Combinatorial Algorithms (B

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:37.054104Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e06883c-af44-4fe5-a61c-0b49ac25cf1c · outbound

This paper cites Edmonds,Matroid intersection, Annals of Discrete Math.

How to see the forest despite the trees Edmonds,Matroid intersection, Annals of Discrete Math

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:37.147729Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3783065c-293d-4613-b16b-fd7af7614494 · outbound

This paper cites Edmonds and D.R.

How to see the forest despite the trees Edmonds and D.R

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:37.251079Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2ecac31-4081-42b4-8ed0-4eaab0a5e731 · outbound

This paper cites Frank, Connections in Combinatorial Optimization, Oxford University Press, 2011 (ISBN 978-0-19-920527-1).

How to see the forest despite the trees Frank, Connections in Combinatorial Optimization, Oxford University Press, 2011 (ISBN 978-0-19-920527-1)

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:37.375159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d237da7-b29b-4f7f-b684-3e1da108e6ad · outbound

This paper cites Combinatorial Theory, Ser.

How to see the forest despite the trees Combinatorial Theory, Ser

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:37.493670Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe50a4e3-46aa-402e-98ff-9d7343fd7185 · outbound

This paper cites Frank,On disjoint trees and arborescences,in: Algebraic Methods in Graph Theory, Colloquia Mathematica Soc.

How to see the forest despite the trees Frank,On disjoint trees and arborescences,in: Algebraic Methods in Graph Theory, Colloquia Mathematica Soc

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:37.628903Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bcb79719-54c0-485c-994e-e00cc52c6e6f · outbound

This paper cites Frank, T.

How to see the forest despite the trees Frank, T

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:37.733968Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a9243f2-06d6-4e00-9ad2-490ecf5e441a · outbound

This paper cites Frank, T.

How to see the forest despite the trees Frank, T

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:37.855923Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2bef0740-e1e6-4801-83c0-798c0836754d · outbound

This paper cites Frank and L.

How to see the forest despite the trees Frank and L

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:38.022003Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e3a53a5c-d20f-49ac-9985-a10ff97f0b82 · outbound

This paper cites Gale,Topological games at Princeton, a mathematical memoir, Games and Economic Behavior, 66(2) (2009 Jul 1) 647-56.

How to see the forest despite the trees Gale,Topological games at Princeton, a mathematical memoir, Games and Economic Behavior, 66(2) (2009 Jul 1) 647-56

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:38.163254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3414047-4b34-4caa-8144-f5cf9d0f417e · outbound

This paper cites Gardner, The Second Scientific American Book of Mathematical Puzzles and Di- versions, The University of Chicago Press, (1961).

How to see the forest despite the trees Gardner, The Second Scientific American Book of Mathematical Puzzles and Di- versions, The University of Chicago Press, (1961)

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:38.268340Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b41765f-32ac-4437-8981-672cd761334d · outbound

This paper cites Garamv¨ olgyi, T.

How to see the forest despite the trees Garamv¨ olgyi, T

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:38.415755Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc03cc6a-a37c-4f25-9a8e-02e62ec26488 · outbound

This paper cites an unresolved cited work.

How to see the forest despite the trees Unresolved cited work

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:38.510980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5b3be8f-4b49-4c6d-9df3-66ea61ca3447 · outbound

This paper cites Horn,A characterization of unions of linearly independent sets, J.

How to see the forest despite the trees Horn,A characterization of unions of linearly independent sets, J

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:38.647175Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 333a7c23-ccb0-4ac4-b57b-8f8cd1e9f341 · outbound

This paper cites Jackson and T.

How to see the forest despite the trees Jackson and T

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:38.783804Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5f27d8f-6f0a-47f8-9627-ea7423408a41 · outbound

This paper cites Jord´ an, Cs.

How to see the forest despite the trees Jord´ an, Cs

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:38.908263Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8160cbf-741c-4613-aa4f-22f3f0c7a6b1 · outbound

This paper cites Karger,Minimum cuts in near-linear time, Journal of the ACM (JACM), 47(1) (2000 Jan 1) 46-76.

How to see the forest despite the trees Karger,Minimum cuts in near-linear time, Journal of the ACM (JACM), 47(1) (2000 Jan 1) 46-76

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.024768Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ba8b650-deaa-40ed-8756-76452e002441 · outbound

This paper cites Kishi and Y.

How to see the forest despite the trees Kishi and Y

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.203888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd2182af-132b-4d3c-9521-324588903540 · outbound

This paper cites Kov´ acs and L.A.

How to see the forest despite the trees Kov´ acs and L.A

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.287118Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ddb9744-811d-4f3f-b372-50a2c261bf04 · outbound

This paper cites Kron, Tensor Analysis of Networks, New York: J.

How to see the forest despite the trees Kron, Tensor Analysis of Networks, New York: J

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.347028Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80c85221-1c81-446e-851c-0312d0c03b6c · outbound

This paper cites Laman,On graphs and rigidity of plane skeletal structures, Journal of Engineering Mathematics, 4 (1970) 331-340.

How to see the forest despite the trees Laman,On graphs and rigidity of plane skeletal structures, Journal of Engineering Mathematics, 4 (1970) 331-340

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.384581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3c6b83a-3254-4356-b163-ae5bf53f8bc6 · outbound

This paper cites Lee and I.

How to see the forest despite the trees Lee and I

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.464004Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 638523c4-e3f0-4925-9dfe-2fe4eb908516 · outbound

This paper cites Lehman,A solution to the Shannon switching game, J.

How to see the forest despite the trees Lehman,A solution to the Shannon switching game, J

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.529622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29688f67-6d13-4a4b-9538-7d8ca02d3545 · outbound

This paper cites Lorea,Hypergraphes et matroides, Cahiers Centrel Etud.

How to see the forest despite the trees Lorea,Hypergraphes et matroides, Cahiers Centrel Etud

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.571883Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b9184fa-42b6-40e6-aba3-ae003ed40c10 · outbound

This paper cites Lov´ asz, Combinatorial Problems and Exercises, North-Holland 1979.

How to see the forest despite the trees Lov´ asz, Combinatorial Problems and Exercises, North-Holland 1979

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.601566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b61d5aa-0b02-413e-9056-aa81da6c9262 · outbound

This paper cites Lov´ asz,A generalization of K˝ onig’s theorem,Acta.

How to see the forest despite the trees Lov´ asz,A generalization of K˝ onig’s theorem,Acta

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.681018Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 10203e66-a269-4f13-8dc7-8a78c9b6f33d · outbound

This paper cites Lov´ asz,On two minimax theorems in graph theory,J.

How to see the forest despite the trees Lov´ asz,On two minimax theorems in graph theory,J

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.740909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9499b6d5-b202-4ddb-83c1-7d1ab7cb568c · outbound

This paper cites Mader,Konstruktion allern-fach kantenzusammenh¨ angenden Digraphen, Europ.

How to see the forest despite the trees Mader,Konstruktion allern-fach kantenzusammenh¨ angenden Digraphen, Europ

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.850860Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 293cc640-0566-418a-8d72-ed60cad518bd · outbound

This paper cites Mohar, R.J.

How to see the forest despite the trees Mohar, R.J

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:39.945467Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97312704-7084-4974-9113-cce642b1d805 · outbound

This paper cites Nash-Williams,On orientations, connectivity and odd vertex pairings in finite graphs, Canad.

How to see the forest despite the trees Nash-Williams,On orientations, connectivity and odd vertex pairings in finite graphs, Canad

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:40.064659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94d54db8-bfc7-4509-b560-b69916974c97 · outbound

This paper cites Nash-Williams,Edge-disjoint spanning trees of finite graphs, The Journal of the London Mathematical Society, 36 (1961) 445-450.

How to see the forest despite the trees Nash-Williams,Edge-disjoint spanning trees of finite graphs, The Journal of the London Mathematical Society, 36 (1961) 445-450

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:40.212308Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 853f0731-0680-416c-85a2-491551cd1ef1 · outbound

This paper cites Nash-Williams,Decomposition of finite graphs into forests,J.

How to see the forest despite the trees Nash-Williams,Decomposition of finite graphs into forests,J

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:40.332643Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9135cc26-c584-4cff-9d54-8d6c3fcfddfb · outbound

This paper cites Rado,A combinatorial theorem on vector spaces, The Journal of the London Math- ematical Society 37 (1962) 351-353.

How to see the forest despite the trees Rado,A combinatorial theorem on vector spaces, The Journal of the London Math- ematical Society 37 (1962) 351-353

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:40.445974Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d744cc0-e04b-4029-97de-e72c0f2046a6 · outbound

This paper cites Recski, Matroid Theory and its Applications in Electric Network Theory and in Statics, Springer, Berlin, 1989.

How to see the forest despite the trees Recski, Matroid Theory and its Applications in Electric Network Theory and in Statics, Springer, Berlin, 1989

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:40.545015Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce279999-ccba-4313-b074-7df1fa50b691 · outbound

This paper cites Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer, 2003.

How to see the forest despite the trees Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer, 2003

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:40.642571Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c928c4d7-e70e-4a9e-acac-94f1997a41cf · outbound

This paper cites Tay,Rigidity of multi-graphs.

How to see the forest despite the trees Tay,Rigidity of multi-graphs

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:40.763102Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3143371e-97fd-4b08-bc87-be7a6927d6ed · outbound

This paper cites Thomassen,Configurations in graphs of large minimum degree, connectivity, or chromatic number, Annals of the New York Academy of Sciences.

How to see the forest despite the trees Thomassen,Configurations in graphs of large minimum degree, connectivity, or chromatic number, Annals of the New York Academy of Sciences

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:40.876843Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eac410f0-d018-4901-915d-509962b74616 · outbound

This paper cites Tutte,On the problem of decomposing a graph intonconnected factors, J.

How to see the forest despite the trees Tutte,On the problem of decomposing a graph intonconnected factors, J

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:41.015680Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31981e0c-0652-4add-90a7-284698a035e5 · outbound

This paper cites Vidyasankar,Covering the edge-set of a directed graph with trees, Discrete Mathe- matics, 24 (1978) 79-85.

How to see the forest despite the trees Vidyasankar,Covering the edge-set of a directed graph with trees, Discrete Mathe- matics, 24 (1978) 79-85

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:41.152838Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b052e74-e375-4639-8621-6d979574bbb1 · outbound

This paper cites Whiteley,Some matroids from discrete applied geometry,in: Matroid Theory (J.E.

How to see the forest despite the trees Whiteley,Some matroids from discrete applied geometry,in: Matroid Theory (J.E

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-04T09:45:41.270810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.