{"as_of":"2026-08-16T08:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8aec4d83e8ef59257b4fb2696001b06a2ea9f44329a3ad0d922ea80e5bb4bb10","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:38:34.263580Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"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.07097/citation-record","integrity":"/paper/1908.07097/integrity","json":"/paper/1908.07097/citation-record.json","paper":"/paper/1908.07097"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00318","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:38:34.521449Z","title":"Bannister , Zhanpeng Cheng , William E","venue":null,"work_id":"8e28af39-6f17-4562-9c14-97eda2e47b34","year":2014},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.073564Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:e6b48411583e799fdb9212cfa01b824af14db17fb75ae1f5bc49ba1e4887e0a7","observation_id":"faf8e9ab-5ad4-4061-aff6-7c91fbe2a7c3","resolution":{"observed_at":"2026-08-14T12:38:34.526699Z","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.endm.2008.06.005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:38:34.489434Z","title":"Brandenburg","venue":null,"work_id":"61e4792e-d597-4caf-962d-dca9d8027257","year":2008},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.111382Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:3325ffdf03b19d9c68a5eccc227f0e3a0c3919e148e95fffffecfca0aa188631","observation_id":"3e928b9c-3b88-4224-8f6f-d7bc8deb339e","resolution":{"observed_at":"2026-08-14T12:38:34.509587Z","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-642-45281-9_3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:38:34.362435Z","title":"On universal point sets for planar graphs","venue":null,"work_id":"5e6e31a3-1799-44c8-9661-edef9b565b4d","year":2013},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.139441Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:d4c36b490d0c027b2cb414b6a855e7e84550031ffc542f79f81e627f7f8d6b8f","observation_id":"9a7011ec-f495-4039-9f3a-25c199ba1036","resolution":{"observed_at":"2026-08-14T12:38:34.425064Z","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-14T12:38:34.963078Z","title":"Chrobak and H","venue":null,"work_id":"dabce9ab-6132-458d-b439-df5324b65fb5","year":1989},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.146959Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:dcf2408506be1c3d13d157cdaf222d5795a6bac2429ce2ee8dbcd8ea3acc8be0","observation_id":"1c64a241-2dab-4958-8b06-33efbeefc60a","resolution":{"observed_at":"2026-08-14T12:38:34.968083Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:38:34.154052Z","title":"Chrobak and T.H","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.154052Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:ca86066e76f4beee4a773718215b40c68c340c0ed7b484d9369063c8e707858b","observation_id":"836da9e2-0f97-4e5f-9cbf-e165a3b2a1c8","resolution":{"observed_at":"2026-08-14T12:38:34.154052Z","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-14T12:38:34.159243Z","title":"De Fraysseix, J","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.159243Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:a0bdbde687d8b3d3b38827ffc4bf906e85ea143eb6ab9c293319ff5fb1bd43ae","observation_id":"f1e5772d-88aa-4f07-8bf7-cd0eca0a906f","resolution":{"observed_at":"2026-08-14T12:38:34.159243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:38:34.907893Z","title":"n straight line representation of planar graphs","venue":null,"work_id":"1563d01b-ea2d-4f10-97e7-908f955d0b3c","year":1948},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.165871Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:4b5ac2ec2cbc215047b33529fd92fc8c074e03a8bdb74dde929ac1b858332a29","observation_id":"876b3d46-fa78-44a3-8ada-48cfd9e9a9aa","resolution":{"observed_at":"2026-08-14T12:38:34.950311Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:38:34.170380Z","title":"On the length of the longest monotone subsequence in a random permutation","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.170380Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:e55eafabd5d76b3e80234129c57faabc4b8a02c6c77d01d8335719b06c5e9c61","observation_id":"43843a1e-6061-407d-ba0f-d1664c80ccbe","resolution":{"observed_at":"2026-08-14T12:38:34.170380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ipl.2004.06.009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:38:34.329133Z","title":"A 1.235 lower bound on the number of points needed to draw all n -vertex planar graphs","venue":null,"work_id":"ec4c7888-f53b-423a-a155-914dc790ce4f","year":2004},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.175225Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:841eb25424d7ccae3aceedb4c3ba51f24d931bd0902f88a232fa6e78b0a4cb53","observation_id":"8ed1d634-a696-4718-8818-9beb63d64bfc","resolution":{"observed_at":"2026-08-14T12:38:34.336557Z","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":"1811.06482","last_updated":"2019-09-25T12:17:05Z","snapshot_observed_at":"2026-08-14T17:58:13.616778Z","submitted_at":"2018-11-15T17:16:50Z","title":"A Note On Universal Point Sets for Planar Graphs","version":3},"cited_work":{"arxiv_id":"1811.06482","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.06482","snapshot_observed_at":"2026-08-14T12:38:34.616301Z","title":"A Note On Universal Point Sets for Planar Graphs","venue":"math.CO","work_id":"f4336685-5f65-44cb-8c40-828fc571778c","year":2018},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.181690Z"},"links":{"cited_paper":"/paper/1811.06482","citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:04ea10862f4357b9b963213759c75613031a61de0929dc3e3d4746cb5f0fc2dd","observation_id":"f295a564-4d9d-4095-82a1-6ac40de3b9bb","resolution":{"observed_at":"2026-08-14T12:38:34.648781Z","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-14T12:38:34.216807Z","title":"Embedding planar graphs on the grid","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.216807Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:eb19833f86af676c3285c604dadeaf22e3f1d374d3962f5e9e7edc5eb29bb07c","observation_id":"6a982c4e-8b10-4683-8191-67ab78e998f9","resolution":{"observed_at":"2026-08-14T12:38:34.216807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:38:34.822096Z","title":"Congruent graphs and the connectivity of graphs","venue":null,"work_id":"b42c3313-323a-4ad3-949a-1192b2d6cf65","year":1932},"citing_paper":{"arxiv_id":"1908.07097","last_updated":"2019-09-11T17:17:01Z","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T12:38:34.263580Z"},"links":{"citing_paper":"/paper/1908.07097"},"observation_digest":"sha256:a1025f8ef58cf7e84af5df159ecfc49d0e32700749f8780eac94177992f185b3","observation_id":"cf7fc6b9-c9b7-4db5-adbc-1804f2bd1e1b","resolution":{"observed_at":"2026-08-14T12:38:34.862632Z","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.07097","last_updated":"2019-09-11T17:17:01Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T03:25:17.605378Z","submitted_at":"2019-08-19T22:57:53Z","title":"An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":5,"verified_fuzzy":3},"total_outbound_references":12},"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 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:1908.07097."}