Paper Citation Record · LEDGER

An FPT Algorithm for Diverse Minimum s-t Cuts

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

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

pith.paper-citation-record.v1
2607.03266 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-12T03:40:17.954159Z

measured 25 of 25 standing notices

One-hop event checks from named stored sources.

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

25 of 25 outbound references displayed

verified exact9
verified fuzzy0
unresolved15
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 50bcf873-cdf0-45dd-a630-f7b1fa6c7df2 · outbound

This paper cites Ahuja, Thomas L.

An FPT Algorithm for Diverse Minimum s-t Cuts Ahuja, Thomas L

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02388100-c178-4354-8b0a-48250310d3c1 · outbound

This paper cites Color-coding.Journal of the ACM, 42(4):844–856, 1995.

An FPT Algorithm for Diverse Minimum s-t Cuts Color-coding.Journal of the ACM, 42(4):844–856, 1995

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dbcde9a6-50e7-419a-bdbc-6a999e6156b8 · outbound

This paper cites Gutin.Digraphs - Theory, Algorithms and Applications, Second Edition.

An FPT Algorithm for Diverse Minimum s-t Cuts Gutin.Digraphs - Theory, Algorithms and Applications, Second Edition

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef2b7e78-99f2-4d8d-8fab-242bc7e8dd41 · outbound

This paper cites Fellows, Lars Jaffke, Tom´ aˇ s Masaˇ r´ ık, Mateus de Oliveira Oliveira, Gee- varghese Philip, and Frances A.

An FPT Algorithm for Diverse Minimum s-t Cuts Fellows, Lars Jaffke, Tom´ aˇ s Masaˇ r´ ık, Mateus de Oliveira Oliveira, Gee- varghese Philip, and Frances A

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11ce4738-e58d-416b-929c-63b7feb8ee77 · outbound

This paper cites Maximum flow and minimum-cost flow in almost-linear time.Journal of the ACM, 72(3):1–103, 2025.doi:10.1145/3728631.

An FPT Algorithm for Diverse Minimum s-t Cuts Maximum flow and minimum-cost flow in almost-linear time.Journal of the ACM, 72(3):1–103, 2025.doi:10.1145/3728631

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ae12dc6-eda2-4647-a4ce-0b3165b62fd5 · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Micha l Pilipczuk, and Saket Saurabh.Parameterized Algorithms, volume 4.

An FPT Algorithm for Diverse Minimum s-t Cuts Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Micha l Pilipczuk, and Saket Saurabh.Parameterized Algorithms, volume 4

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd25a725-c94e-42c8-bd51-e51ae906313e · outbound

This paper cites Finding Diverse Minimum s-t Cuts.

An FPT Algorithm for Diverse Minimum s-t Cuts Finding Diverse Minimum s-t Cuts

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcd37211-30d7-4633-aee8-c19d68c86018 · outbound

This paper cites Disjoint tours and the price of diversity.

An FPT Algorithm for Diverse Minimum s-t Cuts Disjoint tours and the price of diversity

Reference 8

Resolution: verified exact; doi, observed 2026-07-12T03:48:29.094617Z

Source-reported events for the cited work

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

Observation 86c19706-348c-47d8-92c6-8acc4412d1f8 · outbound

This paper cites Graduate texts in mathematics, volume 173.

An FPT Algorithm for Diverse Minimum s-t Cuts Graduate texts in mathematics, volume 173

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 09f3802a-8bdc-4e86-9980-39963db13545 · outbound

This paper cites Finding diverse solutions parameterized by cliquewidth.

An FPT Algorithm for Diverse Minimum s-t Cuts Finding diverse solutions parameterized by cliquewidth

Reference 10

Resolution: verified exact; doi, observed 2026-07-12T03:48:29.128828Z

Source-reported events for the cited work

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

Observation 4f21f8c6-3260-4809-8538-7c0ca2652d51 · outbound

This paper cites Fomin, Petr A.

An FPT Algorithm for Diverse Minimum s-t Cuts Fomin, Petr A

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6d69059-ac9a-419f-8e13-45a66003b958 · outbound

This paper cites Fomin, Petr A.

An FPT Algorithm for Diverse Minimum s-t Cuts Fomin, Petr A

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 93944250-0945-4ca7-8556-0c57dcefb076 · outbound

This paper cites an unresolved cited work.

An FPT Algorithm for Diverse Minimum s-t Cuts Unresolved cited work

Reference 13

Resolution: verified exact; doi, observed 2026-07-12T03:48:29.147399Z

Source-reported events for the cited work

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

Observation 1d3cc6d7-3ab1-40c5-8190-524a7bcc4cab · outbound

This paper cites an unresolved cited work.

An FPT Algorithm for Diverse Minimum s-t Cuts Unresolved cited work

Reference 14

Resolution: verified exact; doi, observed 2026-07-12T03:48:29.130872Z

Source-reported events for the cited work

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

Observation 4e62685c-047f-4bfc-8bd0-b285919b5378 · outbound

This paper cites Finding diverse trees, paths, and more.Proceedings of the AAAI Conference on Artificial Intelligence, 35(5):3778–3786, 2021.

An FPT Algorithm for Diverse Minimum s-t Cuts Finding diverse trees, paths, and more.Proceedings of the AAAI Conference on Artificial Intelligence, 35(5):3778–3786, 2021

Reference 15

Resolution: verified exact; doi, observed 2026-07-12T03:48:29.119165Z

Source-reported events for the cited work

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

Observation 89a6d8d9-f275-4c4a-8f44-10288f9f3e49 · outbound

This paper cites Karger and Clifford Stein.

An FPT Algorithm for Diverse Minimum s-t Cuts Karger and Clifford Stein

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8613ee95-e9ec-4256-b3ba-9cf86803e220 · outbound

This paper cites Flow-augmentation I: Directed graphs.Journal of the ACM, 72(1):1–38, 2025.doi:10.1145/3706103.

An FPT Algorithm for Diverse Minimum s-t Cuts Flow-augmentation I: Directed graphs.Journal of the ACM, 72(1):1–38, 2025.doi:10.1145/3706103

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ca8538e-661d-4eae-9887-faf666ebd676 · outbound

This paper cites Pearson, 2006.

An FPT Algorithm for Diverse Minimum s-t Cuts Pearson, 2006

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82f7b7d4-b880-4571-9a32-9b00b6e92e8a · outbound

This paper cites an unresolved cited work.

An FPT Algorithm for Diverse Minimum s-t Cuts Unresolved cited work

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 665aead1-9a8d-4ecb-8d1b-7b742ffa24bb · outbound

This paper cites On the structure of all minimum cuts in a network and applications.

An FPT Algorithm for Diverse Minimum s-t Cuts On the structure of all minimum cuts in a network and applications

Reference 20

Resolution: verified exact; doi, observed 2026-07-12T03:48:29.105969Z

Source-reported events for the cited work

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

Observation 625f3266-8798-4ff7-b221-afbbdc2e6b45 · outbound

This paper cites Scott Provan and Michael O.

An FPT Algorithm for Diverse Minimum s-t Cuts Scott Provan and Michael O

Reference 21

Resolution: verified exact; doi, observed 2026-07-12T03:48:29.110123Z

Source-reported events for the cited work

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

Observation d3fdf060-4c1f-45a9-a3c0-468255fbb8c7 · outbound

This paper cites Scott Provan and Douglas R.

An FPT Algorithm for Diverse Minimum s-t Cuts Scott Provan and Douglas R

Reference 22

Resolution: verified exact; doi, observed 2026-07-12T03:48:29.097176Z

Source-reported events for the cited work

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

Observation 8f90cca1-218f-40a8-9c5b-1859f2f451bb · outbound

This paper cites Depth-first search and linear graph algorithms.SIAM Journal on Computing, 1(2):146–160, 1972.doi:10.1137/0201010.

An FPT Algorithm for Diverse Minimum s-t Cuts Depth-first search and linear graph algorithms.SIAM Journal on Computing, 1(2):146–160, 1972.doi:10.1137/0201010

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a5e12c4b-e5f4-45f8-8f27-f93d79e1d865 · outbound

This paper cites Tsukiyama, I.

An FPT Algorithm for Diverse Minimum s-t Cuts Tsukiyama, I

Reference 24

Resolution: verified exact; arxiv_id, observed 2026-07-12T03:48:29.101049Z

Source-reported events for the cited work

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

Observation 8096b732-a697-4829-b497-c08b0621653a · outbound

This paper cites an unresolved cited work.

An FPT Algorithm for Diverse Minimum s-t Cuts Unresolved cited work

Reference 25

Resolution: malformed identifier; no resolver link, observed 2026-07-12T03:40:17.954159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.