{"as_of":"2026-08-16T19:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e78f6295619bcb50d17a12c0f32b9943e9d0a7dd8cdd07a4630306aeda566470","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:12:59.700697Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.01662/citation-record","integrity":"/paper/1908.01662/integrity","json":"/paper/1908.01662/citation-record.json","paper":"/paper/1908.01662"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:12:59.852177Z","title":null,"venue":null,"work_id":"27eda271-cd45-4310-ac7e-6fd9e6fc5f6d","year":2010},"citing_paper":{"arxiv_id":"1908.01662","last_updated":"2019-08-05T14:53:11Z","snapshot_observed_at":"2026-08-16T15:51:10.321216Z","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T15:12:59.646823Z"},"links":{"citing_paper":"/paper/1908.01662"},"observation_digest":"sha256:f975917ac80662d727a5b5dbf23fe4add5b52f2233e41e8806d08c98077f8143","observation_id":"fc309575-45a1-4f4e-8ec3-bcbc55abf7ed","resolution":{"observed_at":"2026-08-14T15:12:59.856733Z","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-14T15:12:59.653483Z","title":"Face detection, pose estimation, and landmark localization in the wild","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.01662","last_updated":"2019-08-05T14:53:11Z","snapshot_observed_at":"2026-08-16T15:51:10.321216Z","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T15:12:59.653483Z"},"links":{"citing_paper":"/paper/1908.01662"},"observation_digest":"sha256:107c0ce5a85500b9c99b8f6e014a54e50e905975864b2ea941bdb62664f54ce5","observation_id":"cdbbe988-4dde-4574-989a-af8b4e4c5ba8","resolution":{"observed_at":"2026-08-14T15:12:59.653483Z","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-14T15:12:59.817522Z","title":"Felzenszwalb and Daniel P","venue":null,"work_id":"3521a1b6-20e4-4643-912d-d3c3e0f27421","year":2004},"citing_paper":{"arxiv_id":"1908.01662","last_updated":"2019-08-05T14:53:11Z","snapshot_observed_at":"2026-08-16T15:51:10.321216Z","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T15:12:59.667375Z"},"links":{"citing_paper":"/paper/1908.01662"},"observation_digest":"sha256:09eae21b5726ac5c37a7d7e724b7b2dcf7cd0e37f4ffa9e8eb4baa0542c65b0a","observation_id":"4f3b84bf-6410-43eb-a09c-847e1b3c19f8","resolution":{"observed_at":"2026-08-14T15:12:59.823427Z","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-14T15:12:59.800412Z","title":"Self-describing sequences and the catalan family tree","venue":null,"work_id":"d27fca7f-aaf1-400b-b79a-80a071431e32","year":2003},"citing_paper":{"arxiv_id":"1908.01662","last_updated":"2019-08-05T14:53:11Z","snapshot_observed_at":"2026-08-16T15:51:10.321216Z","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T15:12:59.677365Z"},"links":{"citing_paper":"/paper/1908.01662"},"observation_digest":"sha256:a0b7f38a2a8c72f13ef2e2fa6dbc10b7f1081fc318f84593e61212e0c7b62b86","observation_id":"6a6c8afc-415f-42c6-94b5-f49559856abe","resolution":{"observed_at":"2026-08-14T15:12:59.806085Z","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-14T15:12:59.687896Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.01662","last_updated":"2019-08-05T14:53:11Z","snapshot_observed_at":"2026-08-16T15:51:10.321216Z","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T15:12:59.687896Z"},"links":{"citing_paper":"/paper/1908.01662"},"observation_digest":"sha256:403adc45ab4e14b4e08d2b14596388a4402e7502bdb76b650309179a4f125d3d","observation_id":"4401ea72-092c-4406-9712-aed12437587a","resolution":{"observed_at":"2026-08-14T15:12:59.687896Z","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-14T15:12:59.695542Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.01662","last_updated":"2019-08-05T14:53:11Z","snapshot_observed_at":"2026-08-16T15:51:10.321216Z","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T15:12:59.695542Z"},"links":{"citing_paper":"/paper/1908.01662"},"observation_digest":"sha256:a2e6650df7b13dad81645094cf32e1d48917398967e650a9eab419aa7c03cccc","observation_id":"96ab1e9b-c865-4d89-8d57-69dd72ce1cf0","resolution":{"observed_at":"2026-08-14T15:12:59.695542Z","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-14T15:12:59.747610Z","title":"Under review","venue":null,"work_id":"6305cc01-e68c-426a-9a51-1af02cfed776","year":2019},"citing_paper":{"arxiv_id":"1908.01662","last_updated":"2019-08-05T14:53:11Z","snapshot_observed_at":"2026-08-16T15:51:10.321216Z","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T15:12:59.700697Z"},"links":{"citing_paper":"/paper/1908.01662"},"observation_digest":"sha256:c42f1b5fd7ba476c70a1b943580ef7919ecc9b11ef02f9e5e75b651ed0e0f9f8","observation_id":"2e7126d8-a490-49d4-833d-e45fb1f1cba1","resolution":{"observed_at":"2026-08-14T15:12:59.754212Z","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":"1908.01662","last_updated":"2019-08-05T14:53:11Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-16T15:51:10.321216Z","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":7},"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 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:1908.01662."}