Paper Citation Record · LEDGER

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1908.07097 v2

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T12:38:34.263580Z

measured 12 of 12 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

12 of 12 outbound references displayed

verified exact5
verified fuzzy3
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation faf8e9ab-5ad4-4061-aff6-7c91fbe2a7c3 · outbound

This paper cites Bannister , Zhanpeng Cheng , William E.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs Bannister , Zhanpeng Cheng , William E

Reference 1

Resolution: verified exact; doi, observed 2026-08-14T12:38:34.526699Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 3e928b9c-3b88-4224-8f6f-d7bc8deb339e · outbound

This paper cites Brandenburg.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs Brandenburg

Reference 2

Resolution: verified exact; doi, observed 2026-08-14T12:38:34.509587Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 9a7011ec-f495-4039-9f3a-25c199ba1036 · outbound

This paper cites On universal point sets for planar graphs.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs On universal point sets for planar graphs

Reference 3

Resolution: verified exact; doi, observed 2026-08-14T12:38:34.425064Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 1c64a241-2dab-4958-8b06-33efbeefc60a · outbound

This paper cites Chrobak and H.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs Chrobak and H

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T12:38:34.968083Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 836da9e2-0f97-4e5f-9cbf-e165a3b2a1c8 · outbound

This paper cites Chrobak and T.H.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs Chrobak and T.H

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-14T12:38:34.154052Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1e5772d-88aa-4f07-8bf7-cd0eca0a906f · outbound

This paper cites De Fraysseix, J.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs De Fraysseix, J

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-14T12:38:34.159243Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 876b3d46-fa78-44a3-8ada-48cfd9e9a9aa · outbound

This paper cites n straight line representation of planar graphs.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs n straight line representation of planar graphs

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T12:38:34.950311Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 43843a1e-6061-407d-ba0f-d1664c80ccbe · outbound

This paper cites On the length of the longest monotone subsequence in a random permutation.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs On the length of the longest monotone subsequence in a random permutation

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-14T12:38:34.170380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ed1d634-a696-4718-8818-9beb63d64bfc · outbound

This paper cites A 1.235 lower bound on the number of points needed to draw all n -vertex planar graphs.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs A 1.235 lower bound on the number of points needed to draw all n -vertex planar graphs

Reference 9

Resolution: verified exact; doi, observed 2026-08-14T12:38:34.336557Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f295a564-4d9d-4095-82a1-6ac40de3b9bb · outbound

This paper cites A Note On Universal Point Sets for Planar Graphs.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs A Note On Universal Point Sets for Planar Graphs

Reference 10

Resolution: verified exact; local_arxiv, observed 2026-08-14T12:38:34.648781Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6a982c4e-8b10-4683-8191-67ab78e998f9 · outbound

This paper cites Embedding planar graphs on the grid.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs Embedding planar graphs on the grid

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-14T12:38:34.216807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf7fc6b9-c9b7-4db5-adbc-1804f2bd1e1b · outbound

This paper cites Congruent graphs and the connectivity of graphs.

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs Congruent graphs and the connectivity of graphs

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T12:38:34.862632Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Pith citing papers

No inbound Pith citation observations are available.