Pith. sign in

Paper Citation Record · LEDGER

Unavoidable butterfly minors in digraphs of large cycle rank

As of 20 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-20T06:33:59.587034+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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.751711Z digest=sha256:897ea139643b831f2d3852fc44f7fd5b81f6b3eb105dd48b6f527233aca9161a

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.758605Z digest=sha256:2f62c95efbb3681513e95dd181d467bea16d7faff00c5083f4db1df6db48b3af

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.764577Z digest=sha256:541e77d4b9a6ebcb923ad2a8fcb3cffc9d04249af4a2aa588f1fcf6e5e43616f

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.770569Z digest=sha256:360966900be555197d840d48e6558681f704ce55c5931c38f4574e1b5839fdfa

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.791410Z digest=sha256:50bddf2b62301fa1fd6908ed71bf373d3c24870adbd08273e1b728474ed80b3d

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.797243Z digest=sha256:48110521f659d11d142f7648ec6bd004662c82fbdadfbdb0a225a34475fc4202

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.807496Z digest=sha256:0922f3bb33562affe1ffce872b6770fd291ed1483cddcad2f4199b025332c0fd

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.822301Z digest=sha256:4c1a13cfc23d1f3316967727c1d40ba5c20f7a21eb297fb5d42e313a476e9cb9

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.827360Z digest=sha256:52c919efe889241eaa842ceb5e52374c9a6acac723bc58324aa9fb0ba3406824

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.848119Z digest=sha256:2accbfe21667fafa4e71c65e2411b94b0c53d1ee2b3cb696ad381be8622b6e19

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.853300Z digest=sha256:0cd13832938896d9ab89ea9ced3154f9eaba738b272984bb5695e91a9ee7bf47

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.858857Z digest=sha256:702a4b68ffa84ad24965099df5dfdb34c9a8c6f72053cdda6ed01e8163f78973

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.875550Z digest=sha256:8457e59e46c134a79e6885c9ad6211e86f1ba433d8f5761dab736d0be0650611

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.887315Z digest=sha256:0c404c992ab9d3bf72195826fb078633576f1d6635fb10ef88ac23593463d2b1

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.897949Z digest=sha256:3adea3dec82074692c77a66dc38b13b81e6bdfaf03cc64225f2da232e9be132d

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.902882Z digest=sha256:49596b54558a4ae9ebc758244209e1050608f70accdf2956fbe0e3e65f2e75dd

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.907892Z digest=sha256:354f43be2aa55a6969ff5b74a42ce4b04475dfe13f7ac908b67c7fcbe3edba0f

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.913389Z digest=sha256:423f8938fa82b464c9d9625eb124f888938cd0b7829172773a80e00fe502e2b1

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.919859Z digest=sha256:28ccf9729d7ea54698e704e63c043ff362f9355d1e7cf4517a2b5196b610e040

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.944805Z digest=sha256:20e633355f6dab1e91698e10be33e6efd026a8df648d2325016812ba5cba9c10

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:9d087bb458ef822ae63b978eae5127a3e098df98d182a4bf41ca1dc2eee29de3

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.965475Z digest=sha256:42821db8bfddf5fc511d4614912595ad89082d7407678a9b3b1d5631dba13e54

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-06T17:15:45.979648Z digest=sha256:2af864c20fd0d2cac5746c3df1ea6431b340c1bd1e21eb2a46b9b1b31bab7a83

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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