{"as_of":"2026-08-12T17:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35573454885161ad64f8cac9c092b487e169e6579d145956fb333b6ba23eff89","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T22:01:56.617323Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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-08-07T04:32:34.008685Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T04:32:34.455450Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"cited_work":{"arxiv_id":"2412.04042","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.04042","snapshot_observed_at":"2026-08-07T04:32:34.455450Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","venue":"cs.DS","work_id":"7749e9c6-abe3-47c8-a839-cf39619b574a","year":2024},"citing_paper":{"arxiv_id":"2506.10717","last_updated":"2025-08-27T12:02:31Z","snapshot_observed_at":"2026-08-07T04:17:21.055175Z","submitted_at":"2025-06-12T14:05:44Z","title":"Structural Parameterizations of $k$-Planarity","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T04:32:34.008685Z"},"links":{"cited_paper":"/paper/2412.04042","citing_paper":"/paper/2506.10717"},"observation_digest":"sha256:c3c46618878470890815cd83d6140418d597e623d5300bd69a03924e7d2b5b88","observation_id":"b4fc7cdf-941b-4add-95f5-0bb68358e548","resolution":{"observed_at":"2026-08-07T04:32:34.460061Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2412.04042/citation-record","integrity":"/paper/2412.04042/integrity","json":"/paper/2412.04042/citation-record.json","paper":"/paper/2412.04042"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.371485Z","title":"Eliminating crossings in ordered graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.371485Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:04e33904be2fdf2c6e7efe2c42d48ff1206c05cbe2b15ed5cf493c247df4b1a9","observation_id":"ad6fb8fb-b603-4d54-92b3-12e2c7d54ec7","resolution":{"observed_at":"2026-08-11T22:01:56.371485Z","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-11T22:01:56.377648Z","title":"Edge partitions of complete geometric graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.377648Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:c82275e104ab8fa32e142f4a1790d41b7d6c47924bb804d1907d8acd1556897f","observation_id":"b56790a3-8c63-4b0e-bcf4-e492a6a35ded","resolution":{"observed_at":"2026-08-11T22:01:56.377648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.09329","last_updated":"2020-08-21T06:43:12Z","snapshot_observed_at":"2026-08-03T03:09:49.303188Z","submitted_at":"2020-08-21T06:43:12Z","title":"$2$-Layer $k$-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth","version":1},"cited_work":{"arxiv_id":"2008.09329","doi":null,"metadata_source":"pith","pith_arxiv_id":"2008.09329","snapshot_observed_at":"2026-08-11T22:01:57.884861Z","title":"$2$-Layer $k$-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth","venue":"cs.DM","work_id":"817dda05-d04d-41f7-8412-96aca5b60ebc","year":2020},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.383224Z"},"links":{"cited_paper":"/paper/2008.09329","citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:6d4b1d9600f5d471652e20059d7fe32c697485e774bc8d0a9556ece3df1f0324","observation_id":"622d3db4-1fb8-4143-84da-baf8fba47df1","resolution":{"observed_at":"2026-08-11T22:01:57.890116Z","resolver_source":"local_arxiv","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.388540Z","title":"Brandenburg, Andreas Glei ner, Kathrin Hanauer, Daniel Neuwirth, and Josef Reislhuber","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.388540Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:b7114efa3e6f4ba9e082b8aae2e89d3817eff39c9eed3ec423d25f52efa7a869","observation_id":"881a2bb3-c3a5-422e-9d47-ada361cdd681","resolution":{"observed_at":"2026-08-11T22:01:56.388540Z","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-11T22:01:56.393660Z","title":"Parameterized complexity of 1-planarity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.393660Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:7e52bdc1aa994692bdf7f748dfd46c6788c9998158fe97ac616fe110df90d767","observation_id":"522977fb-5c7e-4558-9141-f3cceba987f0","resolution":{"observed_at":"2026-08-11T22:01:56.393660Z","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-11T22:01:56.398197Z","title":"Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.398197Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:dfcbbb538758bbdd32316c1202e889dbf12b9797e3abe96f8952845b0c595c1d","observation_id":"0535f1ba-0f07-4245-a4a9-65af55a20c6b","resolution":{"observed_at":"2026-08-11T22:01:56.398197Z","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-11T22:01:56.403614Z","title":"Crossing reduction in circular layouts","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.403614Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:afd1cbc103c3c780cdd0e5e19c1eb7c82c3b7043afe0375e12a02f03106b8229","observation_id":"d01dfb99-29ce-4c46-ad86-7632a0eb1ae0","resolution":{"observed_at":"2026-08-11T22:01:56.403614Z","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-11T22:01:56.409139Z","title":"Parameterized algorithms for book embedding problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.409139Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:4db1b50cf65a92e5c907933effcf58c5483095d34f5356a087d8afe01595b4f2","observation_id":"f4433717-2754-455a-ac34-6735d89d65a1","resolution":{"observed_at":"2026-08-11T22:01:56.409139Z","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-11T22:01:56.413635Z","title":"Min- k -planar drawings of graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.413635Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:1c9e4e9142aa0db12d88e288ebdd45b05151ad1a659ff7e8c0ace0bf6cb6468a","observation_id":"a29a5642-67c7-48a0-b510-2dedf5545c10","resolution":{"observed_at":"2026-08-11T22:01:56.413635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13702","last_updated":"2024-10-19T11:48:13Z","snapshot_observed_at":"2026-07-06T17:47:47.206342Z","submitted_at":"2024-03-20T16:06:45Z","title":"Constrained and Ordered Level Planarity Parameterized by the Number of Levels","version":2},"cited_work":{"arxiv_id":"2403.13702","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.13702","snapshot_observed_at":"2026-08-11T22:01:57.858441Z","title":"Constrained and Ordered Level Planarity Parameterized by the Number of Levels","venue":"cs.CG","work_id":"022bd1a2-6853-4f4e-ad26-beaa61d88f83","year":2024},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.417552Z"},"links":{"cited_paper":"/paper/2403.13702","citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:83891e53d396fde45c6840104de267785c88f11e0652a2d8173df446f7eabf2f","observation_id":"7fc457ac-cc5f-4073-86aa-8071aae93b55","resolution":{"observed_at":"2026-08-11T22:01:57.865351Z","resolver_source":"local_arxiv","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.422230Z","title":"Bodlaender","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.422230Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:6ddc5323b190393e98a9f30adcf147d4900ae94e5aa68214d1abac6cb5811103","observation_id":"ab229702-d982-4553-a7d8-a8332d7e615c","resolution":{"observed_at":"2026-08-11T22:01:56.422230Z","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.ipec.2022.8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.993728Z","title":"Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, and Paloma T","venue":null,"work_id":"201d766f-37fa-4357-8577-7dc5e387393a","year":2022},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.426763Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:1bb54e09e61fda5e4de82468ff1d87d5a21e2127c98508450f0b45b10c74ed60","observation_id":"20cff9be-925a-4eab-94a3-916132294ab8","resolution":{"observed_at":"2026-08-11T22:01:57.000020Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.431458Z","title":"Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, and Micha Pilipczuk","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.431458Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:3f44576fc44bf4df3408993eb449aabf939c1a449d93b57147dcd6513edd7b00","observation_id":"ded047b7-de62-4863-829a-d5d796c28761","resolution":{"observed_at":"2026-08-11T22:01:56.431458Z","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-11T22:01:56.436907Z","title":"Bodlaender, Carla Groenland, Jesper Nederlof, and C \\' e line M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.436907Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:96cd06eb527c3d01657979e6637e186f0d34a7c0f42baa4534f38ecbcd7008a7","observation_id":"95835e6d-9fe8-400e-8f79-4a73bfe8f5b8","resolution":{"observed_at":"2026-08-11T22:01:56.436907Z","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-11T22:01:56.441807Z","title":"Adding one edge to planar graphs makes crossing number and 1-planarity hard","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.441807Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:38245633f0dbd157ee0a439ac05813e7c9e5d7221aa55e96b74b8c011b6b0ecc","observation_id":"68a7ae50-e679-4ea6-8b0d-3563f5e5bbb8","resolution":{"observed_at":"2026-08-11T22:01:56.441807Z","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-11T22:01:56.446547Z","title":"Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, and David R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.446547Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:e5ee92254cdf066011028da05bef643ceade14391cb4dfcac263768f9f4af4fb","observation_id":"a6e25505-3e60-4dd7-92e7-6b5c32b25ab0","resolution":{"observed_at":"2026-08-11T22:01:56.446547Z","resolver_source":null,"status":"unresolved"},"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-08-11T10:45:09.242362Z","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-11T22:01:56.451692Z","title":"Beyond outerplanarity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.451692Z"},"links":{"cited_paper":"/paper/1708.08723","citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:36ff2696a2271251ecd8bc838c540993149773a0d3a2f1dc873518cbce5e671a","observation_id":"e86709f6-fcfb-49b5-968b-f6daba4e566e","resolution":{"observed_at":"2026-08-11T22:01:56.451692Z","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-11T22:01:56.457695Z","title":"Fomin, ukasz Kowalik, Daniel Lokshtanov, D \\' a niel Marx, Marcin Pilipczuk, Micha Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.457695Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:83445baad93317fc4446c703832c540e8820b60a9bb460a98ff810f34d67121a","observation_id":"1ffd114e-c835-4eeb-8bdb-a48acdf2748b","resolution":{"observed_at":"2026-08-11T22:01:56.457695Z","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-11T22:01:56.462927Z","title":"A survey on graph drawing beyond planarity","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.462927Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:98ca9ea1603a5b71bf1d8755d786e240a623ddfefe7160932cb5871828237213","observation_id":"369769d0-c423-4e08-9e1d-2c09da4b1c4e","resolution":{"observed_at":"2026-08-11T22:01:56.462927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.15339","last_updated":"2023-06-27T09:49:31Z","snapshot_observed_at":"2026-07-06T15:47:11.292762Z","submitted_at":"2023-06-27T09:49:31Z","title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees","version":1},"cited_work":{"arxiv_id":"2306.15339","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.15339","snapshot_observed_at":"2026-08-11T22:01:57.730838Z","title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees","venue":"cs.CC","work_id":"8817de77-c2df-4f8f-9047-3a9ddd4beff7","year":2023},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.469025Z"},"links":{"cited_paper":"/paper/2306.15339","citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:230c971f87a0a39c357911b89b18b373db36490adfdd6da3854d160915c38f9a","observation_id":"bd9126f4-eb26-4490-a2bd-96534b264225","resolution":{"observed_at":"2026-08-11T22:01:57.736237Z","resolver_source":"local_arxiv","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.474555Z","title":"Downey and Michael R","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.474555Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:386d9430d53d01553672d003158d8c0299ec0eceed64cbb9aaf83763298128de","observation_id":"53484999-f9c8-4bfe-a627-3a35bf9eabf1","resolution":{"observed_at":"2026-08-11T22:01:56.474555Z","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-11T22:01:56.479144Z","title":"Hardness results for approximating the bandwidth","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.479144Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:82fd1f3c4095a5ad38d1578baa1070dbb2810bbcee84d4e6ad0dd78baa801a1f","observation_id":"5e0ce76b-a135-480b-a2d4-e91497ff985c","resolution":{"observed_at":"2026-08-11T22:01:56.479144Z","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-11T22:01:56.483743Z","title":"Beyond-planar graphs: Models, structures and geometric representations ( Dagstuhl seminar 24062)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.483743Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:44355059af2fd1bf571316158db721e7e6fdb6b3a0bae3dc262efefba41d372c","observation_id":"e7d4782f-c6ac-4f4d-b57b-bd1b45cd8584","resolution":{"observed_at":"2026-08-11T22:01:56.483743Z","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-11T22:01:56.487988Z","title":"On the space and circuit complexity of parameterized problems: Classes and completeness","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.487988Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:93382917e844395dafb7fe882c3ab1e416e61631999dfb6964340e54be6c2e57","observation_id":"abcb9767-6c8e-449d-a965-a88feab1aad4","resolution":{"observed_at":"2026-08-11T22:01:56.487988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04264","last_updated":"2024-10-14T13:14:11Z","snapshot_observed_at":"2026-08-12T17:34:21.173210Z","submitted_at":"2024-08-08T07:03:12Z","title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations","version":3},"cited_work":{"arxiv_id":"2408.04264","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.04264","snapshot_observed_at":"2026-08-11T22:01:57.708464Z","title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations","venue":"cs.DM","work_id":"db0f7266-dc22-4e4a-9ad1-e230a65ad9c5","year":2024},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.493198Z"},"links":{"cited_paper":"/paper/2408.04264","citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:2bd3a957b4137969fa0191ec037a517ebc5d7eb04044d5ceb72b532fdb3231c8","observation_id":"1655ee76-10cd-447c-9c99-15581eb6f489","resolution":{"observed_at":"2026-08-11T22:01:57.715360Z","resolver_source":"local_arxiv","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.498044Z","title":"Parameterized Complexity Theory","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.498044Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:27f02e25c8eee336e3ba48a0ff64c5337aff2194ea0079e1bab48adffdb9b851","observation_id":"474bc2c3-7cf9-446b-9ce1-72618458c0c3","resolution":{"observed_at":"2026-08-11T22:01:56.498044Z","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-11T22:01:56.503110Z","title":"Garey and David S","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.503110Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:9804995b2b8f50d5cc1994bc3d7144dde6978390fb030bf88fff2b8dc53f0bd1","observation_id":"b7df8dab-a671-43dd-944a-21828c30e1df","resolution":{"observed_at":"2026-08-11T22:01:56.503110Z","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-11T22:01:56.508036Z","title":"Garey and David S","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.508036Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:401f9543bdc62a722007e39f4128a1a5deafce206563024d0fbcb092d6f965b9","observation_id":"109666cd-0b2d-4516-b2e1-cbbf74fde6c8","resolution":{"observed_at":"2026-08-11T22:01:56.508036Z","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-11T22:01:56.512720Z","title":"Bodlaender","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.512720Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:2c48a0b5bc0b0835e5141a400733b1f123cce985ab33283e76d58c5ff63533c9","observation_id":"6acee6e3-3a54-4299-9f5b-b2931a2f64f1","resolution":{"observed_at":"2026-08-11T22:01:56.512720Z","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-11T22:01:56.517094Z","title":"Computing crossing numbers in quadratic time","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.517094Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:e1ca77008719b55249850813122db0398987e681a5d8b3bb7fd820d90ecf31ac","observation_id":"e30ea146-06b4-441e-b083-b86e6ffba2a7","resolution":{"observed_at":"2026-08-11T22:01:56.517094Z","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/s00453-014-9890-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.847926Z","title":"A linear-time algorithm for testing outer-1-planarity","venue":null,"work_id":"07f3d861-6041-4c4f-adb2-13c738052bf1","year":2015},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.521516Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:ba8d7e394c0518c6b5e6ce69a831091c229f94f2141d87474c49a8493689df60","observation_id":"c9eb42a5-d437-48a7-97cc-89d073413fe6","resolution":{"observed_at":"2026-08-11T22:01:56.855090Z","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.1016/j.dam.2018.08.018","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.831259Z","title":"A linear-time algorithm for testing full outer-2-planarity","venue":null,"work_id":"ffa5e266-0e12-46f0-b389-7d1e9f17f699","year":2019},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.528244Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:59bea89520e109ed82ec8a6948632fd801503150f514343edc0b05aae8d9d24b","observation_id":"3a2050da-9844-4bfe-9338-c6e68f66e544","resolution":{"observed_at":"2026-08-11T22:01:56.837229Z","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-11T22:01:57.901357Z","title":null,"venue":null,"work_id":"cc3992f5-1cf3-42d4-89ae-40b5eb25f093","year":1989},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.533682Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:2a9909b32240a5b348530999072e8a992514177f6cc4744285bbc8a1bbfc37b0","observation_id":"3676a256-5fec-4c98-bb22-999650fb7865","resolution":{"observed_at":"2026-08-11T22:01:57.908759Z","resolver_source":"raw_fallback","status":"unresolved"},"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-11T22:01:56.539245Z","title":"Computing crossing number in linear time","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.539245Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:d4c52c44073a7b3c86bf9c9a2ab580291307d5c3e53a441bab43e18d8c00d7a8","observation_id":"6cefa389-7ea8-47f7-b3fb-a4b9521671db","resolution":{"observed_at":"2026-08-11T22:01:56.539245Z","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.ipec.2017.25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.814111Z","title":"An improved fixed-parameter algorithm for one-page crossing minimization","venue":null,"work_id":"43ac2852-f4f8-4c12-8405-0900ba29497c","year":2017},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.544918Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:c3d51cdfb236265083609b41da41e3d877f64b968a0e6c02967aa5f3e60e6af1","observation_id":"9610086e-9282-4d08-a5ed-96781163195c","resolution":{"observed_at":"2026-08-11T22:01:56.819426Z","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.1007/s00453-014-9872-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.798390Z","title":"A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization","venue":null,"work_id":"3457c32d-6211-4707-9ed8-29a59796c24a","year":2015},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.550625Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:1274755ee64a31c8c255e48591f4c582fa613545d009ea4178c929b70f445b5a","observation_id":"4806f1fb-6776-48da-91cf-4a0a4ac50429","resolution":{"observed_at":"2026-08-11T22:01:56.803320Z","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.1016/j.ipl.2016.04.012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.783374Z","title":"A faster fixed parameter algorithm for two-layer crossing minimization","venue":null,"work_id":"9d2a5fa5-f26a-4918-854f-d65fb305adaf","year":2016},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.556046Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:6c882362adc93a071a3c1e5c827b487e436ec3646e6e680125ba9ce0652cdd09","observation_id":"50f50050-240f-430b-8075-7018b5376000","resolution":{"observed_at":"2026-08-11T22:01:56.788443Z","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.1007/978-3-030-64843-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.769790Z","title":"Parameterized algorithms for fixed-order book drawing with bounded number of crossings per edge","venue":null,"work_id":"651c21f7-cd69-4075-9776-ec646ff4a428","year":2020},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.560897Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:88551f7405b972d31ba0b2da263a537f930df1a0575274389c62d78046e72dc2","observation_id":"4bade9e8-e788-4d99-8ba7-ea50dfe43084","resolution":{"observed_at":"2026-08-11T22:01:56.774764Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.565243Z","title":"On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.565243Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:728d28a62732eb08479386cf27a93dc774dad4a37028205b9c814366d5e0c52b","observation_id":"e695d115-3959-48a5-879e-551d7bba790a","resolution":{"observed_at":"2026-08-11T22:01:56.565243Z","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-45848-4_10","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"One sided crossing minimization is NP -hard for sparse graphs","venue":"Lecture notes in computer science","work_id":"26281705-6027-4436-84c5-d30be7b073e4","year":2001},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.571210Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:64a34f96975e195458822a01bf012f2852b36416ee111900319a60e4659884d8","observation_id":"4937ce1b-2bb4-4966-92d6-95df1d89e433","resolution":{"observed_at":"2026-08-11T22:01:56.743841Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.575655Z","title":"Graphs drawn with few crossings per edge","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.575655Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:8e8297f283f98877b909bf6f57b6a69f8919a766e3ff5d3e39bd1284ed147cef","observation_id":"25eeadd1-b978-4c07-8ebb-fd7ff87e0025","resolution":{"observed_at":"2026-08-11T22:01:56.575655Z","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-11T22:01:56.580611Z","title":"On space efficiency of algorithms working on structural decompositions of graphs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.580611Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:edcd5feb74d67b36127a68778514d94ea451c8ff72c88ef0e8bc5a6c0ca2f2fc","observation_id":"542898dd-20ae-4ce6-8988-93bfdf7297cc","resolution":{"observed_at":"2026-08-11T22:01:56.580611Z","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.1109/tvcg.2010.269","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.699868Z","title":"Purchase, Christopher Pilcher, and Beryl Plimmer","venue":null,"work_id":"3e4adb2c-4ae4-408b-adf7-8c12ad7d2f68","year":2012},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.584849Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:0505f625ff19fd11800e7813317bcdcc12a3376ccbe4e276ddb646bb30d2d37d","observation_id":"e087b551-9a43-4045-9016-55d187e5fcb4","resolution":{"observed_at":"2026-08-11T22:01:56.706686Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.591828Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.591828Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:804a0c51cdda2e34401a2c06672bcb7229f566082b99b05fc596ab9842390c5f","observation_id":"a2358921-5a37-4cba-99e5-812a597fee2d","resolution":{"observed_at":"2026-08-11T22:01:56.591828Z","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-11T22:01:56.596681Z","title":"The graph crossing number and its variants: A survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.596681Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:89942f2494566ed7a73e6c756e49f7ff093b5f16b3cd3a56329a37da00eb2403","observation_id":"4d2e79b2-993f-43e0-be10-207c0972cee7","resolution":{"observed_at":"2026-08-11T22:01:56.596681Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539797331671","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.657316Z","title":"Sz\\' e kely, and Imrich Vrto","venue":null,"work_id":"917b0a9b-9eca-40c0-9173-a9726e38f710","year":2001},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.601469Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:d1fb00340a045147cb25773b9da16bd258ac3f68a1f9e9f3e6bb93331a437291","observation_id":"d8b133c6-38f3-42a3-b40b-1798dac92571","resolution":{"observed_at":"2026-08-11T22:01:56.663346Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:01:56.606717Z","title":"Methods for visual understanding of hierarchical system structures","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.606717Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:96cfb0cb7bbaa3aae2a740c005a573fb9e5a59655f2c4d6059f328e1ed0a8628","observation_id":"f3587af4-4e5d-4599-beef-877c82c39090","resolution":{"observed_at":"2026-08-11T22:01:56.606717Z","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-11T22:01:56.611983Z","title":"Urschel and Jake Wellens","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.611983Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:d6206c50c8594fc72f552ee2dbe41cccc026188dcfd42ac39a72efe70a6c9236","observation_id":"a46bf031-913f-43db-b757-49e1b872f2c3","resolution":{"observed_at":"2026-08-11T22:01:56.611983Z","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-11T22:01:56.617323Z","title":"Parameterized analysis and crossing minimization problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.617323Z"},"links":{"citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:0ca43fec2d1a626dee3b30c4cfd6ce5044854222ec35c8759a9f2e6a6ef6c41f","observation_id":"22daf6ef-8088-400f-a02b-a54f5a84408a","resolution":{"observed_at":"2026-08-11T22:01:56.617323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T21:47:17.350201Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":14,"verified_fuzzy":0},"total_outbound_references":49},"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 12 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 1 inbound Pith citation observation for arXiv:2412.04042."}