{"as_of":"2026-08-11T18:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0a40883093ec2520db561834352e7659e69f571ebf5e2154a80895da16d5aaf","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T12:07:20.430583Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"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/2605.27780/citation-record","integrity":"/paper/2605.27780/integrity","json":"/paper/2605.27780/citation-record.json","paper":"/paper/2605.27780"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T12:07:20.430583Z","title":"Partitioning into graphs with only small components.J","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:f19773bfa6cd9a836115b7d573e3538f32881b6b91a6c544044c729b68679967","observation_id":"d2e1a411-79df-4877-9e9f-6424a44c854f","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:5ec737eda9a3a239668c1ad51c1a5fe98691fffb91770b88e4e88133fc5ab46c","observation_id":"a11054e3-ccde-4832-b959-4bed63b3f6c6","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Bodlaender","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:0d9ff291ba88ad97fba95ba16b9d9eb043a5e10dfaa1b59b5c36c4d1aecceb19","observation_id":"f5f8eb69-6e31-4199-ba98-d4f6fcd84b18","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Bodlaender","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:9ac13777243aa678253cefd78e6870a222194ebca4ecb2e2f33f478576aea4b4","observation_id":"fbaa6e20-0d7f-4bfd-b009-55b4ef42687f","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Bodlaender","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:1b51c579641b5c24e55ed40fd447090c8dddc65a37436dff5214f3c86fb16cf7","observation_id":"b3be49d4-81dc-468d-b763-ad14705bad38","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Bodlaender","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:4ac70058ee6105e6548ac7810c8a3714695528a3f9a0b7c1fdaac00d850661f5","observation_id":"cbc18d0d-611d-45dd-843c-abb68edfa10e","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Bodlaender and Joost Engelfriet","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:d857340ffb49f29d436e684374eb60ace4beb9190083be9401bb95451e34ba64","observation_id":"3c63db56-1860-4674-bae1-3fcfe94094b4","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Bodlaender, Carla Groenland, and Hugo Jacob","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:4b5b6e67445e0b8ec44cdc7d8a0c89e42d472c2e2d6a8f7423626624a1d32162","observation_id":"7a1e7150-41d2-4a2e-8c73-e74dcebd4617","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Bodlaender and Jan van Leeuwen","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:5a72cf2144522fb19f6d82e7f1caae387d49441421066a1e74d47f1a04c15eb4","observation_id":"ab787a10-4c5c-4323-8cb1-12c7ae7ebfe6","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Pascal Gollin, Daniel J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:69280c58bd25773d09f3708376c0712e50bce24591eef189d57f06a8e67d1fd4","observation_id":"0a8bcf51-e3fd-4d71-bcd4-c2b2657dca1f","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:24503925f7b74309d65fcaf6df1b4c42d633846c2b4902649e4ae8c34534a975","observation_id":"46b31a0f-0d29-44d1-a406-6bc97542b23f","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Thilikos","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:e18fa5a79872193e91e3be1e3aa50956e103f381d0bba20ef03efc8eacde7af6","observation_id":"3e4ecb73-07b3-4b25-b6b1-55ddf2c7ca63","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Chinn, Jarmila Chvátalová, Alexander K","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:22bd74ca3a16a6671cc1c9ea8015e7cd96ebcf72a9709e1ca1f42c26f130aa5d","observation_id":"e74e8f2b-579a-48de-b2eb-0646bcdfe065","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:541e93fc6da22a78480f97eb68b6a25b9fd7a2f0d6870dfce81dda7474c3f1bb","observation_id":"785d7491-0279-491b-b5a0-b698b2f143c3","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"On the bandwidth problem for graphs","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:0939af290f6401b0e8659131ca211be3b0a92580a80af6d0cec5fb036c8c14dd","observation_id":"8eff31b6-1343-4b54-94aa-17270316c962","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Computing straight-line 3D grid drawings of graphs in linear volume.Comput","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:d380e38d16039c2db2a9a82276e01a3975a755b71a80e5737d0ac633a9fb4e69","observation_id":"37cdfa94-6e41-46e4-8feb-572414c7245a","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Graph theory, vol","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:f93904e1a9fa87806e026047c0ebab07d5a15344113388346d86bd43c0723dbe","observation_id":"188a6b62-1312-4ef5-96c0-f5db2e5db799","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Some results on tree decomposition of graphs.J","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:00468fc643db504e3fd98e1d75b5be4eff1e14f5f353c234fe122a8c361066ee","observation_id":"a9c7139b-aff2-451e-a518-2ece1a95dd91","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"On tree-partitions of graphs","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:ffbd13c5c9e03dd5c04a4c35756345c2051396a4b2089d2f46a049999362019d","observation_id":"dac2e54d-385d-44ba-90a9-d86c7e66cee6","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-10T21:38:54.284645Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"cited_work":{"arxiv_id":"2604.05690","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.05690","snapshot_observed_at":"2026-06-29T12:13:26.912188Z","title":"Tree-partitions and small-spread tree-decompositions","venue":"math.CO","work_id":"fa159ebc-28a9-4222-9618-78d36da12d6c","year":2026},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"cited_paper":"/paper/2604.05690","citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:e87f33b32c4f0f8c673639298eedbf73d106ef37a0f2b48c8a0dc265f5bdd5ea","observation_id":"c80c1e89-79c1-4aaf-af35-e6185a698f72","resolution":{"observed_at":"2026-06-29T12:13:26.913320Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.12028","last_updated":"2023-09-02T12:17:51Z","snapshot_observed_at":"2026-07-06T15:57:16.688338Z","submitted_at":"2023-07-22T09:19:30Z","title":"Size-Ramsey numbers of structurally sparse graphs","version":2},"cited_work":{"arxiv_id":"2307.12028","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.12028","snapshot_observed_at":"2026-06-29T12:13:26.914408Z","title":"Size-Ramsey numbers of structurally sparse graphs","venue":null,"work_id":"8b5efc32-74f4-483b-b788-77f34bb94a93","year":2023},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"cited_paper":"/paper/2307.12028","citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:7d6897133168da70dd448e40bd0a65fb6aed0173b613e41a89a6015810280f75","observation_id":"c9dedcc9-c0f6-4b91-a4a8-72e1f96e4712","resolution":{"observed_at":"2026-06-29T12:13:26.915783Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:9c94ba45761226447f2fe8b12810f5f8d3dd3ed17957aa3cf5206b452b998277","observation_id":"4493777d-ffa3-4412-b85c-86e22096f631","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:7729c63a2f532417a1fc81a39a44642765933713ce6d06965e250009beba51fa","observation_id":"69674ab6-bd99-4df9-b9e0-62d4f27980da","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Quotient tree partitioning of undirected graphs.BIT, 26(2):148–155, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:a689419947cfb918a38b296de1fdd4223c92586a62fd943b1872deff923eff5d","observation_id":"bb71b4e3-78ef-49a1-9694-c0031e66c196","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Ellis, I","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:c89397d1d43de066473dac3f1ed17728f51b07972aed370c1b34a2fcf89c9655","observation_id":"cd965020-6635-46f9-abba-e98872623369","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Fishburn and Raphael A","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:d8fbf2d070b10d2b91f40a99a208dd439f82637bfc2bb2e790b15187cfaf7a84","observation_id":"8f88cb88-0eaf-4a7c-9977-9fa57ba6a606","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Giannopoulou, O-joung Kwon, Jean-Florent Raymond, and Dim- itrios M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:54be90648654721ebc542ebf69b56420aa9cd3a49bef9b782c3b926b2e799a07","observation_id":"3030f029-3f05-49c2-98ea-dfc7b7778115","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Tree-partitions of infinite graphs.Discrete Math., 97:203–217, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:6ec24a9efa514d7f4e879e7b9a9d417118db753b8bb8ced4b28df6931d1b357e","observation_id":"7ac6f97b-c52a-4f75-bcda-4d703f0dac43","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Harvey and David R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:468c1e955517933f30bfc6e5ea8d3adc99b5d6ec2403e97aaabd47943a2f39db","observation_id":"e0af63f0-5c72-4b27-98bd-a4d4bffcb194","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Wood, and Liana Yepremyan","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:0b39d4611a813adf96dad8299e9a53fbe6de17f10de457db3549bbdd486d5ba7","observation_id":"14432bdd-9eaf-4148-b070-a71a6c054f35","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Logical aspects of Cayley-graphs: the group case","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:3a3938f6f1444d62ad90cdea0b7350a718e9fddc136803088b2a0fabf4aecbeb","observation_id":"39a219f4-7170-4e83-a0c9-a90b6c7e0291","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"PartitioningH-minor free graphs into three subgraphs with no large components.J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:b49c028929a58e1c4dd4a4d38c0f16be7ce70825ad74d898390442f15a173569","observation_id":"e413d025-32d4-40c4-b6fc-a76271e7cfe0","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:ec13bede3c473e8ca345d18bf7b8b94f27cda1a6711d348e6c7bed445ec87919","observation_id":"b07688f2-0e7b-41fa-b526-953d9ffcab36","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Thilikos","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:4f753fd5d10fa5e259d71403079183ee690b203a1ce98ad4f15571b086faa1e8","observation_id":"143126a8-9388-46bc-a278-918d84f69cd0","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:cdd8403fd35f02d7ed63ca2cbc77ff2149e0f9e25a421acf7a7639df7b0f0bf4","observation_id":"2a4f2294-fe51-4a28-91ac-9985501af141","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"A linear algorithm for the pathwidth of trees","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:a2ec3e80248ec33e04570fc82f97bc6cb0645d08c6acab33c91c0161662e0fa8","observation_id":"02a6d7fc-16fa-4d4b-9403-e2722d65722d","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Optimal embedding of a tree into an interval graph in linear time","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:cf3335432a19719d23b7827b73289c8e119126feb448416e491230ae4fb4fadf","observation_id":"1ad19549-9f59-44f8-a40b-5fa609041263","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Tree-partite graphs and the complexity of algorithms","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:6be5320bef2890474624d9aa8c486989519d892cb64752b41a0d84576849164e","observation_id":"216a9285-10e9-48ab-88ce-4e3ea7147fd9","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Pathwidth and layered drawings of trees.Internat","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:b707d6320e7510e013965a2e49d05ea47fc71e1aadca9cd7599f6baa3913a5e3","observation_id":"13979f93-48dd-4c27-a204-25dfc35e144e","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:660a7c0df88ed5ae32a1b63e61f433ca10b5566395c678e1162dddfd9b1383b7","observation_id":"e6a83196-cf34-4bda-993d-010c4a276520","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:befc9c3bc8f83a579d85b720272f67bd425ae1a7f8246dadc9ad73e4f8d93106","observation_id":"f706d3eb-18b5-4ed7-b1ce-93a3db85f65d","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","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-06-29T12:07:20.430583Z","title":"Wood and Jan Arne Telle","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T12:07:20.430583Z"},"links":{"citing_paper":"/paper/2605.27780"},"observation_digest":"sha256:650c27e9a8ebe7d67afe87e71ced5edef001f928a0ee2b31f7f624a18398fc90","observation_id":"0c9cd185-0d08-4256-9050-5a66a75d02d0","resolution":{"observed_at":"2026-06-29T12:07:20.430583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-08T19:57:51.478886Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":40,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":42},"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 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2605.27780."}