{"as_of":"2026-08-08T12:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88659d4ddd41f3ca8b6a49c38bd0e74c1dae537f9736042247403e705bfbe953","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:55:33.637824Z","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-13T21:58:19.990487Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1403.3905","last_updated":"2014-03-16T11:07:49Z","snapshot_observed_at":"2026-08-01T21:35:09.348507Z","submitted_at":"2014-03-16T11:07:49Z","title":"Efficient Computation of Visibility Polygons","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1403.3905","snapshot_observed_at":"2026-08-07T10:55:33.637824Z","title":"arXiv:1403.3905 (2014) Springer Nature 2021 LATEX template 28 Optimizing Mesh to Improve the TEA T able A1: Properties of the polygonal maps","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.04086","last_updated":"2025-08-07T07:21:20Z","snapshot_observed_at":"2026-08-07T10:45:31.447952Z","submitted_at":"2025-06-04T15:46:15Z","title":"Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:33.637824Z"},"links":{"cited_paper":"/paper/1403.3905","citing_paper":"/paper/2506.04086"},"observation_digest":"sha256:3cad7e448f259577cd00c7804a12b0184a06fae7a87b681484c04407ffc1d878","observation_id":"0e776e2d-6e66-416d-a2e2-294e4ca3affb","resolution":{"observed_at":"2026-08-07T10:55:33.637824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1403.3905","last_updated":"2014-03-16T11:07:49Z","snapshot_observed_at":"2026-08-01T21:35:09.348507Z","submitted_at":"2014-03-16T11:07:49Z","title":"Efficient Computation of Visibility Polygons","version":1},"cited_work":{"arxiv_id":"1403.3905","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1403.3905","snapshot_observed_at":"2026-07-04T18:51:54.199783Z","title":"Efficient computation of visibility polygons","venue":null,"work_id":"e6218821-6345-4fe6-a06c-14e9578922a7","year":2014},"citing_paper":{"arxiv_id":"2604.01614","last_updated":"2026-04-02T04:48:55Z","snapshot_observed_at":"2026-07-06T22:51:35.522923Z","submitted_at":"2026-04-02T04:48:55Z","title":"Smooth Feedback Motion Planning with Reduced Curvature","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-13T21:53:19.558138Z"},"links":{"cited_paper":"/paper/1403.3905","citing_paper":"/paper/2604.01614"},"observation_digest":"sha256:23a42c7e4ada31acd69f02808f620dc9c558ec8f5db419bc7bdb2c316f9c3198","observation_id":"9fd4ca24-a22e-449f-bfc6-1c22f57db884","resolution":{"observed_at":"2026-07-04T18:51:54.199783Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1403.3905/citation-record","integrity":"/paper/1403.3905/integrity","json":"/paper/1403.3905/citation-record.json","paper":"/paper/1403.3905"},"outbound":[],"paper":{"arxiv_id":"1403.3905","last_updated":"2014-03-16T11:07:49Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-01T21:35:09.348507Z","submitted_at":"2014-03-16T11:07:49Z","title":"Efficient Computation of Visibility Polygons"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1403.3905."}