Paper Citation Record · LEDGER

Optimization of the directed spanning trees using the weighted matroid intersection algorithm

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

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

pith.paper-citation-record.v1
2607.25238 v1

Coverage vector

measured 39 of 39 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T03:10:16.247862Z

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

39 of 39 outbound references displayed

verified exact2
verified fuzzy0
unresolved37
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c94f767c-2f20-45c3-92ac-355c25ebc221 · outbound

This paper cites Barab´ asi,Network Science; Cambridge University Press: Cambridge, UK, 2016.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Barab´ asi,Network Science; Cambridge University Press: Cambridge, UK, 2016

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.063299Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c72d918-e7e5-426d-a13c-5e8688a2d88a · outbound

This paper cites Bellman,On a routing problem.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Bellman,On a routing problem

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.068632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4a007c3-8286-4a1b-91a6-d527e3c29c5d · outbound

This paper cites Bock,An algorithm to construct a minimum directed spanning tree in a directed network, Developments in Operations Research, pp.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Bock,An algorithm to construct a minimum directed spanning tree in a directed network, Developments in Operations Research, pp

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.073837Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2eedcac-810e-489d-9d82-3aeff347f893 · outbound

This paper cites Brezovec, G.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Brezovec, G

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.079483Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 217400e5-6ba8-42fc-9429-74e6460751aa · outbound

This paper cites B¨ other, O.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm B¨ other, O

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.084765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1cb73ad7-c7ce-4672-b397-b4c657d3071e · outbound

This paper cites B´ erczi, T.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm B´ erczi, T

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.090888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e37d049f-a9b6-4547-96fb-2a1cbb07716a · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.096568Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c55eb8e-66b0-4d84-990a-cfc4bb2cc8ee · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.101368Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8fc83caf-ccd8-461d-b69e-33cb49bd1400 · outbound

This paper cites Cherkassky, and A.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Cherkassky, and A

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.105861Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 674f38fb-6e61-4c9a-a209-c6a0829c75fe · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.110391Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e81e9942-1e9c-4fcd-b4cc-75f47de3ed84 · outbound

This paper cites Edmonds,Optimum branchings, Journal of Research of the National Bureau of Standards, 71B (1967), p.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Edmonds,Optimum branchings, Journal of Research of the National Bureau of Standards, 71B (1967), p

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.114961Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98368289-0d80-4228-a4ae-d3a3faf896ed · outbound

This paper cites Edmonds,Submodular Functions, Matroids, and Certain Polyhedra.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Edmonds,Submodular Functions, Matroids, and Certain Polyhedra

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.119438Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 26abf640-3e9f-4a97-b718-448c9f8292e8 · outbound

This paper cites Espada, A.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Espada, A

Reference 13

Resolution: verified exact; doi, observed 2026-08-01T03:14:15.303647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 738afef6-cd03-457d-8efc-eb579ad99f2e · outbound

This paper cites Eppstein, Z.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Eppstein, Z

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.130041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 04e892dd-209c-4cf4-ab5d-1cbe2a83aabf · outbound

This paper cites Erd˝ os and A.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Erd˝ os and A

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.134838Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dca1ec75-c2ef-4cc5-8f03-dfa3ce3c25e2 · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.139274Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 773c64c0-1d0f-424e-8bc1-e6142fe7f358 · outbound

This paper cites Frank, ,A weighted matroid intersection algorithm, Journal of Algorithms, 2(4): 328–336 (1981).

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Frank, ,A weighted matroid intersection algorithm, Journal of Algorithms, 2(4): 328–336 (1981)

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.143643Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b04d1581-f23a-4a95-80a8-ea01a94148ca · outbound

This paper cites Fujishige,A primal approach to the independent assignment problem, Journal of the Operations Research Society of Japan 20 (1977) 1-15.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Fujishige,A primal approach to the independent assignment problem, Journal of the Operations Research Society of Japan 20 (1977) 1-15

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.148606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba8c072e-42d3-4bf9-bd00-c1ef4aa3671b · outbound

This paper cites Fischer and R.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Fischer and R

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.153816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 346c195a-b814-4f59-991e-e276ba639ecf · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.158065Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08a745e3-c611-48a1-9719-07e1750dcb66 · outbound

This paper cites Hanauer, M.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Hanauer, M

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.163513Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bea3b070-08d0-4b69-93fc-887971cb6cbf · outbound

This paper cites Hagberg P.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Hagberg P

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.168471Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 021e9040-4ed6-446b-9f18-c31e9b261251 · outbound

This paper cites Harel, R.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Harel, R

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.172741Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 93134370-a68f-4172-815f-3bc2a8f0de1a · outbound

This paper cites Karp,A simple derivation of Edmonds’ algorithm for optimum branchings, Net- works 1 (1971): 265-272.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Karp,A simple derivation of Edmonds’ algorithm for optimum branchings, Net- works 1 (1971): 265-272

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.178114Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d266a0c8-e0f4-41b5-8f9b-3a7e002d78c4 · outbound

This paper cites Kamiyama,Arborescence problems in directed graphs: Theorems and algorithms, Interdiscip.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Kamiyama,Arborescence problems in directed graphs: Theorems and algorithms, Interdiscip

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.183105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ca494ef-09e3-4240-8d12-fc3c818633a0 · outbound

This paper cites Korte, and J.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Korte, and J

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.187295Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eec6be32-d525-4c68-a94c-79c493e6a55e · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.191870Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef7b4dcf-acf8-4e3c-bc1b-698972c9e87c · outbound

This paper cites Lov´ asz,Computing ears and branchings in parallel, in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985, pp.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Lov´ asz,Computing ears and branchings in parallel, in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985, pp

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.196806Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9535b113-ba5c-489b-bf33-126cf24ebd26 · outbound

This paper cites A Survey of Shortest-Path Algorithms.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm A Survey of Shortest-Path Algorithms

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.201461Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13ab2c04-25c3-46de-92a3-7824706f1cde · outbound

This paper cites Moore,The Shortest Path Through a Maze.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Moore,The Shortest Path Through a Maze

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.206388Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f560fb05-3825-43b2-bdda-91a7b3c23018 · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.211453Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cddf831c-208c-44fe-8792-6eee4ce493a0 · outbound

This paper cites Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.216346Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a701ec5a-416c-4e08-b9b4-1bc4ce4384d4 · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.220904Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c340887c-8bf7-4580-92c1-0244b058d582 · outbound

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

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Schrijver,Combinatorial Optimization: Polyhedra and Efficiency, Springer Berlin, Heidelberg, 2003

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.230125Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df024fde-b319-4c92-bd91-88274ccbeb50 · outbound

This paper cites S¨ orensen, and G.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm S¨ orensen, and G

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.234482Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 998b7b34-c927-49c6-8f34-5ad0355fb375 · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.239081Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4f64624-d0ae-44fc-a10b-64bd5c29e040 · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.243434Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba00c47a-6bb3-412f-a3e0-0be0fdf30c88 · outbound

This paper cites an unresolved cited work.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Unresolved cited work

Reference 38

Resolution: verified exact; doi, observed 2026-08-01T03:14:15.015302Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation af74fbae-c80b-4da8-bb61-3baf6fb756b7 · outbound

This paper cites Springer, Berlin, Heidelberg.

Optimization of the directed spanning trees using the weighted matroid intersection algorithm Springer, Berlin, Heidelberg

Reference 2006

Resolution: unresolved; no resolver link, observed 2026-08-01T03:10:16.225610Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.