{"as_of":"2026-08-12T18:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1530139f7eb356c792fb35d69c9ce3e64de2ef5fa34a3ceeb275d0ef89607645","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T15:08:37.833485Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2512.18268/citation-record","integrity":"/paper/2512.18268/integrity","json":"/paper/2512.18268/citation-record.json","paper":"/paper/2512.18268"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T15:08:36.455746Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:36.455746Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:a03e95a5e6d10d10024c70c634f55f10b0fb2d76dde9b6acf8e5db7c7dbacd61","observation_id":"ec302661-59c5-42d7-aa55-13d3e75f027c","resolution":{"observed_at":"2026-08-03T15:08:36.455746Z","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-03T15:08:36.525333Z","title":"W.; Gao, K.; Gong, J.; and Yu, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:36.525333Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:08b6ccdb6b902eed918be862c15c8558ab29e7fab243f2e20433dc70a799ecba","observation_id":"8a14b28e-3f7e-410e-ae24-2dcc56535050","resolution":{"observed_at":"2026-08-03T15:08:36.525333Z","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-03T15:08:36.673008Z","title":"W.; Han, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:36.673008Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:044c834f3c1ce6d361f024daad07a6beaf904f26031a16440d4d8827564eac4b","observation_id":"c560f5e8-6987-463d-9ec3-adb636129554","resolution":{"observed_at":"2026-08-03T15:08:36.673008Z","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-03T15:08:36.828270Z","title":"W.; and Yu, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:36.828270Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:8ceeea91c1927cc648724e18c84bbc5195ab3919bc2d37351bc043b24b7d5837","observation_id":"3946c214-ea42-4840-8265-9133be14a0e0","resolution":{"observed_at":"2026-08-03T15:08:36.828270Z","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-03T15:08:36.965738Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:36.965738Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:b6b2c41e752b2a14ed16e13b38f88b36a08ade8547bf7e0deb1a917a1fbcff38","observation_id":"113e01f8-af24-42ed-8e8c-b76da8f552e8","resolution":{"observed_at":"2026-08-03T15:08:36.965738Z","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-03T15:08:37.077771Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:37.077771Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:6fa2613fe96709476632ee5ea18b5a742b7988440923ff18aea37f7a904177c0","observation_id":"937c9edd-94b5-4063-8c53-8de59d134370","resolution":{"observed_at":"2026-08-03T15:08:37.077771Z","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-03T15:08:37.183137Z","title":"S.; and Maass, W","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:37.183137Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:b8cb098591da5dde299cd1bd32d411fa9e5e6da8bc6d159bf19e3f121cab8687","observation_id":"0ae37763-8d34-409e-8eb3-34eef6e2573e","resolution":{"observed_at":"2026-08-03T15:08:37.183137Z","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-03T15:08:37.298850Z","title":"P.; Paprocki, M.; ˇCert´ık, O.; Kir- pichev, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:37.298850Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:9b462ca652242cf2920c7e380ab71f71f6a5fdcb63aba151c15d3d1609e21afd","observation_id":"bf88bdf5-e2ad-41b8-8094-0e9598601448","resolution":{"observed_at":"2026-08-03T15:08:37.298850Z","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-03T15:08:37.399218Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:37.399218Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:ea9c4ce5f1795e99b32a02acc18a922fa590c2f045be1fcbd220bc4cfe049814","observation_id":"7abe73fd-8736-4bc6-8b46-4fa9eaa0ac61","resolution":{"observed_at":"2026-08-03T15:08:37.399218Z","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-03T15:08:37.520427Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:37.520427Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:5653a2e1b83d43917c747abdcfb71ee7f255ec503a66e31787b2eb60c9cef62c","observation_id":"2cb4c7ed-64c8-448f-9091-1f65b077ee11","resolution":{"observed_at":"2026-08-03T15:08:37.520427Z","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-03T15:08:37.653478Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:37.653478Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:08d8c19b18ba02864892034bec03d6ffc27b09a5d3eaa289a904a727444736e9","observation_id":"0c896e6c-6dd6-46e3-b96c-70c5631124cc","resolution":{"observed_at":"2026-08-03T15:08:37.653478Z","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-03T15:08:37.833485Z","title":"D.; O’Rourke, J.; and Goodman, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T15:08:37.833485Z"},"links":{"citing_paper":"/paper/2512.18268"},"observation_digest":"sha256:44df1291ed9e51988e86b2bff457ba6ac07c51f86bfbb79f9ba253492d099635","observation_id":"6a28ba4f-c710-4cde-b452-f2cab502a2d0","resolution":{"observed_at":"2026-08-03T15:08:37.833485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.18268","last_updated":"2026-06-02T13:02:43Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-03T15:08:35.808252Z","submitted_at":"2025-12-20T08:15:29Z","title":"On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":12},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2512.18268."}