Paper Citation Record · LEDGER

The Contiguous Art Gallery Problem is Solvable in Polynomial Time

As of 16 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 4 inbound Pith citation observations for arXiv:2412.13938.

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

pith.paper-citation-record.v1
2412.13938 v3

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T12:42:55.150479Z

measured 40 of 40 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 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T11:28:13.701723Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-18T01:05:33.819174Z

Reference resolution

36 of 36 outbound references displayed

verified exact6
verified fuzzy6
unresolved23
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3d86dde9-504e-466f-ae3b-2ad4e0ddf228 · outbound

This paper cites The art gallery problem is R -complete.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time The art gallery problem is R -complete

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.024796Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e0d88a4-62a0-4c31-8493-94ec3c7ab315 · outbound

This paper cites Minimum star partitions of simple polygons in polynomial time.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Minimum star partitions of simple polygons in polynomial time

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.029117Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 826394e0-2053-4de7-b54d-1dbc50a8ea7f · outbound

This paper cites Common tangents of two disjoint polygons in linear time and constant workspace.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Common tangents of two disjoint polygons in linear time and constant workspace

Reference 3

Resolution: verified exact; doi, observed 2026-08-11T12:42:55.314597Z

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 64805a4f-f48b-4b71-a2f1-5d8220d338c2 · outbound

This paper cites an unresolved cited work.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Unresolved cited work

Reference 4

Resolution: unresolved; raw_fallback, observed 2026-08-11T12:42:55.991161Z

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 682bd431-e074-40e9-93eb-5025211e8941 · outbound

This paper cites An optimal algorithm for determining the visibility of a polygon from an edge.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time An optimal algorithm for determining the visibility of a polygon from an edge

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.041587Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78900dda-857d-44c7-9e8c-cb75c62ae56f · outbound

This paper cites Algorithms for reporting and counting geometric intersections.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Algorithms for reporting and counting geometric intersections

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.045254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21e5dadc-3ca4-4c0d-ad25-32a922e8a550 · outbound

This paper cites an unresolved cited work.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.049403Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e753e761-83b2-4cae-b449-291afb7a4038 · outbound

This paper cites Contiguous Boundary Guarding.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Contiguous Boundary Guarding

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.052689Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9df02dd4-a26f-4329-93b0-ab87027a94c8 · outbound

This paper cites Complexity and Real Computation.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Complexity and Real Computation

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.056481Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 247695f2-9f9f-44b6-b036-4a0ddaa9d718 · outbound

This paper cites A linear algorithm for computing the visibility polygon from a point.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time A linear algorithm for computing the visibility polygon from a point

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.060319Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4d25abd-165f-4524-b6fe-9f6271e3ae3b · outbound

This paper cites On the design of cgal a computational geometry algorithms library.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time On the design of cgal a computational geometry algorithms library

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T12:42:55.975520Z

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 70436815-5070-491e-ba87-6e438711b897 · outbound

This paper cites 2D regularized boolean set-operations.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time 2D regularized boolean set-operations

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T12:42:55.965587Z

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 571a75cb-15d6-43a2-b150-82df33213f39 · outbound

This paper cites Intersection of two lines in three-space.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Intersection of two lines in three-space

Reference 13

Resolution: verified exact; doi, observed 2026-08-11T12:42:55.291488Z

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 1a5253ea-f07a-46ac-9d18-6c4f9f455f4c · outbound

This paper cites Efficient clipping of arbitrary polygons.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Efficient clipping of arbitrary polygons

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.074841Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 288252ff-eb6c-4d96-a41d-47322076456f · outbound

This paper cites Geometric Algorithms and Combinatorial Optimization , volume 2 of Algorithms and Combinatorics.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Geometric Algorithms and Combinatorial Optimization , volume 2 of Algorithms and Combinatorics

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.078082Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc26649d-a3fa-4b9d-a043-d813d89e2a94 · outbound

This paper cites 2D visibility computation.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time 2D visibility computation

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T12:42:55.954775Z

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 5e315ba5-9d9e-4a74-b45a-d7e58bfab719 · outbound

This paper cites Mark Keil.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Mark Keil

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.084807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00a269f9-0ad4-4793-901c-6178a28e5be7 · outbound

This paper cites Mark Keil and Jorg-R.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Mark Keil and Jorg-R

Reference 18

Resolution: verified exact; doi, observed 2026-08-11T12:42:55.266727Z

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 0606c7f0-4c01-4ce5-adc3-380a2d7ea985 · outbound

This paper cites Guarding the walls of an art gallery.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Guarding the walls of an art gallery

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.091304Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa9a6fa7-82f8-4b2e-bf22-63274c5a19e5 · outbound

This paper cites Lee and D.T.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Lee and D.T

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.094952Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c3a59322-b05c-4087-80b2-74673d0a852e · outbound

This paper cites Lee and A.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Lee and A

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.098408Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74025f56-9900-4db4-865b-cca6c8945af2 · outbound

This paper cites an unresolved cited work.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Unresolved cited work

Reference 22

Resolution: verified exact; doi, observed 2026-08-11T12:42:55.242463Z

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 2305368c-efa3-4e51-88ab-cbe7a067e3d1 · outbound

This paper cites Mark Keil.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Mark Keil

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.104841Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45d93fe3-af18-4ce2-89d1-5412e6dfa6f7 · outbound

This paper cites A new algorithm for computing boolean operations on polygons.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time A new algorithm for computing boolean operations on polygons

Reference 24

Resolution: verified exact; doi, observed 2026-08-11T12:42:55.223252Z

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 333190c7-336a-4570-887e-28d6212794f1 · outbound

This paper cites an unresolved cited work.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Unresolved cited work

Reference 25

Resolution: unresolved; raw_fallback, observed 2026-08-11T12:42:55.944588Z

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 b0e74cd5-b90d-486e-b36b-86cba8807f41 · outbound

This paper cites Art gallery theorems and algorithms.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Art gallery theorems and algorithms

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T12:42:55.934247Z

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 c2352dc9-7dab-46e8-a6d4-05d83d19ebba · outbound

This paper cites Dynamization of order decomposable set problems.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Dynamization of order decomposable set problems

Reference 27

Resolution: verified exact; doi, observed 2026-08-11T12:42:55.210852Z

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 d12aaa19-8214-45f1-b0b6-a9b4d84d66b5 · outbound

This paper cites The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.122880Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8bac835-02d1-4782-8435-8c13758a80f1 · outbound

This paper cites Fixed points, nash equilibria, and the existential theory of the reals.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Fixed points, nash equilibria, and the existential theory of the reals

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.126731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2512328-6114-4715-bb11-11a14796c3e1 · outbound

This paper cites an unresolved cited work.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Unresolved cited work

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.130171Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f21b1f16-ab7e-4f17-8f8c-fbecf3603c38 · outbound

This paper cites The Point-Boundary Art Gallery Problem Is R -Hard.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time The Point-Boundary Art Gallery Problem Is R -Hard

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.133533Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44678947-bf22-4ee5-b587-178f025fa198 · outbound

This paper cites CGAL User and Reference Manual.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time CGAL User and Reference Manual

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T12:42:55.923763Z

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 0ab8e814-9959-4ade-b114-a2e72451ae7b · outbound

This paper cites Art gallery and illumination problems.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Art gallery and illumination problems

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.140243Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0767f287-74b1-4fce-999b-7dd31a8432fe · outbound

This paper cites an unresolved cited work.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Unresolved cited work

Reference 34

Resolution: metadata mismatch; raw_fallback, observed 2026-08-11T12:42:55.541511Z

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 56a9530d-009f-4224-bf93-c15f87bbc257 · outbound

This paper cites Hidden surface removal using polygon area sorting.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time Hidden surface removal using polygon area sorting

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-11T12:42:55.146865Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c1cea97-77cc-4f5d-aa9b-b11760ac4559 · outbound

This paper cites 2D arrangements.

The Contiguous Art Gallery Problem is Solvable in Polynomial Time 2D arrangements

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T12:42:55.913370Z

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

Observation 8b0137d0-6819-4fc3-8417-23a5df01a2a7 · inbound

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving cites this paper.

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving The Contiguous Art Gallery Problem is Solvable in Polynomial Time

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-11T11:28:13.701723Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a13cb081-19b0-40a5-bcdd-54263da50f68 · inbound

Simpler and Faster Contiguous Art Gallery cites this paper.

Simpler and Faster Contiguous Art Gallery The Contiguous Art Gallery Problem is Solvable in Polynomial Time

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-05T20:59:56.841523Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3baf1e66-6680-4c48-9acf-87d0d2d0527a · inbound

The Contiguous Art Gallery Problem is in {\Theta}(n log n) cites this paper.

The Contiguous Art Gallery Problem is in {\Theta}(n log n) The Contiguous Art Gallery Problem is Solvable in Polynomial Time

Reference 33

Resolution: verified exact; arxiv_id, observed 2026-05-18T01:05:33.822332Z

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 a15b5678-a82d-4566-bf89-cf4c68e7ef0f · inbound

The Contiguous Art Gallery Problem is in {\Theta}(n log n) cites this paper.

The Contiguous Art Gallery Problem is in {\Theta}(n log n) The Contiguous Art Gallery Problem is Solvable in Polynomial Time

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T00:05:25.924206Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.