{"as_of":"2026-08-09T00:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19549288cf8d5cb5c7515bb2fd12d4715dd57af8bea910062b9c6bdddd224806","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:33:02.257697Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2505.18885/citation-record","integrity":"/paper/2505.18885/integrity","json":"/paper/2505.18885/citation-record.json","paper":"/paper/2505.18885"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.07647","last_updated":"2019-08-20T23:52:50Z","snapshot_observed_at":"2026-07-06T08:15:44.449102Z","submitted_at":"2019-08-20T23:52:50Z","title":"Line and Plane Cover Numbers Revisited","version":1},"cited_work":{"arxiv_id":"1908.07647","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.07647","snapshot_observed_at":"2026-08-07T14:33:04.532184Z","title":"Line and Plane Cover Numbers Revisited","venue":"cs.CG","work_id":"0a568265-cc19-4a4d-8bb0-283529b569b9","year":2019},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:32:59.803603Z"},"links":{"cited_paper":"/paper/1908.07647","citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:c5ec9b2aae1f7db2a77a96938703f30fc306c314f5222b9d4c1e509d3cdb51b8","observation_id":"9b7443dc-7613-49ce-ac6e-01002eee2353","resolution":{"observed_at":"2026-08-07T14:33:04.608923Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.20382/jocg.v11i1a17","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:04.050273Z","title":"Drawing graphs on few lines and few planes","venue":null,"work_id":"2a162d99-f288-47b7-ad07-ab3805f27448","year":2020},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:32:59.884023Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:1eaef26f37f52934da36429cd080c06890dd54cae4f5e1660db7990554524240","observation_id":"0cd1e4ec-ee51-429a-b474-6288fd90a7f7","resolution":{"observed_at":"2026-08-07T14:33:04.094416Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:00.004051Z","title":"The complexity of drawing graphs on few lines and few planes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.004051Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:6cc29767215391bd0c6ce7887fcbcc18af5bd627d69eae92755c9037b219833f","observation_id":"b5eb9f47-3738-4b2b-940c-66a079274d0a","resolution":{"observed_at":"2026-08-07T14:33:00.004051Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.08723","last_updated":"2026-05-31T15:55:24Z","snapshot_observed_at":"2026-07-06T05:57:06.002909Z","submitted_at":"2017-08-29T12:26:43Z","title":"Beyond Outerplanarity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.08723","snapshot_observed_at":"2026-08-07T14:33:00.107504Z","title":"Beyond outerplanarity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.107504Z"},"links":{"cited_paper":"/paper/1708.08723","citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:6ff47c3b393ca09f57ae8c39222e2623ae450cd74595125f477dd44bab8d19c3","observation_id":"6a5b60b2-ee2b-46d7-b861-e47c68402e8a","resolution":{"observed_at":"2026-08-07T14:33:00.107504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15416","last_updated":"2024-07-02T15:50:42Z","snapshot_observed_at":"2026-07-06T16:11:51.259378Z","submitted_at":"2023-08-29T16:21:08Z","title":"The Parametrized Complexity of the Segment Number","version":3},"cited_work":{"arxiv_id":"2308.15416","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.15416","snapshot_observed_at":"2026-08-07T14:33:04.380569Z","title":"The Parametrized Complexity of the Segment Number","venue":"cs.CG","work_id":"0f791e21-2815-47bc-ad88-1a4c319957b7","year":2023},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.175128Z"},"links":{"cited_paper":"/paper/2308.15416","citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:a144fc5242cfc6de1278b08b68b6327f0f3f83f0f9598c83c3b0f1ad21d73482","observation_id":"326a7fe0-7220-4586-aecc-d7bba267f4bc","resolution":{"observed_at":"2026-08-07T14:33:04.443538Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:00.292298Z","title":"The monadic second-order logic of graphs","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.292298Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:1ade03d02489c8c58424f30a8fc3de6b613c0d35fe0b9e161be29af40f11f494","observation_id":"f6d05531-e5f5-45e2-8ddd-62c2daca16d6","resolution":{"observed_at":"2026-08-07T14:33:00.292298Z","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.1017/cbo9780511977619.007","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:03.859733Z","title":"Monadic second-order logic, page 315–426","venue":null,"work_id":"1f99e39a-dcab-4b1a-93a2-786e4b1b264b","year":2012},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.402077Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:52e9cfbe0b57fe867b47784c95ab62f9c9b372e6799f815ace797ba3733fbf41","observation_id":"18eb86d9-9cb0-4a92-a9f8-1a9375076e44","resolution":{"observed_at":"2026-08-07T14:33:03.944037Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:05.299365Z","title":null,"venue":null,"work_id":"efbb14b3-ca08-4d6c-834e-2ef785e040f1","year":null},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.474385Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:16ecc50b9e1ba7749f4c2da1607c4fb681a10d5645307c45c9e8c6e0844461d0","observation_id":"d78fe0d4-1759-482b-b2c9-f7cc8abfea9b","resolution":{"observed_at":"2026-08-07T14:33:05.424440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.20382/v12i1a8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:03.683716Z","title":"Cubic planar graphs that cannot be drawn on few lines","venue":null,"work_id":"c3718934-229d-4946-a438-89f6d2f6ca64","year":2021},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.710582Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:eb802bcf8995c8a242ae961472b3a507b5e3e14cb4adedbb65b174b2637d382d","observation_id":"91fb083d-1e3d-4744-9d32-a7a7f6681dc9","resolution":{"observed_at":"2026-08-07T14:33:03.747702Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:05.135365Z","title":"The weak line cover number in 3D for restricted graph classes","venue":null,"work_id":"1a013366-3f75-49e8-9983-53b0952e34f6","year":2021},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.837292Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:010e5c0950ac9f90d9ff900a7cdd439f589c91afa7e511be0ce11c55ccba9873","observation_id":"c7afc459-6ead-44a6-a8c2-561e6f106dec","resolution":{"observed_at":"2026-08-07T14:33:05.208946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.37236/1799","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:03.546850Z","title":"Vertex-partitioning into fixed additive induced-hereditary prop- erties is NP-hard","venue":null,"work_id":"0216cb0f-d34c-4f59-bce4-7e1d57223b41","year":2004},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.920579Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:1a8a83c0604437e7ace9a4e6fd24628eda5cb5368add200391709c963135aa4c","observation_id":"1bdc4b45-471c-46dd-818d-1e3806574ceb","resolution":{"observed_at":"2026-08-07T14:33:03.604667Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:04.943246Z","title":"Fellows, Jan Kratochv ´ ıl, Matthias Middendorf, and Frank Pfeiffer","venue":null,"work_id":"54853bb6-02ad-47a6-9c10-eb0b5189bfcc","year":null},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.984119Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:5fc61e155ec20887498f134b34d449efe013d107dcb4195ee5de0c122fb8b7ca","observation_id":"b12c4291-b53e-47b2-b0fb-55a579121691","resolution":{"observed_at":"2026-08-07T14:33:05.033245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.20382/jocg.v11i1a18","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:03.386403Z","title":"4-connected triangulations on few lines","venue":null,"work_id":"d149bd17-c397-47f2-ad55-6bd463f6ee5d","year":2020},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.170780Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:2098d2707f703a5b25d31457cac4ca486b84464dad2135633ac7c5b1de899728","observation_id":"060ee462-fcf4-47f5-909e-92eb56da707e","resolution":{"observed_at":"2026-08-07T14:33:03.457986Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:04.820906Z","title":"On the weak line cover numbers","venue":null,"work_id":"e1352bdb-fdf9-437c-88b9-a21dfb7b968f","year":2018},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.247965Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:c361566cd8c44759cc0fb28dfe4e1bd66c93b682da040243f5c87d774ca3b067","observation_id":"02981056-e3fc-4931-82dd-a5963a4dc5a3","resolution":{"observed_at":"2026-08-07T14:33:04.885815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00474","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:03.212886Z","title":"Experimental analy- sis of the accessibility of drawings with few segments","venue":null,"work_id":"0c5c8a3a-aae5-4217-9f8e-ee5d007b9143","year":2018},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.361647Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:eabab50e4bc113aa1fc753349c41bbc81f40d876ecb04d04a89354b350ca06bd","observation_id":"3a828b0b-ab99-415b-8df9-e01d67ab099f","resolution":{"observed_at":"2026-08-07T14:33:03.284947Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:01.468121Z","title":"A single-exponential time 2-approximation algorithm for treewidth","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.468121Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:66f441712f1c9eaf568902fe03b024d59af22223179e7629c0f85e1eb391a2fb","observation_id":"e6f74b95-2f01-45b1-99bb-a62fbdac7b8a","resolution":{"observed_at":"2026-08-07T14:33:01.468121Z","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.7155/jgaa.00495","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:03.048059Z","title":"Drawing graphs on few circles and few spheres","venue":null,"work_id":"a9014db7-f1a2-49b3-b4a3-033dc43b7941","year":2019},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.552344Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:d8531cc6d0856f437feca5811f8f0414291d6562ab42f53af09b55074e185ba2","observation_id":"866583b6-58f8-4dce-a9a9-323fe01f7f79","resolution":{"observed_at":"2026-08-07T14:33:03.136739Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/jgt.3190140113","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:02.876143Z","title":"Bounds for the vertex linear arboricity","venue":null,"work_id":"a804d5dc-0f4d-4f5f-9bc6-2eefd62e2e34","year":1990},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.659355Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:1b192c5162bd23cd94f55d4fe5004cce4f6062519076cf6e64c779682a85c78c","observation_id":"b4b80a88-bdf4-4159-9d9c-fd45b7459708","resolution":{"observed_at":"2026-08-07T14:33:02.947197Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08871","last_updated":"2019-09-07T11:31:53Z","snapshot_observed_at":"2026-07-06T08:16:24.952965Z","submitted_at":"2019-08-23T15:37:38Z","title":"Variants of the Segment Number of a Graph","version":2},"cited_work":{"arxiv_id":"1908.08871","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.08871","snapshot_observed_at":"2026-08-07T14:33:04.206951Z","title":"Variants of the Segment Number of a Graph","venue":"cs.CG","work_id":"29a5bec1-bfcd-4bd1-8568-6520a6320082","year":2019},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.778580Z"},"links":{"cited_paper":"/paper/1908.08871","citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:f997e1260c69afeeed81230619e1c616ff4bd69fe8d80448c8cbb6e621223894","observation_id":"fab3a534-4054-4189-99b3-bf4131aff0b3","resolution":{"observed_at":"2026-08-07T14:33:04.289513Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:01.896725Z","title":"On the computational complexity and geometry of the first-order theory of the reals","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.896725Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:e9f83c968e20f256574334853dfd6347b9f592d402b66e05aa5a491472c29391","observation_id":"a1112e01-7818-472f-b471-fb0ef1028e98","resolution":{"observed_at":"2026-08-07T14:33:01.896725Z","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/s0747-7171(10)80004-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:02.698287Z","title":"On the computational complexity and geometry of the first- order theory of the reals","venue":null,"work_id":"afed6f93-0be7-40ea-b600-5f889e51031b","year":1992},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:02.022081Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:4548ec28cbb092e4080ba991086989491c80a66453dd222ae7042aab0fd17b97","observation_id":"0c1887d7-41d9-4fbc-8542-46e9d0b97acd","resolution":{"observed_at":"2026-08-07T14:33:02.777904Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0747-7171(10)80005-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:02.544749Z","title":"On the computational complexity and geometry of the first-order theory of the reals","venue":null,"work_id":"1a8feef8-3669-4f0d-af5e-8acd87a03bbc","year":1992},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:02.176838Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:524c4bcf85fd2a5c3462701a6d35fb7c228a0b8663fd32af3c4da107c04166f1","observation_id":"79a0b1f9-84f6-4575-b853-1b2fc9b4bcf4","resolution":{"observed_at":"2026-08-07T14:33:02.620428Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00366","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:33:02.369343Z","title":"Drawing graphs with few arcs","venue":null,"work_id":"80c7df7c-6d3c-45a5-bfca-f975abc276fa","year":2015},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:02.257697Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:7db74d866b1a11a3109562dfa0a2c1d951acbb5aa5b3ce3c8477c8cb6a55759b","observation_id":"c9ae7627-abb0-4829-ac9c-cbf84cdf733a","resolution":{"observed_at":"2026-08-07T14:33:02.436387Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T14:33:01.072583Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:01.072583Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:b49966883736ea36b2c19c56270bca86019e7ce9479cb7170ead6e6fa465e6c7","observation_id":"830f6ddf-ea47-4ab1-88b1-8d33633f65f8","resolution":{"observed_at":"2026-08-07T14:33:01.072583Z","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-07T14:33:00.593983Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:00.593983Z"},"links":{"citing_paper":"/paper/2505.18885"},"observation_digest":"sha256:a5d53ef4987d979c7044de42ea1d63cf405aa0eceb76bdc759eecddb86ef56a9","observation_id":"8b8a5f0e-8a2a-4e4f-b45d-af5dfa4fe76a","resolution":{"observed_at":"2026-08-07T14:33:00.593983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.18885","last_updated":"2025-05-24T21:55:22Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T14:21:43.404372Z","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":13,"verified_fuzzy":3},"total_outbound_references":25},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2505.18885."}