{"as_of":"2026-08-16T11:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab746c986e6701ceeb2d987a3fe737fc641f7bc2b9b385bda58c9c7180d42d67","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-14T15:22:30.439338Z","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-16T06:30:59.297886+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/1908.01426/citation-record","integrity":"/paper/1908.01426/integrity","json":"/paper/1908.01426/citation-record.json","paper":"/paper/1908.01426"},"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-14T15:22:30.707462Z","title":"Enumerating order types for small point sets with applications","venue":null,"work_id":"5a9222e5-816a-42d1-8073-08f41bc667e5","year":2002},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.365051Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:7a66145629275a7e6ba9d0ed940c7229a3a12884a85cb9a10a66468a55bf5a3d","observation_id":"b42536fe-ef43-482f-841b-8d3d9fe285ff","resolution":{"observed_at":"2026-08-14T15:22:30.712363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.691341Z","title":"On the number of plane geometric graphs","venue":null,"work_id":"1fc44276-34b5-42e5-94cb-383cfb188006","year":2007},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.369899Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:6966ab8d399ced28c943a757e70297f6512fbce10f57d26c9fc87b9cfb8d37d8","observation_id":"4935fa4d-ffbe-441b-874c-f13429512460","resolution":{"observed_at":"2026-08-14T15:22:30.696584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.677207Z","title":"On embedding an outer-planar graph in a point set","venue":null,"work_id":"ee21aeb7-2869-4ea6-8bef-8a85f7f4e407","year":2002},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.374196Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:6a6ed97d6cf8c7f7538bc552233c702cd77717534b4e81c1f65ab757cc9b88c7","observation_id":"adfa2cd7-9d4e-4a74-852c-febfb1e60082","resolution":{"observed_at":"2026-08-14T15:22:30.682194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.665613Z","title":null,"venue":null,"work_id":"cdfab01c-8714-4618-a4dc-47d72b9e95ef","year":2009},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.378330Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:553ffac471863631794e42b24e5189752a70704f8e226af82cd1b816a20528ba","observation_id":"c9805c21-28d0-4034-8bcb-dab7fcf40e29","resolution":{"observed_at":"2026-08-14T15:22:30.669469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.653810Z","title":"Planar embeddability of the vertices of a graph using a fixed point set is NP-hard","venue":null,"work_id":"714b44f6-f8ec-430f-a31b-da5d392ad0e7","year":2006},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.382334Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:74505d7f4734fbb07dc4570bf86e8289e7950612b98aa1ed121a651b3c108ced","observation_id":"744bc07a-8a66-488a-8143-4f8970b91404","resolution":{"observed_at":"2026-08-14T15:22:30.657963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.641660Z","title":"A linear algorithm for embedding planar graphs using PQ-trees","venue":null,"work_id":"ff12e4f6-8326-4f1f-801a-f08b409f7120","year":1985},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.386359Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:60ada6bd14e5c423d7184fbf8fb3552c83846b00fae2fa0a9a8a94303f45bb47","observation_id":"5e324832-c63c-4456-85b4-d2b6a0ab95fb","resolution":{"observed_at":"2026-08-14T15:22:30.645890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.629657Z","title":"Computational Geometry – Algorithms and Applications","venue":null,"work_id":"dd3b4c50-6a78-4d8d-bc6d-655463a9aa38","year":2008},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.390598Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:df22ec778abe588bf6ab76c92c66575b49e94608bb8b1ba1cbae24023f1bff49","observation_id":"25cb6cc5-f41a-4a0b-a834-282251052bff","resolution":{"observed_at":"2026-08-14T15:22:30.633463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.617030Z","title":"How to draw a planar graph on a grid","venue":null,"work_id":"3982c903-8423-4445-b695-0b4aa88cc6fa","year":1990},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.394388Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:9c61c30942bdbbdfa3239a290676af5ce87a6e16de451cb0f7786843f0620638","observation_id":"8b54c2ff-0d13-48a8-b4b4-0948abec4a22","resolution":{"observed_at":"2026-08-14T15:22:30.621695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.604861Z","title":"Untangling a planar graph","venue":null,"work_id":"152bc333-5326-4185-a7e6-c8bf50903cce","year":2009},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.398143Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:7d003eacb4060bc741ce72d410c82a1652f358cc11301d5031e09dbd4686b8c2","observation_id":"a99ce1b0-aed5-44b2-8834-ca2eefac3ab1","resolution":{"observed_at":"2026-08-14T15:22:30.608540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.593989Z","title":"Goodman and Richard Pollack","venue":null,"work_id":"c9f42422-da44-4b4d-8cb0-dd11c2d4b7d5","year":1984},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.401906Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:9a4b40e77f9b24084e8482b6ef6e264a8003fcbc418736056a182cd308022fe2","observation_id":"5ed5e000-e34b-4f73-9e69-2d84c0d5953d","resolution":{"observed_at":"2026-08-14T15:22:30.597754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.582535Z","title":"Arrangements","venue":null,"work_id":"462caa94-f8f2-43bd-998a-3e2f6599882d","year":2018},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.406344Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:1493da5acb7cb0650cf52da4ef619cd2fa309cff1aacdea0d54b0bacc54f1c0c","observation_id":"6c274fa1-529c-47d0-b2c9-c7d59c38c52e","resolution":{"observed_at":"2026-08-14T15:22:30.585856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.571161Z","title":"Minimum-weight triangulation is NP-hard","venue":null,"work_id":"51606cf1-c091-406f-8e53-44bb0e04104a","year":2008},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.409982Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:7d836c389d886b0bb8c8446d27b695632056fbb1273b3c3c38e67e3faa5cf909","observation_id":"f4c7bdd6-0332-48b9-9e81-f6400bb3dea7","resolution":{"observed_at":"2026-08-14T15:22:30.575274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.559505Z","title":"Every graph admits an unambiguous bold drawing","venue":null,"work_id":"8f87587f-1aee-4db4-a253-09dc33fbbf1e","year":2011},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.414099Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:5aa74f3bae3aca7c3d84c4e11abd0c39c2dd4350e3f0e4b16b1b726c9912562b","observation_id":"6ba092e9-154b-42fe-90a4-b41dabc70405","resolution":{"observed_at":"2026-08-14T15:22:30.563578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.547087Z","title":"Embedding a planar triangulation with vertices at specified points","venue":null,"work_id":"896794a2-f39d-4650-96f7-141bbd9e267d","year":1991},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.417612Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:af04ecac51751bf5c23a4bd06bcdb9f77415a1a9f3a66475301e49ad0edac1e6","observation_id":"ac56fddd-05ca-486a-bd42-bc6231dee6c8","resolution":{"observed_at":"2026-08-14T15:22:30.551131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.535052Z","title":"Handbook of Graph Drawing and Visualization","venue":null,"work_id":"7ce82d7f-9e73-4866-812a-ca4cd1a4c1c4","year":2013},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.421364Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:57da35613d96cc40267547bd735ce02839f1c64323a22607a2540efc7e679239","observation_id":"7aac7bf2-0b9f-481e-9973-7fffc5876c33","resolution":{"observed_at":"2026-08-14T15:22:30.539328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.520789Z","title":"Planarity","venue":null,"work_id":"d6ef4b4f-641a-4284-b4ea-b35aea7d176b","year":2007},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.425282Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:3506e0e033aa5fc4464ca5581897717be9a1c6af95a4a4cb3b273eeec4abc257","observation_id":"05283c82-a658-4fad-a19c-99ba04ce81c8","resolution":{"observed_at":"2026-08-14T15:22:30.525660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.506543Z","title":"NetLogo: A simple environment for modeling complexity","venue":null,"work_id":"774f880f-3821-46b1-a32f-152cbb3b8620","year":2004},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.429037Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:16cfddfde0fc3452317b9b9363eb9569774e9035cccbaf5fbadfb021cea46386","observation_id":"36d4bd1d-2b43-4bd8-8c2d-3a77b32d1ea6","resolution":{"observed_at":"2026-08-14T15:22:30.512095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.492349Z","title":"Bold graph drawings","venue":null,"work_id":"56098bbf-5d61-45aa-8142-7b8f7e3ac0c8","year":2011},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.432940Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:1680e067cdc7976f01f8bd03aa62c8970587d96f9e163d52c95af5b20bc3f6fe","observation_id":"d259882f-6fb8-4084-83ed-a8c2a37d4e50","resolution":{"observed_at":"2026-08-14T15:22:30.496549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.479869Z","title":"On the obfuscation complexity of planar graphs","venue":null,"work_id":"1543fe2a-b7d3-4618-96b6-b0f411e0a32a","year":2008},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.436120Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:b4a4d7c289f7601ce82d046902e04c0f372fc85a38af3388cd55aa3fecbdcd52","observation_id":"90124ec1-476d-4e88-aeaa-2bf1d6fb6847","resolution":{"observed_at":"2026-08-14T15:22:30.483769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:22:30.466296Z","title":"Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno","venue":null,"work_id":"26e2f5bf-3d28-4618-8da2-d65941b7ef27","year":2015},"citing_paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:22:30.439338Z"},"links":{"citing_paper":"/paper/1908.01426"},"observation_digest":"sha256:2a088411c30628bb57e03a9cfcfad1f892250877bdbfbc5832784aaaf052a503","observation_id":"db7498cd-d6a9-4879-a037-e31b236527c3","resolution":{"observed_at":"2026-08-14T15:22:30.471868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01426","last_updated":"2019-08-05T00:14:34Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-16T09:03:22.040607Z","submitted_at":"2019-08-05T00:14:34Z","title":"Geometry and Generation of a New Graph Planarity Game"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":19},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.01426."}