{"as_of":"2026-08-12T09:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b6a34e3dcbacf663fb37c54095c72f237b92d1a5c4a0baab838894be32590db","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:52:55.377624Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.05508/citation-record","integrity":"/paper/2608.05508/integrity","json":"/paper/2608.05508/citation-record.json","paper":"/paper/2608.05508"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.582964Z","title":null,"venue":null,"work_id":"7e3e2c87-2a59-4fcc-8284-beb02fdd3178","year":2020},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.316466Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:1bb394f9930263de4046d5b5f5ad5f2f8807387fbe9e0ee199b1b60cefeab50b","observation_id":"7e162769-4afc-4e1a-8bfc-631107b80ac0","resolution":{"observed_at":"2026-08-08T11:52:55.586056Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.573313Z","title":null,"venue":null,"work_id":"4678e4ae-5a37-4d8d-94dd-9cd22d7f2767","year":2022},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.320715Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:c7350af465e83085c1529b0bfe5274e47751f25c433376de0224fa858f205b0b","observation_id":"0163a499-8c76-452c-b6c4-ce96925537b9","resolution":{"observed_at":"2026-08-08T11:52:55.576478Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.564427Z","title":"Arnborg and A","venue":null,"work_id":"836cad5a-34f6-4311-b305-1d7d519b9c0b","year":1986},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.323993Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:9b30499f4b66fb0e31247b0fb250df82f128c611f2de75bed84105ac39cafb72","observation_id":"57665600-1593-4ea9-87f7-6e35724b9008","resolution":{"observed_at":"2026-08-08T11:52:55.567635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.555611Z","title":null,"venue":null,"work_id":"261f08bb-6fdd-488b-b7ce-30e5a8535e70","year":2023},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.327442Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:71f3448d2ea1f2add0628f9dae2e8e40fefaefc2ef46221cbadfe66edd85573c","observation_id":"4d6d6e30-d2a7-4666-8eec-cb06dce16e50","resolution":{"observed_at":"2026-08-08T11:52:55.558742Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.546636Z","title":"Di Battista, F","venue":null,"work_id":"dc6b4545-cd89-4222-a7d8-617e009a0af6","year":2013},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.330785Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:a7e3f9f750a674c57c4a5afcf5d89d6df63e200efe6acfb4232287b90cdbeba9","observation_id":"b80086a5-3126-4142-bd1b-b3866f704d0d","resolution":{"observed_at":"2026-08-08T11:52:55.549771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.537565Z","title":"Dujmovi´c","venue":null,"work_id":"96964665-ebbe-46aa-9490-e6a4a424147b","year":2015},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.334213Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:f7879bf7ffcac7ca775c6f97a88ee82c8c952dad6c89fc27c3d9967b163c836a","observation_id":"a5f8a1e9-f578-40d4-859d-36586da25ef1","resolution":{"observed_at":"2026-08-08T11:52:55.540722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.528123Z","title":"Dujmovi´c and F","venue":null,"work_id":"8762baee-7310-47e2-a448-83fb38b9280c","year":2018},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.337685Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:2564650129c87c1272e84a71086a6ca093988dbb8178f26d4c002c261962cdeb","observation_id":"6cf42150-0082-453e-9171-c72ada576e0f","resolution":{"observed_at":"2026-08-08T11:52:55.531681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.519439Z","title":"Dujmovi´c, G","venue":null,"work_id":"3db9b7e6-73d9-4bbc-b41d-8c0b0a73a87d","year":2020},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.340722Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:434f22f3e8f3280d9205f716b9e0b4de8e34e3f9f3a3bdd6a522807c99f205d7","observation_id":"74e8f996-ed7d-4d11-8ff2-c6ca69b01389","resolution":{"observed_at":"2026-08-08T11:52:55.522508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.510633Z","title":"Dujmovi´c, P","venue":null,"work_id":"e4f323a2-d93d-48e4-a4d6-51a3c74829f4","year":2005},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.343632Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:a5f478a693868d4ea43007b69c4b71497609ceb2fcb60125485dd12c030dc18c","observation_id":"4eae30d9-1163-475a-a8bb-3687448cfa66","resolution":{"observed_at":"2026-08-08T11:52:55.513856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.501147Z","title":"Dujmovi´c and D","venue":null,"work_id":"a62b714e-5f0f-4110-b4b6-91951a3dab35","year":2005},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.346822Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:299f50859dbc4eebb661145ba178c5e21e25536f3d6a4eebdc641cc742cf5994","observation_id":"2e10ad57-46c9-4b38-80d6-79fa4b9f809e","resolution":{"observed_at":"2026-08-08T11:52:55.504341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.491949Z","title":"F¨orster, M","venue":null,"work_id":"c3b6a35f-5c9a-4665-a6af-b98cf0180e39","year":2023},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.349855Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:ed87c228cbfce176aa67ce2830f2bcdeb8beb641155d2f31d3e9c39116c1891d","observation_id":"3872600c-1167-4ab0-9a49-67b854d74cbf","resolution":{"observed_at":"2026-08-08T11:52:55.495187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.482873Z","title":null,"venue":null,"work_id":"9d09d9cb-0413-48c6-ab53-8b33979ae867","year":1992},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.352759Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:b63867da9354dcab612122838fc107b2a9c3509d7da24c1ab7b4bce2add512a8","observation_id":"419c6226-bdb4-4056-b3fa-8a3018f55e5d","resolution":{"observed_at":"2026-08-08T11:52:55.486143Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.473809Z","title":null,"venue":null,"work_id":"e638557e-cc52-4551-84cb-72605e80e0bf","year":1992},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.355893Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:031c4c60d3dba49fa9ce2a8e5f23763465744fd5950539efd6c489aadc5edd8a","observation_id":"aa1435a2-27f3-4461-9ef8-d702011eb132","resolution":{"observed_at":"2026-08-08T11:52:55.476746Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.464540Z","title":"Katheder, M","venue":null,"work_id":"7cb00f47-269f-491e-92b3-a9012188ba69","year":2025},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.358915Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:c0295bc56cba0ce9149a2f1e21090f6374bb15945fa36cffb42270da009c5851","observation_id":"793e83bd-daad-43ec-ab9d-7e4321fd7fef","resolution":{"observed_at":"2026-08-08T11:52:55.467730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1210.8113","last_updated":"2012-10-30T18:31:36Z","snapshot_observed_at":"2026-07-06T02:58:50.042191Z","submitted_at":"2012-10-30T18:31:36Z","title":"A note on planar partial 3-trees","version":1},"cited_work":{"arxiv_id":"1210.8113","doi":null,"metadata_source":"pith","pith_arxiv_id":"1210.8113","snapshot_observed_at":"2026-08-08T11:52:55.404301Z","title":"A note on planar partial 3-trees","venue":"cs.DM","work_id":"7cf45474-e7c6-417e-87df-1109c6801780","year":2012},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.361972Z"},"links":{"cited_paper":"/paper/1210.8113","citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:c09eab90ccc28939d1109427134e8ec2eb0838559e2f1f6a1cd3c353069f1646","observation_id":"fcc8b5d8-2ec7-4051-9baa-3898a77c730c","resolution":{"observed_at":"2026-08-08T11:52:55.410009Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.454414Z","title":null,"venue":null,"work_id":"544c1fc3-302e-4c83-a04f-bccf2894d154","year":1992},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.365351Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:f86ab13e3518fb8f37a2bf056dc32c5db5a5b5166486405df3e3770831501aea","observation_id":"2899087d-f64d-45f3-b20f-b5f843489265","resolution":{"observed_at":"2026-08-08T11:52:55.457897Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.445015Z","title":null,"venue":null,"work_id":"99fd1af1-0d2a-46fb-996c-ae4ea5938987","year":2017},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.368913Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:711dca40a0420e6d8f1a2ab5aadd5b84c66b1fe8c5fd2c50116144ed9556fd39","observation_id":"f14fdcd7-d1ba-438c-9667-f7c46d6414ea","resolution":{"observed_at":"2026-08-08T11:52:55.448218Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.435777Z","title":null,"venue":null,"work_id":"73c467d8-2ec9-4db8-8c72-df689a68d41e","year":2022},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.371814Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:6352592b97a5a3db4141e1b94231c4ae0391af562abe053e86833005f5e3920e","observation_id":"31301288-4dfe-4280-8bba-b55af15065e2","resolution":{"observed_at":"2026-08-08T11:52:55.438953Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.426179Z","title":"Wiechert","venue":null,"work_id":"45d29540-179b-45c0-ad63-79d171d433d1","year":2017},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.374721Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:fd7387627267e68f10a9551c406a55bfd829a93958aee6338720fefcd6f2f9ab","observation_id":"2e3446ea-0e67-4f5c-9ae0-a644a66c7909","resolution":{"observed_at":"2026-08-08T11:52:55.429363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:52:55.416877Z","title":null,"venue":null,"work_id":"f7d9ec12-e9cf-4980-8cd7-e7a4a39a44e6","year":2005},"citing_paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T11:52:55.377624Z"},"links":{"citing_paper":"/paper/2608.05508"},"observation_digest":"sha256:44ccc7064c94de7bc007a6d72a9505e67368f647fbe2502efa5fecf7fc584701","observation_id":"d72a34e3-3124-4017-be4c-661e8304e65e","resolution":{"observed_at":"2026-08-08T11:52:55.420054Z","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"}}],"paper":{"arxiv_id":"2608.05508","last_updated":"2026-08-06T01:22:53Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-09T23:10:58.757934Z","submitted_at":"2026-08-06T01:22:53Z","title":"A Gap in the 42-Queue Layout Algorithm for Planar Graphs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":20},"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 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2608.05508."}