Pith. sign in

Paper Citation Record · LEDGER

Unavoidable butterfly minors in digraphs of large cycle rank

As of 7 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-07T06:34:17.273281+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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.751711Z digest=sha256:9126719a49f4e55bd10ff6d7f81501567f4eb9109234e9f4e674b13bd62854f1

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.758605Z digest=sha256:49c991bc0d3dd927170adcdb0e487076c507abb591fa4b9b1a0d7551e0db6a15

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.770569Z digest=sha256:2cfba879170f1876a8077c61fcd2a1a49b03804bf9d4a9660918ee8e4882511b

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.791410Z digest=sha256:550dc1f84bf8b0093aac7ae434134e4fe65da5161f9a6a6137668c2b03b1a55a

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.797243Z digest=sha256:5814e0d0aa8e60d816e6f26a655db2379d152193e1d737b38a7fd040774fe085

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.807496Z digest=sha256:8a0f87510b9a28e4f9909603edadf460e92f41cb64a75fc2e4902ea55f6f10b9

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.813362Z digest=sha256:3efe13d10ab66ad7ce16817a3abbea55ad3f551ca1546f1dd90912ebec34b5ab

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.822301Z digest=sha256:8f028e3a1dc7112ac82caf2fc3e70aebce5f0d2564335fd79639b41a5444c155

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.827360Z digest=sha256:0d5886e1c78a9d0e5aa8b55504550c819dcaf46657f8f573eb2c476d3e62d580

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.853300Z digest=sha256:4c69b8776e2bd15e2775a2f52d59d0637bb6fdd9cd2e494b0eaed73971e36440

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.858857Z digest=sha256:69cc7649414e55352ee0eb2bbcb120fce5b8696df944374b30020b38ce1c9692

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.897949Z digest=sha256:66dbb6cf3513eda6f4705dd55ae5b4989519403710e8ff0663fb1c17f16dd0e8

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.944805Z digest=sha256:9916d7657d448409d71bed9275c72af5a5de1fab166af10604ca6a87ba78c898

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-06T17:15:45.979648Z digest=sha256:06927d5290a229b7808cb3097c79bbe6c1221f1eb92aea3d58798f14ede4faf3

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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