Pith. sign in

Paper Citation Record · LEDGER

Unavoidable butterfly minors in digraphs of large cycle rank

As of 9 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 1 inbound Pith citation observation for arXiv:2507.11814.

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

pith.paper-citation-record.v1
2507.11814 v1

Coverage vector

measured 44 of 44 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T17:15:46.036098Z

measured 45 of 45 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-06-30T02:54:10.867711Z

Reference resolution

44 of 44 outbound references displayed

  • verified exact2
  • verified fuzzy35
  • unresolved7
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation f0a36a51-eccd-401d-b453-62e24abc2868 · outbound

This paper cites Graph searching games and width measures for directed graphs.

Unavoidable butterfly minors in digraphs of large cycle rank Graph searching games and width measures for directed graphs

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:50.011205Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.745646Z digest=sha256:b8be4d742b28f89c9acb35b6d045f0822ce9685fa6096f532d88aba36fdde619

Observation 48a3051a-32aa-4b57-8321-0e603daecf6a · outbound

This paper cites The Erdos-Posa Property for Directed Graphs.

Unavoidable butterfly minors in digraphs of large cycle rank The Erdos-Posa Property for Directed Graphs

Reference 2

Resolution
verified exact
local_arxiv, observed 2026-08-06T17:15:46.187972Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.751711Z digest=sha256:4251f865f78e5505253eb0bbe74662f478db39440b1447270af526a385a32b0f

Observation 31963723-d6a9-42f0-a169-939ea2963ac7 · outbound

This paper cites Decid- ing the Erd˝ os-P´ osa property in 3-connected digraphs.

Unavoidable butterfly minors in digraphs of large cycle rank Decid- ing the Erd˝ os-P´ osa property in 3-connected digraphs

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:49.875404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.758605Z digest=sha256:3c20c1e8031fa54dbefb5e2e05233d64d43cecd2e1455736a81dddc4307e63e1

Observation 841021c6-b2ef-4288-85e6-d280b50a9f83 · outbound

This paper cites The dag-width of directed graphs.

Unavoidable butterfly minors in digraphs of large cycle rank The dag-width of directed graphs

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:49.716821Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.764577Z digest=sha256:8c47cf1ec436f8face54be9717b7cfc33fcc68cab58a1fce3719943749c368e6

Observation fe430025-67eb-4d47-a8c3-9699902fa296 · outbound

This paper cites Quickly excluding a forest.

Unavoidable butterfly minors in digraphs of large cycle rank Quickly excluding a forest

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:49.573221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.770569Z digest=sha256:16725b24cc827280f500a3ffcd4f2b54804851690c25f8bcc6bcf1b04092c246

Observation 904fe22a-7c31-4490-864f-254bb8688f6a · outbound

This paper cites Bodlaender, Jitender S.

Unavoidable butterfly minors in digraphs of large cycle rank Bodlaender, Jitender S

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:49.311498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.778819Z digest=sha256:d6c13265e1782938216fcfaf280a4435783b345e157aef3416c6add25eca896f

Observation e4b920bb-4935-44a9-a0b5-d4be81b15df6 · outbound

This paper cites Cabello, M.

Unavoidable butterfly minors in digraphs of large cycle rank Cabello, M

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:49.213499Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.786287Z digest=sha256:d9d5be9cea4f6f620fd0bb2a878aa223e0696dddda46a35edf64f0b71492ccf4

Observation e14fb5ce-f14f-49a9-9c09-5301342a23f3 · outbound

This paper cites Towards tight(er) bounds fo r the excluded grid theorem.

Unavoidable butterfly minors in digraphs of large cycle rank Towards tight(er) bounds fo r the excluded grid theorem

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:49.130187Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.791410Z digest=sha256:76638ce3337be7e575a911775655ebd2b5749b67167539f08580c11fcf0986f1

Observation b4e2bdd5-daee-4681-818d-ba1eb3cc66e5 · outbound

This paper cites an unresolved cited work.

Unavoidable butterfly minors in digraphs of large cycle rank Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-06T17:15:48.974643Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.797243Z digest=sha256:8a5fb10ca5e6dbe5d3dc77349c1293bcedc793fec694e2dfd43ff86aaf4729fe

Observation 6b388544-796f-45e9-a014-59237ca71f2a · outbound

This paper cites an unresolved cited work.

Unavoidable butterfly minors in digraphs of large cycle rank Unresolved cited work

Reference 10

Resolution
unresolved
raw_fallback, observed 2026-08-06T17:15:48.870912Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.802290Z digest=sha256:1ca7ff1fb90dd3eb49304d99e71527ff45bfe71d28a74859fb2c301c0c5191d2

Observation 20223451-4700-4262-a9ff-93dab629d91b · outbound

This paper cites Directed path-decompositions.

Unavoidable butterfly minors in digraphs of large cycle rank Directed path-decompositions

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:48.754570Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.807496Z digest=sha256:993c474ce597d221a55f9fa8e5a555a78495b1880f85e75cee07c4a4763a272c

Observation f7c28b7c-9548-4d3e-a57f-f6de8e3dbc2d · outbound

This paper cites Digraph width measures in parameterized algor ithmics.

Unavoidable butterfly minors in digraphs of large cycle rank Digraph width measures in parameterized algor ithmics

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:48.605195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.813362Z digest=sha256:2ac757996fad3708ae193b611e05addfd69c860d0c8a92456e0047a9cb18729b

Observation 170fa961-1c51-4376-a3a0-d79d4c54d55e · outbound

This paper cites The grid theorem for vertex- minors.

Unavoidable butterfly minors in digraphs of large cycle rank The grid theorem for vertex- minors

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:48.426814Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.822301Z digest=sha256:223196854522fd5ad37b91d3bb69e443982499936042fe558ead02ce0f7a4da2

Observation d1ce3995-1526-4ef7-a318-9d26b9f6db24 · outbound

This paper cites Succinctness of regular expressions wi th interleaving, intersection and count- ing.

Unavoidable butterfly minors in digraphs of large cycle rank Succinctness of regular expressions wi th interleaving, intersection and count- ing

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:48.243942Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.827360Z digest=sha256:97ab1133dc92de0d33088f32565f79abde0537b6219fa21c7d9946a4daf3f4ee

Observation 346e5a63-99d1-4e60-a54d-3da980ba5bf1 · outbound

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

Unavoidable butterfly minors in digraphs of large cycle rank Giannopoulou, Paul Hunter, and Dimitrios M

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:48.129567Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.832103Z digest=sha256:df734ced738667340ca7f9bdd889d676b97195a5b4b1ee935a8c52793b190914

Observation e13ac4c8-3662-402f-bb1b-52d7b5301ee6 · outbound

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

Unavoidable butterfly minors in digraphs of large cycle rank Digraph complexity measures and appli cations in formal language theory

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:48.024837Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.837337Z digest=sha256:ce435937a7bf103e02575ff72c761b3d08def4bc24a427d8ae3117560f900ac6

Observation 1cf70620-4034-42b4-a796-da3188c0bd7b · outbound

This paper cites Polynomial planar directed grid theorem.

Unavoidable butterfly minors in digraphs of large cycle rank Polynomial planar directed grid theorem

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:47.857527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.842207Z digest=sha256:3399f7797e4b71d46bd3c586fdc985b112aa866387e3f426a3c630cbbfdd934e

Observation 1449391c-35e4-4fae-8682-5f99e0b5436c · outbound

This paper cites Cycles of Well- Linked Sets and an Elementary Bound for the Directed Grid The orem.

Unavoidable butterfly minors in digraphs of large cycle rank Cycles of Well- Linked Sets and an Elementary Bound for the Directed Grid The orem

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:47.718164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.848119Z digest=sha256:7d87d09f5f78d65f762702281b568ec2ad3ce5f3d06dea3a9538b156b780a73d

Observation f026522d-937e-444d-b58d-32199a776b86 · outbound

This paper cites Generating strongly 2-connected digraphs.

Unavoidable butterfly minors in digraphs of large cycle rank Generating strongly 2-connected digraphs

Reference 19

Resolution
verified exact
local_arxiv, observed 2026-08-06T17:15:46.149756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.853300Z digest=sha256:1acaad5161c782431385b11ee4ad2b2b0e1b0a0af7002055ae152c88bda38777

Observation 7390c7eb-e052-45ae-8e71-966e7dedcd1a · outbound

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

Unavoidable butterfly minors in digraphs of large cycle rank Digraph measures: Ke lly decompositions, games, and orderings

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:47.590634Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.858857Z digest=sha256:5cc80890a0f9f1919373e82258dcfa4b291b95176f73a5e3a3827cb613b981f8

Observation eb5370a9-4190-4c57-872d-0cca377dcfcc · outbound

This paper cites an unresolved cited work.

Unavoidable butterfly minors in digraphs of large cycle rank Unresolved cited work

Reference 21

Resolution
unresolved
raw_fallback, observed 2026-08-06T17:15:47.395597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.864891Z digest=sha256:1bbea347281666330b39f94855d7375cfd6be4a492f656e3b791c0f07ddf35fa

Observation 06199bac-f0ef-4617-96cc-d7436ae0d1cb · outbound

This paper cites The dire cted grid theorem.

Unavoidable butterfly minors in digraphs of large cycle rank The dire cted grid theorem

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:47.285358Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.870651Z digest=sha256:e6a86fc6efb26ff7385e4e426a5904f9c4c56f84708a5019d8d0c8a0945d1d64

Observation a13b0e35-b219-4c88-803b-b7a67141ef7b · outbound

This paper cites an unresolved cited work.

Unavoidable butterfly minors in digraphs of large cycle rank Unresolved cited work

Reference 23

Resolution
unresolved
raw_fallback, observed 2026-08-06T17:15:47.167291Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.875550Z digest=sha256:2fa3f2fcceb1c82add283610070cdebd7fd14138fce3ef8b051d98e58f82b8db

Observation 55324eb9-fbb4-4589-b57f-6b0aa549c484 · outbound

This paper cites Digraphs of bounded width.

Unavoidable butterfly minors in digraphs of large cycle rank Digraphs of bounded width

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.995786Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.881266Z digest=sha256:f44d856c6fe9aabd3c69b17afc8e211108f8d3273a30bd7b4f88750c8b7a2d49

Observation 9c3e7d56-9773-47df-a3b1-695466092b52 · outbound

This paper cites Algorithmic properties of sparse digraphs.

Unavoidable butterfly minors in digraphs of large cycle rank Algorithmic properties of sparse digraphs

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.819711Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.887315Z digest=sha256:78926c957aec186005ab67b37cbccfd7239b09c946a2fb5e64a86392ca26a7b9

Observation 14969715-d77b-4619-be0e-82033beca439 · outbound

This paper cites Structural properties and constant factor-approximation of strong di stance-r dominating sets in sparse directed graphs.

Unavoidable butterfly minors in digraphs of large cycle rank Structural properties and constant factor-approximation of strong di stance-r dominating sets in sparse directed graphs

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.724352Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.893131Z digest=sha256:ca5a1f92fafe199470f64db0cc957facfbf7116cc955d6785139c165ac95cdd9

Observation 45c678a9-420e-49d0-aca2-7653a3fd2b03 · outbound

This paper cites The loop complexity of pure-group e vents.

Unavoidable butterfly minors in digraphs of large cycle rank The loop complexity of pure-group e vents

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.599827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.897949Z digest=sha256:2d8c7c8fbb86ad29c3f111aaab89b378111b1a800c211d41afe016e2b51ccf40

Observation bd115c5a-7929-4433-b8a1-be99fdc3cf89 · outbound

This paper cites The loop complexity of regular even ts.

Unavoidable butterfly minors in digraphs of large cycle rank The loop complexity of regular even ts

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.564044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.902882Z digest=sha256:345eb25aa7ea78e5d887fa9298a5130ba9853093fa15f75e744d0d9d61d7fe44

Observation c5717940-ae04-4bff-a2a2-095f65af9ec0 · outbound

This paper cites R ecognizing digraphs of kelly-width 2.

Unavoidable butterfly minors in digraphs of large cycle rank R ecognizing digraphs of kelly-width 2

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.539020Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.907892Z digest=sha256:79bcc40eb4bcd4efed5c38a01f04ecbe4fa6ab57171a5f6b5aa9bb351fede1c8

Observation 4c8cf3c4-6e79-4735-9ade-e7695e9c8947 · outbound

This paper cites On the order of countable graphs.

Unavoidable butterfly minors in digraphs of large cycle rank On the order of countable graphs

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.512419Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.913389Z digest=sha256:842eddc33fd265b04de75717fb9f7a8a047f4267468cc8f82ccf70ab41ab0567

Observation 3b5156af-263c-4a31-99ed-dde996434f34 · outbound

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

Unavoidable butterfly minors in digraphs of large cycle rank Tree-depth, subgraph coloring and homo- morphism bounds

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.481713Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.919859Z digest=sha256:0f6fb0e6451073409f16247a384bb30db72579c4e797afac9a43c5aac71bb765

Observation f7ea7c01-59fa-4ec3-af38-782686605ad4 · outbound

This paper cites Gradand classes with bounded expansion.

Unavoidable butterfly minors in digraphs of large cycle rank Gradand classes with bounded expansion

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.445358Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.925274Z digest=sha256:2453bdf8fd1c571ec295fa373b68247dd89700bb4c209bb718be885a09f7aabc

Observation 5043ee31-103e-4d4f-bef9-7e54ba43e2ef · outbound

This paper cites Gradand classes with bounded expansion.

Unavoidable butterfly minors in digraphs of large cycle rank Gradand classes with bounded expansion

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.428732Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.931714Z digest=sha256:ad3ecd99fa8f478003955f86c1fb65c831111b03a095b8b3abb78f5b44a7c37e

Observation 92b33ffc-4b6d-4305-95a0-9df7281d7d19 · outbound

This paper cites Gradand classes with bounded expansion.

Unavoidable butterfly minors in digraphs of large cycle rank Gradand classes with bounded expansion

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.409313Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.937246Z digest=sha256:885727431c456e8f2fc26565c32a544a4dae8eb5fac3c06cbcd9891fe6472db1

Observation ec1aa3a3-7b15-40bd-9287-0b7a265b51de · outbound

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

Unavoidable butterfly minors in digraphs of large cycle rank Sparsity, volume 28 of Algorithms and Combinatorics

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.392195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.944805Z digest=sha256:3d62282eb22ae12a3305b3dda6f54cada3cbff04f25c1a14cdbc55cffba25e25

Observation 9e7c4ff5-5e5d-4b1d-b80c-77464e8b511d · outbound

This paper cites An Overview of Universal Obstructions for Graph Parameters.

Unavoidable butterfly minors in digraphs of large cycle rank An Overview of Universal Obstructions for Graph Parameters

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-06T17:15:45.951380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:15:45.951380Z digest=sha256:61389850463560403478d7c12ccfbe1824a83909eeab6363a949ea356ffa81ce

Observation 756c3d02-81cb-474d-abe6-78d3c906eb36 · outbound

This paper cites T hilikos, and Sebastian Wiederrecht.

Unavoidable butterfly minors in digraphs of large cycle rank T hilikos, and Sebastian Wiederrecht

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.372957Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.957364Z digest=sha256:de06b3a996b4af40c2c90b34d4d231c570cd6d63023a77c4edbb015956a9ece3

Observation bff8082a-bf96-4c3a-9867-fe2ea2de920c · outbound

This paper cites Packing directed circuits.

Unavoidable butterfly minors in digraphs of large cycle rank Packing directed circuits

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.332771Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.965475Z digest=sha256:529e7807ef2d2b696b8b451d0c0d6777a0b1c92148616d8cf14fb09aea3871ac

Observation e5e84130-ab17-4de8-9be6-bec068a88c04 · outbound

This paper cites an unresolved cited work.

Unavoidable butterfly minors in digraphs of large cycle rank Unresolved cited work

Reference 39

Resolution
unresolved
raw_fallback, observed 2026-08-06T17:15:46.311493Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.972263Z digest=sha256:5f3294c5e0d5eadcd8f8337cdc0087e85bf2e7a7cf0d7477eec074b50d1d8844

Observation 705aea60-9a60-4c97-ab6c-80ea9c69d5db · outbound

This paper cites an unresolved cited work.

Unavoidable butterfly minors in digraphs of large cycle rank Unresolved cited work

Reference 40

Resolution
unresolved
raw_fallback, observed 2026-08-06T17:15:46.294058Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.979648Z digest=sha256:5dd7c25732cde0da5ffc487d35cf8732b3d4b605c5e51f86170d376ef1f7edf1

Observation 1a668c10-80c9-41d7-8766-2e13ae8c73cb · outbound

This paper cites Linear-time algorithms for NP-complete problems restrict ed to partial k-trees , volume 87-3 of Rep., Akad.

Unavoidable butterfly minors in digraphs of large cycle rank Linear-time algorithms for NP-complete problems restrict ed to partial k-trees , volume 87-3 of Rep., Akad

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.277170Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:45.990534Z digest=sha256:caed7e5338a69af94315122d8334cc3425e5072777c56302406efd708e02ceb6

Observation d4c7ea25-d1be-4098-bff5-2da3fe363146 · outbound

This paper cites The structure of graphs not admitting a fixe d immersion.

Unavoidable butterfly minors in digraphs of large cycle rank The structure of graphs not admitting a fixe d immersion

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.256565Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:46.020502Z digest=sha256:4ef52649862664f4ee382d89ccc782fad5df5f1b37bbef19f5ad085eecdd460b

Observation 8fb0e98c-2a42-4f1d-980c-71e51beb639d · outbound

This paper cites H Younger.

Unavoidable butterfly minors in digraphs of large cycle rank H Younger

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.232606Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:46.028266Z digest=sha256:ecf32a199524dc314d71d4062b8bd18cbc5a95a97dc512fc7bf1c70420020086

Observation 1c70a2e5-dfcd-4d3b-a05b-02de453f4467 · outbound

This paper cites Colouring graphs with bounded generalized colouring number.

Unavoidable butterfly minors in digraphs of large cycle rank Colouring graphs with bounded generalized colouring number

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T17:15:46.209386Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-08-06T17:15:46.036098Z digest=sha256:5ec29cd3c6769bc72880f09f567d50b8fad648f84bc70d5272aae7b009800da7

Pith citing papers

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

An FPT algorithm for cycle rank on semi-complete digraphs cites this paper.

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-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-06-30T02:04:12.183555Z digest=sha256:c290989335893f200d47a567e9bf279cc5d3044bbb73f63b27f3ddbeb61c508c