{"as_of":"2026-08-08T03:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f627ca3c1f956833e39236e818eb9b37fffa6598fcb360c8dda71c02ee2698d1","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-08-07T11:33:05.742501Z","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-07T06:34:17.273281+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/2506.02346/citation-record","integrity":"/paper/2506.02346/integrity","json":"/paper/2506.02346/citation-record.json","paper":"/paper/2506.02346"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:12.731061Z","title":"Decomposition trees: structured graph representation and efficient algorithms","venue":null,"work_id":"f76ed964-e574-4693-9b54-d5d94e3e2da7","year":1988},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:01.314854Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:5bd0fb329386b44902b7cd4fd4b98598401900da57fec3ab8d222419447344ad","observation_id":"e90a1f8e-2698-4f6d-b649-ef7e4a360ffd","resolution":{"observed_at":"2026-08-07T11:33:12.792808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:12.559869Z","title":"Complexity of finding embeddings in ak-tree","venue":null,"work_id":"fda15f6e-7d26-4369-8e14-7aab38d981fc","year":1987},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:01.379770Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:5a00250006a85b1587ebbc6638e24b3de0efc808593c929f545f072b9324d475","observation_id":"2a7d18c8-c390-481c-81e4-037a111f1b18","resolution":{"observed_at":"2026-08-07T11:33:12.655360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:01.493975Z","title":"A linear time algorithm for finding tree-decompositions of small treewidth","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:01.493975Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:0f6f10bbfc6cc0f5d695e5f97f7b7d75c4f4b86a4c9f686ab199c38aa25d60ac","observation_id":"c02325ef-d1a5-451f-8699-b8594d7ca31c","resolution":{"observed_at":"2026-08-07T11:33:01.493975Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:12.385279Z","title":"Tree decomposition: A feasibility study","venue":null,"work_id":"779cb2ea-9526-435f-aa50-a73a5cf2c035","year":1998},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:01.603808Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:53392aadb94c7a2d293d60e2dd3b9c7bcb0f85ce5ecf2edb871408b48dc9ed1a","observation_id":"77404c2e-dc67-43bb-a959-e440cfa8284e","resolution":{"observed_at":"2026-08-07T11:33:12.457833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:12.215777Z","title":"Algorithms finding tree-decompositions of graphs","venue":null,"work_id":"2a22fdd3-af19-4803-9476-8b6edf8c1503","year":null},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:01.693763Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:755d6587f695ddfa4fe751433c0133c33823871e7eb33b3db6c5d967f4517bdf","observation_id":"e13d25cf-04c2-4cc5-a3eb-55ce71ab11c0","resolution":{"observed_at":"2026-08-07T11:33:12.303483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:12.049452Z","title":null,"venue":null,"work_id":"4c589de1-d137-446d-832d-dadd64b41a58","year":null},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:01.943197Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:e3a73e7623068de80a29289f02d3a2fe396cc00690c3936e9921043e8997ba94","observation_id":"085c098e-8d87-4914-b94e-42e6dd61480e","resolution":{"observed_at":"2026-08-07T11:33:12.132169Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:11.844665Z","title":null,"venue":null,"work_id":"13f682cd-c6fa-467d-bfa4-576f224e9c44","year":2011},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:02.215977Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:29f4bfdd8c17b2f3158f5c79cb2802877a1e4158762668045845e98ddeb4ce25","observation_id":"9739e74b-1cbd-448f-8590-b042a6a866ce","resolution":{"observed_at":"2026-08-07T11:33:11.928023Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:11.659322Z","title":"K-packings and k-dominations on tree graphs (2004)","venue":null,"work_id":"30f3bd7a-5891-4bc2-8605-bf01dabf02cd","year":2004},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:02.413167Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:fa00e696dbdf0a25e7e24753453385da3fd0c81ffd52c195b28f086258da7532","observation_id":"3b2ff6bd-e57b-4740-b310-78ce6ba32e23","resolution":{"observed_at":"2026-08-07T11:33:11.755893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:11.438870Z","title":"Algorithms for minimum weighted dominating sets in cycles and cacti","venue":null,"work_id":"dcb309b4-f430-45f8-89ea-8dc582a9e191","year":2014},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:02.525929Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:40b424f1f0d9b618ee6a0578055c6ac2a974128f7632e1ac418f42674d9607c1","observation_id":"c3f71a54-bde5-4bd6-b111-6b8a15926724","resolution":{"observed_at":"2026-08-07T11:33:11.550759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:11.290040Z","title":"Algorithm to find a maximum 2-packing set in a cactus","venue":null,"work_id":"dab771cb-0de9-4c99-abd7-190f304e99eb","year":2018},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:02.557703Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:2398df1c363439de191568fc19aa979dbe748745cb10f8fa549dc364a85cd2a6","observation_id":"6e208cb6-9f6d-43b4-81e6-f7b93c85c0be","resolution":{"observed_at":"2026-08-07T11:33:11.353836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:02.662796Z","title":"Algorithmic meta-theorems for restrictions of treewidth","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:02.662796Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:921e5493eb9f3bd2c2c768e975aba65b8549260a4c855615433cb5f954ddc014","observation_id":"e31a93a1-4441-4cbc-a1b3-96534a9b7cdc","resolution":{"observed_at":"2026-08-07T11:33:02.662796Z","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":"10.1002/net.10046","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:07.161946Z","title":null,"venue":null,"work_id":"878295bd-ca2d-4837-bdda-6dceb6f78a02","year":2002},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:02.802262Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:a67a512df90281dc7d5ec43817e338165121ab76e1325fbd44ea774cf062a013","observation_id":"a9a8ebec-595e-430b-ac0f-e5b4d7ee3a83","resolution":{"observed_at":"2026-08-07T11:33:07.288760Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:11.105778Z","title":"Fundamentals of parameterized complexity, volume 4","venue":null,"work_id":"927e3fec-ddba-4be8-abd1-b70ccf0d870f","year":2013},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:02.951871Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:372ab1b78ca3e79b55364f4ecd503dfe885437605978e9d19067a57ae9022a0d","observation_id":"d998507d-b232-4cac-9cd0-564bd2bba5b8","resolution":{"observed_at":"2026-08-07T11:33:11.202828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:10.966724Z","title":"Improved approximation algorithms for minimum-weight vertex separators","venue":null,"work_id":"c586c2b4-07cc-4068-b6f9-7a50449ef919","year":2005},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:03.092507Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:5cd2032197dc8388a8ef2198e3c8b4c4b4674fa45b5ead25f7c11999ae2763ef","observation_id":"c293e88f-0cdf-488d-8e1b-c96c71f5e24e","resolution":{"observed_at":"2026-08-07T11:33:11.030442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:10.809913Z","title":"Approximate tree decompositions of planar graphs in linear time","venue":null,"work_id":"ceb252c1-cbf3-4113-8ac8-7c25cf8c7c84","year":2016},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:03.218839Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:ce0080707f049b6bd0c84945a45202667b014e2328b7e518e1d4479193441b5a","observation_id":"ad720441-8092-4f5a-a6fc-8eb10c78f7c7","resolution":{"observed_at":"2026-08-07T11:33:10.866023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:10.632765Z","title":"Treelength of series–parallel graphs","venue":null,"work_id":"b96c1127-52c9-472e-8399-54f6b4f998c6","year":2023},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:03.413675Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:3d61afd4e899fdfd2b346788fda890ed49e5c85ecd2a62b3941991f811cd5c02","observation_id":"1a15a720-2ff1-41bc-ac93-e6bddda03362","resolution":{"observed_at":"2026-08-07T11:33:10.722330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.5896","last_updated":"2013-01-24T20:54:38Z","snapshot_observed_at":"2026-07-06T03:04:50.149153Z","submitted_at":"2013-01-24T20:54:38Z","title":"Computing bounded-width tree and branch decompositions of k-outerplanar graphs","version":1},"cited_work":{"arxiv_id":"1301.5896","doi":"10.48550/arxiv.1301.5896","metadata_source":"pith","pith_arxiv_id":"1301.5896","snapshot_observed_at":"2026-08-07T18:16:16.850658Z","title":"Computing bounded-width tree and branch decompositions of k-outerplanar graphs","venue":"cs.DS","work_id":"67cb1e6c-5b9d-45d7-8f7a-d8c5ef4bba6b","year":2013},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:03.548072Z"},"links":{"cited_paper":"/paper/1301.5896","citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:8de0e08c3b8cd1260076c0a6f58a721863e2b2ae59b88c2f6dae65afa1a412fe","observation_id":"35b86b4f-4256-4949-8242-052c7a23ce3d","resolution":{"observed_at":"2026-08-07T11:33:07.021313Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:10.440590Z","title":"Planar graphs with bounded treewidth","venue":null,"work_id":"5dd5e761-4de3-41a4-8ccb-7f76627690ed","year":1988},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:03.671032Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:900e0fa811523918ece5b08e2bfcf213ce0f104ac98f767715ab4d399a60f655","observation_id":"cf4c9283-901e-4bcf-9fcb-96115507d554","resolution":{"observed_at":"2026-08-07T11:33:10.507415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:10.235699Z","title":"The pathwidth and treewidth of cographs","venue":null,"work_id":"d2def1ac-40bc-4e4d-a5d1-4a5280d57e2a","year":1993},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:03.786652Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:f81e6853e43f293479d70c8e40a4bfe62bd9f4c2d0be88d4309d8bbe620aa98e","observation_id":"e5d89f29-bdbe-413d-804e-ecbb02587dc2","resolution":{"observed_at":"2026-08-07T11:33:10.318430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:10.065447Z","title":"Treewidth of circular-arc graphs","venue":null,"work_id":"ee03cc51-1b92-4eea-a272-a323811b9f66","year":1994},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:03.908266Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:9d533661fd323bda5c5f448a28189cedd685efea76c13f03f86f9f2e04282c22","observation_id":"b267efca-4314-43f3-ad97-a7de1ab3e15e","resolution":{"observed_at":"2026-08-07T11:33:10.154613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:09.880335Z","title":"Better algorithms for the pathwidth and treewidth of graphs","venue":null,"work_id":"c9871dbb-3c48-4563-a171-fdb8a26b67fc","year":1991},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.020013Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:1266b439109a8c5fb2a1adf99bbc958d501535f8039732a4fa6074462f26de86","observation_id":"c6f4e271-8a01-4de0-98ce-8a59a3219ac6","resolution":{"observed_at":"2026-08-07T11:33:09.958973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:09.686139Z","title":"Invitation to fixed-parameter algorithms, volume 31","venue":null,"work_id":"c787100d-1862-49bb-8ebc-fbdec615132a","year":2006},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.265855Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:b087d09498be20557535090d4e88c779d8e95ac5761a4646f8fc934a7461d698","observation_id":"6f4054aa-a63d-4df8-8fb1-31f585285481","resolution":{"observed_at":"2026-08-07T11:33:09.742703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:09.476056Z","title":"Treelike and chordal graphs: Algorithms and generalizations","venue":null,"work_id":"ab11bedf-e575-4536-a6f2-5cc22b373cca","year":2010},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.374591Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:a30bb657eba21ea81640e3e8e7d41e8df49550e67986d3ff560d5a6150df39e9","observation_id":"07569ae5-ff77-4fe7-9a02-1e6a631724c4","resolution":{"observed_at":"2026-08-07T11:33:09.579231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-54233-7_162","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:06.710927Z","title":null,"venue":null,"work_id":"2133ec1d-fdb2-4ece-99b0-567bc21ac5ee","year":null},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.113624Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:2f5119e87afb854d5c7b17a12c990f46abe2389ecb262485dc88d037fa65ccf1","observation_id":"fc62b4b5-26cc-41f3-8cb3-3061d4cf5d48","resolution":{"observed_at":"2026-08-07T11:33:06.775978Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:09.268611Z","title":"Linear algorithms for graphs of tree-width at most four","venue":null,"work_id":"cb8e258c-3417-4dce-8bec-4b94d8266090","year":1993},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.552582Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:3f2a2e68dcdc25f169e80e040a63239588e54dec4b7c09d310cc834b82357e39","observation_id":"523da967-f66a-4d73-8e99-36a0022b1d3b","resolution":{"observed_at":"2026-08-07T11:33:09.408223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ipec.2016.30","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:09.116742Z","title":null,"venue":null,"work_id":"a6d1b4ef-805b-43f3-af02-280466545416","year":2016},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.627598Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:5254bab99d3a6381d623c3f63d04991420acf5c92b8a939eab2fbb8a0b5f87be","observation_id":"e15583df-82a6-402b-a097-643796296602","resolution":{"observed_at":"2026-08-07T11:33:09.179495Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0607033","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:06.552054Z","title":"Characterization and recognition of partial 3-trees","venue":null,"work_id":"0b689d20-05d1-4421-b4c7-4d318de06c72","year":1986},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.457737Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:04ac2a115b64aad540389ca30a7662bdd98b2d00b9e3fe2cfd09d6f6defdcdac","observation_id":"0a0a7fc3-08e6-444f-888c-36afefea8278","resolution":{"observed_at":"2026-08-07T11:33:06.630096Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:08.706605Z","title":"libtw, 2006","venue":null,"work_id":"40babbf6-f184-4f0c-953b-197d435b9086","year":2006},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.790753Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:92d25023b9ccf55d714771929158b6bcbc0d99d8e88f741d7968312f4f254fd7","observation_id":"6cd22c3f-f9d6-4e8e-8944-b3c8509d429f","resolution":{"observed_at":"2026-08-07T11:33:08.819915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:04.908764Z","title":"Bodlaender, Arie M.C.A","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.908764Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:2c6d7ec8647cd9945a3a04318189b75f217dac8a466121bfb2684d003eb5fa74","observation_id":"d06ceeae-5ff4-49ce-bfc7-0eb4e276dd1e","resolution":{"observed_at":"2026-08-07T11:33:04.908764Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ipec.2017.30","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:08.914094Z","title":"The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration","venue":null,"work_id":"cd6fba7f-423f-4c59-a4ae-bb4cdac1ebd2","year":2017},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.706458Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:a24da34a370bf4a8e97b0508fa8ecfd1e8b472a3d987c3d8daca35a5c96cac0f","observation_id":"fddeb832-7b9b-4129-9df9-6a9da3b7e5be","resolution":{"observed_at":"2026-08-07T11:33:09.013599Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:05.083306Z","title":"Fomin and Dimitrios M","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.083306Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:a8381dd93f1dbf85167c5f898acf7e478ad95eb3ce0b79da048fcce9f8e739cd","observation_id":"f3db73c3-bc19-4d88-b753-d5663692dfa4","resolution":{"observed_at":"2026-08-07T11:33:05.083306Z","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":"10.1016/j.jpdc.2020.03.016","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:06.380582Z","title":"A distributed algorithm for a maximal 2-packing set in halin graphs","venue":null,"work_id":"cde5c79d-f98e-451a-9c63-64b1e785ad20","year":2020},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.174513Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:70920ce81b6a654a4fc2c0f23acbea5581aed3d6eb9a8b7927d934fa9efbb4a7","observation_id":"2a199782-cc61-45dc-84b0-4c8b51bc863d","resolution":{"observed_at":"2026-08-07T11:33:06.447635Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:08.531731Z","title":"Studies on minimally n-connected graphs","venue":null,"work_id":"d21f75d7-1970-4936-944d-3672d1c9e5e8","year":1969},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:04.990674Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:296ff404c95ae13334179188552b503ce95ba9037740d3b1ef0e0dca656bf0bd","observation_id":"d0c40344-1004-4ca2-b096-757d22833f28","resolution":{"observed_at":"2026-08-07T11:33:08.606368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02591867","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:06.207574Z","title":"Halin graphs and the travelling salesman problem","venue":null,"work_id":"cf6e3444-275e-4e2e-a71d-a1619edc4e2d","year":1983},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.333294Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:a7b3b5a1073e4a31e1a93944494db85e4bbb96a99a2d775bf946ef6e82a1c11c","observation_id":"fff418ae-4abb-473e-be6c-a0994c710407","resolution":{"observed_at":"2026-08-07T11:33:06.267379Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0304-0208(08)73008-15","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:06.029166Z","title":"The pancyclicity of Halin graphs and their exterior contractions","venue":null,"work_id":"da4fa1ab-26c0-4033-bf3a-164e6cabc3b6","year":1985},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.421325Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:b5efe8902b8af77d1332a71698f245f89274763ca89736c4f463cd2950d746e3","observation_id":"ec27b0a4-516e-4eff-896b-02e1ac9f0205","resolution":{"observed_at":"2026-08-07T11:33:06.128620Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:05.273174Z","title":"Simple recognition of Halin graphs and their generalizations.Journal of Graph Algorithms and Applications, 20(2):323–346, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.273174Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:1ec49bdfce11ae89ef4cc4f4ed7db434578fbf8f5d5c92b9c34241c7f7ba62a2","observation_id":"f1616b7a-3841-4223-a3e5-9fbb32d5b126","resolution":{"observed_at":"2026-08-07T11:33:05.273174Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:08.112302Z","title":"Graph theory, volume 173 of","venue":null,"work_id":"63f627ca-f283-4281-bd14-46d97047c7f8","year":2012},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.566052Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:150c7bfb2ebccd48e4d522f628cf5066e257180fc533b512d9fdff007c678de7","observation_id":"a270678b-ecb0-4e04-8a5d-3f2fb7c248db","resolution":{"observed_at":"2026-08-07T11:33:08.178582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-21275-3_7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:05.869902Z","title":"Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh","venue":null,"work_id":"82feeae4-09d6-4562-92f3-fd9f31d6b564","year":2015},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.650441Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:63f3f3cacc6f9be8d919c131da631470e9f9b5868ef2c2bd0a17e4c9beb2ceb9","observation_id":"c506fe5b-3b19-4b65-8ffc-951f4187d90c","resolution":{"observed_at":"2026-08-07T11:33:05.966663Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:08.269707Z","title":"Lengths of cycles in halin graphs","venue":null,"work_id":"b0b11d40-5f3a-4229-b1f5-466342c0130a","year":1985},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.494055Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:6099df1cd8e22af7ac89407077c3d3939160f481ca7f1deece5dc77d434655c0","observation_id":"1c26e201-5ad7-435a-8d96-1e06e44640ab","resolution":{"observed_at":"2026-08-07T11:33:08.396251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-08-07T11:33:07.951929Z","title":"To avoid invoking a recursive call, we must also ensure that h(cw,a) = 0","venue":null,"work_id":"ec3334af-bfa0-4f55-95cb-63eec912e40b","year":null},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:05.742501Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:78be424608ce5d0ee9f67170d842435f54f742f96765fdf331967d6304ac9856","observation_id":"7f2185b4-6f0d-447c-bab0-9d849b7948f1","resolution":{"observed_at":"2026-08-07T11:33:07.999236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0196-6774(91)90020-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:07.609527Z","title":"doi:https://doi.org/10.1016/0196-6774(91)90020-Y","venue":null,"work_id":"0ca61865-f639-40d4-9be4-21bfcdce23ef","year":null},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:01.802458Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:7b1695812fb9e7494b4d6d6346072d7b9d37c8734c11bbc99d1f518d96fac295","observation_id":"35ba3ffa-a37a-4eb7-acab-5675e0f1d1a3","resolution":{"observed_at":"2026-08-07T11:33:07.689292Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0895480193243043","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:33:07.407665Z","title":null,"venue":null,"work_id":"315808bf-1031-4ae1-861f-f05ef354abd2","year":null},"citing_paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","version":1},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-07T11:33:02.065172Z"},"links":{"citing_paper":"/paper/2506.02346"},"observation_digest":"sha256:5ea1a3c6c9299b8b84bf9d39bc0d25788c5b73f1f38bed7897c4a6c513ea57d6","observation_id":"a7be92eb-2d19-4f6e-93ff-df5eb387a39d","resolution":{"observed_at":"2026-08-07T11:33:07.470498Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.02346","last_updated":"2025-06-03T00:52:06Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T11:23:35.590451Z","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":12,"verified_fuzzy":23},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2506.02346."}