{"as_of":"2026-08-19T14:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:841f0c90d0de479be6e7274adb81d823dfdcb7d34ae0ec3a2f2baf93aa5b82c9","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T19:47:22.954226Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:57:01.070711Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-06-29T12:13:26.912188Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","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-16T17:52:41.735211Z","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:2c989e5f5ae1086b60ef2d05aea66fdfd4518f0c4632b23e24fb68b5f712245e","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-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.05690","snapshot_observed_at":"2026-08-16T00:57:01.070711Z","title":"Distel, N","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.070711Z"},"links":{"cited_paper":"/paper/2604.05690","citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:2e9d3c620449368558614ec0b6ce8a4834f04176bc4f7adaeb7345811f052682","observation_id":"044e7124-1c23-402f-b908-0aa629bba620","resolution":{"observed_at":"2026-08-16T00:57:01.070711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.05690/citation-record","integrity":"/paper/2604.05690/integrity","json":"/paper/2604.05690/citation-record.json","paper":"/paper/2604.05690"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Partitioning into graphs with only small components","venue":null,"work_id":"8d360953-6bd3-46bf-86b5-66614d499d8c","year":2003},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:57f8d28d6f52c2395a324af266b6dd227574fa5ff0494c81ea516ebe900f06f7","observation_id":"cfa592a0-54b4-4c1b-ad9f-b791001ee27c","resolution":{"observed_at":"2026-05-16T03:57:17.300729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A separator theorem for nonplanar graphs","venue":null,"work_id":"ec8e5ac4-a1b4-4276-8c70-69eba7ebb489","year":1990},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:c0b75982d59a8a2c9e6a9fa27712486e6f0a0f88d9645ff38e3e89febd8e0af0","observation_id":"3712b0f2-1bad-4d5d-8292-d3e2423c09d9","resolution":{"observed_at":"2026-05-16T03:57:17.313225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Upperbound for max degree of k-tree completion","venue":null,"work_id":"7ed55247-4f96-4cbd-87c6-798e48734cda","year":2020},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:22afb72f5c89c30b2a33765571b4cc982fbfcb92e9e2a08114e7ce3bb75d63d8","observation_id":"4efa3c5f-ecad-4fa9-a873-321377e3dfc0","resolution":{"observed_at":"2026-05-16T03:57:17.292888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e79dc92d-e91e-4489-9487-79d8b6bf3f22","year":2008},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:424552f9dc362ad15ad1a1d767ecdca2dc42558a33c70e4042fa19ff3ce0b5a2","observation_id":"f139ad8d-fbb3-485e-9384-9f5713ce9cc6","resolution":{"observed_at":"2026-05-16T03:57:17.280256Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0c70454f-2b67-4dd7-9d4f-c7c0f6ed5aff","year":2019},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:0b2a18c746c96b6274b6ad0b0b42086c189d046fa96e9a42ed61681acc0d402c","observation_id":"26236b7c-4f7a-4ebb-b405-1638f96983ea","resolution":{"observed_at":"2026-05-16T03:57:17.273431Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bounded-diameter tree-decompositions","venue":null,"work_id":"dd7af1f2-4b6d-457e-828f-7055d6c43c9d","year":2024},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:337749cfb801528074d4010cf62c7eeae294618a70a8abac58a216c3d90fcaa6","observation_id":"4992cc83-4c3d-4a38-88bf-88bfe0f271be","resolution":{"observed_at":"2026-05-16T03:57:17.319213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodlaender","venue":null,"work_id":"a053b1cd-bada-440c-9afe-6737ba9b56cf","year":1988},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:f726dc1f8c0dee3e876788ae720796be7e29593e99b729cbdfcc8b0a39b98d70","observation_id":"4cccf865-6ae0-4d44-8fc6-e7f2ba582a74","resolution":{"observed_at":"2026-05-16T03:57:17.323441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodlaender","venue":null,"work_id":"3a70d697-bf3e-4785-8b7a-46b6548aca06","year":1990},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:c78d837135c883f3ec362edd35445f6ba4d0d005dd308cd386a119302a12a373","observation_id":"f61e13a1-f633-4e26-8a74-472a6d8b27e7","resolution":{"observed_at":"2026-05-16T03:57:17.296860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodlaender","venue":null,"work_id":"c0cba88b-4baa-49c3-86d0-b5e066fca1e2","year":1998},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:2826225b84febaf1c970310e6730af265d528aa763248d15393c6faca9ec2d09","observation_id":"eecebb8f-3ee3-45ac-966c-e20f9811aa0a","resolution":{"observed_at":"2026-05-16T03:57:17.262952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodlaender","venue":null,"work_id":"14a1b0d4-f537-4569-9e6b-7ce7998cfd24","year":1999},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:4f42f2d053e0e2d2d33c69bd09ae0699a6533ffc19aac5fa633801759ea65536","observation_id":"bbd5d2ad-0b40-4514-b24d-716859232d14","resolution":{"observed_at":"2026-05-16T03:57:17.308047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodlaender and Joost Engelfriet","venue":null,"work_id":"13aaee42-3752-48c0-8f50-5b8d48f4b5ca","year":1997},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:973edd15d2f2a247cdc7881480cf2b71aa92b726f14178261471875ba8b83c8a","observation_id":"abc94eed-1875-4f9f-998c-dda3ae64b626","resolution":{"observed_at":"2026-05-16T03:57:17.288243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.04040","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodlaender and Carla Groenland","venue":null,"work_id":"907eec2a-39f3-4edf-9bf0-7a244ee01e40","year":2026},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:4ee8c9fe2fe8db2b2d46ba8f94d88f2fbf6dee23026571fc135493f18e88c865","observation_id":"fc465993-cce0-463b-8d48-53b4d7d2c8be","resolution":{"observed_at":"2026-05-10T22:30:51.978248Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodlaender, Carla Groenland, and Hugo Jacob","venue":null,"work_id":"536ae34d-8287-4f18-b164-40ba45b54d34","year":2022},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:8c9624149563744e60105fc84e5d79a579a47642dbf4703c50716887d5f87a26","observation_id":"95e9169c-c8a7-4c91-8a0c-944c8d409f48","resolution":{"observed_at":"2026-05-16T03:57:17.327876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bodlaender and Jan van Leeuwen","venue":null,"work_id":"bc20e360-572a-4763-89e5-ed12b359826e","year":1986},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:5ce244a7fedbec900429cc9b9151b8a9a35d6d71115f546f6a8ecb01cd2091b8","observation_id":"8d821400-b90a-40d5-9cab-12fffa9416ae","resolution":{"observed_at":"2026-05-16T03:57:17.304333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, and David R","venue":null,"work_id":"d8987cfa-9e4b-4507-b414-09c3d8a88990","year":2024},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:af33f979325671d64805c9905edae819b577ba57a49a5a175af5c6aced794fad","observation_id":"4c207fc0-edc4-449d-82eb-f7388e0a6b52","resolution":{"observed_at":"2026-05-16T03:57:17.284563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pascal Gollin, Daniel J","venue":null,"work_id":"25a974a1-cec8-46a6-9cc6-32a7af6627f1","year":2023},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:6fe1d2592638776e79fc27cb496f9441186ea3742482bae8404a267cc4a2394d","observation_id":"2fd89eba-b61b-4d26-a743-2313933067c6","resolution":{"observed_at":"2026-05-16T03:57:17.270271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4d2092ee-f098-4d8b-a1d6-81d5b0ee18b6","year":2008},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:0871fc7f5e6a359087bb19ee11481ffcd2a394482051a3be680f9c4ec50cb86e","observation_id":"dce4c8c2-8e7b-4aae-98b2-76e52b7634a9","resolution":{"observed_at":"2026-05-16T03:57:17.276568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Thilikos","venue":null,"work_id":"0009c6c5-448f-44ae-93dd-0b82c2c97b7a","year":2018},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:037145f8195c2d2b533004fed0ad56025c5e3b1df033087ac8c7b7d2220227d5","observation_id":"ab092839-f4b8-49cf-9a93-94f52f9dac59","resolution":{"observed_at":"2026-05-16T03:57:17.266307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"T o approximate treewidth, use treelength! SIAM J","venue":null,"work_id":"5451464f-ecec-4c1d-89b4-52398fcc1617","year":2016},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:8ef798b608bac95d33cd631839c5bbc472e8525a6110be7626d8af2b7f74d152","observation_id":"183c458e-aeee-4454-8911-3e6fbaefaccd","resolution":{"observed_at":"2026-05-16T03:57:17.446129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Treewidth versus clique number","venue":null,"work_id":"6d1aad4e-ee15-4573-af49-8aba202d55ca","year":2021},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:f1fc08c226f567005ecc8e69d8ac1cb25d525f07c7664503a7955af9a08284e6","observation_id":"e809c308-f89e-4b4d-aeff-43e91ddaa75f","resolution":{"observed_at":"2026-05-16T03:57:17.434924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computing straight-line 3D grid drawings of graphs in linear volume","venue":null,"work_id":"7f4fe37f-9423-4f5b-b679-94c68255e210","year":2005},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:808187e59d5fe201dcd11bb8c59e51100c25c02be4573e0f3f658088af797b49","observation_id":"f4f0c076-b120-412e-9512-816abfe62a6b","resolution":{"observed_at":"2026-05-16T03:57:17.430907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph theory, vol","venue":null,"work_id":"427bb46d-c909-492e-8bac-c1ec47dfa36d","year":2018},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:05cffc228993312fc3d21df5e6445b531659a5705304a5383fc97379e58dbd22","observation_id":"73e53d09-a07c-4629-817b-5792ffbd5c3f","resolution":{"observed_at":"2026-05-16T03:57:17.438389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Some results on tree decomposition of graphs","venue":null,"work_id":"225f209d-3b2d-4f5b-89e3-fd82f8e9559e","year":1995},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:aa3e1333eec8ed9395658c516d74b07dd400a744da63f06dad5f5a942328f3bf","observation_id":"535bee0b-6c23-4693-90df-ee4e0c23fcc4","resolution":{"observed_at":"2026-05-16T03:57:17.442130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On tree-partitions of graphs","venue":null,"work_id":"d1710176-6709-416a-962c-0c2bee9c0263","year":1996},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:cdbdf8610441d42f033a440e2c2448e78305808d46f17813d910ec89bb124dcb","observation_id":"b1711eab-6075-47c7-8d40-dbc31b04f1e4","resolution":{"observed_at":"2026-05-16T03:57:17.449983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12577","last_updated":"2023-07-28T06:10:03Z","snapshot_observed_at":"2026-08-19T09:00:56.049785Z","submitted_at":"2022-10-23T00:16:39Z","title":"Tree-Partitions with Small Bounded Degree Trees","version":2},"cited_work":{"arxiv_id":"2210.12577","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.12577","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"09f54db0-1393-40df-a67b-db594f119e54","year":2022},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"cited_paper":"/paper/2210.12577","citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:4b4e780f5687383ed5042588c2e35aac8795ebe51c0f385a48a313f2d1addc8b","observation_id":"46280ed2-da90-4ce8-9d35-c31f65564ae3","resolution":{"observed_at":"2026-05-10T22:30:52.017569Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tree-decompositions with bags of small diameter","venue":null,"work_id":"bb85e7de-5ebf-43d5-b82e-9d573bbb3752","year":2008},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:a44a9a665a2b6c4fe059e1fb0dab9990d2e631f74cd478a08924763cfe2548b8","observation_id":"053c4838-b969-4491-988f-a0cf3a7058c3","resolution":{"observed_at":"2026-05-16T03:57:17.457980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Downey and Catherine McCartin","venue":null,"work_id":"617a4ebf-c905-4018-951a-8d5828abe93d","year":2004},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:05387bd37c7d6cccd91d20ff1380eda99068553be15fa76d870089a80b9d3e6c","observation_id":"17d63de6-d900-43c5-b41e-da64f4df4eef","resolution":{"observed_at":"2026-05-16T03:57:17.461690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Downey and Catherine McCartin","venue":null,"work_id":"af5206e9-3cb8-45bf-9d96-f17314aac26d","year":2004},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:60a6051a36a5025ac83190ed47b6a3e5909fa4ba9c86786f5292f9eb13f609f9","observation_id":"cea1275d-377f-473e-814a-68ba1da06f44","resolution":{"observed_at":"2026-05-16T03:57:17.468985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Downey and Catherine McCartin","venue":null,"work_id":"bad9d946-f69d-4b41-9a88-a99898f17490","year":2005},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:92a20963f560b1cff615120c12b4babfc0d74c4b7b308cfb48e4e24d64e80505","observation_id":"f0d692af-dc65-46de-a404-c7ac8b80b26e","resolution":{"observed_at":"2026-05-16T03:57:17.426656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Downey and Catherine McCartin","venue":null,"work_id":"a9573d44-fc48-48a9-a61f-587cb0832a0f","year":2007},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:b073853dd687c069138b4e8bd771d8813c8457490c4815f27122e9d266c0b559","observation_id":"56875808-c413-475f-832c-b32d367ba3b3","resolution":{"observed_at":"2026-05-16T03:57:17.418527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-18T16:50:54.369658Z","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":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"cited_paper":"/paper/2307.12028","citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:b0819c4cb42ee2f014486db9e408639c668d55fb835cc6c21b5a0ddc1a451eb7","observation_id":"2723e1de-94bc-4a1a-a491-7d61e9678922","resolution":{"observed_at":"2026-05-10T22:30:51.999703Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f86c229d-724f-428c-94da-98fd83b1f4f6","year":2022},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:32faa0b262d1110d5a63e03fab1567b25e4a0e7b9a59ad6134d687e1ab83da0a","observation_id":"f3409558-6534-4fa5-938d-272dc0c13b00","resolution":{"observed_at":"2026-05-16T03:57:17.404073Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a4499e7a-2700-43d8-ad35-34988cc0a447","year":2025},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:787f16dfb04bb529d23436fc3f87ffb4865d19cdf49303fffc00457cd41bd987","observation_id":"e5f6d135-1ba7-42de-8484-b6752a88104c","resolution":{"observed_at":"2026-05-16T03:57:17.407652Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9f6990fc-c5f2-4071-b103-50ab0a0d7d20","year":2024},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:fe55daf51cab8a59eca6c03744ab6d9db32850535f3734e2682fd1a06ba15d18","observation_id":"7be70fcb-3f47-4d78-a802-cb19370c70ea","resolution":{"observed_at":"2026-05-16T03:57:17.400012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f15530b0-adee-441e-b02b-b95a1275c15c","year":2005},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:3851a90b4d37d07a03335195159f6d00ea5fd3b919131fb1b433710c42986a4e","observation_id":"634fb32a-1153-41b5-a6b7-a346c9d26bd0","resolution":{"observed_at":"2026-05-16T03:57:17.396302Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fd43ffa1-b9c2-4713-8ef6-3845daba7c14","year":2007},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:cfd95a85c855bf4e29e6bcabcc954b59a22f648ccf9561c2a3f9af31aa41749d","observation_id":"88dd4e26-ed45-4c81-b5c0-769838b4ff96","resolution":{"observed_at":"2026-05-16T03:57:17.411159Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quotient tree partitioning of undirected graphs","venue":null,"work_id":"8ac90ade-84a0-40b1-8bfa-796ec383ee4c","year":1986},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:0288a42045e5874a59a65040b9b0cbbc10a33773ba391227d63f01543171413c","observation_id":"d5834089-13cb-4b2e-8233-705d63944c03","resolution":{"observed_at":"2026-05-16T03:57:17.414747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fishburn and Raphael A","venue":null,"work_id":"1f4f62e1-c750-4869-9110-d42f17e0dc3f","year":1982},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:1f6706c68538629a8dcc451400d47fd10a3335a5bbdbd22192c004a19cf89920","observation_id":"1086213d-ca95-4bcb-addb-cb6ec5a56e60","resolution":{"observed_at":"2026-05-16T03:57:17.422527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Giannopoulou, O-joung Kwon, Jean-Florent Raymond, and Dimitrios M","venue":null,"work_id":"d8390b23-c9cf-413b-b78d-a2344e89bce7","year":2016},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:f9bb8826a34fd6ff2443aee0eb95b89d339848d45812dea433918d9f444a0246","observation_id":"cb5da547-154f-48a8-b5e8-57c503722606","resolution":{"observed_at":"2026-05-16T03:57:17.381366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tree-partitions of infinite graphs","venue":null,"work_id":"b3f61411-b33c-4f55-99f2-2a831a91621f","year":1991},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:b5940c24c77d05703ea147ad4cf87e54647dc2efc286d41edec2fa07a18d9b04","observation_id":"2b896c7d-47a6-4c68-b2b4-480e944cf060","resolution":{"observed_at":"2026-05-16T03:57:17.465223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Harvey and David R","venue":null,"work_id":"58cfbf79-6079-45ec-8149-be33f48a37c7","year":2017},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:e9ef1f454e886bc7b595e1405002d4eebc9ad0226fc47b23a2bf48199b57babc","observation_id":"72e927c2-0da2-4b5a-964b-f4d489320b3d","resolution":{"observed_at":"2026-05-16T03:57:17.392568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Minimal triangulations of graphs: a survey","venue":null,"work_id":"4827f06d-bb98-44fa-a59f-708e53af10cc","year":2006},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:3ef97274a6efec434508b11a3b3e10cdea570ea083484906029b98a92d27167a","observation_id":"4bb8e6f5-2f01-475e-9fa4-fc69b320ccce","resolution":{"observed_at":"2026-05-16T03:57:17.344695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.22196","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cdcc3ce1-14da-4aea-89f0-da2f71e371db","year":2025},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:d0bc5edda15ade5c06e48c892d1b9af8e6dc6bf726f5d6c6c7d80c9f69a7b72f","observation_id":"91ecb065-3da2-4cdc-b93d-9b9dc8d49b56","resolution":{"observed_at":"2026-05-10T22:30:51.990884Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tree-chromatic number is not equal to path-chromatic number","venue":null,"work_id":"44ab31f3-672f-41dd-b83f-fc585894a916","year":2017},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:8b1d621399fc5a0d34ae6d245ddb79e60cefaec75e6e45f500e45a6e93077f2e","observation_id":"a9300261-0405-4a42-86d9-b10afbb261de","resolution":{"observed_at":"2026-05-16T03:57:17.385051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wood, and Liana Yepremyan","venue":null,"work_id":"e6507de4-bf21-40f6-bb3e-d5de59ffd14b","year":2019},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:41dbdfe503233c0a38294765493c162c6517a7b6940d3464a17fe3aa8218d3fe","observation_id":"89910302-5393-47b2-85c2-aed805f3e412","resolution":{"observed_at":"2026-05-16T03:57:17.373969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wood, and Liana Yepremyan","venue":null,"work_id":"9853b227-d2e7-4beb-b8e1-fa7e07630993","year":2021},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:92a3a9ae1fa295224a7964f2c524f9fe9df4fdf1bb432d307fc6cee35242abed","observation_id":"b83d3dbd-8316-48cf-a87d-3b7b57067ad7","resolution":{"observed_at":"2026-05-16T03:57:17.370750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Logical aspects of Cayley-graphs: the group case","venue":null,"work_id":"929f6847-377c-4c38-bffc-1bfbb3f31450","year":2005},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:435ee4b73ef9161140bc08425ffabf5f8dc815e1abf9e771831463b9e0dc54bc","observation_id":"a2646eaf-da5e-449b-9e29-04068c21348a","resolution":{"observed_at":"2026-05-16T03:57:17.454271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20333","last_updated":"2024-10-27T04:22:44Z","snapshot_observed_at":"2026-08-18T21:02:01.166490Z","submitted_at":"2024-10-27T04:22:44Z","title":"Product Structure and Tree-Decompositions","version":1},"cited_work":{"arxiv_id":"2410.20333","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.20333","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d058c92a-a244-46b8-8cc7-9f8393dc667c","year":2024},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"cited_paper":"/paper/2410.20333","citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:23e9a56f00b8b48ada9603f4bbbf7e1e133f0d2dfb65de795351e555bfac0829","observation_id":"f355abf9-48b4-4908-852b-67ff5d25d02a","resolution":{"observed_at":"2026-05-10T22:30:52.009901Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Partitioning H-minor free graphs into three subgraphs with no large components","venue":null,"work_id":"1537e7a8-aebb-4762-bb62-bbdf220ff261","year":2018},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:70de1540faaf47d9a1091a91b6ca9e7a89f06a99a521aeaff30c2feb43261e1e","observation_id":"a013fa91-0dc4-4bb9-94d2-c663eda6de58","resolution":{"observed_at":"2026-05-16T03:57:17.367230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the complexity of computing treelength","venue":null,"work_id":"fb82f28d-1df1-4538-9346-f8281993e356","year":2010},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:b327e20ab0fae8043e6bbed5492bf55b4a3b9f9f71a3171fb333cd1a0224401b","observation_id":"a69237d0-584e-4199-af34-67f9d01decf8","resolution":{"observed_at":"2026-05-16T03:57:17.377780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Grid spread","venue":null,"work_id":"f2526612-c5b3-4bd8-9ac1-3bf17516233e","year":2026},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:ba0e23ac5755f0821387457180427c478d00687f429a3b9b6dc9fd0735acc9c2","observation_id":"5d148660-c0fe-448f-a223-08e5286ae832","resolution":{"observed_at":"2026-05-16T03:57:17.389019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Thilikos","venue":null,"work_id":"cdfb0731-6358-4e71-90b0-c4e576cf1b35","year":2017},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:61bb6d17c7fe9a0f8662cf1aba1056e05594510b49aaeccfe79c8d44f444e846","observation_id":"d7b73dde-a5c1-4e6b-868d-5fb1a84f845d","resolution":{"observed_at":"2026-05-16T03:57:17.363629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"50f66455-9592-4325-acd2-caf2a209cd7a","year":2003},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:7ed23778677dfc63b34f73a9af1c0f3128cb4cf914c6f715520217623351894e","observation_id":"4979feae-9a14-4025-a9f6-b6c1ca4ff8a1","resolution":{"observed_at":"2026-05-16T03:57:17.355641Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Triangulated graphs and the elimination process","venue":null,"work_id":"d0590a44-4513-4ea9-8dd1-474d70fde527","year":1970},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:5bca3f6bd5d23dd4da0e045f73727de555ccb8110d127cdb958a46d31b5e1563","observation_id":"5e1d2594-4847-4ed1-83b9-70c320d1bd1d","resolution":{"observed_at":"2026-05-16T03:57:17.348689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tree-partite graphs and the complexity of algorithms","venue":null,"work_id":"6f3ad042-c901-41eb-bc71-57c03809f7dd","year":1985},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:6fba1453caa2d2a6e04350372eefd87a03fa7386d035e38f133cb6708df07d71","observation_id":"7db1185c-21b6-4615-8b7f-a24df7612955","resolution":{"observed_at":"2026-05-16T03:57:17.359572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tree-chromatic number","venue":null,"work_id":"298ff9e2-e58f-4f8c-81bf-0af33b923e9f","year":2016},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:c96cb2cd780252390f92e6f6f09193fdeb571a6f32f1c235eb38c29a0d83a3bf","observation_id":"85636d96-7584-459d-a9de-5c147ecbe244","resolution":{"observed_at":"2026-05-16T03:57:17.331225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ce5c930c-9e07-47d6-be20-7450a76aae0c","year":2006},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:f9740aeac3798084fd16d7b23f145ca0601b81fe63f27231a3e581c656d93071","observation_id":"15f07888-66c0-43a1-a049-a9e7eb306414","resolution":{"observed_at":"2026-05-16T03:57:17.334464Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9db4525c-d591-41fc-a260-052bfe9ca6f4","year":2009},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:7ca3fe6db39bd006690340100fa613b8a0cdc335517364d7544bd72465ddb9d9","observation_id":"e964f039-8ad0-406d-a1cc-ec435e3bc0e7","resolution":{"observed_at":"2026-05-16T03:57:17.337950Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.01140","last_updated":"2026-05-06T20:48:29Z","snapshot_observed_at":"2026-08-12T23:59:36.857072Z","submitted_at":"2025-09-01T05:20:27Z","title":"Tree decompositions with small width, spread, order and degree","version":3},"cited_work":{"arxiv_id":"2509.01140","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.01140","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tree decompositions with small width, spread, order and degree","venue":"math.CO","work_id":"06f20cb7-3f38-43f4-a14a-2506cb2f3666","year":2025},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"cited_paper":"/paper/2509.01140","citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:99df7bd09b4cfadd4b43bdd3fb516d585a12328a071aaea6fb59481e01323a07","observation_id":"bf5a85a8-db3c-445e-b948-2988042a0984","resolution":{"observed_at":"2026-05-10T22:30:51.984115Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wood and Jan Arne Telle","venue":null,"work_id":"6a8c793c-35e7-4067-97ee-c52078ce43ee","year":2007},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:b1853bf8f1b5806de46154e196874109da434f031ae013d0ac21ab566b32575f","observation_id":"ed61e609-e94f-4f7e-b7a7-bb218aac353d","resolution":{"observed_at":"2026-05-16T03:57:17.341186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Minor-matching hypertree width","venue":null,"work_id":"77e02c57-0058-4b78-a825-2ff5afe926b2","year":2018},"citing_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-10T19:47:22.954226Z"},"links":{"citing_paper":"/paper/2604.05690"},"observation_digest":"sha256:b99a321d4cb2694dd04cba405a0c79265439e0503ca2c097c8cc30520faa23ea","observation_id":"fa3a6b99-0139-4153-bd0a-898ccd127688","resolution":{"observed_at":"2026-05-16T03:57:17.352302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":6,"verified_fuzzy":44},"total_outbound_references":61},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 2 inbound Pith citation observations for arXiv:2604.05690."}