{"as_of":"2026-08-21T12:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7083b309c42d7a0d8887d8cd63dc0105c08e92075cc9b62a46ba8ebdb6970165","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T17:26:02.148189Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T15:21:33.592018Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T05:49:37.830819Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"cited_work":{"arxiv_id":"2508.16319","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.16319","snapshot_observed_at":"2026-07-04T05:49:37.830819Z","title":"20 Reinhard Diestel.Graph Theory, 4th Edition, volume 173 ofGraduate texts in mathematics","venue":null,"work_id":"f1e35f6c-30f3-450b-9d7f-f9fd651b17ed","year":null},"citing_paper":{"arxiv_id":"2606.20331","last_updated":"2026-06-18T15:04:39Z","snapshot_observed_at":"2026-08-21T02:52:06.422150Z","submitted_at":"2026-06-18T15:04:39Z","title":"Computing Twin-Width via Treedepth and Vertex Integrity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T15:21:33.592018Z"},"links":{"cited_paper":"/paper/2508.16319","citing_paper":"/paper/2606.20331"},"observation_digest":"sha256:4a437a2a787ac8d426cebfc1286f4f290153a2d8b7520ddc9e2205cfa39bf041","observation_id":"2d2566b4-3893-4289-b729-1f986965d621","resolution":{"observed_at":"2026-07-04T05:49:37.833825Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.16319/citation-record","integrity":"/paper/2508.16319/integrity","json":"/paper/2508.16319/citation-record.json","paper":"/paper/2508.16319"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T17:26:01.146610Z","title":"E liminating C rossings in O rdered G raphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.146610Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:68ebc72647be25c879266a90c46c2b9e02e6a6dea20f06c719f7ef2852bf1aaf","observation_id":"e8e8f75a-7fcd-429b-8dc3-808c4332a6f2","resolution":{"observed_at":"2026-08-05T17:26:01.146610Z","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-05T17:26:02.911091Z","title":"Asymptotically tight bounds for some multicolored ramsey numbers","venue":null,"work_id":"9361bf2e-7ce0-47ec-a32d-155e3b2a0714","year":null},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.194584Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:c2c30eb6f8ab028fda58e395194615e3b617d421b8057d36d567621bcb81ac9c","observation_id":"6e14a8c8-dbec-4e17-bcea-b7a5447c5be0","resolution":{"observed_at":"2026-08-05T17:26:02.914155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:01.278547Z","title":"Bekos, Philipp Kindermann, and Tamara Mchedlidze","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.278547Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:fea25438b585b3e27091b8afa7891328bf36adf67f3b336a76d5b2a8d01ded85","observation_id":"7618537b-e499-47c9-9b93-314e84cf0f7e","resolution":{"observed_at":"2026-08-05T17:26:01.278547Z","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-05T17:26:01.422367Z","title":"C rossing M inimization for 1-page and 2-page D rawings of G raphs with B ounded T reewidth","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.422367Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:49e188d284d58067fb88a093986512d15d5d2e17cdbcca004134298dfd078192","observation_id":"2804ee02-de53-4f24-88c0-d795174d3769","resolution":{"observed_at":"2026-08-05T17:26:01.422367Z","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-05T17:26:01.528399Z","title":"Bekos, Martin Gronemann, and Chrysanthi N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.528399Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:1f0a834823940de759bf3ee52179284d9edb5b32f330ea1a050a899ec6cdaf64","observation_id":"7de4403f-2d27-4740-abd9-afb6d58cf671","resolution":{"observed_at":"2026-08-05T17:26:01.528399Z","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-05T17:26:01.603557Z","title":"On the U pward B ook T hickness P roblem: C ombinatorial and C omplexity R esults","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.603557Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:85a34b3ae5fe8eb65130ac36a52e11d3ae855083920da5e7647ab17bc5627c22","observation_id":"d167ee64-9946-4f0d-8eb2-79b758341367","resolution":{"observed_at":"2026-08-05T17:26:01.603557Z","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-05T17:26:01.697570Z","title":"Parameterized A lgorithms for B ook E mbedding P roblems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.697570Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:adc7dcb775b3ad28ca17d68f83c61c842187172b5143343f33f4218d4a14c880","observation_id":"056ae69e-709e-419d-a7f2-7695f9005c84","resolution":{"observed_at":"2026-08-05T17:26:01.697570Z","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-05T17:26:01.778095Z","title":"Parameterized A lgorithms for Q ueue L ayouts","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.778095Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:7ba5e71085062ef9113837a94ad8de24439adfd4b6205a6147fd5c21d554736a","observation_id":"ab73d21a-e503-41df-a422-a2cb38a193bb","resolution":{"observed_at":"2026-08-05T17:26:01.778095Z","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-05T17:26:01.874001Z","title":"Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, and Tom C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.874001Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:da1c42d6ca5455bf2c3d7b0f0dd67c9303f79ac14a55dfdc66de9b2d04944079","observation_id":"6a2a8637-8b56-4820-99fd-12d9a6fffaab","resolution":{"observed_at":"2026-08-05T17:26:01.874001Z","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-05T17:26:01.970529Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.970529Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:8b61767cb5a4d68889ce5fb4b93ec9b14cdd5b05dc142f9bb090b88f80131bb9","observation_id":"e19931f1-d3ae-4de8-a1e9-eac14c3bd4e0","resolution":{"observed_at":"2026-08-05T17:26:01.970529Z","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-05T17:26:01.995677Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \\' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:01.995677Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:462ff8da60d3c6c5f962d2013b15b900154df9cb581ac1cb3213daf900902ef5","observation_id":"d97cf97a-d3a4-42a2-979b-87ecf989d7ee","resolution":{"observed_at":"2026-08-05T17:26:01.995677Z","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-05T17:26:02.065189Z","title":"Fink, Robert Ganian, and Martin N \\\"o llenburg","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.065189Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:54473eecce0af08090560bd1573788399fc5372d322fbd7062899a076a2268d8","observation_id":"42bcd441-4926-42be-94cc-23fa099aee3d","resolution":{"observed_at":"2026-08-05T17:26:02.065189Z","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-05T17:26:02.901934Z","title":"Fink, Robert Ganian, and Martin N \\\" o llenburg","venue":null,"work_id":"e1fe77c2-ff56-4b95-97be-259c7b69a3a4","year":2025},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.067765Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:080c08d80af0acea0ba0cf4168286b07da5cdb85d9ce6e7d62c6b5733469b239","observation_id":"5be33f47-c052-4f90-9092-9ff4fc9b1b93","resolution":{"observed_at":"2026-08-05T17:26:02.905099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.892123Z","title":"G raph T heory, 4th E dition , volume 173 of Graduate T exts in M athematics","venue":null,"work_id":"05202075-a924-4e82-8229-bbde9f020416","year":2012},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.070239Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:d1b4b5b019593387226a9526e5115a7ed403bac26308388f3193a923e98e8c20","observation_id":"cdf3c9ea-952d-4649-a4a9-8303d00bdcb6","resolution":{"observed_at":"2026-08-05T17:26:02.895504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.072601Z","title":"Dregi, and Pim van 't Hof","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.072601Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:fc9401d1704901624d03ce8d919b65f939f7c774739093baeeb5fa5c28807511","observation_id":"6fc90729-2212-401f-bd50-c4648f7dc6ae","resolution":{"observed_at":"2026-08-05T17:26:02.072601Z","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-05T17:26:02.074959Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.074959Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:6ee68529a2198b7acd7f6f634db5df7641d8911f554e6fe914a5e71787df94c9","observation_id":"f6b784ca-7db6-4036-8a62-5a0fb28144e4","resolution":{"observed_at":"2026-08-05T17:26:02.074959Z","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-05T17:26:02.077343Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.077343Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:f07e28f2b7cc3153ac2580d49f92b73b71723f15ea33eba9c75480dbb53581a8","observation_id":"90770004-efe9-4349-9374-6dccfd251617","resolution":{"observed_at":"2026-08-05T17:26:02.077343Z","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-05T17:26:02.079817Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.079817Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:88005b957c6e92f92ee255fad44431702602f53a164264f6263b996f8dfff3c1","observation_id":"2d850752-9bec-44a3-82da-2ab75d23bb72","resolution":{"observed_at":"2026-08-05T17:26:02.079817Z","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-05T17:26:02.082270Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.082270Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:22396ffb6d9ef34f5ca5046177540a5f8682fd1e276eefdc3231fba28ef23e5c","observation_id":"8f200083-5716-471c-aba6-b0cbc9cb751f","resolution":{"observed_at":"2026-08-05T17:26:02.082270Z","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.46298/dmtcs.550","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Discrete Mathematics & Theoretical Computer Science","work_id":"f115f3a5-3a51-41d6-b939-805c85d00e0b","year":2011},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.085062Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:00dc0dde9823980e215e69970a69aaaf5848a8e776a5beb4deb5f825e5444a51","observation_id":"ee0f09e8-8bb8-4f29-9faa-dc7e9c379512","resolution":{"observed_at":"2026-08-05T17:26:02.321274Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2017/85","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Solving I nteger L inear P rograms with a S mall N umber of G lobal V ariables and C onstraints","venue":null,"work_id":"673da6fa-20ab-44f4-bfe2-87c1c41c54a0","year":2017},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.087552Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:3658caab16f9324f1e43d0ad431bf792278b5eee905a566895dcabda78c9f6a2","observation_id":"bc54d10a-32e5-4557-996f-880ccc5607df","resolution":{"observed_at":"2026-08-05T17:26:02.313586Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.10356","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T17:26:02.705926Z","title":"he complexity landscape of decompositional parameters for ILP: P rograms with few global variables and constraints","venue":null,"work_id":"0be998c8-1017-4b59-b9a9-a3f8ff6589fc","year":2021},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.090288Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:470905e42b3687c28ce6184bb98577788cac38e7e83effe8ccc7cf1a5157b3af","observation_id":"ec5cdfe0-5ed0-4884-a6b5-fd649ca1b2d3","resolution":{"observed_at":"2026-08-05T17:26:02.789890Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.092762Z","title":"On S tructural P arameterizations of the B ounded- D egree V ertex D eletion P roblem","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.092762Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:fa225d5b804f6425db7aa8fb540c4442cde31784aee6d4a494c0d275289a1880","observation_id":"598de0b9-f12d-433c-ba24-4097be856275","resolution":{"observed_at":"2026-08-05T17:26:02.092762Z","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-05T17:26:02.095279Z","title":"Parameterized C omplexity in G raph D rawing ( D agstuhl S eminar 21293)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.095279Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:c320caf58f7f2e6cbfb5725e4cea69b0911e536227b145fd214cb7aee80537ee","observation_id":"245f5cd7-d14f-4960-844e-6276bafa5a06","resolution":{"observed_at":"2026-08-05T17:26:02.095279Z","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.4230/lipics.icalp.2024.68","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A T ight S ubexponential- T ime A lgorithm for T wo- P age B ook E mbedding","venue":"arXiv (Cornell University)","work_id":"a1fdb993-d8c8-4718-aebd-22d0fb1a15a3","year":2024},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.097872Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:623c954227d773809e5cd04b6f267d741fcb284090f626c07ce89a38d746aadf","observation_id":"a441bf53-91db-4b43-9c42-7fc02ed270f3","resolution":{"observed_at":"2026-08-05T17:26:02.294876Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-020-00795-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On S tructural P arameterizations of the E dge D isjoint P aths P roblem","venue":"Algorithmica","work_id":"5da21b8c-2da0-4cf8-96ec-62093f806e45","year":2021},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.100206Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:35895205e5acfec0b76914b4c9baaab19ea3e16fbcfdccc7c925fab6ad20888c","observation_id":"edf314ec-aaec-4004-ba94-5d5327712921","resolution":{"observed_at":"2026-08-05T17:26:02.287024Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.883368Z","title":"Garey and David S","venue":null,"work_id":"c7fcab89-9b8d-48d4-9061-d331a567f152","year":1979},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.102527Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:4259dd2008d16297cbc80d36de4a8d68b352304aa8de8f15ddb76b4d41e787f8","observation_id":"8174923b-77b8-4203-98e8-a9cf6c2e272c","resolution":{"observed_at":"2026-08-05T17:26:02.885954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.105070Z","title":"Exploring the gap between treedepth and vertex cover through vertex integrity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.105070Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:8fc9a6488914aa496c6146433e5bf0d70059001200c9fc7dc13ef7c9445b1e9b","observation_id":"52788f22-61a8-4b1e-b72c-7711dba2cf4f","resolution":{"observed_at":"2026-08-05T17:26:02.105070Z","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.4230/lipics.mfcs.2024.58","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Parameterized V ertex I ntegrity R evisited","venue":"arXiv (Cornell University)","work_id":"019a460c-ac6b-434c-a14e-63f8f7982fc2","year":2024},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.107487Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:9085e92da5983c3bcda166c5bc2eeef1105e81dd476fcb44bd50fa8ccf8b6a1e","observation_id":"c8bf8c7b-5dfb-4c46-80b6-5e858ff7568c","resolution":{"observed_at":"2026-08-05T17:26:02.273593Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1998.0085","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T17:26:02.511118Z","title":null,"venue":null,"work_id":"898bd3ce-1a30-45e8-8931-74181b286558","year":1999},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.109855Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:7a851ce60861a4967a0b0f3c2d2cb0ae658fc26f5ffebc9bb17fa3a0ab3da228","observation_id":"8ae5a67c-d3b0-4c36-97ec-9462ad03d34b","resolution":{"observed_at":"2026-08-05T17:26:02.581174Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0608018","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"SIAM Journal on Algebraic and Discrete Methods","work_id":"63587a01-2a40-45ac-8ce1-df361dd10fff","year":1987},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.112771Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:ad2dbe1b1e1cd12935221593cbcecb5b55b6194a670ba8ad12b093637a3da1d1","observation_id":"9dea536e-1b6e-4b2b-a93d-d8dc4603f274","resolution":{"observed_at":"2026-08-05T17:26:02.264845Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0021813","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Heath and Sriram V","venue":"Lecture notes in computer science","work_id":"daf6aed6-32b2-475c-8ca4-27865443144b","year":1996},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.115168Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:414e728d4e89c5059e2e5ef2242e051e72594d0228ee20685ef2f92f8475a643","observation_id":"f383b5a3-54de-4a1d-9dd7-bbf32bd9baaf","resolution":{"observed_at":"2026-08-05T17:26:02.256912Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.117487Z","title":"Heath and Arnold L","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.117487Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:ea44d72dcdeacb701dec06f01f5b073c731bd39e7b56f0098ab1280e24cab727","observation_id":"ccc8b9d0-c4fb-49a3-ba6b-c9c7cd40f51e","resolution":{"observed_at":"2026-08-05T17:26:02.117487Z","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.1007/3-540-46648-7_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"L evel P lanar E mbedding in L inear T ime","venue":"Lecture notes in computer science","work_id":"dcbe94a1-ba2a-4c08-9a43-529ca5d57193","year":1999},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.120289Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:e7d8045ea695c0d43b33d9de116197b72a4cc5059465241ca8fb6c9d5afe6b2a","observation_id":"3c7f388f-a904-4606-a0d3-c959a627c4b7","resolution":{"observed_at":"2026-08-05T17:26:02.243502Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00045","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"L evel P lanar E mbedding in L inear T ime","venue":"Journal of Graph Algorithms and Applications","work_id":"1c8b5b52-b14d-4014-ac02-428258e8d416","year":2002},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.122800Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:e41100b6e398238ff5f4f451d2a9f60f9e8abc88eff39f6b237eaee2858463ea","observation_id":"a3e96bd1-185c-4575-9569-759b7b071d54","resolution":{"observed_at":"2026-08-05T17:26:02.234860Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.126143Z","title":"Level P lanarity T esting in L inear T ime","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.126143Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:5e4bcc572f5699fadfd222b95eda0f7c5aba1c58a02fda32e5527f30ff21e24f","observation_id":"0a97a45b-4b30-4aaa-8657-950449d954b0","resolution":{"observed_at":"2026-08-05T17:26:02.126143Z","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.4230/lipics.stacs.2025.56","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Transforming S tacks into Q ueues: M ixed and S eparated L ayouts of G raphs","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"a000ab32-2b49-4f0e-8fc1-ae41b2a56e9b","year":2025},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.128627Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:9d611fc7ea814643762ca4a08c59b6888e64e37bb1e8612bd0cbdc142ad9b278","observation_id":"5d4ca769-e679-41fe-9862-65ec8a347323","resolution":{"observed_at":"2026-08-05T17:26:02.221837Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.130962Z","title":"Fine-grained M eta- T heorems for V ertex I ntegrity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.130962Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:25549e60b1d8ffc9e3f967fe2a8b59efea820ed9dd0441de3abb49f49f5d6505","observation_id":"36b32585-8c04-49ee-903a-85c548dc85d5","resolution":{"observed_at":"2026-08-05T17:26:02.130962Z","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.tcs.2021.04.021","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering","venue":"Theoretical Computer Science","work_id":"9991652e-b143-4e63-94fc-07c7f09ac87c","year":2021},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.133383Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:82dc6a0501cc61d44aefa95fc3e6c2043a16a4dcd729d05e1142632d6d1c598f","observation_id":"bc4c0c87-71a3-4fbe-9bd5-998232dd62d1","resolution":{"observed_at":"2026-08-05T17:26:02.208133Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.874952Z","title":"Rosenberg","venue":null,"work_id":"1e580f4e-c4a0-438a-bac6-684e81059ae0","year":1986},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.135686Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:48fee24d0dc1e47a8df43daf0b04e8e747b373ea6b7dd34f603ca0644d462b2a","observation_id":"9bf6d86e-8f71-4f64-a7e5-6340a72b18c7","resolution":{"observed_at":"2026-08-05T17:26:02.877676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.137995Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.137995Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:0e61876b7093b944cfe0ae4da471a4102adf1b9ed13b1fb22a8656462e1a677f","observation_id":"a0154f07-c1d6-4117-a2c9-1fb5975d7f32","resolution":{"observed_at":"2026-08-05T17:26:02.137995Z","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/0890-5401(88)90036-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A T rade-off between P age N umber and P age W idth of B ook E mbeddings of G raphs","venue":"Information and Computation","work_id":"54020c48-2ba1-4abd-899d-ec4436335f6a","year":1988},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.140396Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:d3743e3a92a550cfd070561538a91c5196bb5d3431b7097f2c21744bf4458575","observation_id":"a6a7604f-e4f6-49bb-9685-cc0922c37f7a","resolution":{"observed_at":"2026-08-05T17:26:02.194392Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0012-365x(91)90398-l","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The pagewidth of trivalent planar graphs","venue":"Discrete Mathematics","work_id":"8152b7a7-08cd-4553-81a8-61a538a2e907","year":1991},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.143021Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:05ecdb86f670c1759084a4d70858daef32e61b89e9c417b4a3f416ef557ddabf","observation_id":"2f6f965b-be5e-48d9-95a3-9a27d9dc046b","resolution":{"observed_at":"2026-08-05T17:26:02.185633Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-05T17:26:02.145569Z","title":"On the queue-number of graphs with bounded tree-width","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.145569Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:7d9cd45d758583b42858f4980a8c990b137f9f31a68fc5f0f66f8eaec5cfd9b5","observation_id":"f150c490-4b9e-48d5-a303-f8a372e75be3","resolution":{"observed_at":"2026-08-05T17:26:02.145569Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T17:26:02.148189Z","title":"Embedding P lanar G raphs in F our P ages","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T17:26:02.148189Z"},"links":{"citing_paper":"/paper/2508.16319"},"observation_digest":"sha256:524fe08e16849b9d81abcd872abc18be722aa7b2bc2b37fc045d5d607db1074a","observation_id":"5ae5e6a5-10c2-4d21-8205-cf3f3541305b","resolution":{"observed_at":"2026-08-05T17:26:02.148189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.16319","last_updated":"2025-08-22T11:58:56Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T02:30:01.356853Z","submitted_at":"2025-08-22T11:58:56Z","title":"Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":24,"verified_exact":14,"verified_fuzzy":5},"total_outbound_references":45},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 1 inbound Pith citation observation for arXiv:2508.16319."}