Paper Citation Record · LEDGER

Excluding paths and bicliques

As of 10 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.13995.

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

pith.paper-citation-record.v1
2607.13995 v1

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T03:16:32.421510Z

measured 30 of 30 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+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

30 of 30 outbound references displayed

verified exact8
verified fuzzy0
unresolved16
parse uncertain0
malformed identifier6
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ea2d2612-5cc7-44ea-a024-3d89b10cfd8b · outbound

This paper cites Lozin, and Igor Razgon.

Excluding paths and bicliques Lozin, and Igor Razgon

Reference 1

Resolution: malformed identifier; no resolver link, observed 2026-08-02T03:16:32.334148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e77e30d-f77c-45ce-8439-862500920c97 · outbound

This paper cites Awesomegraphparameters.

Excluding paths and bicliques Awesomegraphparameters

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.338350Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41c66e4d-67e5-4f74-ac6d-f3ae665d2bf8 · outbound

This paper cites Tree-independence number of $P_5$-free graphs with no large bicliques.

Excluding paths and bicliques Tree-independence number of $P_5$-free graphs with no large bicliques

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.341360Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6bc63b0a-60ea-43ba-a9e7-e760a97268a8 · outbound

This paper cites Bodlaender.

Excluding paths and bicliques Bodlaender

Reference 4

Resolution: malformed identifier; no resolver link, observed 2026-08-02T03:16:32.345172Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c5af4f4-5b55-47b9-81a1-59dbfd23d937 · outbound

This paper cites On poly- nomial degree-boundedness.Adv.

Excluding paths and bicliques On poly- nomial degree-boundedness.Adv

Reference 5

Resolution: verified exact; doi, observed 2026-08-02T03:19:06.602410Z

Source-reported events for the cited work

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

Observation 801e9b33-57ab-4469-b4d7-58bf8d671f95 · outbound

This paper cites Separating polyno- mialχ-boundedness fromχ-boundedness.Combinatorica, 44(1):1–8, 2024.

Excluding paths and bicliques Separating polyno- mialχ-boundedness fromχ-boundedness.Combinatorica, 44(1):1–8, 2024

Reference 6

Resolution: verified exact; doi, observed 2026-08-02T03:19:06.476088Z

Source-reported events for the cited work

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

Observation 169e968d-3331-4462-9546-8a131833b3de · outbound

This paper cites Pascal Gollin, Martin Milanič, and Varun Sivashankar.

Excluding paths and bicliques Pascal Gollin, Martin Milanič, and Varun Sivashankar

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.355631Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a543a177-8054-4918-8544-d317e086fe2a · outbound

This paper cites Tree independence number V. Walls and claws.

Excluding paths and bicliques Tree independence number V. Walls and claws

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.358571Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd3474be-5806-4bc6-be8c-a6f1d8a14b61 · outbound

This paper cites Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth.

Excluding paths and bicliques Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.361550Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7fd6006b-f08a-4292-9109-b2f4bfbbbba3 · outbound

This paper cites On treewidth and maximum cliques.Innov.

Excluding paths and bicliques On treewidth and maximum cliques.Innov

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.364616Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb73a501-88ef-4fad-bf5f-a4842222db92 · outbound

This paper cites Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star.

Excluding paths and bicliques Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.367422Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 55bb1801-2503-44b3-8acd-00cc1ed086c7 · outbound

This paper cites Treewidth versus clique number.

Excluding paths and bicliques Treewidth versus clique number

Reference 12

Resolution: verified exact; doi, observed 2026-08-02T03:19:06.367412Z

Source-reported events for the cited work

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

Observation e6433736-836c-4269-a8fc-b6788b600d5e · outbound

This paper cites Long induced paths in sparse graphs and graphs with forbidden patterns.

Excluding paths and bicliques Long induced paths in sparse graphs and graphs with forbidden patterns

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.374070Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5da1c5b5-dec1-453a-ad1d-03169fc9bd13 · outbound

This paper cites Erdös and G.

Excluding paths and bicliques Erdös and G

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.377150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d1c5ae3-1773-445a-85b5-cf74cad92c0c · outbound

This paper cites Galvin, I.

Excluding paths and bicliques Galvin, I

Reference 15

Resolution: malformed identifier; no resolver link, observed 2026-08-02T03:16:32.380286Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38050437-5b96-41ac-9785-7d57f51c94ee · outbound

This paper cites Induced subdivisions inKs,s-free graphs with polynomial average degree.International Mathematics Research No- tices, 2025(4):rnaf025, 02 2025.doi:10.1093/imrn/rnaf025.

Excluding paths and bicliques Induced subdivisions inKs,s-free graphs with polynomial average degree.International Mathematics Research No- tices, 2025(4):rnaf025, 02 2025.doi:10.1093/imrn/rnaf025

Reference 16

Resolution: verified exact; doi, observed 2026-08-02T03:19:06.260338Z

Source-reported events for the cited work

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

Observation aa60e4e1-1f72-4063-a4d6-39d360c0293b · outbound

This paper cites Polynomial bounds for pathwidth.

Excluding paths and bicliques Polynomial bounds for pathwidth

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.385454Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e09880d-039f-4403-b2e2-15e15fbcac91 · outbound

This paper cites Tree-alpha and excluding finitely many graphs.

Excluding paths and bicliques Tree-alpha and excluding finitely many graphs

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.388019Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7683f577-91b3-4c02-b515-2daaeb6761a7 · outbound

This paper cites Complexity of coloring graphs without paths and cycles.Discrete Appl.

Excluding paths and bicliques Complexity of coloring graphs without paths and cycles.Discrete Appl

Reference 19

Resolution: malformed identifier; no resolver link, observed 2026-08-02T03:16:32.390679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c30d4581-b8bd-47d1-85b1-b03ca5d826a1 · outbound

This paper cites Treewidth versus clique number.

Excluding paths and bicliques Treewidth versus clique number

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.393266Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0c9097e-cccc-42a9-92c7-f64509ec34db · outbound

This paper cites Long induced paths in minor- closed graph classes and beyond.Electron.

Excluding paths and bicliques Long induced paths in minor- closed graph classes and beyond.Electron

Reference 21

Resolution: malformed identifier; doi_truncated, observed 2026-08-02T03:19:06.187244Z

Source-reported events for the cited work

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

Observation 6b189061-5cf3-47aa-8ac3-278c407162a0 · outbound

This paper cites Long induced paths inK s,s-free graphs.Journal of Graph Theory, 2026.

Excluding paths and bicliques Long induced paths inK s,s-free graphs.Journal of Graph Theory, 2026

Reference 22

Resolution: verified exact; doi, observed 2026-08-02T03:19:06.109474Z

Source-reported events for the cited work

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

Observation f41a5cfe-8144-4f93-a48d-9ebe2858519d · outbound

This paper cites A polynomial-time algorithm for the in- dependent set problem in{P 10, C4, C6}-free graphs.

Excluding paths and bicliques A polynomial-time algorithm for the in- dependent set problem in{P 10, C4, C6}-free graphs

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.402353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0caf77a7-f5ee-4170-b37e-b2ceb7e10784 · outbound

This paper cites Certifying coloring algorithms for graphs without long induced paths.Discrete Appl.

Excluding paths and bicliques Certifying coloring algorithms for graphs without long induced paths.Discrete Appl

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.404942Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00d2b1ea-45a9-4a04-a027-58e2dfaafe79 · outbound

This paper cites Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, and Kenny Štorgel.

Excluding paths and bicliques Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, and Kenny Štorgel

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.407966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97b932d1-68eb-43e7-844d-5be6c44d6cbb · outbound

This paper cites Some results on graphs without long induced paths.Inform.

Excluding paths and bicliques Some results on graphs without long induced paths.Inform

Reference 26

Resolution: verified exact; doi, observed 2026-08-02T03:19:05.995014Z

Source-reported events for the cited work

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

Observation 7c29e55f-55d5-4688-ad99-8fad80e858f1 · outbound

This paper cites Springer, Heidelberg, 2012.doi:10.1007/ 978-3-642-27875-4.

Excluding paths and bicliques Springer, Heidelberg, 2012.doi:10.1007/ 978-3-642-27875-4

Reference 27

Resolution: malformed identifier; no resolver link, observed 2026-08-02T03:16:32.413260Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4c0f58e-fa92-4f32-8267-857dd3259201 · outbound

This paper cites an unresolved cited work.

Excluding paths and bicliques Unresolved cited work

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-02T03:16:32.415916Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3fb3d870-a33f-464c-a649-e5b5dfa49d18 · outbound

This paper cites an unresolved cited work.

Excluding paths and bicliques Unresolved cited work

Reference 29

Resolution: verified exact; doi, observed 2026-08-02T03:19:05.821698Z

Source-reported events for the cited work

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

Observation 07ffc0b8-c782-4813-b204-fab6612bd0ce · outbound

This paper cites Minor-matching hypertree width.

Excluding paths and bicliques Minor-matching hypertree width

Reference 30

Resolution: verified exact; doi, observed 2026-08-02T03:19:05.658088Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.