{"as_of":"2026-08-21T10:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74c2e5f25e7ab45ddfedc78ce5cc656ab1409db8fb9e5ef99b02606cedcdecc8","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T16:05:14.059558Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-01T21:56:15.541866Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.03526","last_updated":"2018-03-09T14:32:35Z","snapshot_observed_at":"2026-08-14T19:37:48.862632Z","submitted_at":"2018-03-09T14:32:35Z","title":"A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon","version":1},"cited_work":{"arxiv_id":"1803.03526","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.03526","snapshot_observed_at":"2026-07-01T21:56:15.541866Z","title":"A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon","venue":"cs.CG","work_id":"6ecf1b28-f526-42b7-aada-7f498978d183","year":2018},"citing_paper":{"arxiv_id":"2606.01147","last_updated":"2026-05-31T10:32:24Z","snapshot_observed_at":"2026-08-04T06:06:28.634155Z","submitted_at":"2026-05-31T10:32:24Z","title":"On Fr\\'echet Traveling Salesmen Problems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T16:05:14.059558Z"},"links":{"cited_paper":"/paper/1803.03526","citing_paper":"/paper/2606.01147"},"observation_digest":"sha256:a2d1e2a6cb33eee0995921cc5cb35036a74b0e94886b27c36113fbb699c0494a","observation_id":"9746c1d1-3f3c-422c-ba3f-d14a4af5292d","resolution":{"observed_at":"2026-07-01T21:56:15.543344Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1803.03526/citation-record","integrity":"/paper/1803.03526/integrity","json":"/paper/1803.03526/citation-record.json","paper":"/paper/1803.03526"},"outbound":[],"paper":{"arxiv_id":"1803.03526","last_updated":"2018-03-09T14:32:35Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-14T19:37:48.862632Z","submitted_at":"2018-03-09T14:32:35Z","title":"A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1803.03526."}