{"as_of":"2026-08-16T08:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:153f98a9a4ab6428620da2c36d44ac52560f8d80fe93e92ef94516cf631604b7","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:55:51.641661Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"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.06417/citation-record","integrity":"/paper/1908.06417/integrity","json":"/paper/1908.06417/citation-record.json","paper":"/paper/1908.06417"},"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-14T12:55:52.579629Z","title":"The NURBS book","venue":null,"work_id":"c9307208-a23c-40aa-b73e-c3ef1e0b148b","year":1997},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.279601Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:afdf16d060bcf88b408b6fc8b30545a37882d7b1971ec918f2dd7e5a32d768ab","observation_id":"27879e3c-4bda-48b6-a4e1-f44521de6e1e","resolution":{"observed_at":"2026-08-14T12:55:52.586311Z","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-14T12:55:52.559418Z","title":"Handbook of computer aided geometric design","venue":null,"work_id":"d2f753ae-7045-428f-b495-52645b2cfa5f","year":2002},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.291445Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:d61cb7032bd7aa9a97df84a1f8c43b642d6dbded2ebdea36d75f7cc3a62f18cd","observation_id":"bc988010-b36e-4efa-8aff-cead481ea65f","resolution":{"observed_at":"2026-08-14T12:55:52.566482Z","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-14T12:55:52.538089Z","title":"Total least squares fitting of bezier and b-spline curves to ordered data","venue":null,"work_id":"0509151e-c559-46cd-a251-9d8f92b2da41","year":2002},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.307316Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:e412ee6e1dc0ddbb429e672e97b7ac34a3b56161f60a438e0d64a784ccca4e76","observation_id":"61ffa51a-8208-4c21-8eb0-cf562aca4228","resolution":{"observed_at":"2026-08-14T12:55:52.544869Z","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-14T12:55:52.517439Z","title":"Fitting b-spline curves to point clouds by curvature-based squared distance minimization","venue":null,"work_id":"79725680-b2d3-422f-bdaa-76b04bc74aed","year":2006},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.319984Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:7f4a5af9d22ad57d5b2484b8767cb0697f3033b2fb5c2e22a335711a1c0beac7","observation_id":"21ddd17c-befe-4c3b-8dd3-f6db2d0af8d7","resolution":{"observed_at":"2026-08-14T12:55:52.524908Z","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-14T12:55:52.497080Z","title":"B-spline surface fitting by it- erative geometric interpolation/approximation algorithms","venue":null,"work_id":"d941bef0-d161-4f77-9db8-12243a5ac8db","year":2012},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.328856Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:22243491a7a3ef10a06674bda38229479ad8f5f2f246923addb99fb94e2f86d9","observation_id":"7609da86-3db6-4297-9352-125978363042","resolution":{"observed_at":"2026-08-14T12:55:52.504166Z","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-14T12:55:52.476367Z","title":"An efficient method for fitting large data sets using T-splines","venue":null,"work_id":"1e584356-0d49-4971-98c8-3a4731af693d","year":2013},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.335724Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:967aa06466da306c2c1f03681eaa206f53fa2fcf826bc9a860d9b1b404fdd91e","observation_id":"af1c6db6-9beb-43ba-b93a-c2d55ad872c2","resolution":{"observed_at":"2026-08-14T12:55:52.482346Z","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-14T12:55:52.457826Z","title":"Progressive and iterative approximation for least squares B-spline curve and surface fitting","venue":null,"work_id":"59015124-0048-4826-9a0e-e64dcd762600","year":2014},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.344530Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:115545a9f5744fdebb81ebc08b08c0b1be96605df87a00d00c9a2d72b10aa392","observation_id":"a01c887b-603f-4a8a-a474-f36e5f3724f8","resolution":{"observed_at":"2026-08-14T12:55:52.463538Z","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-14T12:55:52.435405Z","title":"Elitist clonal selection algorithm for optimal choice of free knots in b-spline data fitting","venue":null,"work_id":"9863f315-5073-4c5c-bf18-40bcd5c7379c","year":2015},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.351842Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:1fce635e3260f20c1c6d838c71cd3d6fb56ced882927db7b08ec0ab7f3509cbe","observation_id":"d3e29278-0328-425e-9f66-af1f575b0f74","resolution":{"observed_at":"2026-08-14T12:55:52.444176Z","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-14T12:55:52.416285Z","title":"Least square geometric iterative fitting method for generalized B-spline curves with two different kinds of weights","venue":null,"work_id":"102866c1-f8b3-47af-bd36-18eac2fef554","year":2016},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.360941Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:39d54c3f9728e3a6d8565f6c89533dc83965b0ea707b79080ef6fe580565be13","observation_id":"d7487489-2456-4235-94f3-cdc966c1cc7c","resolution":{"observed_at":"2026-08-14T12:55:52.421990Z","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":{"arxiv_id":"1707.09109","last_updated":"2017-07-28T05:43:23Z","snapshot_observed_at":"2026-08-14T20:44:44.900865Z","submitted_at":"2017-07-28T05:43:23Z","title":"The Convergence of Least-Squares Progressive Iterative Approximation with Singular Iterative Matrix","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.09109","snapshot_observed_at":"2026-08-14T12:55:51.373435Z","title":"The convergence of least-squares progressive iterative approximation with singular iterative matrix","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.373435Z"},"links":{"cited_paper":"/paper/1707.09109","citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:7e59a44d9b46704d7dbfb799edc9b3bc4911340203f6f7b853c55364e0109e79","observation_id":"1175531e-f69d-49ca-89bd-f177ea5134d3","resolution":{"observed_at":"2026-08-14T12:55:51.373435Z","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-14T12:55:52.392415Z","title":"Shape modeling based on specifying the initial b-spline curve and scaled bfgs optimization method","venue":null,"work_id":"39f310c8-5f8b-4b58-8631-3f2b3b615e3f","year":2018},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.384004Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:437a4f50d76ea2c1c8fa6ba427b31a1369dda0f2254942e69d3c1de2d759a0fa","observation_id":"74d08122-8a45-4333-bf32-221669b99339","resolution":{"observed_at":"2026-08-14T12:55:52.398964Z","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-14T12:55:52.368622Z","title":"Survey on geometric iterative methods and their applications","venue":null,"work_id":"1db589ce-451c-427e-9d25-5d14043ab560","year":2018},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.391642Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:38f676c70c7d01e427e863e1379b9da94b9053e1e14fa4d6447fc7df31489be4","observation_id":"a4feec0c-49b1-421c-a8ad-4379c5fbd528","resolution":{"observed_at":"2026-08-14T12:55:52.376682Z","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-14T12:55:52.346931Z","title":"Progressive iterative approximation for regularized least square bivariate B-spline surface fitting","venue":null,"work_id":"a3269c3b-bdec-4dd1-992f-57b82a21eb50","year":2018},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.401660Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:b98d9da1a1155f710d4342dca55eb6eeb52537d7ebf5d965a81a1dc3be4c7f56","observation_id":"a146f2ae-387d-4e64-8605-2d960268a635","resolution":{"observed_at":"2026-08-14T12:55:52.353427Z","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-14T12:55:52.323067Z","title":"Parameterizing and extending trimmed regions for tensor-product surface fitting","venue":null,"work_id":"23ff5cf5-733a-4753-8d9f-2c46391e7362","year":2018},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.409655Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:d9408248e765f61fb133e40deabe555e630f9c718f674a2c9e0914ed3f6909b9","observation_id":"ab35ea7d-492a-462b-b6f4-0f47413c9792","resolution":{"observed_at":"2026-08-14T12:55:52.329514Z","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-14T12:55:52.302248Z","title":"Totally positive bases and progressive iteration approximation","venue":null,"work_id":"86944ceb-eabf-4de5-b3e5-63db3430a729","year":2005},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.415745Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:25d5a46f873cd24590f81076082503d5f0a0a882dbb7cbc78365b860e25c9b22","observation_id":"da965c7e-61e1-4ed6-98e1-1e27ea3a466c","resolution":{"observed_at":"2026-08-14T12:55:52.308689Z","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-14T12:55:52.281341Z","title":"The convergence of the geometric interpolation algorithm","venue":null,"work_id":"074fc55b-cfcb-4b30-91d1-be8e850e335f","year":2010},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.426383Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:4f60a529b1d975e6da479f4b57354c65024b0a5e373330e23d6fcd5f05636b14","observation_id":"4b211ead-f673-4154-956d-6a5dfaa220d0","resolution":{"observed_at":"2026-08-14T12:55:52.288526Z","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-14T12:55:52.257818Z","title":"Interpolation by geometric algo- rithm","venue":null,"work_id":"4bc8622b-9f26-40cb-8457-08d3791ef8fb","year":2007},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.433653Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:631da7d6838d6da7800a56cc94b35671b64af35e8b9a83eba72d85dc25954b21","observation_id":"bc554099-bee4-42ab-a7b4-0cfac7c42886","resolution":{"observed_at":"2026-08-14T12:55:52.264353Z","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-14T12:55:52.235155Z","title":"How does Agee’s smoothing method work? Proceedings of the 1979 army numerical analysis and computers conference, ARO report 1979;79-3:299–302","venue":null,"work_id":"40845639-0ecc-4431-aa48-389c17b0ab7d","year":1979},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.444082Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:191de20c739dd1af0a022c6b2444461724ab326eba66afc63aa103fb5b627541","observation_id":"a9340da7-c6c2-4d25-a826-d9219741aba4","resolution":{"observed_at":"2026-08-14T12:55:52.244070Z","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-14T12:55:52.215049Z","title":"The method of numeric polish in curve fitting","venue":null,"work_id":"700c2bc9-f5f4-4d9e-8c99-06bc0a20d336","year":1975},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.450270Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:5f433914645b40cdc1585dd71923f1e90408254aca43124641d251d2d0f3b816","observation_id":"31337ac9-3ecc-404a-b8da-b12cf6e0d208","resolution":{"observed_at":"2026-08-14T12:55:52.221156Z","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-14T12:55:52.192750Z","title":"A method of designing free surfaces by computer display (1st report)","venue":null,"work_id":"d2daaab0-15dc-4ffc-ba1e-f7304d176006","year":1977},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.456519Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:e8cbf8395d02b1c724370beaa40de05fcf33e926ce57fedc06f264110bdc5641","observation_id":"b4f62ad6-fd7e-4078-a2d9-1d95f0aab905","resolution":{"observed_at":"2026-08-14T12:55:52.198877Z","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-14T12:55:52.170965Z","title":"Convexity of rational curves and total positivity","venue":null,"work_id":"3da17ba4-5d31-4a27-9639-6fd2f1ce38be","year":1996},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.467144Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:eaa8e5bb7a0cabf8f1757d6cf599d8a750d4fe6ebacafeefbc7c2e176150e610","observation_id":"fecaed0d-48e3-4893-8247-899b9dfe3eed","resolution":{"observed_at":"2026-08-14T12:55:52.177358Z","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-14T12:55:52.152198Z","title":"A shape preserving representation with a evaluation algorithm of linear complexity","venue":null,"work_id":"f929af18-7036-41cf-9185-0a768b8562c2","year":2003},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.473140Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:e467db5434be5d9ba74820d5bbb8a9cb9ad715f84ee9d25b6f62d63b3cae99ba","observation_id":"be9c446c-7f50-4eb0-8dde-f21bf654550a","resolution":{"observed_at":"2026-08-14T12:55:52.158056Z","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-14T12:55:52.129820Z","title":"Constructing iterative non-uniform B- spline curve and surface to fit data points","venue":null,"work_id":"6b2051dc-e5ca-4d4d-96ee-cb2b6b61fd6e","year":2004},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.483651Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:a10d93c53b468f7cf7169050732c6ca8549c65b86c0fe3e296df1da0ba70ba56","observation_id":"65b3e57e-45d2-47bf-9713-eb6a5c3b64ef","resolution":{"observed_at":"2026-08-14T12:55:52.136853Z","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-14T12:55:52.100001Z","title":"Weighted progressive iteration approximation and convergence analysis","venue":null,"work_id":"f0a76e1a-26fb-4ebb-b9eb-0ec63c1f02e0","year":2010},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.502287Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:e71b29d9252dc59217ada405a9d586214b828a65fbb997184ccd225144154125","observation_id":"9e68c3c3-75a6-491a-b00d-f4d420bd3979","resolution":{"observed_at":"2026-08-14T12:55:52.107085Z","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-14T12:55:52.074120Z","title":"An extended iterative format for the progressive- iteration approximation","venue":null,"work_id":"2cc4744f-b999-4f10-bbed-5d0598da693d","year":2011},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.509810Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:cc40b238a44dc0edefc821304f51fac49afd948367ddb85bd792586ea41f44cf","observation_id":"1a5fb987-3b93-43c4-9b67-04512c4c90ce","resolution":{"observed_at":"2026-08-14T12:55:52.082408Z","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-14T12:55:52.036940Z","title":"An iterative algorithm of NURBS interpolation and approximation","venue":null,"work_id":"27d63984-3b8e-4577-bd11-f515e06ba391","year":2006},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.516538Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:3689add4be50e25c73bdf263c2fd748b09af4dc51bc5a5ffb515bd8a6fe40a1f","observation_id":"7f291e84-ba8e-447d-8c72-7f6c2c7ce5e7","resolution":{"observed_at":"2026-08-14T12:55:52.048982Z","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-14T12:55:52.013570Z","title":"Local progressive-iterative approximation format for blending curves and patches","venue":null,"work_id":"6b358a81-38df-4bdb-aecf-7731d1047858","year":2010},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.527242Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:e07e2bbe6278d35b09baa900b0d6bd136b36a92ceac8ae070591dd573f37848d","observation_id":"52e2da71-542c-41b3-9202-7c75709da65b","resolution":{"observed_at":"2026-08-14T12:55:52.020299Z","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-14T12:55:51.987352Z","title":"Progressive iterative approximation for triangular B´ ezier surfaces","venue":null,"work_id":"57d2008b-e7bd-4deb-a649-58b7f27a585b","year":2011},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.537623Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:8e82383389355e41bef1ad1561d4caae10dae1a48e574064708b4011da793457","observation_id":"e3415c3b-cf49-4bbc-8084-79f81df114fe","resolution":{"observed_at":"2026-08-14T12:55:51.993968Z","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-14T12:55:51.957987Z","title":"An iterative algorithm for polynomial approximation of rational triangular B´ ezier surfaces","venue":null,"work_id":"18046092-b1c7-4ed6-b78e-36a7d1f25ae6","year":2013},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.544395Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:f811e7fec9525c102881fed4237baa7fb0b9b39f2556289609cd135098a72399","observation_id":"ea5f0dee-65e7-475e-89db-bef5f6d3493c","resolution":{"observed_at":"2026-08-14T12:55:51.969291Z","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-14T12:55:51.932710Z","title":"Loop subdivision surface based progressive interpolation","venue":null,"work_id":"546eb1e4-ce63-476d-9f95-b6dd9f9bf055","year":2009},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.557482Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:7f2f9feaf20b856aa524cf2fece63389881dc61b74e7154c0dfccda4b0dbc0d3","observation_id":"e75381a9-0410-47e6-959f-4d81d427f076","resolution":{"observed_at":"2026-08-14T12:55:51.938221Z","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-14T12:55:51.909601Z","title":"Weighted progressive interpolation of Loop subdivi- sion surfaces","venue":null,"work_id":"53206671-6e60-4ff6-90ed-df051ec7e5dc","year":2012},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.566052Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:89d5d8a93c375dc0310bf3d3c6d9cd1e0e0be694edb1c0389302b0d545747aef","observation_id":"b8b7a7a2-73a7-4d42-8930-58a9c04ca8f3","resolution":{"observed_at":"2026-08-14T12:55:51.916493Z","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-14T12:55:51.871480Z","title":"Progressive interpolation based on Catmull-Clark subdivision surfaces","venue":null,"work_id":"7d630e45-2b2d-4f2d-ab60-399f9a4fd631","year":2008},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.577171Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:2e0b07026f239970b33a0c40269db14516b61b0d54fece7b1cf527fe1c668177","observation_id":"b6a1f753-db51-446c-8d79-e7dd3191afd7","resolution":{"observed_at":"2026-08-14T12:55:51.878062Z","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-14T12:55:51.833644Z","title":"Subdivision based interpolation with shape control","venue":null,"work_id":"73438d74-01ca-4770-a61f-0929dd18753f","year":2008},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.589155Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:8e29e8ccc45d1aa0b9f126007ed77387397f5095e5b9e2f334c490f474acaed8","observation_id":"62d83fac-f531-459f-8b6e-64af440345fc","resolution":{"observed_at":"2026-08-14T12:55:51.853132Z","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-14T12:55:51.800433Z","title":"Least squares cubic spline approximation I-Fixed knots","venue":null,"work_id":"e0c648f3-3e28-467a-8fee-e812479de673","year":1968},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.605121Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:6bd27195731340093d878eb439f7b9c4a8246df530640483176fd93888b6ec92","observation_id":"7646549a-b2d4-41da-a246-147ea478e45e","resolution":{"observed_at":"2026-08-14T12:55:51.815351Z","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-14T12:55:51.774406Z","title":"Iterative solution of large linear systems","venue":null,"work_id":"363b020e-d2ab-441f-8a03-1096b9ae3392","year":1971},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.630095Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:9a00aeafb561122ddf233e6cfe82429c523b84fef0916af31b269b738051730b","observation_id":"4b4eb8e3-1917-4b90-b488-619631032e20","resolution":{"observed_at":"2026-08-14T12:55:51.783650Z","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-14T12:55:51.750843Z","title":"On polya frequency functions","venue":null,"work_id":"698fb340-8b63-4869-85d2-bd5eb5cda5bf","year":1953},"citing_paper":{"arxiv_id":"1908.06417","last_updated":"2019-08-21T02:23:49Z","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:51.641661Z"},"links":{"citing_paper":"/paper/1908.06417"},"observation_digest":"sha256:4e59b8fd0caa1159147f4106aac1d8dfe2d30fb6fc5af39084417446530ae60f","observation_id":"8d98d2d8-c413-49bd-925d-443ad2bac7c6","resolution":{"observed_at":"2026-08-14T12:55:51.759564Z","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.06417","last_updated":"2019-08-21T02:23:49Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-08-16T02:24:56.088252Z","submitted_at":"2019-08-18T10:15:47Z","title":"On a progressive and iterative approximation method with memory for least square fitting"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":35},"total_outbound_references":36},"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 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1908.06417."}