{"as_of":"2026-08-08T02:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e61d80654999ce2aaf1343aa2041ad97d1d3fb614cf0ab03d158c49547684d1","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:40:12.395852Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.04664/citation-record","integrity":"/paper/2506.04664/integrity","json":"/paper/2506.04664/citation-record.json","paper":"/paper/2506.04664"},"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-07T10:40:17.228858Z","title":"An iterative procedure for the polygonal approximation of plane curves","venue":null,"work_id":"38dcc693-3835-42e8-8f5a-56af068f444c","year":1972},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.383014Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:70b6efeb0bb2e9b7f14ec678ea3abe7892c004350a060e92060f5f3e9725606f","observation_id":"2711808d-6110-4c63-965c-cfd7394629fd","resolution":{"observed_at":"2026-08-07T10:40:17.374377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:16.959539Z","title":"Algorithms for the reduction of the number of points required to represent a digitized line or its caricature","venue":null,"work_id":"dec93e5a-42c0-47bf-b83c-045ab7321f15","year":1973},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.436265Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:d10d4faf4c65eeadcb3a992c52597e08bbc2493626abce12cb48e8040548aa27","observation_id":"a55b337d-e65a-4feb-9c6a-8e3d29f37fe5","resolution":{"observed_at":"2026-08-07T10:40:17.078973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:16.566527Z","title":"A new thresholding approach for automatic generation of polygonal approximations","venue":null,"work_id":"8137da6f-8b91-426b-8775-91daeb2e835b","year":2016},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.534243Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:dfec375ef3e892d0d8bccb38f07b81309afd6a1f8864d2aacd138affb6e3f85f","observation_id":"a2b5ff4c-8150-45e3-bac3-6376778d649b","resolution":{"observed_at":"2026-08-07T10:40:16.790330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:16.341770Z","title":"Optimized polygonal approximation by dominant point deletion","venue":null,"work_id":"d9689200-bbf7-4ee2-b8f7-d30e8a3c2e62","year":2008},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.610758Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:d9e074a8fdf7658a682da3ada4e2ab6324b58bcf344574e2308c33a5a4e3a99d","observation_id":"097cd4f8-11d2-4bd8-99e3-0a3f8213b409","resolution":{"observed_at":"2026-08-07T10:40:16.408023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:16.245480Z","title":"An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves","venue":null,"work_id":"41128ce7-7fc7-40a3-b45a-6344abba9da4","year":2016},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.697895Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:0fc8f406684e59de6a651c9d1fedbd5c4b11e406ca766b6c5c0e58d59d198b3e","observation_id":"60c5bb9d-9f6d-4410-9e91-21707e448eb7","resolution":{"observed_at":"2026-08-07T10:40:16.313984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:16.027541Z","title":"Segmentation of plane curves","venue":null,"work_id":"2f1e257b-cdb5-432f-83d2-bfd78b1544a0","year":1974},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.770565Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:f1239c2a245e3e172a7431f72d3645117844d7f8ba5d2e2a40f37c548cb0c485","observation_id":"9e61f924-bdd2-4d04-afdb-e4226fa8bc94","resolution":{"observed_at":"2026-08-07T10:40:16.140574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:15.809051Z","title":"Optimum polygonal approximation of digitized curves","venue":null,"work_id":"8c5701b2-a011-4fb6-a1cb-be5a94709324","year":1994},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.842462Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:133e719da1a2f70a80b6f31a323acaa16e5fc7f182d71a9bc7f56b32f5e0e46f","observation_id":"4c8c30ac-3a3f-413f-b619-28b307933ac4","resolution":{"observed_at":"2026-08-07T10:40:15.907835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:15.633282Z","title":"Techniques for assessing polygonal approximations of curves","venue":null,"work_id":"15c9a523-72bc-4950-8787-c7e487629253","year":1997},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.914582Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:001ef75bb92bf2589a834b80746a74e209655d20aafa43ec07d77f9a5945d1dd","observation_id":"41ac5a08-428e-49d3-bf2d-8be7c9328fa2","resolution":{"observed_at":"2026-08-07T10:40:15.724908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:15.443972Z","title":"An efficient algorithm for piecewise linear approximation of planar curve s","venue":null,"work_id":"a57fa277-99be-470f-8d4e-0608040ed548","year":1978},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:10.981058Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:c04099d4678e17ff37e59550be98375625a1698047e7c454e25d8e4a38c88937","observation_id":"3b82fbf3-a448-4b32-b114-ce3d35a397a5","resolution":{"observed_at":"2026-08-07T10:40:15.545341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:15.278790Z","title":"A fast sequential method for polygonal approximation of digitized curves","venue":null,"work_id":"45c8edb4-7ae8-4e89-8350-809e39a57145","year":1984},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.077203Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:0161f4e9b640c8f481de84acbed3ef4c261f38cef620e2adb3c6fd245d2662b0","observation_id":"31c5f8af-e625-47a7-bff8-a2bdf2cc3e53","resolution":{"observed_at":"2026-08-07T10:40:15.339987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:15.111959Z","title":"An algorithm for polygonal approximation based on iterative point elimination","venue":null,"work_id":"a9786e3a-409c-46a4-9e76-fd6adf2a7d22","year":1995},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.174968Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:29fa75f68cdf14f00e4202e56013df2694486ad7dd101e9e2e6ba143979f806e","observation_id":"db58c0b5-4d31-4c47-a928-418374c336d0","resolution":{"observed_at":"2026-08-07T10:40:15.204526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:14.958183Z","title":"Line generalization by repeated elimination of points","venue":null,"work_id":"5ac836b2-df5e-48f3-980b-e00363a4210b","year":1993},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.247108Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:1a18d4c86188485ced8bdae6247a0c849293a8562b669ed3857a38e85d51176f","observation_id":"942c5ad1-5638-46db-a740-8d6cc98ad093","resolution":{"observed_at":"2026-08-07T10:40:15.023709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:14.795150Z","title":"Dominant point deletion by reverse polygonization of digital curves","venue":null,"work_id":"5c4ed9fb-89b5-46a2-9de9-0cbce0fc8f2c","year":2008},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.338208Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:8cd59bf835fc8df6d9ea80a66be98639108b8e73e6041f46b741802e6531ae1a","observation_id":"02694af3-f002-49c7-81a6-0ebdfec33e24","resolution":{"observed_at":"2026-08-07T10:40:14.868158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:14.587627Z","title":"Polygonal approximation of digital planar curves through break point suppression","venue":null,"work_id":"6d13f4c1-8f1d-409d-9306-10fb9ebd0b4d","year":2010},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.405845Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:1c41a6a4dfd2ab9b528958d1be09dc88a01bd30367b6db7323d7ef843156f975","observation_id":"ebe2dbbb-8d0d-4754-92c8-dbe3d0528ca4","resolution":{"observed_at":"2026-08-07T10:40:14.712479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:14.317144Z","title":"On stop conditions about methods to obtain polygonal approximations relied on break point suppression","venue":null,"work_id":"31108efb-fe21-40f1-a417-e8fcdc2e11fd","year":2012},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.539363Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:faec75f887782c74931c648fc88e8be621ced017dc04c3c2df50d4d4150c01b7","observation_id":"4e788b11-0420-4d28-bccd-8568aee59b9f","resolution":{"observed_at":"2026-08-07T10:40:14.442817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:14.038717Z","title":"The computation of polygonal approximations for 2D contours based on a concavity tree","venue":null,"work_id":"7cb15157-d87c-4c5d-80d8-d92430d4d808","year":1905},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.642461Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:ec5e5414e72f00dd643e7b7bd418ab3b7a8285d7e56d76d0bc695b92e0a5454a","observation_id":"66e297b3-10b1-4438-927c-54cb32a09fab","resolution":{"observed_at":"2026-08-07T10:40:14.161406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:13.705810Z","title":"A novel framework for making dominant point detection methods non-parametric","venue":null,"work_id":"ff9736ab-9bb0-4013-8330-45f2450214b7","year":2012},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.752723Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:c6816d98f325fb86b203b043b0df7d73d81fea557971ac787463ad333cdae02f","observation_id":"0f30f996-c8c2-4dc1-a5fd-8c8b1f92485d","resolution":{"observed_at":"2026-08-07T10:40:13.886502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:13.443329Z","title":"Unsupervised generation of polygonal approximations based on the convex hull","venue":null,"work_id":"28a78cee-06bb-41a0-bb00-f826330695c7","year":2020},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.864051Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:c2f2ef4c85326628ecf6171dca25b6b731b79acb8c3abcef4d723b76fe11aaf3","observation_id":"0d6e2585-de5b-4f3f-b11c-eb3be1ab605a","resolution":{"observed_at":"2026-08-07T10:40:13.527320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:13.187155Z","title":"Polygonal approximation of digita l planar curves through adaptive optimizations","venue":null,"work_id":"fc5ee478-03aa-4561-991b-b47bb2595fa2","year":1997},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:11.976447Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:85de55a97aae1a2ff1527776f6c1cf047418898b7c9d8b846e6557b80f8457f1","observation_id":"7da59bbe-3d98-42be-a443-74103d70fe69","resolution":{"observed_at":"2026-08-07T10:40:13.289953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:12.970011Z","title":"Optimized polygonal approximation s through vertex relocations in contour neighborhoods","venue":null,"work_id":"e8b54d38-1801-472c-b4f3-4fb9089be31a","year":2015},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:12.097703Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:099f36dc7d21148817f497c0df4b7598cf53ee4ef20bec808d7eaf5d5795ea73","observation_id":"9d15d0ea-075e-48ec-b892-ef77d6616cc1","resolution":{"observed_at":"2026-08-07T10:40:13.071318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:12.818816Z","title":"A simple algorithm for detection of significant vertices for polygonal approximation of chain -coded curves","venue":null,"work_id":"8d11a0fc-9774-49f5-a9b9-dc4a1d1b7023","year":1993},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:12.194685Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:99531bdd5edc8c480f3a8a1a8a53fee724c751ce37d3c860242bd36162bce25a","observation_id":"54b2b3d6-813e-4187-9269-65185e133cc9","resolution":{"observed_at":"2026-08-07T10:40:12.884515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:12.658365Z","title":"Some algorithms under non -parametric framework versus an unsupervised approach","venue":null,"work_id":"09957f72-5db7-4aec-9569-50ed6e804ff6","year":2021},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:12.310514Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:bc0ef6f355b82f43930a64d3cb1f1f140256b06942916e1eedd3aae72a3609f9","observation_id":"be64a107-c817-4842-bb9c-f0a326848a3e","resolution":{"observed_at":"2026-08-07T10:40:12.728133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:40:12.515149Z","title":"Near-convex decomposition of 2D shape using visibility range","venue":null,"work_id":"a2872552-1fc6-48c9-bc25-db320076326c","year":2021},"citing_paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:12.395852Z"},"links":{"citing_paper":"/paper/2506.04664"},"observation_digest":"sha256:2fe772d82cd3f28238d9f9408646c4380e6d387962c639f370f32919a2794fd6","observation_id":"51333ed0-6bcd-414b-a75c-c869d174e681","resolution":{"observed_at":"2026-08-07T10:40:12.569790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04664","last_updated":"2025-08-12T05:44:15Z","latest_version":2,"primary_category":"cs.GR","snapshot_observed_at":"2026-08-07T10:33:27.820415Z","submitted_at":"2025-06-05T06:18:48Z","title":"A Fast Unsupervised Scheme for Polygonal Approximation"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":23},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2506.04664."}