Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T15:01:29.292778Z
Paper Citation Record · LEDGER
A Universality Theorem for Nested Polytopes
As of 15 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 4 inbound Pith citation observations for arXiv:1908.02213.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-14T11:22:45.285346Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-14T21:27:59.557923Z
Reference resolution
41 of 41 outbound references displayed
- verified exact1
- verified fuzzy32
- unresolved8
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation c5ddd915-b735-43f2-9417-5771916e3885 · outbound
This paper cites The Art Gallery Problem is $\exists \mathbb{R}$-complete.
A Universality Theorem for Nested Polytopes The Art Gallery Problem is $\exists \mathbb{R}$-complete
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:01:29.160329Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0d5bed6f-8347-49f7-bd21-7979cfe8749a · outbound
This paper cites an unresolved cited work.
A Universality Theorem for Nested Polytopes Unresolved cited work
Reference 2
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:01:29.767688Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 4473a313-eb8f-4e3f-95a3-96543f33650f · outbound
This paper cites Computing a nonnegative matrix factorization - provably.
A Universality Theorem for Nested Polytopes Computing a nonnegative matrix factorization - provably
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.755679Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 8ebab2c8-aca0-45a1-a85c-ccda940d6773 · outbound
This paper cites an unresolved cited work.
A Universality Theorem for Nested Polytopes Unresolved cited work
Reference 4
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:01:29.743761Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation c47e84d1-2200-4bd6-b613-b5d1b7449bc7 · outbound
This paper cites Some provably hard crossing number problems.
A Universality Theorem for Nested Polytopes Some provably hard crossing number problems
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.732009Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 61f5c8d3-c870-4123-a342-0a74f3f3563d · outbound
This paper cites Existential-R-Complete Decision Problems about Sym- metric Nash Equilibria in Symmetric Multi-Player Games.
A Universality Theorem for Nested Polytopes Existential-R-Complete Decision Problems about Sym- metric Nash Equilibria in Symmetric Multi-Player Games
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.719948Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 406aaa3e-13f8-4e97-b85b-f867b7bfc99a · outbound
This paper cites Goodrich.
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.708277Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 989c1b9f-cd2f-4cd4-b941-3e64e6713790 · outbound
This paper cites Some algebraic and geometric computations in pspace.
A Universality Theorem for Nested Polytopes Some algebraic and geometric computations in pspace
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.697671Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation b37e0d44-66a0-4273-9afe-801505016390 · outbound
This paper cites Computational geometry column 62.
A Universality Theorem for Nested Polytopes Computational geometry column 62
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.686398Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 107bdcdb-3faf-45a0-8b82-099fe60a429e · outbound
This paper cites Intersection graphs of rays and grounded segments.
A Universality Theorem for Nested Polytopes Intersection graphs of rays and grounded segments
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.674830Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 6e6f91fe-69ba-4c16-8431-3ecc08e06080 · outbound
This paper cites Recognition and complexity of point visibility graphs.
A Universality Theorem for Nested Polytopes Recognition and complexity of point visibility graphs
Reference 11
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:01:29.195505Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c1d6791d-0e3a-4942-9ded-760af715a257 · outbound
This paper cites Nonnegative matrix factorization requires irrationality.
A Universality Theorem for Nested Polytopes Nonnegative matrix factorization requires irrationality
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.655810Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation ad0292f7-a698-47f4-9865-69d4628f0446 · outbound
This paper cites Clarkson.
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.644460Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 4929a520-7e60-4e04-bb9b-20f371a713f5 · outbound
This paper cites Cohen and Uriel G.
A Universality Theorem for Nested Polytopes Cohen and Uriel G
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.632521Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a965f3aa-3abb-44f1-9388-1ede0a2ca948 · outbound
This paper cites Approximation schemes in computational geometry.
A Universality Theorem for Nested Polytopes Approximation schemes in computational geometry
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.620965Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 89681309-b5be-4314-ae7c-b2d7cc295cde · outbound
This paper cites Goodrich.
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.609560Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation f943530d-fb17-4232-b031-295e2a3cd3b3 · outbound
This paper cites The complexity of minimum convex nested polyhedra.
A Universality Theorem for Nested Polytopes The complexity of minimum convex nested polyhedra
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.597888Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 27fbf7e8-73a9-4687-b6f7-662804a385ed · outbound
This paper cites Minimum vertex hulls for polyhedral domains.
A Universality Theorem for Nested Polytopes Minimum vertex hulls for polyhedral domains
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.587159Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation f146547d-bf2d-4476-a44d-dd6f8382a994 · outbound
This paper cites Smoothed Analysis of the Art Gallery Problem.
A Universality Theorem for Nested Polytopes Smoothed Analysis of the Art Gallery Problem
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:01:29.220017Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e7c5e648-1abf-4a50-9ed1-4b59c587a3b0 · outbound
This paper cites ∀∃R- completeness and area-universality.
A Universality Theorem for Nested Polytopes ∀∃R- completeness and area-universality
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.576067Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation c1e44b99-19d0-4438-82b0-20a05039b841 · outbound
This paper cites Linear vs.
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.564397Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 8239f275-c249-413b-82b0-edf4e796ed4b · outbound
This paper cites On the geometric interpretation of the nonnegative rank.
A Universality Theorem for Nested Polytopes On the geometric interpretation of the nonnegative rank
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.551897Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation f911815d-f1e7-42b7-9564-03ada8726830 · outbound
This paper cites Intersection graphs of segments.Journal of Combinatorial Theory, Series B , 62(2):289–315, 1994.
A Universality Theorem for Nested Polytopes Intersection graphs of segments.Journal of Combinatorial Theory, Series B , 62(2):289–315, 1994
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.540789Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 74bee1c2-5c8f-44eb-8808-f2c4c30977cf · outbound
This paper cites The complexity of drawing a graph in a polygonal region.
A Universality Theorem for Nested Polytopes The complexity of drawing a graph in a polygonal region
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.529024Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 60e5b0c5-6ef8-4c64-bfc6-608e9bb846cc · outbound
This paper cites Intersection graphs of segments and $\exists\mathbb{R}$.
A Universality Theorem for Nested Polytopes Intersection graphs of segments and $\exists\mathbb{R}$
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T15:01:29.238088Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f6b24fcf-a080-478e-a20c-b0d638df9cdd · outbound
This paper cites Integer realizations of disk and segment graphs.Journal of Combinatorial Theory, Series B , 103(1):114–143, 2013.
A Universality Theorem for Nested Polytopes Integer realizations of disk and segment graphs.Journal of Combinatorial Theory, Series B , 103(1):114–143, 2013
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.519160Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation ce33f679-f10d-45cd-bad9-fd4c74304d8b · outbound
This paper cites an unresolved cited work.
A Universality Theorem for Nested Polytopes Unresolved cited work
Reference 27
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:01:29.508795Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 13b163cb-bd66-4a1a-be38-7d5386571971 · outbound
This paper cites An almost optimal algorithm for computing nonnegative rank.
A Universality Theorem for Nested Polytopes An almost optimal algorithm for computing nonnegative rank
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.497625Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation a3724e1f-9d7f-4d31-88ab-8b7f2622949b · outbound
This paper cites An almost optimal algorithm for computing nonnegative rank.
A Universality Theorem for Nested Polytopes An almost optimal algorithm for computing nonnegative rank
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.487206Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation e10c8058-b6b8-4789-b841-032d21f7d44c · outbound
This paper cites The computational geometry column# 4.
A Universality Theorem for Nested Polytopes The computational geometry column# 4
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.477052Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation cb8c4af3-6789-4f10-8460-be03b02721c9 · outbound
This paper cites Realization spaces of 4-polytopes are universal.
A Universality Theorem for Nested Polytopes Realization spaces of 4-polytopes are universal
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.466511Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 5cc05d19-13c5-4a92-a642-a740c7446abe · outbound
This paper cites Complexity of some geometric and topological problems.
A Universality Theorem for Nested Polytopes Complexity of some geometric and topological problems
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.456558Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 13eca175-cdc3-4421-9ca3-397795940be7 · outbound
This paper cites Fixed points, Nash equilibria, and the existential theory of the reals.
A Universality Theorem for Nested Polytopes Fixed points, Nash equilibria, and the existential theory of the reals
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.446182Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 22aceb4f-e27e-464d-8930-b6c537def5fc · outbound
This paper cites A universality theorem for nonnegative matrix factorizations.
A Universality Theorem for Nested Polytopes A universality theorem for nonnegative matrix factorizations
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.435619Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 36af3b56-9546-4242-89bc-6e0534f165bf · outbound
This paper cites The nonnegative rank of a matrix: Hard problems, easy solutions.
A Universality Theorem for Nested Polytopes The nonnegative rank of a matrix: Hard problems, easy solutions
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.423559Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 02070e67-85e4-4e01-bcdd-00af1eded47f · outbound
This paper cites Stretchability of pseudolines is np-hard.
A Universality Theorem for Nested Polytopes Stretchability of pseudolines is np-hard
Reference 36
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.411323Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 955a5ffa-e79f-4804-9f39-6a4b74ad3713 · outbound
This paper cites Silio Jr.
Reference 37
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.399946Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation fd4a1409-e0af-4c19-83b2-80fd79efe8b5 · outbound
This paper cites A decision method for elementary algebra and geometry.
A Universality Theorem for Nested Polytopes A decision method for elementary algebra and geometry
Reference 38
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.388461Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 5795c628-f97a-461c-8236-b697ece1f929 · outbound
This paper cites Smoothed Analysis of Order Types.
A Universality Theorem for Nested Polytopes Smoothed Analysis of Order Types
Reference 39
- Resolution
- verified exact
- local_arxiv, observed 2026-08-14T15:01:29.325874Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation f4142378-5def-42b4-8452-3d839a1ae4e8 · outbound
This paper cites an unresolved cited work.
A Universality Theorem for Nested Polytopes Unresolved cited work
Reference 40
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T15:01:29.376777Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 58ca2abe-a81a-4614-8ac1-c3d53ea41f7d · outbound
This paper cites Expressing combinatorial optimization problems by linear programs.
A Universality Theorem for Nested Polytopes Expressing combinatorial optimization problems by linear programs
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T15:01:29.365158Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Pith citing papers
Observation e410654d-a835-41b9-9887-018ca81e4ab6 · inbound
Optimal Curve Straightening is $\exists\mathbb{R}$-Complete cites this paper.
Optimal Curve Straightening is $\exists\mathbb{R}$-Complete A Universality Theorem for Nested Polytopes
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T11:22:45.285346Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ff19ebb7-c56e-4a2f-8745-b7dea3bf9b2f · inbound
Complexity of Contextuality cites this paper.
Complexity of Contextuality A Universality Theorem for Nested Polytopes
Reference 35
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:11:57.179064Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 74564297-a5a7-469b-bf5e-e884ed3481b8 · inbound
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem cites this paper.
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem A Universality Theorem for Nested Polytopes
Reference 11
- Resolution
- verified exact
- arxiv_id, observed 2026-05-12T09:11:27.246801Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 54113509-ac04-436f-af95-99f835f827cf · inbound
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem cites this paper.
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem A Universality Theorem for Nested Polytopes
Reference 11
- Resolution
- verified exact
- arxiv_id, observed 2026-05-14T21:27:59.560364Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.