{"as_of":"2026-08-16T16:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ae63dcc0012e2760825166544973562e2a1410e17e26c533b8eb6ee0003c99b","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:42:55.150479Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:28:13.701723Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-18T01:05:33.819174Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13938","snapshot_observed_at":"2026-08-11T11:28:13.701723Z","title":"The contiguous art gallery problem is solvable in polynomial time, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.15567","last_updated":"2025-06-23T03:27:21Z","snapshot_observed_at":"2026-08-11T18:37:07.505113Z","submitted_at":"2024-12-20T05:04:14Z","title":"The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T11:28:13.701723Z"},"links":{"cited_paper":"/paper/2412.13938","citing_paper":"/paper/2412.15567"},"observation_digest":"sha256:adc9e9f4bcea6fe08029c8c1741160fe9aa69e7dc4424fcafd6138f9519b9543","observation_id":"8b0137d0-6819-4fc3-8417-23a5df01a2a7","resolution":{"observed_at":"2026-08-11T11:28:13.701723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13938","snapshot_observed_at":"2026-08-05T20:59:56.841523Z","title":"The contiguous art gallery problem is solvable in polynomial time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09734","last_updated":"2025-08-13T11:59:58Z","snapshot_observed_at":"2026-08-11T18:37:15.160345Z","submitted_at":"2025-08-13T11:59:58Z","title":"Simpler and Faster Contiguous Art Gallery","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T20:59:56.841523Z"},"links":{"cited_paper":"/paper/2412.13938","citing_paper":"/paper/2508.09734"},"observation_digest":"sha256:788ce4164e7bd8cda1bf6aae02b616bbf079a5be39326fd7aaebf31043b0ef23","observation_id":"a13cb081-19b0-40a5-bcdd-54263da50f68","resolution":{"observed_at":"2026-08-05T20:59:56.841523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"cited_work":{"arxiv_id":"2412.13938","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.13938","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The contiguous art gallery problem is solvable in polynomial time","venue":null,"work_id":"0fa62937-5495-48a8-a391-683f0d22be43","year":2024},"citing_paper":{"arxiv_id":"2511.02960","last_updated":"2026-07-09T08:04:52Z","snapshot_observed_at":"2026-08-11T09:39:29.135386Z","submitted_at":"2025-11-04T20:01:54Z","title":"The Contiguous Art Gallery Problem is in {\\Theta}(n log n)","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-18T01:04:22.660792Z"},"links":{"cited_paper":"/paper/2412.13938","citing_paper":"/paper/2511.02960"},"observation_digest":"sha256:18f0c24cf487af8e396c8b642aeb2b7689306ade6a4fa5eaec6f948c0c56df93","observation_id":"3baf1e66-6680-4c48-9acf-87d0d2d0527a","resolution":{"observed_at":"2026-05-18T01:05:33.822332Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13938","snapshot_observed_at":"2026-08-04T00:05:25.924206Z","title":"The contiguous art gallery problem is solvable in polynomial time, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02960","last_updated":"2026-07-09T08:04:52Z","snapshot_observed_at":"2026-08-11T09:39:29.135386Z","submitted_at":"2025-11-04T20:01:54Z","title":"The Contiguous Art Gallery Problem is in {\\Theta}(n log n)","version":6},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T00:05:25.924206Z"},"links":{"cited_paper":"/paper/2412.13938","citing_paper":"/paper/2511.02960"},"observation_digest":"sha256:24165a3caca2121726e822ba59fc21e504f85b2c90eba42b8ba415cc474b9247","observation_id":"a15b5678-a82d-4566-bf89-cf4c68e7ef0f","resolution":{"observed_at":"2026-08-04T00:05:25.924206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.13938/citation-record","integrity":"/paper/2412.13938/integrity","json":"/paper/2412.13938/citation-record.json","paper":"/paper/2412.13938"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.024796Z","title":"The art gallery problem is R -complete","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.024796Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:bbbb40e69bea54fcd369997fb7d5fd61b9a8461a4365021ecdeab1159388ea6c","observation_id":"3d86dde9-504e-466f-ae3b-2ad4e0ddf228","resolution":{"observed_at":"2026-08-11T12:42:55.024796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.029117Z","title":"Minimum star partitions of simple polygons in polynomial time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.029117Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:6c6fcdb410585443c1ab4bc89442d6574503dd27ea51e1c72b1811e95772744d","observation_id":"8e0d88a4-62a0-4c31-8493-94ec3c7ab315","resolution":{"observed_at":"2026-08-11T12:42:55.029117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3284355","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.310847Z","title":"Common tangents of two disjoint polygons in linear time and constant workspace","venue":null,"work_id":"d8d45127-a9b7-424e-904e-b921b5b681bf","year":2018},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.033564Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:f5cf688df2fdb67e517959c970996168b61a878cea0bfd6a5efacfa42bb08a42","observation_id":"826394e0-2053-4de7-b54d-1dbc50a8ea7f","resolution":{"observed_at":"2026-08-11T12:42:55.314597Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.987652Z","title":null,"venue":null,"work_id":"741b59a7-779d-4f15-aa85-8273320fae03","year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.038020Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:c5f7f651f049890fad9e649d00e1ced3eba5e0751fa7b0c9728323e93e53285f","observation_id":"64805a4f-f48b-4b71-a2f1-5d8220d338c2","resolution":{"observed_at":"2026-08-11T12:42:55.991161Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.041587Z","title":"An optimal algorithm for determining the visibility of a polygon from an edge","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.041587Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:3f6bdc6352941294e1a2cabb779741fdf20a108c490925c679ce5919d3046670","observation_id":"682bd431-e074-40e9-93eb-5025211e8941","resolution":{"observed_at":"2026-08-11T12:42:55.041587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.045254Z","title":"Algorithms for reporting and counting geometric intersections","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.045254Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:c7b4b3420f98df1e90398ed9500cfde1cec6181aca347c90d2b4a408d3ae4e2c","observation_id":"78900dda-857d-44c7-9e8c-cb75c62ae56f","resolution":{"observed_at":"2026-08-11T12:42:55.045254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.049403Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.049403Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:7e6eb3cd843dfe5f46fd5865f65af654414398598c1b1eb1b7423b61c18aee41","observation_id":"21e5dadc-3ca4-4c0d-ad25-32a922e8a550","resolution":{"observed_at":"2026-08-11T12:42:55.049403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15053","last_updated":"2025-05-08T14:19:14Z","snapshot_observed_at":"2026-08-16T09:14:20.908437Z","submitted_at":"2024-12-19T17:00:22Z","title":"Contiguous Boundary Guarding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15053","snapshot_observed_at":"2026-08-11T12:42:55.052689Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.052689Z"},"links":{"cited_paper":"/paper/2412.15053","citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:ece4a1f17f52c7b4873fa1eb9ab183521e06cfde6aef8fe1b9a3dab436f88064","observation_id":"e753e761-83b2-4cae-b449-291afb7a4038","resolution":{"observed_at":"2026-08-11T12:42:55.052689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.056481Z","title":"Complexity and Real Computation","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.056481Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:af6683fd705aafa9878c63aefe0379168d054665e93b887019a8804d16e04079","observation_id":"9df02dd4-a26f-4329-93b0-ab87027a94c8","resolution":{"observed_at":"2026-08-11T12:42:55.056481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.060319Z","title":"A linear algorithm for computing the visibility polygon from a point","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.060319Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:10b57a90f5a8f61874ed3393fb2a53b31a481ae2aee9d7f0aff0a2f5ea608cbd","observation_id":"247695f2-9f9f-44b6-b036-4a0ddaa9d718","resolution":{"observed_at":"2026-08-11T12:42:55.060319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.971833Z","title":"On the design of cgal a computational geometry algorithms library","venue":null,"work_id":"ce8999a1-5d67-43ba-ad61-70b1dcd45377","year":2000},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.064078Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:21681d9b899f70c67656d76bd78d56656aa00261dcd62c2332425c57a3403239","observation_id":"f4d25abd-165f-4524-b6fe-9f6271e3ae3b","resolution":{"observed_at":"2026-08-11T12:42:55.975520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.961816Z","title":"2D regularized boolean set-operations","venue":null,"work_id":"293a8146-b645-409d-91e0-d9f6ecb908ab","year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.067830Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:82dccb92a593a523635ff997e8f5593458649001c6b6e6da3e122f7878764238","observation_id":"70436815-5070-491e-ba87-6e438711b897","resolution":{"observed_at":"2026-08-11T12:42:55.965587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/b978-0-08-050753-8.50064-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.287145Z","title":"Intersection of two lines in three-space","venue":null,"work_id":"fc15281c-0126-4e86-9a0b-41d20b619f94","year":1990},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.071241Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:8dc075d77b92e8ab2a2accf8bd0e00bf8ef42f22595caa58dd4fbc6fd99047e3","observation_id":"571a75cb-15d6-43a2-b150-82df33213f39","resolution":{"observed_at":"2026-08-11T12:42:55.291488Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.074841Z","title":"Efficient clipping of arbitrary polygons","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.074841Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:6ba340ed9baebc3096cd668d8d866aee762f7c6e13993f187fec7d414b99acb2","observation_id":"1a5253ea-f07a-46ac-9d18-6c4f9f455f4c","resolution":{"observed_at":"2026-08-11T12:42:55.074841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.078082Z","title":"Geometric Algorithms and Combinatorial Optimization , volume 2 of Algorithms and Combinatorics","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.078082Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:17edd57b1f1dca4634372e7427b48a1469bb16fbe2eb2e9f199358c339ccace6","observation_id":"288252ff-eb6c-4d96-a41d-47322076456f","resolution":{"observed_at":"2026-08-11T12:42:55.078082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.951110Z","title":"2D visibility computation","venue":null,"work_id":"b0860db3-65ec-4062-b305-2527b1b10e96","year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.081549Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:d5984b61722e68c48ccf96783ac72e08c9d4dacfb32af4a9559cb03820c2c538","observation_id":"fc26649d-a3fa-4b9d-a043-d813d89e2a94","resolution":{"observed_at":"2026-08-11T12:42:55.954775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.084807Z","title":"Mark Keil","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.084807Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:460b0fed838c7ef133822008b88a125c2606f0168190a5f803871e3e3b145f72","observation_id":"5e315ba5-9d9e-4a74-b45a-d7e58bfab719","resolution":{"observed_at":"2026-08-11T12:42:55.084807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/b978-0-444-87806-9.50012-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.263160Z","title":"Mark Keil and Jorg-R","venue":null,"work_id":"f5137ee1-a462-4fb4-9f14-7d5778ecee09","year":1985},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.088187Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:0406e665ece2745785d9c0f9354ed4cd4d6d8f3891c35653c1d76c7bf2db908a","observation_id":"00a269f9-0ad4-4793-901c-6178a28e5be7","resolution":{"observed_at":"2026-08-11T12:42:55.266727Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.091304Z","title":"Guarding the walls of an art gallery","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.091304Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:79e66348d280f2f460e00db498dc75a1fa3dd920b8414025c76eed1c93b87da0","observation_id":"0606c7f0-4c01-4ce5-adc3-380a2d7ea985","resolution":{"observed_at":"2026-08-11T12:42:55.091304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.094952Z","title":"Lee and D.T","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.094952Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:69ca26bae569afd0e57a9bff6dc22bc5781248272d126cac1400da720adc095b","observation_id":"fa9a6fa7-82f8-4b2e-bf22-63274c5a19e5","resolution":{"observed_at":"2026-08-11T12:42:55.094952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.098408Z","title":"Lee and A","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.098408Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:da49c3d783569b12ccdab3d310208eca5bc7a985659b1b9c9bcce8016038f729","observation_id":"c3a59322-b05c-4087-80b2-74673d0a852e","resolution":{"observed_at":"2026-08-11T12:42:55.098408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4613-8997-2_23","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":null,"venue":null,"work_id":"2fb7405e-3289-4f73-9e6d-1df55cf2a23d","year":1990},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.101498Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:23fc0a8639ef90d74ef397e560bf2b3b22975f50fb9037bfa110d8c66b9cd67e","observation_id":"74025f56-9900-4db4-865b-cca6c8945af2","resolution":{"observed_at":"2026-08-11T12:42:55.242463Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.104841Z","title":"Mark Keil","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.104841Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:2ccdcffd8006c13b525ab6e132365a859198be33e93155fcc6891bfc19c02284","observation_id":"2305368c-efa3-4e51-88ab-cbe7a067e3d1","resolution":{"observed_at":"2026-08-11T12:42:55.104841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.cageo.2008.08.009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.218760Z","title":"A new algorithm for computing boolean operations on polygons","venue":null,"work_id":"92e818a4-707f-43a4-b414-8b060736fad2","year":2009},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.108220Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:625ba1b508747217c35ea849416cec1b889723c91a597f037dfd6fa176d3b0c4","observation_id":"45d93fe3-af18-4ce2-89d1-5412e6dfa6f7","resolution":{"observed_at":"2026-08-11T12:42:55.223252Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.940973Z","title":null,"venue":null,"work_id":"6b2c3db4-cac2-4657-bd95-ca949f8c3c0a","year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.111730Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:42d1d7175a0a11fca0ac2f14a59824b927b622f2603f62892bb87383b7ae20ab","observation_id":"333190c7-336a-4570-887e-28d6212794f1","resolution":{"observed_at":"2026-08-11T12:42:55.944588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.930468Z","title":"Art gallery theorems and algorithms","venue":null,"work_id":"3c7985bc-6964-4a94-9878-dc48e5bf993e","year":1987},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.115092Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:a4c6d77b1815f51f9b53a942f399e05f41e2e937e077f4b419a779aa8974db37","observation_id":"b0e74cd5-b90d-486e-b36b-86cba8807f41","resolution":{"observed_at":"2026-08-11T12:42:55.934247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0196-6774(81)90025-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.204993Z","title":"Dynamization of order decomposable set problems","venue":null,"work_id":"c07e92d1-b920-4dc5-90ce-7cc926be19e6","year":1981},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.118373Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:32080acfb47beb4b184bb745f1470cd6c66b46e1ed4e06a23adc2542536e51a1","observation_id":"c2352dc9-7dab-46e8-a6d4-05d83d19ebba","resolution":{"observed_at":"2026-08-11T12:42:55.210852Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15567","last_updated":"2025-06-23T03:27:21Z","snapshot_observed_at":"2026-08-11T18:37:07.505113Z","submitted_at":"2024-12-20T05:04:14Z","title":"The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15567","snapshot_observed_at":"2026-08-11T12:42:55.122880Z","title":"Robson, Jack Spalding-Jamieson, and Da Wei Zheng","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.122880Z"},"links":{"cited_paper":"/paper/2412.15567","citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:eb400e70a8626f862723c58b5ddf456430afe46677bc8ac3ba0390ef8bf5cbef","observation_id":"d12aaa19-8214-45f1-b0b6-a9b4d84d66b5","resolution":{"observed_at":"2026-08-11T12:42:55.122880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.126731Z","title":"Fixed points, nash equilibria, and the existential theory of the reals","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.126731Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:c669e2159a3f38dbbb7f7baffb4717244154ef6fc24e0d0fbee9c4a53c0672dc","observation_id":"b8bac835-02d1-4782-8435-8c13758a80f1","resolution":{"observed_at":"2026-08-11T12:42:55.126731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.130171Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.130171Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:d577811da21892e607a10f9c25a7260100e7762cf37003583f7d37b17a2e4e84","observation_id":"a2512328-6114-4715-bb11-11a14796c3e1","resolution":{"observed_at":"2026-08-11T12:42:55.130171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.133533Z","title":"The Point-Boundary Art Gallery Problem Is R -Hard","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.133533Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:76dde8918870fa5be96e92dc234e0d7ed807108a2d641166866b71a2cf1045d9","observation_id":"f21b1f16-ab7e-4f17-8f8c-fbecf3603c38","resolution":{"observed_at":"2026-08-11T12:42:55.133533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.920050Z","title":"CGAL User and Reference Manual","venue":null,"work_id":"3045f612-13b9-4783-91b2-813cd7b7a46f","year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.136971Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:d6b7a67d7eadc1fbecf2301e8878062036f97e9ed685770c2b4bc8de189da539","observation_id":"44678947-bf22-4ee5-b587-178f025fa198","resolution":{"observed_at":"2026-08-11T12:42:55.923763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.140243Z","title":"Art gallery and illumination problems","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.140243Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:b58b07c1690148cd40cb8177988fd9ed4a9cefdf4c295d4e9460c0360cfb9623","observation_id":"0ab8e814-9959-4ade-b114-a2e72451ae7b","resolution":{"observed_at":"2026-08-11T12:42:55.140243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9902.12990","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.536309Z","title":null,"venue":null,"work_id":"6c928347-fa51-469c-aba2-477dfa91930f","year":1992},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.143629Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:e8a0e8e02c285c04b038b2a93c923efe45766ac8c6442c5d99bb9fa1dde6781b","observation_id":"0767f287-74b1-4fce-999b-7dd31a8432fe","resolution":{"observed_at":"2026-08-11T12:42:55.541511Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.146865Z","title":"Hidden surface removal using polygon area sorting","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.146865Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:51765237dd13547b8d11d03de454c43c714c3421bf4e6e0074222df484c7ab15","observation_id":"56a9530d-009f-4224-bf93-c15f87bbc257","resolution":{"observed_at":"2026-08-11T12:42:55.146865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:42:55.909804Z","title":"2D arrangements","venue":null,"work_id":"369b5757-f426-4265-bfbd-0cd58228fef8","year":2024},"citing_paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T12:42:55.150479Z"},"links":{"citing_paper":"/paper/2412.13938"},"observation_digest":"sha256:d3337161571add1940ad92a724109f0006c39c11fc5d41d19f26770da0161bbe","observation_id":"3c1cea97-77cc-4f5d-aa9b-b11760ac4559","resolution":{"observed_at":"2026-08-11T12:42:55.913370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.13938","last_updated":"2025-06-27T02:00:14Z","latest_version":3,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-11T18:37:14.128383Z","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":23,"verified_exact":6,"verified_fuzzy":6},"total_outbound_references":36},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"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."}