Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A Universality Theorem for Nested Polytopes
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T05:11:57.179064Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-14T21:27:59.557923Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
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-08T06:32:00.761636+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-08T06:32:00.761636+00:00.