Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Tiling with Three Polygons is Undecidable
As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2409.11582.
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-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-11T15:56:09.169601Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-05T20:55:45.122871Z
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 c3dbb420-208b-4202-90bb-4584288b2abd · inbound
Undecidability of Translational Tiling with Three Tiles cites this paper.
Undecidability of Translational Tiling with Three Tiles Tiling with Three Polygons is Undecidable
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T15:56:09.169601Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation aaa610b3-5962-4f3b-9300-232c1a4d78cc · inbound
Two Tiling is Undecidable cites this paper.
Two Tiling is Undecidable Tiling with Three Polygons is Undecidable
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T04:13:16.031744Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7d6efe54-ff8c-41aa-ae06-bccd1a0d86ad · inbound
Undecidability of Tiling the Plane with a Set of 5 Polyominoes cites this paper.
Undecidability of Tiling the Plane with a Set of 5 Polyominoes Tiling with Three Polygons is Undecidable
Reference 2
- Resolution
- verified exact
- local_arxiv, observed 2026-08-05T20:55:45.130529Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.