Paper Citation Record · LEDGER

An FPT algorithm for cycle rank on semi-complete digraphs

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

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

pith.paper-citation-record.v1
2606.29336 v1

Coverage vector

measured 39 of 39 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-30T02:04:12.183555Z

measured 39 of 39 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+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 e71d1b1c-ff2a-4cdb-88b1-4cb540ae3902 · outbound

This paper cites Ranking tournaments.

An FPT algorithm for cycle rank on semi-complete digraphs Ranking tournaments

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67731672-5437-4049-9055-6324a9a37aa0 · outbound

This paper cites Fast F A ST.

An FPT algorithm for cycle rank on semi-complete digraphs Fast F A ST

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6c5bcb4-2362-4fa4-a169-e992c9fc5f39 · outbound

This paper cites Tournaments a nd semicomplete digraphs.

An FPT algorithm for cycle rank on semi-complete digraphs Tournaments a nd semicomplete digraphs

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d98d16d2-3e10-40ac-a3c9-933114acc354 · outbound

This paper cites an unresolved cited work.

An FPT algorithm for cycle rank on semi-complete digraphs Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fabccff4-1180-4e3a-8e14-a95d7b451370 · outbound

This paper cites A polynomial algorithm for the 2-path problem for semicomplete digraphs.

An FPT algorithm for cycle rank on semi-complete digraphs A polynomial algorithm for the 2-path problem for semicomplete digraphs

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90ef56ec-cb76-42ba-9756-a356e166d4c9 · outbound

This paper cites DAG-width and par- ity games.

An FPT algorithm for cycle rank on semi-complete digraphs DAG-width and par- ity games

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19fe90bd-a8fd-4eaa-87f5-89e34711c41d · outbound

This paper cites The minimum feedback arc set problem is NP-hard for tournaments.

An FPT algorithm for cycle rank on semi-complete digraphs The minimum feedback arc set problem is NP-hard for tournaments

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c5bab44-152b-448e-bb3e-df7a81174d25 · outbound

This paper cites A ﬁxed-parameter algorithm for the directed feedback vertex set problem.

An FPT algorithm for cycle rank on semi-complete digraphs A ﬁxed-parameter algorithm for the directed feedback vertex set problem

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90bc810a-0745-463b-92aa-89f29e851364 · outbound

This paper cites Computing slater rankings using simi larities among candidates.

An FPT algorithm for cycle rank on semi-complete digraphs Computing slater rankings using simi larities among candidates

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9484c9b2-505d-41cd-9407-ab8e0f0718f1 · outbound

This paper cites Makowsky, and Udi Rotics.

An FPT algorithm for cycle rank on semi-complete digraphs Makowsky, and Udi Rotics

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bde9c9ff-b051-4e79-a3ef-6ec4b9e0f491 · outbound

This paper cites Upper bounds to the clique width of graphs.

An FPT algorithm for cycle rank on semi-complete digraphs Upper bounds to the clique width of graphs

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b89a5fb9-1667-417e-806c-ba1cfac98e9d · outbound

This paper cites an unresolved cited work.

An FPT algorithm for cycle rank on semi-complete digraphs Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf065ef3-068f-4857-a5c7-8165fee69b3b · outbound

This paper cites Fomin and Micha/suppress l Pilipczuk.

An FPT algorithm for cycle rank on semi-complete digraphs Fomin and Micha/suppress l Pilipczuk

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20ea5825-7fc2-48ae-96a0-9bce64cadaf5 · outbound

This paper cites Fomin and Micha/suppress l Pilipczuk.

An FPT algorithm for cycle rank on semi-complete digraphs Fomin and Micha/suppress l Pilipczuk

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e6fb587a-62c3-4855-8164-b4b39fd69ebd · outbound

This paper cites Tournament pathwi dth and topological containment.

An FPT algorithm for cycle rank on semi-complete digraphs Tournament pathwi dth and topological containment

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94222e14-f4aa-498f-841c-a275547fab41 · outbound

This paper cites Digraph width measures in parameterized algor ithmics.

An FPT algorithm for cycle rank on semi-complete digraphs Digraph width measures in parameterized algor ithmics

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a0718de-ae91-4c8a-880c-31fc3b96945b · outbound

This paper cites Are there any good digraph width measures? J.

An FPT algorithm for cycle rank on semi-complete digraphs Are there any good digraph width measures? J

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 81d2573f-aa86-4f0c-aa06-e5d23c8b758c · outbound

This paper cites Giannopoulou, Paul Hunter, and Dimitrios M.

An FPT algorithm for cycle rank on semi-complete digraphs Giannopoulou, Paul Hunter, and Dimitrios M

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eaba4f30-c50e-447c-989f-dea1a18f7c32 · outbound

This paper cites Digraph complexity measures and appli cations in formal language theory.

An FPT algorithm for cycle rank on semi-complete digraphs Digraph complexity measures and appli cations in formal language theory

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f69b40c6-e5e6-4658-9886-d3aef0ea8cf9 · outbound

This paper cites Ac yclic coloring parameterized by directed clique-width.

An FPT algorithm for cycle rank on semi-complete digraphs Ac yclic coloring parameterized by directed clique-width

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08a82cbe-bc03-4a04-8bcf-dbf734eb381f · outbound

This paper cites Directed width parameters on semicomplete digraphs.

An FPT algorithm for cycle rank on semi-complete digraphs Directed width parameters on semicomplete digraphs

Reference 21

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12d7ab00-096d-4624-a38e-279531677820 · outbound

This paper cites Unavoidable butterfly minors in digraphs of large cycle rank.

An FPT algorithm for cycle rank on semi-complete digraphs Unavoidable butterfly minors in digraphs of large cycle rank

Reference 22

Resolution: verified exact; arxiv_id, observed 2026-06-30T02:54:10.869719Z

Source-reported events for the cited work

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

Observation 327d88c2-1873-4750-8ae9-0f19b114b0f0 · outbound

This paper cites Digraph measures: Ke lly decompositions, games, and orderings.

An FPT algorithm for cycle rank on semi-complete digraphs Digraph measures: Ke lly decompositions, games, and orderings

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a08697f0-17b0-4908-8510-ac6590ec1568 · outbound

This paper cites an unresolved cited work.

An FPT algorithm for cycle rank on semi-complete digraphs Unresolved cited work

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b8df709-002d-4a54-bea1-307cdfc10c9f · outbound

This paper cites Seymour, and Robi n Thomas.

An FPT algorithm for cycle rank on semi-complete digraphs Seymour, and Robi n Thomas

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c526a837-3499-43bd-bbbd-83385fefdfa8 · outbound

This paper cites The rank-wid th of edge-coloured graphs.

An FPT algorithm for cycle rank on semi-complete digraphs The rank-wid th of edge-coloured graphs

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 17e248f0-06f2-4a5b-8cc8-95180cb7eb5b · outbound

This paper cites Reducibility among combinatorial probl ems (1972).

An FPT algorithm for cycle rank on semi-complete digraphs Reducibility among combinatorial probl ems (1972)

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77e0f6d4-d905-4fbf-a212-281aace32b20 · outbound

This paper cites Digraphs of bounded width.

An FPT algorithm for cycle rank on semi-complete digraphs Digraphs of bounded width

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e5bb722d-7994-42cb-94d6-cec43cb3049c · outbound

This paper cites The loop complexity of regular even ts.

An FPT algorithm for cycle rank on semi-complete digraphs The loop complexity of regular even ts

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d6db91c-032b-4c4c-9900-c61e489fecd1 · outbound

This paper cites Sub-exponential time parameterized algorithms for graph layout problems on digr aphs with bounded independence number.

An FPT algorithm for cycle rank on semi-complete digraphs Sub-exponential time parameterized algorithms for graph layout problems on digr aphs with bounded independence number

Reference 30

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af1a9b86-edfa-42b8-8d7c-3876f2bccf83 · outbound

This paper cites Tree -depth, subgraph coloring and homo- morphism bounds.

An FPT algorithm for cycle rank on semi-complete digraphs Tree -depth, subgraph coloring and homo- morphism bounds

Reference 31

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ef4acb6-d9f2-4273-bd7a-6d01af856944 · outbound

This paper cites Sparsity, volume 28 of Algorithms and Combinatorics.

An FPT algorithm for cycle rank on semi-complete digraphs Sparsity, volume 28 of Algorithms and Combinatorics

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adc5ea14-f16d-4ad2-afc2-acc5756603e0 · outbound

This paper cites DAG-width—connectivity measure for directed graphs.

An FPT algorithm for cycle rank on semi-complete digraphs DAG-width—connectivity measure for directed graphs

Reference 33

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91d29fd1-a846-4f64-b11b-5b62f6fa3b9b · outbound

This paper cites Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings.

An FPT algorithm for cycle rank on semi-complete digraphs Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings

Reference 34

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6061886a-d972-4262-9508-775be2a3f0a3 · outbound

This paper cites Graph classes through the lens of logic.

An FPT algorithm for cycle rank on semi-complete digraphs Graph classes through the lens of logic

Reference 35

Resolution: verified exact; arxiv_id, observed 2026-06-30T02:54:10.873176Z

Source-reported events for the cited work

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

Observation c5983f74-dced-4919-b44d-4150e9d8d84a · outbound

This paper cites A faster parameterized algorithm for treedepth.

An FPT algorithm for cycle rank on semi-complete digraphs A faster parameterized algorithm for treedepth

Reference 36

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d27d217-a943-4558-90cf-8464a0a04713 · outbound

This paper cites an unresolved cited work.

An FPT algorithm for cycle rank on semi-complete digraphs Unresolved cited work

Reference 37

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dfe7d69b-5506-4036-b6f8-54633c8fccb3 · outbound

This paper cites Parameter ized algorithms for directed modular width.

An FPT algorithm for cycle rank on semi-complete digraphs Parameter ized algorithms for directed modular width

Reference 38

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0adca739-a06c-4f5e-94f4-fa8dc9ce22bf · outbound

This paper cites Depth-ﬁrst search and linear graph algo rithms.

An FPT algorithm for cycle rank on semi-complete digraphs Depth-ﬁrst search and linear graph algo rithms

Reference 39

Resolution: unresolved; no resolver link, observed 2026-06-30T02:04:12.183555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.