Pith. sign in

Paper Citation Record · LEDGER

A simple layered-wheel-like construction

As of 17 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2507.06169.

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

pith.paper-citation-record.v1
2507.06169 v3

Coverage vector

measured 23 of 23 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T19:27:18.850107Z

measured 23 of 23 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+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

23 of 23 outbound references displayed

  • verified exact1
  • verified fuzzy21
  • unresolved1
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 51316712-6454-4361-a900-55f658649379 · outbound

This paper cites On the tree-width of even-hole-free graphs.

A simple layered-wheel-like construction On the tree-width of even-hole-free graphs

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.785537Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:16.692349Z digest=sha256:41461ca32430329400cfb5027febb3940da4feecc742ceb261bda4375620d70c

Observation d44319f5-f472-4cc9-96ad-cd4ab1a944c1 · outbound

This paper cites Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.

A simple layered-wheel-like construction Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.774737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:16.804262Z digest=sha256:e887c8e34bb6c73ca8be1a7a4815be13841dacd7e5dec53fc3abfc7ae0720f7c

Observation ca175e6d-b7f4-4bf8-b2e8-1dbe443f31f9 · outbound

This paper cites Submodular functions and perfect graphs.

A simple layered-wheel-like construction Submodular functions and perfect graphs

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.762714Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:16.923694Z digest=sha256:116a79fb826a1219eaf4e0f6e911336cc23ab8268b3a3786acdc89430002ab4d

Observation d4e7f3b2-608e-4187-8aab-d716c31edd4f · outbound

This paper cites Induced subgraphs and tree decompositions V. One neighbor in a hole.

A simple layered-wheel-like construction Induced subgraphs and tree decompositions V. One neighbor in a hole

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.752128Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:17.047141Z digest=sha256:60fed7d492ca9cf11a508c210db60a66f3302cfc039f3fd58b3c91003a2febd0

Observation 8355d40c-55bb-42b5-a7b4-78f5f816407f · outbound

This paper cites Every Graph is Essential to Large Treewidth.

A simple layered-wheel-like construction Every Graph is Essential to Large Treewidth

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-06T19:27:17.190884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T19:27:17.190884Z digest=sha256:abaed1fdb9dc8fd4b577ee8f9d885e81d1221e08c8653c30cadac5957061162e

Observation fa44a959-9e10-4474-8ff1-274112477ed2 · outbound

This paper cites Induced subgraphs and tree decompositions XIII. Basic obstructions inH-free graphs for finiteH.

A simple layered-wheel-like construction Induced subgraphs and tree decompositions XIII. Basic obstructions inH-free graphs for finiteH

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.741850Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:17.341466Z digest=sha256:4b928954e9298c4b114418a1287908e44529154057556668c294204ef77b8519

Observation 7a28aae5-367c-4ebd-9e82-ff8309628984 · outbound

This paper cites Induced subgraphs and tree decompositions IX. Grid theorem for perforated graphs.

A simple layered-wheel-like construction Induced subgraphs and tree decompositions IX. Grid theorem for perforated graphs

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.731918Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:17.503687Z digest=sha256:8221a4a18b02c195914297ae525f0ff83c676d01e98de755fd2437887e2783d4

Observation 3d606722-9c17-455a-b69a-3e6e6c7d6e38 · outbound

This paper cites Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs.

A simple layered-wheel-like construction Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.723191Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:17.673759Z digest=sha256:01f74dc94d8d93ec9866cfa3735acc390eb152ae73d584862c70511c63b1e721

Observation e3f04792-52e2-4666-b186-4ef3896aeaea · outbound

This paper cites Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.

A simple layered-wheel-like construction Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.703521Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:17.775126Z digest=sha256:99de031bb7009757e1a256f48792ef81b9fc79b7e7d4ae0ecf69b12dee2cb1b7

Observation 29785b00-d3cd-40b3-af26-ff8a3875e574 · outbound

This paper cites Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors.

A simple layered-wheel-like construction Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.490954Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:17.874647Z digest=sha256:09271dfd7971fe8f0dd862c0c3f7634f666097e3ac2ada96f7a0a18d266eb409

Observation 0035bb93-b11f-4553-8e0f-03d8a6c0b8ec · outbound

This paper cites Induced subgraphs and tree decompositions XVII. Anticomplete sets of large treewidth.

A simple layered-wheel-like construction Induced subgraphs and tree decompositions XVII. Anticomplete sets of large treewidth

Reference 11

Resolution
verified exact
raw_fallback, observed 2026-08-06T19:27:19.049119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:17.968832Z digest=sha256:d5e44d6380c4f953b9b681577c4591071dbde4bf526fe08771d7cf594ea5aac5

Observation 8870c1d4-24e7-46ec-b47e-918e22ced411 · outbound

This paper cites On treewidth and maximum cliques.

A simple layered-wheel-like construction On treewidth and maximum cliques

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:21.247602Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.106422Z digest=sha256:cc12dd2137b4428d30e9b397e858b839044aace138e1cc3ce9fd812a0078bfb6

Observation dc20ea76-8b29-4ad7-bb56-08b9c21735f2 · outbound

This paper cites Cygan, F.

A simple layered-wheel-like construction Cygan, F

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:20.972862Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.203417Z digest=sha256:bdc6c4ab7c64489b9388cf0728280ea6188a049eedcd506c5aced585dedf52cd

Observation 20cb789e-891b-4152-8b89-e9617290cf08 · outbound

This paper cites Problem Session.

A simple layered-wheel-like construction Problem Session

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:20.749625Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.311250Z digest=sha256:f3591ed3630542171d90061ae063d932ceb8bf20ce0802acc592395704aaa156

Observation 1488d433-d806-4c5c-9ee2-196b77c87be8 · outbound

This paper cites Coloring polygon visibility graphs and their generalizations.

A simple layered-wheel-like construction Coloring polygon visibility graphs and their generalizations

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:20.430609Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.370758Z digest=sha256:e4a9d84478cdae7e814370c7ef03fdea2ff5ee55a3abe523409ed7d6c5b1f305

Observation a16ceb17-a0db-4764-b1e3-31a1da60423b · outbound

This paper cites Parallel recognition of series-parallel graphs.

A simple layered-wheel-like construction Parallel recognition of series-parallel graphs

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:20.217537Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.457356Z digest=sha256:a92fbc3f92f97ee22ef7cb03e093471925e076c5de0986df7621820e2ba231ef

Observation 0b42a324-01a1-44b1-8a05-0358937c2d42 · outbound

This paper cites Parameters tied to treewidth.

A simple layered-wheel-like construction Parameters tied to treewidth

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:19.927958Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.506865Z digest=sha256:c43b2ed4e778bf1b4c34d65a8a5f25362c92a9c257bc0a3b0d9da60d64163c94

Observation d52bbd16-2357-4743-93d3-abe800c470ed · outbound

This paper cites Grid induced minor theorem for graphs of small degree.

A simple layered-wheel-like construction Grid induced minor theorem for graphs of small degree

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:19.771421Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.568889Z digest=sha256:5ddbf06c6e50420ba7da6738fac3d3540f7d13fe3c20bd7f16c02affa42d030d

Observation be49135b-8cf8-4347-984f-7ea5da758281 · outbound

This paper cites Unavoidable induced subgraphs of large graphs.

A simple layered-wheel-like construction Unavoidable induced subgraphs of large graphs

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:19.615075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.626189Z digest=sha256:102d7bd84c078fbcf3eaeff6283f28740dfe5436eb2e4072038e1299e966b165

Observation f5f823c1-a1f3-4698-a303-cd0cead42085 · outbound

This paper cites Graph minors. II. Algorithmic aspects of tree-width.

A simple layered-wheel-like construction Graph minors. II. Algorithmic aspects of tree-width

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:19.496931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.681478Z digest=sha256:7f92e5cc8f4bfcda4c7cb64e5f56a42557d0d931e04548d7ea35535f46e360f4

Observation 59741ab2-0219-4e42-981c-3b2976501727 · outbound

This paper cites Graph minors. V. Excluding a planar graph.

A simple layered-wheel-like construction Graph minors. V. Excluding a planar graph

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:19.393826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.733346Z digest=sha256:77d7645a7467074fcb64eb8048d206ab28fcadedc63922b76605eb966e703f20

Observation 7da87a0d-6507-46e2-be95-79d5439df410 · outbound

This paper cites (Theta, triangle)-free and (even hole,K4)-free graphs. Part 1: Layered wheels.

A simple layered-wheel-like construction (Theta, triangle)-free and (even hole,K4)-free graphs. Part 1: Layered wheels

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:19.274933Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.792892Z digest=sha256:78e606ca97edd79439b85450d22ab56df328efd8e2c044233846204111007b16

Observation 5cea4eed-7cf0-4231-969d-fc7dd14d60ca · outbound

This paper cites Trotignon.

A simple layered-wheel-like construction Trotignon

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T19:27:19.171454Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-06T19:27:18.850107Z digest=sha256:65ff2b02ed892555cc0faf19ed646783718c5d3189f56d7b72fda5233b105453

Pith citing papers

No inbound Pith citation observations are available.