{"as_of":"2026-08-13T04:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd86fa0f1ce4effbe9234639df77f52b55399dd19b902101d3b959661313e375","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:51:25.673835Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.16918/citation-record","integrity":"/paper/2411.16918/integrity","json":"/paper/2411.16918/citation-record.json","paper":"/paper/2411.16918"},"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-12T12:51:25.937716Z","title":"Complexity of finding embeddings in a k -tree","venue":null,"work_id":"fe94b7a9-4fdd-4bcb-a57d-c9b82cb4c6ec","year":1987},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.638617Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:04db885ea3ec1c55c7a2217e2c14eab210fabc90c124ada7ef632c341c72d7e7","observation_id":"4bdc25ed-f558-4b59-94b7-128e233fdc5d","resolution":{"observed_at":"2026-08-12T12:51:25.940686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-92681-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:51:25.715917Z","title":"Finding all leftmost separators of size k","venue":null,"work_id":"c8edcfae-8026-4630-97ad-9e81ea012d03","year":2021},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.641914Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:8956b23e098d68f455136a1371d450bea5a69725f58a3834c85111b657efe491","observation_id":"bed81bbc-fc20-43fd-91f3-0389f49802db","resolution":{"observed_at":"2026-08-12T12:51:25.720764Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00593","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:51:25.703055Z","title":"An improvement of R eed's treewidth approximation","venue":null,"work_id":"86734bda-30e5-4da7-b4f1-d4804d2eae1b","year":2022},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.646251Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:d9d9a298d0077a7a59303f9b46e08e501ef51565f3144ef2c2b85fcb02420aec","observation_id":"525b3cf7-3c55-4ba6-a0e9-16a935442236","resolution":{"observed_at":"2026-08-12T12:51:25.708203Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:51:25.928792Z","title":"A linear-time algorithm for finding tree-decompositions of small treewidth","venue":null,"work_id":"2529906b-a0de-49e1-a1e1-ddc781f36e84","year":1996},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.650534Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:622645b5564b23b104a57f091f4d6c447114b9fc43dcdcef0de5a5a1ffa288c3","observation_id":"a7b24284-4e37-40fd-a9f9-8b0d0e53cf7c","resolution":{"observed_at":"2026-08-12T12:51:25.931986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:51:25.919290Z","title":"A c^k n 5-approximation algorithm for treewidth","venue":null,"work_id":"e3c3d7d3-208b-4309-83a6-da726838c4c3","year":2016},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.654109Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:eb801106e2a07c26c33b211dc92b6d85a8285f668cf56e355de3fe72f1da717b","observation_id":"f2eda584-f4fe-4032-8e00-b726acaa344d","resolution":{"observed_at":"2026-08-12T12:51:25.922647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:51:25.658067Z","title":"Fomin and Tuukka Korhonen","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.658067Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:1e6445e8f0069438ad6dfdbd47f375469961a14f9e769b704df20faec2dfa66c","observation_id":"57322df2-3ceb-4c81-af8a-95793bc1e66d","resolution":{"observed_at":"2026-08-12T12:51:25.658067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:51:25.662061Z","title":"A single-exponential time 2-approximation algorithm for treewidth","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.662061Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:e867a425f10dfd64944bb7441aedf94937475040b9a23ad8ec7636ba77d99d78","observation_id":"baadb56d-d016-4541-874b-509c19055bea","resolution":{"observed_at":"2026-08-12T12:51:25.662061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:51:25.665179Z","title":"A single-exponential time 2-approximation algorithm for treewidth","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.665179Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:dd51e0892cf839362e3d1c8d1261aefbaa01b0952fd5ef871335b344929fc72b","observation_id":"93b0f966-7b32-495d-8c0f-e33ab9b52edc","resolution":{"observed_at":"2026-08-12T12:51:25.665179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:51:25.668019Z","title":"An improved parameterized algorithm for treewidth","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.668019Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:23f2f1c9c95cc8cf1d08a1b1a388204aaacbe444ace938224916bc3517dae4c6","observation_id":"792ec7c6-56ea-4c3c-9a44-8f29f15d952a","resolution":{"observed_at":"2026-08-12T12:51:25.668019Z","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-12T12:51:25.910211Z","title":"Graph minors","venue":null,"work_id":"0676b1a8-dee9-4725-a94e-58a31ade4769","year":1984},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.671024Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:d3ee0ce3e440d279bfd201a568dbbb3600bdedff0ad8ac15336da6adf911ecb6","observation_id":"5a3b9180-863c-463f-a15e-efc9fd3dd18f","resolution":{"observed_at":"2026-08-12T12:51:25.913832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:51:25.673835Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T12:51:25.673835Z"},"links":{"citing_paper":"/paper/2411.16918"},"observation_digest":"sha256:22333ac7ae96b3b29b5db8a34340e7841437571f8edd570b0d0694d2427a4002","observation_id":"042f1554-70f9-4305-b568-83b5ea9db739","resolution":{"observed_at":"2026-08-12T12:51:25.673835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.16918","last_updated":"2025-07-05T08:54:06Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T12:42:35.270317Z","submitted_at":"2024-11-25T20:44:15Z","title":"Optimized 2-Approximation of Treewidth"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":4},"total_outbound_references":11},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2411.16918."}