{"as_of":"2026-08-11T19:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:32d8e944eeea26332beed12075289082672bf06c2a550a7ccc224c146a1002c1","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T05:07:02.564638Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.27601/citation-record","integrity":"/paper/2607.27601/integrity","json":"/paper/2607.27601/citation-record.json","paper":"/paper/2607.27601"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.13684","last_updated":"2025-04-03T14:12:51Z","snapshot_observed_at":"2026-08-10T20:39:11.572129Z","submitted_at":"2023-07-25T17:42:53Z","title":"Induced subgraphs and tree decompositions X. Towards logarithmic treewidth for even-hole-free graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13684","snapshot_observed_at":"2026-08-01T05:07:02.436553Z","title":"Induced subgraphs and tree decompositions X","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.436553Z"},"links":{"cited_paper":"/paper/2307.13684","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:6003b87b86ed195a59685ae0ad4d926ca58d669867a603f6b5a4df30da350186","observation_id":"dfd9ccc6-24ea-4185-9a66-f67a073c58d2","resolution":{"observed_at":"2026-08-01T05:07:02.436553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.440301Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.440301Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:55ee8983b04d2be5d774f14c50d344d72d6bdd217de3ca539d2843530e2e2d1e","observation_id":"0a76f0e1-a3f5-4ec3-aeb6-5e0aade2a3d6","resolution":{"observed_at":"2026-08-01T05:07:02.440301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.443060Z","title":"Bounded-diameter tree-decompositions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.443060Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:3019fa06c488389ecc22687f99475cae366fbde83b6e05203cf485faa318a1ca","observation_id":"aac0a803-2185-49da-ae84-1d016f7a8e5b","resolution":{"observed_at":"2026-08-01T05:07:02.443060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.445956Z","title":"Drawing planar 3-trees with given face areas","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.445956Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:f1c54012181d1416edcde5f7fa099594b7658221740d3d6ca77e0ebe02ac8b6f","observation_id":"f06e2538-aa65-4957-9145-8aacf73896c7","resolution":{"observed_at":"2026-08-01T05:07:02.445956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.448574Z","title":"Quickly excluding a forest","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.448574Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:fc605fbf2b5d9f9ed57189cd189cf879ad60270300bf9335ffb6f36ba45a0971","observation_id":"1f8176da-c379-49df-88c6-e5fe1818087a","resolution":{"observed_at":"2026-08-01T05:07:02.448574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.451267Z","title":"Bodlaender","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.451267Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:304046267763232788f6287c1135fbafe71b06755e7ea45d95db752404945678","observation_id":"00cea719-25bb-4178-9792-a8b0df0d5819","resolution":{"observed_at":"2026-08-01T05:07:02.451267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14211","last_updated":"2024-05-03T18:23:38Z","snapshot_observed_at":"2026-08-10T20:39:19.418730Z","submitted_at":"2024-02-22T01:32:15Z","title":"Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14211","snapshot_observed_at":"2026-08-01T05:07:02.454133Z","title":"Induced subgraphs and tree decompositions XV","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.454133Z"},"links":{"cited_paper":"/paper/2402.14211","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:f0de99d67a7ef18df6fb957326e330d6a14cb6621778d9b88f5d41f3e731f9ef","observation_id":"93c3a76f-cb93-45d8-ae02-7d993bf94edb","resolution":{"observed_at":"2026-08-01T05:07:02.454133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.456898Z","title":"Towards tight(er) bounds for the excluded grid theorem","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.456898Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:0cc4c2043f7b3e7d78d5fa7e52dc31ec64fa60271342af166f81a1aa7c4184e2","observation_id":"9c69424f-8991-4e73-b74a-e70cf4c6a4d2","resolution":{"observed_at":"2026-08-01T05:07:02.456898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.459274Z","title":"To approximate treewidth, use treelength! SIAM J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.459274Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:c0e6333d75a02349906bbeecc86f37abdf3507b0138e3c1e1ca3a9dee941f9f2","observation_id":"207928c9-a799-42de-be7b-f4a7620a8898","resolution":{"observed_at":"2026-08-01T05:07:02.459274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.461807Z","title":"Treewidth versus clique number","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.461807Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:097d45091fc6e399e9ad5b6357710e39419082fce4310e1cc23e7ed7897b1244","observation_id":"0f434cf5-4533-4d96-931d-81db8d0e778f","resolution":{"observed_at":"2026-08-01T05:07:02.461807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.464338Z","title":"Non-separating planar graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.464338Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:33cc27b3b1cdf6c5c53718a84bb324a6fddd7b4d509bb460382cbdc9d0a60667","observation_id":"2221ab6f-c03c-4065-8649-726f59cd5318","resolution":{"observed_at":"2026-08-01T05:07:02.464338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.467061Z","title":"Graph theory, vol","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.467061Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:acffd87bc1b7318659d8834fc6d5c06d29df883905dbb60bafd9461e4f88f8da","observation_id":"f1e349da-57a1-422e-8fe1-2b3cc5bf1d1f","resolution":{"observed_at":"2026-08-01T05:07:02.467061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.469753Z","title":"A short proof for lean tree-decompositions.Combin","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.469753Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:ad9362f96c8708977b4268573bbddf602fc224da700361f2bdce16780ec616ed","observation_id":"a8af95b1-513c-41fb-bb77-9473e1c9ff2d","resolution":{"observed_at":"2026-08-01T05:07:02.469753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.472252Z","title":"Connected tree-width","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.472252Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:9ed3d18340cf3fadc907a7b213e29597827cc2b9bedcf5d0638e8ae35aee7668","observation_id":"f920e4db-2597-4432-9048-f4169a857ba2","resolution":{"observed_at":"2026-08-01T05:07:02.472252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.474602Z","title":"Tree-decompositions with bags of small diameter","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.474602Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:1f0f3abc17781ab23abd50e9a863a11a0f03867dab2ad60e1a88e444ada83f49","observation_id":"e1b765a2-d197-4379-bd16-c6bbc3e64d6f","resolution":{"observed_at":"2026-08-01T05:07:02.474602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05661","last_updated":"2025-03-31T21:44:54Z","snapshot_observed_at":"2026-08-07T17:21:25.899142Z","submitted_at":"2025-03-07T18:23:40Z","title":"Graph parameters that are coarsely equivalent to path-length","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.05661","snapshot_observed_at":"2026-08-01T05:07:02.477011Z","title":"Dragan and Ekkehard Köhler","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.477011Z"},"links":{"cited_paper":"/paper/2503.05661","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:e917f3392e2b66e7eb68b3043c1901237a327eb689d784757f77eec02fdea024","observation_id":"7a67f984-0b44-4bb0-bb6d-b909f7a46bcc","resolution":{"observed_at":"2026-08-01T05:07:02.477011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.03163","last_updated":"2026-07-16T21:33:03Z","snapshot_observed_at":"2026-08-06T20:14:21.070622Z","submitted_at":"2025-07-03T20:43:42Z","title":"3-Colouring Planar Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.03163","snapshot_observed_at":"2026-08-01T05:07:02.479725Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.479725Z"},"links":{"cited_paper":"/paper/2507.03163","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:4e0f9b6e32d2b7ea2ec7d34a94ac28f8feef2141e1ea7951238ad375fe25654a","observation_id":"b7c627d0-f6ae-4353-8742-67c2aff5951d","resolution":{"observed_at":"2026-08-01T05:07:02.479725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.482439Z","title":"A short derivation of the structure theorem for graphs with excluded topological minors.SIAM J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.482439Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:1d61754c80fe959f01e130129dbafa144f5b3fdb264bc8d2a164c24d8a079dc1","observation_id":"36655be4-4bed-4c11-8500-125dc13b6039","resolution":{"observed_at":"2026-08-01T05:07:02.482439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.484873Z","title":"A combinatorial theorem.J","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.484873Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:c53c5ab67f5feb12ac64481c00d7ccce8d24473885fa9afc8843fed50d3638f8","observation_id":"3b74d371-1006-497d-9ef1-99afd542cc25","resolution":{"observed_at":"2026-08-01T05:07:02.484873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.487134Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.487134Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:8525a0cb9c35f9af1b6fca7bb792e16b697685cd222e9205befeb6ac24969d8a","observation_id":"3b034c23-c0f5-4117-acb0-13422a122359","resolution":{"observed_at":"2026-08-01T05:07:02.487134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.489559Z","title":"Tree-width and large grid minors in planar graphs.Discrete Math","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.489559Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:879c7eea7b3bac9526376314d1b037f4a406ecb4c1680a693596ef3189de91cd","observation_id":"914ef56e-3ace-443f-9418-9d006fcb34f2","resolution":{"observed_at":"2026-08-01T05:07:02.489559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.491972Z","title":"Harvey and David R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.491972Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:8700486328eda5ce15ee020a288c832afdf1741e6d6856f7fd8c2d876627138c","observation_id":"a0e5a400-92cf-479f-8ff7-8a5011f1e85c","resolution":{"observed_at":"2026-08-01T05:07:02.491972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.494330Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.494330Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:5c22e9796d3758612769c0ed34fa53e94bb04c49c1c7917711cf6706d7a1181c","observation_id":"95bc5203-f5e9-4dcc-860b-4be20366eedc","resolution":{"observed_at":"2026-08-01T05:07:02.494330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.10840","last_updated":"2025-08-20T11:19:01Z","snapshot_observed_at":"2026-08-10T18:53:30.590950Z","submitted_at":"2025-01-18T18:22:08Z","title":"Graphs that are quasi-isometric to graphs with bounded treewidth","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.10840","snapshot_observed_at":"2026-08-01T05:07:02.496596Z","title":"Graphs quasi-isometric to graphs with bounded treewidth","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.496596Z"},"links":{"cited_paper":"/paper/2501.10840","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:e6c50e4196474ab7a1adfbc4a26df87f2494c2b6f19ee07e4169aee23b4365a4","observation_id":"5f7cda47-1a49-4080-b50b-83f14e311229","resolution":{"observed_at":"2026-08-01T05:07:02.496596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.499253Z","title":"Seweryn, and Paul Wollan","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.499253Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:ca294d9cfb71e28321a566f485c9cb8378d59346c6af8db7c21e4e8d54370888","observation_id":"68090105-0651-4484-ad08-1ad87d70a303","resolution":{"observed_at":"2026-08-01T05:07:02.499253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.501591Z","title":"Tree-chromatic number is not equal to path-chromatic number","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.501591Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:e3f3ddd092a18114d019dd51f84ccac81addb8b1925197422442e8fd3d206a6d","observation_id":"b24b5958-521a-4b34-8f2f-279f95e91dfe","resolution":{"observed_at":"2026-08-01T05:07:02.501591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.504143Z","title":"Wood, and Liana Yepremyan","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.504143Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:6fdf1c81f18e7d25e5cc5f7aea5d9daeaf239b5b7463522eaa96e93fd458db64","observation_id":"2f3f3b9d-b919-4c8e-a623-992e0162c2e7","resolution":{"observed_at":"2026-08-01T05:07:02.504143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.506690Z","title":"Kostochka","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.506690Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:00759f47c3d86c12af9e8703c6c382cca827d374054515dddd803d40fbb9533d","observation_id":"9f1579d4-ce3b-4a94-a5d6-8aef230594ac","resolution":{"observed_at":"2026-08-01T05:07:02.506690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.509094Z","title":"Kostochka","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.509094Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:4ce58edb2d0286a00531a3e3b6f69a08e912386b587e5ebbc5d99f03eeec68ca","observation_id":"2009fe54-a745-4876-a57f-0ffecc08e52c","resolution":{"observed_at":"2026-08-01T05:07:02.509094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.511426Z","title":"On the relation between treewidth, tree-independence number, and tree-chromatic number of graphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.511426Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:392c0eac6c8fa75d27a1b0b191456fe3602c5a6cafdae57be524dea11e388efb","observation_id":"f7df4a7c-6fb3-402c-816b-51f1ee8e82ed","resolution":{"observed_at":"2026-08-01T05:07:02.511426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20333","last_updated":"2024-10-27T04:22:44Z","snapshot_observed_at":"2026-08-02T02:00:01.801447Z","submitted_at":"2024-10-27T04:22:44Z","title":"Product Structure and Tree-Decompositions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20333","snapshot_observed_at":"2026-08-01T05:07:02.513807Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.513807Z"},"links":{"cited_paper":"/paper/2410.20333","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:4141ac84df4bd77b325679545252241093aae5b9d571cfe26be55e8132fda9f0","observation_id":"71d11600-90f5-4f0c-9aba-9d167d684eff","resolution":{"observed_at":"2026-08-01T05:07:02.513807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.516546Z","title":"Homomorphiesätze für Graphen.Math","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.516546Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:69427596bd5a11ad9a66792400c8811a7d006eb2c90ad69e0d3d87b2a09da33e","observation_id":"561ffb2a-0613-4b8f-b86f-574232bd386c","resolution":{"observed_at":"2026-08-01T05:07:02.516546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.518924Z","title":"Graphs on surfaces","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.518924Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:293c9480f6777acf275419f4e2f9fb076ad5f5376c54c02fb8ee69f673e84f7a","observation_id":"5d40c465-4318-4494-8eb4-c289b61788e7","resolution":{"observed_at":"2026-08-01T05:07:02.518924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.521283Z","title":"The extremal function for noncomplete minors","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.521283Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:557d16243f682cb4f9331116e5ad4f96715d77bcc8efe6fc11806083c2fd14f7","observation_id":"049b06fc-dd9d-4f52-ab49-9f6e0b06f072","resolution":{"observed_at":"2026-08-01T05:07:02.521283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1211.7353","last_updated":"2015-10-14T11:25:18Z","snapshot_observed_at":"2026-08-10T14:45:00.157055Z","submitted_at":"2012-11-30T19:50:07Z","title":"Connected tree-width","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1211.7353","snapshot_observed_at":"2026-08-01T05:07:02.523694Z","title":"Connected tree-width","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.523694Z"},"links":{"cited_paper":"/paper/1211.7353","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:897fcaf3a718ee0eaad23eb411164af06097fb6e3891782e0b59dff145d9368d","observation_id":"85de02fa-14de-492f-b4bc-bf642d0f6cfc","resolution":{"observed_at":"2026-08-01T05:07:02.523694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.526414Z","title":"Sparsity, vol","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.526414Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:053df4c8351dbbe1f3edc4898086ecc54ad88c561294f503a45bbba5c5ce269c","observation_id":"2f6d4cfc-c297-4515-bdba-b8a9d0ba9fe9","resolution":{"observed_at":"2026-08-01T05:07:02.526414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.09839","last_updated":"2026-07-31T22:59:13Z","snapshot_observed_at":"2026-08-10T19:35:26.977403Z","submitted_at":"2025-01-16T20:57:17Z","title":"Asymptotic structure. I. Coarse tree-width","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.09839","snapshot_observed_at":"2026-08-01T05:07:02.528824Z","title":"Asymptotic structure","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.528824Z"},"links":{"cited_paper":"/paper/2501.09839","citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:5b2a1b645f751b66392b8a5e0f2e6b093c5c5978eb0dce6523baeaf4ce0eb8de","observation_id":"46ee67ed-887e-440b-83f9-9ca45bd6e8fb","resolution":{"observed_at":"2026-08-01T05:07:02.528824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.531312Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.531312Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:62fa9aece428a52c96b0d7ce9a4defd86dc42dd2602962363563be1d3fb3b697","observation_id":"0a21a3c2-b22a-46e0-a7ed-12f3801cd0e6","resolution":{"observed_at":"2026-08-01T05:07:02.531312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.533689Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.533689Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:6c732c3df989afd0424690d7596d2341726c70e3179b7de918926177d44bd707","observation_id":"1025c4a5-00fd-4310-a6ad-5a859568a0e1","resolution":{"observed_at":"2026-08-01T05:07:02.533689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.536011Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.536011Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:81f5fff3cb18c93ebbaa3cfe40fd890bbe2a1b6e679ff6bf114d4ed8cc113e59","observation_id":"1daceff6-43a4-4099-937d-b1ee792b65fc","resolution":{"observed_at":"2026-08-01T05:07:02.536011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.538285Z","title":"Graph minors","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.538285Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:4d6bdb0718fae2395f611d8c432aedd9475092da4e3260cff1875dbc06882334","observation_id":"331dfae1-476f-4b29-990a-76b282af19c3","resolution":{"observed_at":"2026-08-01T05:07:02.538285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.540601Z","title":"Graph minors","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.540601Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:9d399a4a169c35039a182cdad39059df744b63c2173f7063202f35b39665848e","observation_id":"492a2a55-cb58-4554-942c-7efc41be63f1","resolution":{"observed_at":"2026-08-01T05:07:02.540601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.542943Z","title":"Graph minors","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.542943Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:2cd28b698685412c814f75444e15a54806e6127cd20cc658f3e183c64aadb910","observation_id":"d02e1ef3-d712-49a9-b230-f9c0efdb637b","resolution":{"observed_at":"2026-08-01T05:07:02.542943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.545446Z","title":"Quickly excluding a planar graph.J","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.545446Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:07625932f76e4a568941e0269ba9494ad6dbaf6259085c7c2785eb659822c5cc","observation_id":"cc7b8db9-f689-410b-b595-6f3d21766c98","resolution":{"observed_at":"2026-08-01T05:07:02.545446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.547763Z","title":"Die baumweite von graphen als ein maß für die kompliziertheit algorithmischer probleme","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.547763Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:29f349e6c04eab3a730a52396d82d3b35693411c9b0f7d53e3ff7e076fa6cedc","observation_id":"826ebef4-9ead-4850-b071-a33184d92ef2","resolution":{"observed_at":"2026-08-01T05:07:02.547763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.549990Z","title":"Tree-chromatic number.J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.549990Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:9ee73994f5b752622c2c46745a341afcda2a4979695b39b851918bba081dcbe0","observation_id":"609960e3-032c-454b-9866-4d20b9d7d1cc","resolution":{"observed_at":"2026-08-01T05:07:02.549990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.552365Z","title":"A Menger-like property of tree-width: The finite case.J","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.552365Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:f1321a211d2061f06bcf1066bf83884ab82c5cf3da58ded9e98a3796fa6f97bc","observation_id":"ea0f1123-b342-4f00-a8ec-445f6f6ff1d9","resolution":{"observed_at":"2026-08-01T05:07:02.552365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.554753Z","title":"An extremal function for contractions of graphs.Math","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.554753Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:50ceabe2eb31bd79b923954a23a63fd008fa8fef5e85ed32922a27bf352d0a42","observation_id":"c0c75491-ad77-45aa-b968-b077005e5d90","resolution":{"observed_at":"2026-08-01T05:07:02.554753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.557068Z","title":"The extremal function for complete minors.J","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.557068Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:e087a610df8e58ff67a8b2db4a75910460fe62bef7850a59f887b96209a7d320","observation_id":"95967383-e3f6-44a8-b32c-3d5293a2dc50","resolution":{"observed_at":"2026-08-01T05:07:02.557068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.559451Z","title":"On the extremal function for graph minors.J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.559451Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:e70b4582460382da95e67961337d2a285fc3f5984da06fb36bffca4b4a404065","observation_id":"3de6b7ef-d202-4462-ab88-a0c67e32c5d9","resolution":{"observed_at":"2026-08-01T05:07:02.559451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.561994Z","title":"On the block number of graphs.SIAM J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.561994Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:18bdbfb1c8d5f29e693394979d0d3e2407f98269b9996bb175aeeeff49023088","observation_id":"a5946f16-211a-4aab-a7f1-ab35eadddc61","resolution":{"observed_at":"2026-08-01T05:07:02.561994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:07:02.564638Z","title":"Minor-matching hypertree width","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T05:07:02.564638Z"},"links":{"citing_paper":"/paper/2607.27601"},"observation_digest":"sha256:221c46bbb5d16b84df1c618871244bacadf29f7282f0a2c2df73292957d6f509","observation_id":"00684a7f-7f14-44d3-b1eb-1e4dedccb580","resolution":{"observed_at":"2026-08-01T05:07:02.564638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27601","last_updated":"2026-07-30T02:43:49Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-08T00:32:58.575488Z","submitted_at":"2026-07-30T02:43:49Z","title":"Optimal tree-decompositions with bags of bounded pathwidth"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":52},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2607.27601."}