{"as_of":"2026-08-16T13:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00f51c126ed48d62b6a8c4d51feee67b9d4f40b57b4d17d219df8bcf3ae84706","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:27:00.769693Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"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.03341/citation-record","integrity":"/paper/1908.03341/integrity","json":"/paper/1908.03341/citation-record.json","paper":"/paper/1908.03341"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1607.04911","last_updated":"2016-07-21T20:40:49Z","snapshot_observed_at":"2026-08-14T21:48:02.650244Z","submitted_at":"2016-07-17T19:45:01Z","title":"Near-Optimal Induced Universal Graphs for Bounded Degree Graphs","version":2},"cited_work":{"arxiv_id":"1607.04911","doi":null,"metadata_source":"pith","pith_arxiv_id":"1607.04911","snapshot_observed_at":"2026-08-14T14:27:02.080576Z","title":"Near-Optimal Induced Universal Graphs for Bounded Degree Graphs","venue":"cs.DS","work_id":"69edeb79-3b71-45e0-89ea-7c00a47fa3c7","year":2016},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.526391Z"},"links":{"cited_paper":"/paper/1607.04911","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:8a27f6a466f541929e0bf125c0d842666197ceca5d89c751627fa57dbb2cf6ed","observation_id":"bdbe79b7-2acc-4ca6-9e2d-c82bff6686ca","resolution":{"observed_at":"2026-08-14T14:27:02.085915Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.532106Z","title":"Abraham, S","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.532106Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:7d4361ec3273c14434d96e4ec4dfc42ccc961233171ead4f9c7c0267788543b5","observation_id":"7d36fd1d-f29f-420e-a7de-08ee31776a33","resolution":{"observed_at":"2026-08-14T14:27:00.532106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09228","last_updated":"2020-04-27T06:19:47Z","snapshot_observed_at":"2026-08-16T11:26:51.570839Z","submitted_at":"2019-02-25T12:29:11Z","title":"Succinct Data Structures for Families of Interval Graphs","version":2},"cited_work":{"arxiv_id":"1902.09228","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.09228","snapshot_observed_at":"2026-08-14T14:27:02.054992Z","title":"Succinct Data Structures for Families of Interval Graphs","venue":"cs.DS","work_id":"9b6b19d2-dc5e-4eb3-a8c0-b8807598d4b7","year":2019},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.537079Z"},"links":{"cited_paper":"/paper/1902.09228","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:43c41340ae95aed627398925b94c41f70e0d16f7dd656eb160b34389671ae61b","observation_id":"83e311dd-30b2-4565-b485-27f849cbd1de","resolution":{"observed_at":"2026-08-14T14:27:02.060818Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.542406Z","title":"Alstrup, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.542406Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:8f8109600330d266b7c14f5759c47e21655f5e190dfb8c9e62531b381b0344d0","observation_id":"ecd28b62-3657-4f5a-9094-f918b656f343","resolution":{"observed_at":"2026-08-14T14:27:00.542406Z","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-14T14:27:00.547751Z","title":"Alstrup, C","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.547751Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:d0fe406a09c871332a222def6282654e0665505e20d8876b4f146fe0b390e0f2","observation_id":"a29bdd13-3ff4-4d75-a42b-973a64199e11","resolution":{"observed_at":"2026-08-14T14:27:00.547751Z","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-14T14:27:00.552700Z","title":"Alstrup, C","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.552700Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:c75a5e596fc6d157a0298202f217b656be97eda176051b64e76d2c2fe1108dbe","observation_id":"2a10f88e-38ce-419f-9122-2cc92588948d","resolution":{"observed_at":"2026-08-14T14:27:00.552700Z","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-14T14:27:00.558070Z","title":"Alstrup, E","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.558070Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:8f81f05d8bcad9ec63030f4bbf1385d87e33c84447f7eca65ba8af1532dc53f9","observation_id":"ee7d7ebd-8227-4533-bb25-cbfb272df3b3","resolution":{"observed_at":"2026-08-14T14:27:00.558070Z","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-14T14:27:00.562684Z","title":"Alstrup, H","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.562684Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:de3d5ed2259b09290f67927b5339283d089537da4be3325e08901981361c16bd","observation_id":"9f56871a-739e-4100-a979-75143aa94312","resolution":{"observed_at":"2026-08-14T14:27:00.562684Z","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-14T14:27:00.567298Z","title":"Alstrup, H","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.567298Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:e1f988025e4940cd50dc3b94117ea46bb68f5a896f0e7b1512678c73361f6010","observation_id":"43a33ff1-025b-4e2e-9cfb-8197b1ab602f","resolution":{"observed_at":"2026-08-14T14:27:00.567298Z","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-14T14:27:00.571942Z","title":"Alon , Asymptotically optimal induced universal graphs , Geometric and Functional Analysis, 27 (2017), pp","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.571942Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:ad69d941eebe499aac934d0c3f33d0bd74fcf4420c54b2adb38ce765805069c4","observation_id":"a1ee5319-928a-4e1a-8962-0a9f31e4f844","resolution":{"observed_at":"2026-08-14T14:27:00.571942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11818","last_updated":"2020-03-17T18:25:36Z","snapshot_observed_at":"2026-08-08T12:58:41.847354Z","submitted_at":"2020-02-26T22:04:43Z","title":"Finding large matchings in 1-planar graphs of minimum degree 3","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11818","snapshot_observed_at":"2026-08-14T14:27:00.576852Z","title":"Alstrup and T","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.576852Z"},"links":{"cited_paper":"/paper/2002.11818","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:1ecb2ad49dbfc09b40fe05682650b90cebc2942064706652ee4fcd4eb860a646","observation_id":"a8238e85-99dd-4954-8015-531a68bee10d","resolution":{"observed_at":"2026-08-14T14:27:00.576852Z","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/978-3-662-43951-7_32","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.147742Z","title":"Adjiashvili and N","venue":null,"work_id":"d6f85c07-23ce-456e-8809-79bffa2f14d9","year":2014},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.583164Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:b1e7ef860c0c70d6db70ac1ffd2dfda5e1f5d82635045cc258c6d22cfe982409","observation_id":"4a69b0de-6465-4610-ac15-78dd6b94d957","resolution":{"observed_at":"2026-08-14T14:27:01.152617Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/s0304-0208(08)73486-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.131521Z","title":"Babai, F","venue":null,"work_id":"39619324-cdf6-4321-b2d3-98cd54ccdfc2","year":1982},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.588144Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:7701a03e7235002f88dc4ccb76bc536baea5c140b560bd32657ca6ed3aa12653","observation_id":"905d1195-37e0-4d22-bafa-82375d7afcc3","resolution":{"observed_at":"2026-08-14T14:27:01.136623Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/11780823_12","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.115936Z","title":"Bonichon, C","venue":null,"work_id":"56e87fe4-2911-4728-a3c3-b6ca59e3b95a","year":2006},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.592969Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:d7f7993538810da4e79bed3cc397c61ace59677d2c3c31a8e23fbb6427d2c80b","observation_id":"d0fa3585-b8f1-4ab1-9e5d-f3354385f4b7","resolution":{"observed_at":"2026-08-14T14:27:01.120863Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1137/1.9781611975994.27","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.100699Z","title":"Bonamy, C","venue":null,"work_id":"b521e35d-f210-4a86-b193-581488bd0102","year":2020},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.597763Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:535a4272ca604576bc0b2d417101e947c9a790415212208686ee898d0131e4d5","observation_id":"141559fc-93c7-4b7d-84af-5d16dbc2c162","resolution":{"observed_at":"2026-08-14T14:27:01.105664Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.602236Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.602236Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:3b32cf7f0c8aba8a1a0208a58738e7d0fb7cf37a4cfd97df46b0dddd06159432","observation_id":"ad8955e0-9c78-48e1-a933-d9cfd8a2b27c","resolution":{"observed_at":"2026-08-14T14:27:00.602236Z","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/s00373-009-0860-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.074986Z","title":"Butler , Induced-universal graphs for graphs with bounded maximum degree , Graphs and Combinatorics, 25 (2009), pp","venue":null,"work_id":"f3faa4b1-3090-481d-a909-c93d8a20fbdd","year":2009},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.606807Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:d6f66421f108908e2d2f2344d7f475e7e503642c1a917b7c859d58a57750beea","observation_id":"3fcde77c-3eb1-4903-bf8f-fe12b5db2322","resolution":{"observed_at":"2026-08-14T14:27:01.080080Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/s004930200017","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.059557Z","title":null,"venue":null,"work_id":"f986fabe-87ba-4f67-a649-b24a0b0f9418","year":2002},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.611304Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:17a77d03c4f1192616129be3000f46de9eb03e8680f372fc42a6cb81c081325c","observation_id":"d3f74323-fd17-4b19-a193-a9ecd126ba58","resolution":{"observed_at":"2026-08-14T14:27:01.064329Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/s00454-009-9196-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.044407Z","title":"Chalopin, D","venue":null,"work_id":"07bcf602-8bfc-49fc-af28-0a291b176f95","year":2010},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.616000Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:0c6da0e5f657e634635af9eeb274310f060ab48fb27d2cbb461829627ca158b1","observation_id":"93559480-d789-4eee-8409-157185e15bc4","resolution":{"observed_at":"2026-08-14T14:27:01.049221Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.620806Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.620806Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:476781ee2bac24511342e92cd121306eb9770989410b123cc329fd83489c8592","observation_id":"277e67bf-bf73-41db-9665-27a535db4ed4","resolution":{"observed_at":"2026-08-14T14:27:00.620806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05269","last_updated":"2022-01-20T21:26:29Z","snapshot_observed_at":"2026-08-14T16:48:34.953864Z","submitted_at":"2019-04-10T16:13:30Z","title":"Planar graphs have bounded nonrepetitive chromatic number","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.05269","snapshot_observed_at":"2026-08-14T14:27:00.625401Z","title":"Dujmovi\\' c , L","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.625401Z"},"links":{"cited_paper":"/paper/1904.05269","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:3552cb89a6aa3f33200e701659832a26d8f214fadb8e96cde4159390d706b8e2","observation_id":"4cf1fa06-c4fd-40bb-abc5-64d619560f20","resolution":{"observed_at":"2026-08-14T14:27:00.625401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.04280","last_updated":"2021-02-04T19:39:41Z","snapshot_observed_at":"2026-08-06T20:54:22.783096Z","submitted_at":"2020-03-09T17:39:55Z","title":"Adjacency Labelling for Planar Graphs (and Beyond)","version":4},"cited_work":{"arxiv_id":"2003.04280","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.04280","snapshot_observed_at":"2026-08-14T14:27:01.922203Z","title":"Adjacency Labelling for Planar Graphs (and Beyond)","venue":"cs.DS","work_id":"6f9998c6-83b4-4112-a8f7-8e613b74bce7","year":2020},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.630238Z"},"links":{"cited_paper":"/paper/2003.04280","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:4a72be3a76d52d10096d8d040e05d0ba419bbf8967a3aaad2c615263785f296a","observation_id":"f7fca0a5-3578-4206-a653-d41b4763d086","resolution":{"observed_at":"2026-08-14T14:27:01.927996Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"10.1017/s0963548300001139","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.018113Z","title":"de Fraysseix, P","venue":null,"work_id":"dd993bc6-73dc-416b-bd64-9b9d9a9f9606","year":1994},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.635570Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:ce961652c5f91361e76d466d3f1802721ab9f13e96b339864071aa0600c197f9","observation_id":"c87e16d7-52e0-4096-bdb0-ceeb8f416c34","resolution":{"observed_at":"2026-08-14T14:27:01.024233Z","resolver_source":"doi","status":"verified_exact"},"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":{"arxiv_id":"2001.08860","last_updated":"2020-07-02T21:40:08Z","snapshot_observed_at":"2026-07-06T08:52:29.410955Z","submitted_at":"2020-01-24T01:45:42Z","title":"Notes on Graph Product Structure Theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08860","snapshot_observed_at":"2026-08-14T14:27:00.640273Z","title":"Dvo r \\' a k, T","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.640273Z"},"links":{"cited_paper":"/paper/2001.08860","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:1a798f28ea0ec24ef6d66666cc6a95f9560535a0257a9cf107d3cecc45c521be","observation_id":"f3c205cd-0a0d-473a-9109-7332094166ea","resolution":{"observed_at":"2026-08-14T14:27:00.640273Z","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-14T14:27:00.645277Z","title":"Dujmovi\\' c , G","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.645277Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:78c0d88a93a271fa994614274ff02420b06138c00ed9a220198c1323b6e16386","observation_id":"84898100-db71-4a89-932d-d95dbfc0e526","resolution":{"observed_at":"2026-08-14T14:27:00.645277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05168","last_updated":"2022-11-18T21:48:24Z","snapshot_observed_at":"2026-08-14T16:06:46.043333Z","submitted_at":"2019-07-11T12:59:49Z","title":"Graph product structure for non-minor-closed classes","version":5},"cited_work":{"arxiv_id":"1907.05168","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.05168","snapshot_observed_at":"2026-08-14T14:27:01.822755Z","title":"Graph product structure for non-minor-closed classes","venue":"math.CO","work_id":"9cf1367c-fab9-431a-9085-295a6d558952","year":2019},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.650027Z"},"links":{"cited_paper":"/paper/1907.05168","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:7e0fc61d3b16a61f80a29d752c91b722cb5e71d1ffbe1dfd9ba02425a2dade84","observation_id":"1c45fb61-a085-459f-a812-87238c856080","resolution":{"observed_at":"2026-08-14T14:27:01.828297Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"10.1016/j.ipl.2008.04.020","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.001848Z","title":"Esperet, A","venue":null,"work_id":"8bda59a4-fbeb-4b08-9f19-e0ba9db69b10","year":2008},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.654703Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:22ad291ea6f86fd3dbfc4e415bfe13bc2cf0d4fcc028b15ec10b1fb358be1b35","observation_id":"d50342be-b637-4931-84f9-8cc573f50508","resolution":{"observed_at":"2026-08-14T14:27:01.006779Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/3-540-48224-5_62","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.985949Z","title":"Fraigniaud and C","venue":null,"work_id":"e2d32605-f174-41f4-a59c-9c694d6fe3cb","year":2001},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.659488Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:85a16e2c445dacc198615a1bb97046440b5fc3cf3c66a050b105bc164742f94c","observation_id":"608432b0-372c-487f-8235-affea7f3c917","resolution":{"observed_at":"2026-08-14T14:27:00.990756Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.664160Z","title":"Freedman, P","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.664160Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:5ee0ecc15f0c84c8cb39e5045c5ee691944f87a3e4e3f1ace40a70a4c4d56834","observation_id":"d6c40117-0f33-4e40-92b0-16b6b7665c12","resolution":{"observed_at":"2026-08-14T14:27:00.664160Z","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.1137/1.9781611973075.38","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.971161Z","title":"Fraigniaud and A","venue":null,"work_id":"9a3c9856-a0ee-48c3-9487-0edbc7905ca9","year":2010},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.668794Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:21ddd00401975b2d4590aa79eb3e7af98e9819b05fcdedafda34ab4d122d93d1","observation_id":"6c08da21-b78c-4268-b09e-1823343b864e","resolution":{"observed_at":"2026-08-14T14:27:00.975582Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.673462Z","title":"Fraigniaud and A","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.673462Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:0b699f803f9952df3bd7578172136eb67dd5b6a46fd7c51b42d14d6c6aadc217","observation_id":"f8969336-69e4-4bfe-9721-5a80a8714a3a","resolution":{"observed_at":"2026-08-14T14:27:00.673462Z","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.1137/1.9781611975031.12","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.956239Z","title":"Gon c alves, L","venue":null,"work_id":"a9b648bb-9365-4d2d-a4e7-7c225a9d5206","year":2018},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.677974Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:9f6e5b484d8a507e63cd8e9bea4a4f35bafa7dd166667be8508d8b1133558b4f","observation_id":"63c8b1a8-2752-4021-a2b8-d66322b6ce00","resolution":{"observed_at":"2026-08-14T14:27:00.961039Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/978-3-662-53426-7_17","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.940819Z","title":"Gawrychowski, A","venue":null,"work_id":"3f76a6e9-ec4d-4b4f-b864-d25d317720a1","year":2016},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.682671Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:bd026ce582f3c59ce222765dc9bb88b42611d0276cf5647564eb12e8218f1338","observation_id":"c39999a4-1ca9-4a82-9dcb-83e50233a483","resolution":{"observed_at":"2026-08-14T14:27:00.945686Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.687303Z","title":"Gavoille and A","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.687303Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:321ef4db4d95ec262d38497674db33bdd200b714ebcd3e2eae9dccdc3a37da38","observation_id":"326bd685-0862-4e4a-90e1-c524d6b6d44f","resolution":{"observed_at":"2026-08-14T14:27:00.687303Z","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/s00446-002-0073-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.915645Z","title":"Gavoille and D","venue":null,"work_id":"91202dee-6862-43bc-971d-a93cac28e039","year":2003},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.692202Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:e5b1ac3f47b575b65d7ee967e4d6813629dd68ce800ef0e2e9bd9cbac7305796","observation_id":"541a9ce2-c3a6-42a6-9d9b-b500414a8386","resolution":{"observed_at":"2026-08-14T14:27:00.920425Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1137/050635006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.899411Z","title":"Gavoille and C","venue":null,"work_id":"959ba782-398b-46f0-a97b-26b1d7e9795f","year":2008},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.697231Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:6c525e061311be1d8b334f50c2da5d7d25fbe8b622cc6c84c0321142c1822e9f","observation_id":"48cef5e3-3c55-4c8d-9188-d0900c4115f3","resolution":{"observed_at":"2026-08-14T14:27:00.904740Z","resolver_source":"doi","status":"verified_exact"},"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":{"arxiv_id":"1611.06529","last_updated":"2016-11-20T15:32:27Z","snapshot_observed_at":"2026-08-14T21:29:33.800513Z","submitted_at":"2016-11-20T15:32:27Z","title":"A note on distance labeling in planar graphs","version":1},"cited_work":{"arxiv_id":"1611.06529","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.06529","snapshot_observed_at":"2026-08-14T14:27:01.665649Z","title":"A note on distance labeling in planar graphs","venue":"cs.DS","work_id":"071d510a-bdb7-4fba-9f5f-269948758c60","year":2016},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.702827Z"},"links":{"cited_paper":"/paper/1611.06529","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:d7e9adac0ddd6a634fefb5b5efd3e998ae00c2d1e7e9ef79dd983ff169644765","observation_id":"8fecbe5b-d073-4a47-90c2-881b24cd2f81","resolution":{"observed_at":"2026-08-14T14:27:01.670828Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.707880Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.707880Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:1b1037b09c4415831a2045be009609647c63f5ef11a396907248f258ba52745f","observation_id":"83a77657-01ca-455c-95a3-33ca1a582704","resolution":{"observed_at":"2026-08-14T14:27:00.707880Z","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":"2212.62244","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.639412Z","title":"Kannan, M","venue":null,"work_id":"5b7b58ac-3a6a-4ecf-9d1e-7b69330e3f7d","year":1988},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.713042Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:4552313b7123844e43a77718ae34b63764553c91cf2e8f7800fe21f5f1bd4d0e","observation_id":"2644729c-6536-4aa3-ad90-7b9d87013b3c","resolution":{"observed_at":"2026-08-14T14:27:01.648880Z","resolver_source":"raw_fallback","status":"verified_exact"},"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-14T14:27:02.126731Z","title":"u ber die Verhandlungen der S \\","venue":null,"work_id":"8930acfc-e423-4516-a2c8-6db6420ea073","year":1936},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.717490Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:e40d6de2a2dad363f8622058da5b836f9b062dd6bd7070722dc7d456f8ebc30d","observation_id":"f9629a4d-e02d-40ed-8b6b-3a5d47b32c12","resolution":{"observed_at":"2026-08-14T14:27:02.131786Z","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":"10.1007/3-540-44612-5_53","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.874281Z","title":"Peleg , Informative labeling schemes for graphs , in 25^ th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000, vol","venue":null,"work_id":"a00e92eb-5e1d-47d7-b528-9699dfef7eee","year":2000},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.722097Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:e41cac9248b136443b070caa15dcd2f882d8672eea188ff8ef1c58f3bf601c32","observation_id":"06ed0dd0-47f5-4568-a82a-2f76c844695b","resolution":{"observed_at":"2026-08-14T14:27:00.879548Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/j.tcs.2005.03.015","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.858369Z","title":"Peleg , Informative labeling schemes for graphs , Theoretical Computer Science, 340 (2005), pp","venue":null,"work_id":"f4ad826a-a357-4c6f-a47f-2b002852b33a","year":2005},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.726807Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:723bec017cc4852fa12e0747051eef713971052ab1c981b01c40754dad810812","observation_id":"ca8d99bb-6d72-4b23-8e9f-5e1cc2115402","resolution":{"observed_at":"2026-08-14T14:27:00.863568Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/0020-0190(94)90053-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.842987Z","title":null,"venue":null,"work_id":"34f83634-0a7a-4913-a118-f29a360ce4ab","year":1994},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.731302Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:e7d7a3d45b818222b298036cf217c566e418b637bcd8cc6591e029d12d5afd42","observation_id":"4fe95f04-c48a-42eb-b7a6-349cbeed0878","resolution":{"observed_at":"2026-08-14T14:27:00.847769Z","resolver_source":"doi","status":"verified_exact"},"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":"edu/3385549","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.561111Z","title":"Rotbart , New Ideas on Labeling Schemes , PhD thesis, University of Copenhagen, October 2016","venue":null,"work_id":"8d28428a-5294-4b6f-b205-ac01c9def65d","year":2016},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.736333Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:2ad28b55239bc9fecac98c1490ee2681d688c20924732bb88b068b9ed6337c8b","observation_id":"67478f87-0d27-4e37-bbdd-8dea73aa562f","resolution":{"observed_at":"2026-08-14T14:27:01.569059Z","resolver_source":"raw_fallback","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.740926Z","title":"Robertson and P","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.740926Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:65f552afb83cbf8d4ac6f9b5a3fc15467f9ffdc71cf87623ff32bc1589932a6e","observation_id":"359891c3-258b-477c-9eae-9f79132334eb","resolution":{"observed_at":"2026-08-14T14:27:00.740926Z","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-14T14:27:00.745793Z","title":"Roditty and R","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.745793Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:fab271d5774631e9c09fa4f003d14b53c79ef42d4d2861e9f7de1a4057e79b06","observation_id":"80cf8257-765a-47b0-ad77-dceb402d1cc8","resolution":{"observed_at":"2026-08-14T14:27:00.745793Z","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/bf00353652","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.815561Z","title":"Schnyder , Planar graphs and poset dimension , Order, 5 (1989), pp","venue":null,"work_id":"5bb4a2fe-0d8c-4328-ace5-456448740a97","year":1989},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.750409Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:adf590c5d111483ff0331a3dacd89d414103b5f6accc9c0161abd1bcabc2d4d6","observation_id":"297eaec9-69d3-4d00-b3b5-3c20b716631f","resolution":{"observed_at":"2026-08-14T14:27:00.822457Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:27:02.109046Z","title":null,"venue":null,"work_id":"2922bc4c-01cb-4a4a-8a39-ded904700410","year":2003},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.755288Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:3072fa6f93bac31cd43867af0bd2ba83c3a4d9b38b9a07b05bc99c5b02c2daa1","observation_id":"69e42da3-9748-4534-b2b4-f7e928a3350b","resolution":{"observed_at":"2026-08-14T14:27:02.114970Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.760121Z","title":"Thomassen , Interval representations of planar graphs , Journal of Combinatorial Theory, Series B, 40 (1986), pp","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.760121Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:ef32ed7d2ceaf2c2729d4938bda3593c7aff28da08d61d08400eed3acaa16a42","observation_id":"40510559-e7f1-427a-9781-1b24c961e69f","resolution":{"observed_at":"2026-08-14T14:27:00.760121Z","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":"8580.37858","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:01.389583Z","title":"Thorup and U","venue":null,"work_id":"7c777db9-59b4-4923-9018-960dff356bed","year":2001},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.765058Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:543013977b0f29687cc1344316ee338472eb8c5c8285b354e39349aefa8f2fdd","observation_id":"2ab72cbe-7475-4a4f-9f09-1c636e1dc232","resolution":{"observed_at":"2026-08-14T14:27:01.397539Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:27:00.769693Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.769693Z"},"links":{"citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:cc49c2b82ba5218ed4ef999ef57e847f83bab1b5cb1205243bdf64bade38c83e","observation_id":"f3618c9d-88fd-4ffa-83b3-67b60d7cb6dd","resolution":{"observed_at":"2026-08-14T14:27:00.769693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T04:36:11.830717Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":23,"verified_exact":26,"verified_fuzzy":1},"total_outbound_references":51},"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 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:1908.03341."}