{"as_of":"2026-08-16T15:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c65f51a5bfe4fbac955d85455bb9a53a9c19f6193a88e068ab3659d0c52e791e","coverage":[{"denominator":86,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":86,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:03:11.412380Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"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.06001/citation-record","integrity":"/paper/1908.06001/integrity","json":"/paper/1908.06001/citation-record.json","paper":"/paper/1908.06001"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:10.738065Z","title":"Alpert, L","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.738065Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:2a9571a815ba0370125aab053653a05f411932c8a326aa58d342f1003a972a5c","observation_id":"6d5be0f5-c651-4e29-8b83-a7087d69f52f","resolution":{"observed_at":"2026-08-14T13:03:10.738065Z","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-14T13:03:10.752323Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.752323Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:cd793e18d8719943ea3907b362415dc876692d2bc5be2f7b63b64e507a621094","observation_id":"027364f6-8933-4454-8dd7-840eee2b7812","resolution":{"observed_at":"2026-08-14T13:03:10.752323Z","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-14T13:03:10.760070Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.760070Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:be79dbab205016cb7ed28897d12c8d5b2f5bad88535ca5d67db2e0d76da8deaf","observation_id":"98513d69-5849-4a5a-b089-9fa8925484ab","resolution":{"observed_at":"2026-08-14T13:03:10.760070Z","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-14T13:03:10.765642Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.765642Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:dc42ca13d793d363ad7644a56427f2f1aa6bcb0d620be79cb6e75e080ef99ce0","observation_id":"8344122c-eb6c-44a1-a82d-c22cfa837570","resolution":{"observed_at":"2026-08-14T13:03:10.765642Z","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-14T13:03:10.771768Z","title":"Barrodale, L","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.771768Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:9c02912a56f156fd17e4887b0cac281e8a7cda976df0723cefa4995744079974","observation_id":"50bc4edb-569b-4f8c-a431-9d0d74de993d","resolution":{"observed_at":"2026-08-14T13:03:10.771768Z","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-14T13:03:10.778764Z","title":"Beckermann and A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.778764Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:dfe907efe9d6ed64210ab7874f36135845ce182ae731e25492269bb43db102ae","observation_id":"da36d793-ff43-4db4-a5a5-c4d10144349d","resolution":{"observed_at":"2026-08-14T13:03:10.778764Z","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-14T13:03:13.630266Z","title":"Benner, A","venue":null,"work_id":"09dacd5a-efb3-4967-88fe-dd63339c9c5d","year":2017},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.789015Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:d531d368104297d18de1061a8b4e6716c9be5df9493d682a586b787d57a31993","observation_id":"0cae7f7a-04cb-4057-bff7-5bb6dc1b5c77","resolution":{"observed_at":"2026-08-14T13:03:13.635540Z","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-14T13:03:13.610586Z","title":"Berljafa and S","venue":null,"work_id":"e4ebe40b-2091-4524-8f0a-bbbbf926518b","year":2017},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.795973Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:3b899952d4ec10ab82e0d30d2ddaf008470c6ba2c7eadc57e8ce70086960d1d7","observation_id":"15947abf-9e24-4500-bcd6-50e4ce611847","resolution":{"observed_at":"2026-08-14T13:03:13.617630Z","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-14T13:03:13.585121Z","title":"Berrut and L","venue":null,"work_id":"22c32e87-d8e5-40a4-9481-9209ed43aa17","year":2004},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.801385Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:f4065e9ae73ef5386c9a09bc66548e31fc22ed83ef207fbebf8289c137707aec","observation_id":"0d23eacd-600d-4a23-8773-bb05e67c5240","resolution":{"observed_at":"2026-08-14T13:03:13.592813Z","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-14T13:03:13.548836Z","title":"Braess, Nonlinear Approximation Theory, Springer, 1986","venue":null,"work_id":"ffdca932-d846-4257-af45-d857d440b344","year":1986},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.807800Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:8ca81bbd13fdf4d946562cfa7b05fd9798168e1bad73349b835379b0f8413a29","observation_id":"df7a935f-6c54-4bc0-a2a4-80a0768c33fd","resolution":{"observed_at":"2026-08-14T13:03:13.562102Z","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-14T13:03:13.517980Z","title":"Chahlaoui and P","venue":null,"work_id":"2170c3a3-37e1-4789-be6d-b67c3680c5e2","year":2008},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.820070Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:4d3237d73dc0fa5255924668dde7689ca33acec49be1c5ccaf7086a6165af983","observation_id":"402d2ffa-17c6-4075-a71b-a45e6ac73526","resolution":{"observed_at":"2026-08-14T13:03:13.526327Z","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-14T13:03:13.488820Z","title":"Chen and T","venue":null,"work_id":"925f922e-65c1-4425-a04f-0402e6d5f65c","year":1990},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.826791Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:ced4a3ca1a9bc93f7f16861a6057b1076dd9b30f7d96db0f375304e46933a407","observation_id":"d3230f02-1b87-4a77-bf23-8dd195a4cbc0","resolution":{"observed_at":"2026-08-14T13:03:13.499485Z","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-14T13:03:13.463347Z","title":null,"venue":null,"work_id":"61b69ef2-c001-43b5-ba8a-489001c681ec","year":1972},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.836538Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:9745cb2e0affd877c7cd8f49744425df5eac31200e7e06921f163ac801090672","observation_id":"a4e5509a-0f5d-4409-b61b-d0135e5e696c","resolution":{"observed_at":"2026-08-14T13:03:13.471402Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:13.439287Z","title":null,"venue":null,"work_id":"62a190f4-9a0f-4f21-9ff8-e04825d063dc","year":1969},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.843408Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:5fa7decc454198956a5ee24dbd117ddd1eb2df06b9e1e659a5b508ddee4e6bc1","observation_id":"a00eb949-dafb-429d-8c5c-ff8e95033523","resolution":{"observed_at":"2026-08-14T13:03:13.446766Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:13.410002Z","title":"Cooper, Rational Approximation of Discrete Data with Asymptotic Be haviour, PhD thesis, U","venue":null,"work_id":"1fe36ce3-47f5-4349-b335-764f088d0f42","year":2007},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.849600Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:636489f21b2d8b6512fc4dbe722049932c9aa9dd587810844e741a6fa490a8fe","observation_id":"70779774-a453-4a87-83e9-16b2302bbab1","resolution":{"observed_at":"2026-08-14T13:03:13.416303Z","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-14T13:03:13.383273Z","title":"Daubechies, R","venue":null,"work_id":"b3aba445-fdc6-48b5-98be-99181089e0a2","year":2010},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.857269Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:fb0ee7f26411759dd78668154459410123c21cd18826701665c6346b073cb595","observation_id":"b069229d-0bad-4026-bce8-e39296c9d751","resolution":{"observed_at":"2026-08-14T13:03:13.389414Z","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-14T13:03:13.356319Z","title":"A Driscoll, A MATLAB toolbox for Schwarz–Christoffel mapping, ACM Trans","venue":null,"work_id":"24f4de67-9b4a-4a57-a03e-f8b447349848","year":1996},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.863923Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:290c95e949b96751e499597b7d3150a742646abfdcc0636c0ea4b5da45c64409","observation_id":"9e8ee1f3-616d-4b35-9275-f4b260681f5f","resolution":{"observed_at":"2026-08-14T13:03:13.365879Z","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-14T13:03:13.334873Z","title":null,"venue":null,"work_id":"2407cc59-7a48-46c7-a73a-94bcbdcb4186","year":2014},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.871188Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:af3cc78ef8ee0cca604877d39ed64f294ffc054c42efc1c3f39e1d0ab567e324","observation_id":"e69cd2c6-2524-447b-b72b-04b4f6eb179e","resolution":{"observed_at":"2026-08-14T13:03:13.340875Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:13.313094Z","title":"Ellacott and J","venue":null,"work_id":"25a4f25a-752e-4109-bfa5-894d48e9bbfa","year":1976},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.878133Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:128db65b76721242732f711c7949fd917af975b48b0ed9379ea50a114afe4e7e","observation_id":"c5c5a564-802d-41bd-9468-9aa27a8ab7ce","resolution":{"observed_at":"2026-08-14T13:03:13.322153Z","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-14T13:03:13.284128Z","title":"Ellacott and J","venue":null,"work_id":"bc0c25d7-b889-47b0-a546-93bcf35a60fa","year":1976},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.884619Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:af5dfc43cfcd23be751d18b4ded981c3938d199b804a739ee294ac2c110b208b","observation_id":"4e1b6385-a86a-48d1-b4d1-8dcb7f67c522","resolution":{"observed_at":"2026-08-14T13:03:13.295438Z","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-14T13:03:13.241817Z","title":"Filip, Y","venue":null,"work_id":"7c5c2421-7f67-40f5-bfd9-2d040de21bf4","year":2018},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.892929Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:d84815cf234bc6faa45f60e68d3806595efb72eaa0da014bf30b3f5014148a3b","observation_id":"3af9a6dc-6be7-4879-8749-690ad34a2af4","resolution":{"observed_at":"2026-08-14T13:03:13.250032Z","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-14T13:03:13.211359Z","title":"Fischer and J","venue":null,"work_id":"6e5db1b3-192d-4b8f-b929-8b52616275dd","year":1993},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.903936Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:02da8da4ddc0fd7a7c502f6d36261d69a3cf82d279960f2dab60b87cc7337348","observation_id":"4405e11f-bed8-4c13-95ab-7199e138090f","resolution":{"observed_at":"2026-08-14T13:03:13.222770Z","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-14T13:03:13.188346Z","title":null,"venue":null,"work_id":"8a840703-9e3a-4d06-a3f4-a5e0fde9698e","year":2007},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.911460Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:83b6d3af532035749607cc432a8bfe831e0e355ec006272280917279f7f03d1a","observation_id":"46df6ebc-8ceb-49b7-8661-9700a64424ce","resolution":{"observed_at":"2026-08-14T13:03:13.197331Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:13.160666Z","title":"Gaier, Lectures on Complex Approximation, Birkh¨ auser, 1987","venue":null,"work_id":"eb2c9924-214e-4356-94fa-5d5a19b9c4a4","year":1987},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.927770Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:351232aba76a6f5eb1322332e2532715093020349721cc1f8bba8425688ec815","observation_id":"d539f836-90a0-4065-9013-e3d9abb60bea","resolution":{"observed_at":"2026-08-14T13:03:13.168957Z","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-14T13:03:13.124111Z","title":null,"venue":null,"work_id":"39965700-864c-4398-837f-40b1bbcdf24c","year":1969},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.934761Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:82eb55a20617774bc89e744073ffedaca6038f4ab1612eb8ac9bdcff459825e3","observation_id":"aab6fe73-0d37-417a-8a67-a28bd5559ab9","resolution":{"observed_at":"2026-08-14T13:03:13.131892Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:13.100505Z","title":"Glashoff and K","venue":null,"work_id":"3ff05366-36aa-4efd-ab6c-f7fd7d27c50f","year":1981},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.943623Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:bf8a5b4de83f75e6b9f4fc1e1a376c39be2a50681f7fe89f6388ad677380f66a","observation_id":"2b925bb1-d8fc-4aa8-a057-9f7b8747d03e","resolution":{"observed_at":"2026-08-14T13:03:13.106410Z","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-14T13:03:13.070870Z","title":"Gopal and L","venue":null,"work_id":"b47b158e-5b68-4a7f-9a16-c79fec01ccb8","year":2019},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.953767Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:09103e5afa73ae660808eb71b7291ba3ba55542be0bdbd673b74aa8b29c5d33f","observation_id":"ca7bc585-9276-4c70-8e2c-cf39d9802229","resolution":{"observed_at":"2026-08-14T13:03:13.077978Z","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-14T13:03:13.044496Z","title":"Gopal and L","venue":null,"work_id":"313c3c4c-2ef4-404b-86f4-faf325dc54ed","year":2019},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.963405Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:49115e5646c57ace6a85be13527ed1b4dc1473bfa453e379606ad5005333fe73","observation_id":"2aa1874f-5481-4bfb-93da-2e1c979469cf","resolution":{"observed_at":"2026-08-14T13:03:13.054016Z","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-14T13:03:13.024359Z","title":"Gopal and L","venue":null,"work_id":"00e2cd91-2502-403e-abe5-2e2e691fef42","year":null},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.969325Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:9dafefb3fff1c4d9aa3b2bb347dabbdba08bdc2e026f4070edcb8be02b0ca2a3","observation_id":"713eb966-f08a-47ba-b8a1-6744fc561eec","resolution":{"observed_at":"2026-08-14T13:03:13.030882Z","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-14T13:03:13.003623Z","title":"Gugergin, A","venue":null,"work_id":"e94bd593-351f-4efb-b74c-8afbe17a85ab","year":2008},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.975595Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:aadc45385051ff53e1829fd3bff8c4d5b4ff078f1e1c87f9ca21ac47214c1435","observation_id":"5d473cf1-48ae-4c29-bb1c-6c5ca45cfc8e","resolution":{"observed_at":"2026-08-14T13:03:13.011081Z","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-14T13:03:12.983707Z","title":"Gustavsen and A","venue":null,"work_id":"57a7a6a8-430c-4d19-b753-ec3ec16a5245","year":1999},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.984322Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:73ae603c7f0d7b766e5de2a9a8d51fac074ffdb2da07203d65cbb19cf5065b34","observation_id":"357a0719-3132-4e68-8840-36b27328942d","resolution":{"observed_at":"2026-08-14T13:03:12.989590Z","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-14T13:03:12.960696Z","title":null,"venue":null,"work_id":"3acef759-0ad5-4376-af6b-480f948c59d2","year":1978},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.992201Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:5433497688b313e5bae63cf16bddb7aeb601e4b0c24e37a09b28223bfe7c5985","observation_id":"4539b955-09fa-4df3-9ee7-d65e463bf6ba","resolution":{"observed_at":"2026-08-14T13:03:12.970326Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.938857Z","title":null,"venue":null,"work_id":"9f59b1b0-ecee-42b3-9214-5a1965fc7be1","year":1983},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:10.998640Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:09737e94191fabb5f0484acefe62155c570c4296043564573e5858d24ea44856","observation_id":"aa008b8b-588f-4ae5-b872-98bb705f7ac8","resolution":{"observed_at":"2026-08-14T13:03:12.944464Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.921055Z","title":null,"venue":null,"work_id":"ee3872fc-dace-4858-8bbe-60a8dd63033b","year":1983},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.008706Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:222e0ded4894d9001e067994b4ef3fd03cc375e01535d37d05225f77b5dd9064","observation_id":"c25a4606-edfa-43c1-895d-c2b9ceeb9a6c","resolution":{"observed_at":"2026-08-14T13:03:12.926325Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.899438Z","title":"Hayashi, L","venue":null,"work_id":"a862f5b1-45b0-4bf8-ad6b-b387894312b9","year":1990},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.018652Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:1f35f7010a6a6de61b9724b05ddb5665a3b29bcd87b1351d3bec29ec52f39cfa","observation_id":"48af5471-bf74-4e7f-898d-8a8abe34334f","resolution":{"observed_at":"2026-08-14T13:03:12.909456Z","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-14T13:03:12.881716Z","title":"Henrici, Applied and Computational Complex Analysis, v","venue":null,"work_id":"e21fb7d2-43bd-4ad4-801b-e259682f37e8","year":1974},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.026691Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:2d3f33f0f07c0b40967e646c62898bbf2ba38521a19ce60be834c81a0bdd21f8","observation_id":"814c3d57-6cfa-46d1-b23f-b2d1a708352c","resolution":{"observed_at":"2026-08-14T13:03:12.886791Z","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-14T13:03:12.864201Z","title":null,"venue":null,"work_id":"c46953c8-2889-4357-bc82-e357233219fd","year":2013},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.035751Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:cc3dc7e80e25de5768d015dc40582b6a1e8eaeb295c965b65999db7cd322ecea","observation_id":"a9a867bb-e137-45c6-84ff-e9094af38e68","resolution":{"observed_at":"2026-08-14T13:03:12.869519Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.845217Z","title":"Istace and J.-P","venue":null,"work_id":"a1836a01-4bbc-4d52-bb8b-f67e24e840d5","year":1993},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.044226Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:f0db4be61970de3f193e5b194c2f35ab9cc5bd08b34d7a937c30a828be397018","observation_id":"80e23f61-5a5a-4174-acbc-a34246a326b8","resolution":{"observed_at":"2026-08-14T13:03:12.851669Z","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-14T13:03:12.822056Z","title":"Klotz, Gewisse rationale Tschebyscheff-Approximationen in der ko mplexen Ebene, J","venue":null,"work_id":"0e33ee8b-d841-40be-90dc-d2554e59c69e","year":1977},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.049798Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:43afd0cf99190c38194a3f4c1614af904521fb56299c094bc48ee7cf6785fcae","observation_id":"bfa15e1c-1dee-4361-a884-22864b392ddd","resolution":{"observed_at":"2026-08-14T13:03:12.828732Z","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-14T13:03:12.803360Z","title":null,"venue":null,"work_id":"c5977395-c303-422d-b2e9-3b71c4200e39","year":1948},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.055890Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:3504b52c1e65c2f8be8831bbb710e87a67f025ea99cb87985931c10a898d667b","observation_id":"b2afbfd0-f82d-46cd-a56d-c388a7749109","resolution":{"observed_at":"2026-08-14T13:03:12.808712Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.785256Z","title":"Krabs and G","venue":null,"work_id":"7f1db458-f27a-4e0c-ab34-45245ab2c140","year":1975},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.066936Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:695f3c3b4e9982ce9078f75cf870cd4edb71c93565dad944b16465988812afdd","observation_id":"0e6ee108-7cfd-461d-adf9-8b1fcfbea978","resolution":{"observed_at":"2026-08-14T13:03:12.790886Z","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-14T13:03:12.761941Z","title":null,"venue":null,"work_id":"3dbebcaf-05ff-40b8-9435-82196d7feb8f","year":1961},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.076157Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:8ab5d64a02a7a92228a00c7ab65d2e8f095641716e9ae6202e7c640ce4fcf6af","observation_id":"49c7576d-e68c-4b6d-9e02-5f6cca276f1e","resolution":{"observed_at":"2026-08-14T13:03:12.768288Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.735709Z","title":null,"venue":null,"work_id":"5eb2d53f-d366-4044-8873-37cb75d0da87","year":1973},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.083707Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:d28ae99ca0ce445a4f6deaac6007f1217acabb55c56234cdbe999669d6361073","observation_id":"d2986d09-1800-459c-8d6d-3ce00d3fb6c9","resolution":{"observed_at":"2026-08-14T13:03:12.742326Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.706038Z","title":"Li and J","venue":null,"work_id":"9ed4bb40-b7d9-4727-b626-8aff93b1f376","year":2004},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.091873Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:44562dc63e6d9c52671654405c0dd1750eb9a2ce577f85670e0df5694617ae1a","observation_id":"ed640a45-f445-437d-97fe-a663a7f96c1e","resolution":{"observed_at":"2026-08-14T13:03:12.713858Z","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-14T13:03:12.682367Z","title":null,"venue":null,"work_id":"18e752ca-6738-4c6b-b3e2-4d1ad4707b4c","year":2019},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.098698Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:8f45937de70899b6bb5acff64143e316d0843b7245914596ec8d506ed3772b22","observation_id":"b1f59421-96e1-4ad0-8407-8a49ef8d1027","resolution":{"observed_at":"2026-08-14T13:03:12.689394Z","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":{"arxiv_id":"1801.08622","last_updated":"2018-02-02T01:48:50Z","snapshot_observed_at":"2026-08-14T19:51:53.932370Z","submitted_at":"2018-01-25T22:24:43Z","title":"Automatic rational approximation and linearization of nonlinear eigenvalue problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.08622","snapshot_observed_at":"2026-08-14T13:03:11.105994Z","title":"Lietaert, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.105994Z"},"links":{"cited_paper":"/paper/1801.08622","citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:50ef4e854f3038f221a5b7f5152b8ca40f39b3dc8515736a367765e617da64d2","observation_id":"9c1b0a9e-db59-4dba-8a14-e91eef761421","resolution":{"observed_at":"2026-08-14T13:03:11.105994Z","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-14T13:03:12.663451Z","title":null,"venue":null,"work_id":"9b94d44a-abe1-451f-9152-837b2c81fdc6","year":1971},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.122898Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:73dce85c5ccd0e0322403dd40df50d8ca9f0419e5db932389167b3893158e8f5","observation_id":"8af77ee9-6a71-444f-83c5-510b93ea047d","resolution":{"observed_at":"2026-08-14T13:03:12.668617Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.640096Z","title":null,"venue":null,"work_id":"139f58cb-d355-415c-8d9b-a39e9b619b86","year":1963},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.129983Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:fca2bba0cfc5333ade55105f3a61451f28e7e0bdce4f259b77a11d6f7e6f5277","observation_id":"fe689378-c16b-4b7c-8290-3bbb463fd157","resolution":{"observed_at":"2026-08-14T13:03:12.646637Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.617139Z","title":"meinardus and D","venue":null,"work_id":"bf53d7cc-57d6-4131-9949-3f0a4ee5e9f9","year":1964},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.144797Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:9520bdb997e2d256ecb870fdd54c021ac4a6c159392e6b8fa5fd52c769403c8e","observation_id":"ddffc75d-cfbd-4c3b-88c8-0fc58032b0bb","resolution":{"observed_at":"2026-08-14T13:03:12.622855Z","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-14T13:03:12.593313Z","title":null,"venue":null,"work_id":"d798cea7-a3aa-4c13-b172-0b39deb570dd","year":2016},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.151553Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:89b08288c7a1d68404abacf218430696b5a6fd7d47dcdbf54b8dfd147f7a5188","observation_id":"7173ce98-5859-459b-b002-dc342a4004d5","resolution":{"observed_at":"2026-08-14T13:03:12.601099Z","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-14T13:03:11.158203Z","title":"Nakatsukasa, O","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.158203Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:8471423b1a204ef53f19986549f46e4e75d326aea491830d47169c3dbbfe6d89","observation_id":"cc6e5e96-4204-452f-b892-e211a43c3c3f","resolution":{"observed_at":"2026-08-14T13:03:11.158203Z","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-14T13:03:12.550771Z","title":null,"venue":null,"work_id":"f316ebc8-5cc2-4b24-af03-9828272cec90","year":1964},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.168147Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:74eb57fa572932c9494f38ee1281b16043585522742ed73bf27c870b88435e8e","observation_id":"758f201d-cc3a-46a9-b627-de15db47e314","resolution":{"observed_at":"2026-08-14T13:03:12.557436Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.528746Z","title":"Opfer, An algorithm for the construction of best approximations ba sed on Kolmogorov’s criterion, J","venue":null,"work_id":"4a952a06-68ad-45c8-b7f0-7c7ef3eddb14","year":1978},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.173855Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:1c9e909fe47195783ff3a68f1f2c49508dd9ec27ea25b4142eb8fbc487d7ed41","observation_id":"1ca970bd-db12-46b9-984f-abd19777e685","resolution":{"observed_at":"2026-08-14T13:03:12.535044Z","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-14T13:03:12.507833Z","title":null,"venue":null,"work_id":"1090d97e-90c7-4b0a-834a-bc1af4a7e142","year":2014},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.180891Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:ae07034cebde392b8553b4ab666cbbc824f48b1e6f9baba9959c5e09fce69415","observation_id":"74f05aa2-aa91-43b7-85d5-4f0295e08f52","resolution":{"observed_at":"2026-08-14T13:03:12.515105Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.481362Z","title":null,"venue":null,"work_id":"1f953745-07d7-4f10-94e5-d0ded29cade4","year":1985},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.187525Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:df8040aaf0852bb55566de56bad8ca1666dc6b4816b49a9f4f76087e655546ec","observation_id":"b22cdf9c-4e0c-45bb-83c8-9155838a30c1","resolution":{"observed_at":"2026-08-14T13:03:12.491355Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.458292Z","title":null,"venue":null,"work_id":"ddc2b5d7-1276-4068-883c-a3238639adb5","year":1969},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.193754Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:fb6c9cbfa90a48540c745ebb8922fc37652a2375947d41f851e4747f1e1739f7","observation_id":"1502ffb1-5903-4b55-beea-8f466eaec77d","resolution":{"observed_at":"2026-08-14T13:03:12.465041Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.432146Z","title":null,"venue":null,"work_id":"c05ad917-12d8-4411-b883-e82733577b01","year":1951},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.200290Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:fa4e4865a2cf12bc75e741a9405baf5cca81a6221bb08bf3030f1573161d3211","observation_id":"4bfea0f9-18a9-41a6-9d9d-5ae8fcbe8573","resolution":{"observed_at":"2026-08-14T13:03:12.441529Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.406997Z","title":null,"venue":null,"work_id":"778f9e13-4d61-4cd9-953b-d4a6df3b400f","year":1969},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.208489Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:93e3a9403c5ae7da64dad2a2e4aa3721c5270616e00b67d2540c16853f0fe3f9","observation_id":"e119f24b-df7f-45ef-9286-37bc853656be","resolution":{"observed_at":"2026-08-14T13:03:12.412275Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.384247Z","title":null,"venue":null,"work_id":"df477ae1-6ceb-49f1-8ff0-e78020396b3d","year":1968},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.214465Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:c1b769a1b04a7f00e0e4015c1f2df01e31e52aa623719bb0856db14ab201ba9d","observation_id":"331c3610-b142-485f-983b-122a75391715","resolution":{"observed_at":"2026-08-14T13:03:12.391349Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.357502Z","title":"Runge, Zur Theorie der eindeutigen analytischen Functionen, Acta Math","venue":null,"work_id":"6dac57e5-3f19-4971-986a-8d910d2cc842","year":null},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.222375Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:8f581d6befe79a88031856a404a90c1e43936e554c2d07eb6c49ec419d678449","observation_id":"e6f41cc6-9c27-4804-a875-1491cb0d6384","resolution":{"observed_at":"2026-08-14T13:03:12.364030Z","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-14T13:03:12.332000Z","title":"Ruttan, A characterization of best complex rational approximants i n a fundamental case, Constr","venue":null,"work_id":"9e5f342b-d617-472e-9741-ab2f0a4b8eb8","year":1985},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.231635Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:a0f73fbb51b69e88a7c7312b51395692249d0ba18f864c7025498249db4fbac7","observation_id":"28b794c0-75ba-4da0-ac12-e0b52e7b3f41","resolution":{"observed_at":"2026-08-14T13:03:12.338449Z","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-14T13:03:12.312486Z","title":null,"venue":null,"work_id":"932f6b0f-2a20-4c7e-bf56-b7c28146e4e9","year":1977},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.238857Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:1e6c0ade493b1591c2b4ef443e180ab43a633230fce1ef650f4f9bde2c180ae9","observation_id":"5c999ba6-a80d-4c5a-b285-98a46220fee1","resolution":{"observed_at":"2026-08-14T13:03:12.318697Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.294180Z","title":null,"venue":null,"work_id":"577110d1-64f7-46e0-8839-903dfa3a6b6b","year":1978},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.244775Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:356d1982eb2b79a1d55b5ed2248d861abc83ffc8209b1e4d7a336ca6009b2dd2","observation_id":"b6cbcab7-afaf-4e13-ae19-5125284896bf","resolution":{"observed_at":"2026-08-14T13:03:12.299910Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.272283Z","title":"Schneider and W","venue":null,"work_id":"4d36fc39-3006-42ec-a444-9ae6013717fb","year":1986},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.249879Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:8c4d543723c27890c364157e4511b14ebcc75be95f5831a919ba33e9ab4041ff","observation_id":"8235e727-4d44-44d4-879c-fd5d9d67f9da","resolution":{"observed_at":"2026-08-14T13:03:12.278692Z","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-14T13:03:12.246171Z","title":"Singer, The Theory of Best Approximation and Functional Analysis, SIAM, 1974","venue":null,"work_id":"7aabd715-1e72-4351-9ef9-1afcf9df7718","year":1974},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.256128Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:969b67f79b3b5bdf82be42ae267a0bceeaf34db2e92793a2f73c81ed5e1a8ad2","observation_id":"44c403a3-8893-481e-9fbc-188f62ef807e","resolution":{"observed_at":"2026-08-14T13:03:12.253168Z","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-14T13:03:12.218937Z","title":"Stahl, Best uniform rational approximation of |x| on [− 1, 1], Russian Acad","venue":null,"work_id":"4ab780eb-5319-4f29-a4cb-bb5bbbf25700","year":1993},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.261687Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:6b3f34cc33d6834f96edff31a54c0152ead546ddd856e96b6304cc40d4257c1f","observation_id":"7a2f51db-dcf3-4556-a858-a5d78411e20b","resolution":{"observed_at":"2026-08-14T13:03:12.227661Z","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-14T13:03:12.188584Z","title":"Stahl, The convergence of Pad´ e approximants to functions with bra nch points, J","venue":null,"work_id":"8fb665c9-b960-45e5-893a-37145727879a","year":1997},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.271555Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:726d2328fce8a60930ab7493e5d78106784e28d14c67604cef6cfec69ea9e2c0","observation_id":"7c37a687-fee2-44c6-bbf4-cad5a39a1a6f","resolution":{"observed_at":"2026-08-14T13:03:12.199032Z","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-14T13:03:12.150253Z","title":"Szeg ˝o, ¨Uber eine Eigenschaft der Exponentialreihe, Sitzungsber","venue":null,"work_id":"b59099fb-d259-4a0a-8588-5f4d2f327b42","year":1924},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.280431Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:814b6024cb52ca3a3ee0792e21d900b27ca885c46348f0cc3b561cafe451626c","observation_id":"5220e337-fa54-4c99-a5b6-8fab1a556a4e","resolution":{"observed_at":"2026-08-14T13:03:12.159430Z","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-14T13:03:12.115704Z","title":null,"venue":null,"work_id":"70364a45-3423-4365-93c8-131b59693f92","year":1988},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.291241Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:d47e06d05c31e924d71de2da2eb922f465c9a123cffa47341307cbd2ad19ce13","observation_id":"b78190bc-fbf9-4858-938e-6d51ca374023","resolution":{"observed_at":"2026-08-14T13:03:12.127388Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:12.073431Z","title":"Thiran and M.-P","venue":null,"work_id":"6b6d8920-b33d-454d-aaef-93d582bd8ce5","year":1993},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.297343Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:eb36d4fca329d68da6bf9c9c647de62d4787f5c04f6873eca4c0efe2f805d628","observation_id":"521e0c75-067d-49b1-a421-ebaa0835c91c","resolution":{"observed_at":"2026-08-14T13:03:12.083667Z","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-14T13:03:12.049328Z","title":"Tonelli, I polinomi d’approssimazione di Tchebychev, Ann","venue":null,"work_id":"0a23b8ba-62a1-43f5-8230-21d12537bf47","year":1908},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.303478Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:9655f2d3586c0fe2f4d9c5419507e3dc0893f776a194536868eb08146eee9874","observation_id":"e5217c82-d474-4927-a9fd-b045ef367155","resolution":{"observed_at":"2026-08-14T13:03:12.055480Z","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-14T13:03:12.024661Z","title":null,"venue":null,"work_id":"77752630-d35a-47f6-8f76-05e93fb880cf","year":1977},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.310595Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:525d72004deaa4657ea8e98c088ee8a57c26d0d83e4a35f19076814c606fdaba","observation_id":"a4ace879-971f-40ea-a3e6-335d4541582b","resolution":{"observed_at":"2026-08-14T13:03:12.032529Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:11.995443Z","title":null,"venue":null,"work_id":"4b741945-48c7-4a7f-9f92-4ee7c1c55b13","year":1981},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.317034Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:516aa78331c61130a53f906175bc63e7b0700edf855011a7a62becb811ee0f86","observation_id":"330c1496-a646-4998-b871-a834b7eec033","resolution":{"observed_at":"2026-08-14T13:03:12.006503Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:11.965277Z","title":null,"venue":null,"work_id":"35bb53ad-b976-4ca6-8037-93f6900d4e32","year":1981},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.323569Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:b2b22808990d772135d197d914a97150bcb5c7e80cd389b9409a7a4ec2c05125","observation_id":"e49af99c-f658-4428-a2fa-37fff586e55a","resolution":{"observed_at":"2026-08-14T13:03:11.971545Z","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-14T13:03:11.329480Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.329480Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:553f9a2e28bb4dcc1ad8f5f2327ae19137a492581a144f88bf7f52e90f670edd","observation_id":"28ba8433-30ad-4608-bb6e-e5fbfc65afbb","resolution":{"observed_at":"2026-08-14T13:03:11.329480Z","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-14T13:03:11.336767Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.336767Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:72a640a1cbc9c412e635f84888434f2fe06165abbd078d9f87e83f87adf90f2b","observation_id":"01b81931-9a46-4228-9785-093385086b02","resolution":{"observed_at":"2026-08-14T13:03:11.336767Z","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-14T13:03:11.897029Z","title":null,"venue":null,"work_id":"7441ba7d-d248-4ac0-bd39-5007c5dfb84f","year":2019},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.344397Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:4e7f58f381ea02f665d1bb5e5d2236d79c6c809587965edcd2fa8ad06b1d2a51","observation_id":"67b0ea5a-06e9-41ab-9337-8823d74b4e50","resolution":{"observed_at":"2026-08-14T13:03:11.903453Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:11.719212Z","title":"V an Deun and L","venue":null,"work_id":"b9b298eb-2c3c-4425-a524-611d83617926","year":null},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.352907Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:2718c5c1bbb77d4cda7987413e716c7c1847d858a47960491f6b61ce10d3d636","observation_id":"44412bb9-5326-4f01-9b77-0ca4f0d92e31","resolution":{"observed_at":"2026-08-14T13:03:11.878053Z","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-14T13:03:11.696100Z","title":null,"venue":null,"work_id":"2df480d2-485c-450e-8b12-84419cdaa26c","year":1931},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.360225Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:3c97b93ceabad8c9e049baec3f2a573c9062bdab51283d9b738f3d7550f2d82d","observation_id":"f1b1f50e-8cee-4a07-9f3b-a98684455e8f","resolution":{"observed_at":"2026-08-14T13:03:11.703495Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:11.674190Z","title":null,"venue":null,"work_id":"9ba246a9-3664-44c0-ae6d-718a1dfb5405","year":1969},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.370306Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:290375ec3d95a6ff9d9b62a3aeaa7b53767eec0a4c8c9e3fa4bcb9655fff105b","observation_id":"bf8c4862-06f0-4e04-9858-f069fe97bb8b","resolution":{"observed_at":"2026-08-14T13:03:11.681969Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:11.642617Z","title":null,"venue":null,"work_id":"d4da6613-8eaf-489c-90b2-6f044e2865f9","year":1980},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.379269Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:340b13b63e3218cd4eb542f56f83533df94c9a116ee57f323c5cfe1cb9f2de2b","observation_id":"f9e2971f-1484-4edb-b856-6f6c9a768a1d","resolution":{"observed_at":"2026-08-14T13:03:11.650909Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:03:11.606010Z","title":"Werner, Tschebyscheff-Approximation im Bereich der rationalen Fun ktionen bei Vorliegen einer guten Ausgangsn¨ aherung,Arch","venue":null,"work_id":"ae8dfca9-b524-412a-b8a3-1eed714598b7","year":1962},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.385988Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:6877a22d2f9ba46bbcd07d37fc7c6be82534ce53609290368f80e33629b3dfdb","observation_id":"0dac900f-ebaa-4829-ad1f-804b3cda754b","resolution":{"observed_at":"2026-08-14T13:03:11.620360Z","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-14T13:03:11.585090Z","title":"Werner, Die konstruktive Ermittlung der Tschebyscheff-Approximie renden im Bereich der 20 Nakatsukasa and Trefethen rationalen Funktionen, Arch","venue":null,"work_id":"076b6461-a982-4337-a579-ba487d5337dd","year":1962},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.391000Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:7ccb6aba90553474246deb7abe9759d83fd495ea4e321176d6aab8b49281f94f","observation_id":"2ba5d230-4524-4a5d-987d-d3e51aae50fb","resolution":{"observed_at":"2026-08-14T13:03:11.591945Z","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-14T13:03:11.555896Z","title":"Werner, Polynomial interpolation: Lagrange versus Newton, Math","venue":null,"work_id":"49e1fb86-1785-482d-a73d-d09d52551c9b","year":1984},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.398663Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:38949019cac50e3e72aa03c4e77097842cc6b9f8a5747730645f9ef7b3b34eb1","observation_id":"a822aada-275d-4f22-ba46-fdbf6c83bbfe","resolution":{"observed_at":"2026-08-14T13:03:11.565695Z","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-14T13:03:11.521830Z","title":"Williams, Characterization and computation of rational Chebyshev ap proximations in the complex plane, SIAM J","venue":null,"work_id":"21b7a680-e179-439c-8d17-2741f5af1db8","year":1979},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.406621Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:7542af6fb528b4795899ee028314bbd7838129e9307d362c969f571f0c1417f0","observation_id":"b102565d-c1e8-4f54-9b00-8cb5da7fda58","resolution":{"observed_at":"2026-08-14T13:03:11.534437Z","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-14T13:03:11.484141Z","title":"Zalcman , Analytic Capacity and Rational Approximation, Lect","venue":null,"work_id":"c634011f-8d08-458b-9177-fafa3b5aabe1","year":1968},"citing_paper":{"arxiv_id":"1908.06001","last_updated":"2019-08-16T15:04:59Z","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-14T13:03:11.412380Z"},"links":{"citing_paper":"/paper/1908.06001"},"observation_digest":"sha256:bf6589f30f7ebd271eef9a6154c3ed289cd352be201475b9b5c4d58171195d29","observation_id":"e4aeddd7-a7f7-4e6c-9335-3c0bb08eba5c","resolution":{"observed_at":"2026-08-14T13:03:11.498834Z","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.06001","last_updated":"2019-08-16T15:04:59Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-16T14:54:40.066312Z","submitted_at":"2019-08-16T15:04:59Z","title":"An algorithm for real and complex rational minimax approximation"},"reference_resolution":{"displayed":86,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":43,"verified_exact":0,"verified_fuzzy":43},"total_outbound_references":86},"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 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:1908.06001."}