{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I3DIXN3GFUI5VKNREJH6BIP4YX","short_pith_number":"pith:I3DIXN3G","schema_version":"1.0","canonical_sha256":"46c68bb7662d11daa9b1224fe0a1fcc5da8cfab60785df54643f461ea84ca3db","source":{"kind":"arxiv","id":"1705.10132","version":3},"attestation_state":"computed","paper":{"title":"Rational minimax approximation via adaptive barycentric representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Bernhard Beckermann, Lloyd N. Trefethen, Silviu-Ioan Filip, Yuji Nakatsukasa","submitted_at":"2017-05-29T11:45:02Z","abstract_excerpt":"Computing rational minimax approximations can be very challenging when there are singularities on or near the interval of approximation - precisely the case where rational functions outperform polynomials by a landslide. We show that far more robust algorithms than previously available can be developed by making use of rational barycentric representations whose support points are chosen in an adaptive fashion as the approximant is computed. Three variants of this barycentric strategy are all shown to be powerful: (1) a classical Remez algorithm, (2) a \"AAA-Lawson\" method of iteratively reweigh"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.10132","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-29T11:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"197179b2005479915c22ec1f69311fe7f9514416cfc228592555ab666206d0cf","abstract_canon_sha256":"2b1f23dfe07e782526025698fb145587f9968789061d02bf54dc311bc4d28570"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:14.584724Z","signature_b64":"takt3QCpFMtuj5aZTKfeAiHMbB62DzXH/SxsU52ARN1xmVRkljjSK+edIHTvsS838q6xK3qFdetmV8Lvb6JVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c68bb7662d11daa9b1224fe0a1fcc5da8cfab60785df54643f461ea84ca3db","last_reissued_at":"2026-05-18T00:16:14.583899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:14.583899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rational minimax approximation via adaptive barycentric representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Bernhard Beckermann, Lloyd N. Trefethen, Silviu-Ioan Filip, Yuji Nakatsukasa","submitted_at":"2017-05-29T11:45:02Z","abstract_excerpt":"Computing rational minimax approximations can be very challenging when there are singularities on or near the interval of approximation - precisely the case where rational functions outperform polynomials by a landslide. We show that far more robust algorithms than previously available can be developed by making use of rational barycentric representations whose support points are chosen in an adaptive fashion as the approximant is computed. Three variants of this barycentric strategy are all shown to be powerful: (1) a classical Remez algorithm, (2) a \"AAA-Lawson\" method of iteratively reweigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10132","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.10132","created_at":"2026-05-18T00:16:14.584031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10132v3","created_at":"2026-05-18T00:16:14.584031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10132","created_at":"2026-05-18T00:16:14.584031+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3DIXN3GFUI5","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3DIXN3GFUI5VKNR","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3DIXN3G","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX","json":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX.json","graph_json":"https://pith.science/api/pith-number/I3DIXN3GFUI5VKNREJH6BIP4YX/graph.json","events_json":"https://pith.science/api/pith-number/I3DIXN3GFUI5VKNREJH6BIP4YX/events.json","paper":"https://pith.science/paper/I3DIXN3G"},"agent_actions":{"view_html":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX","download_json":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX.json","view_paper":"https://pith.science/paper/I3DIXN3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10132&json=true","fetch_graph":"https://pith.science/api/pith-number/I3DIXN3GFUI5VKNREJH6BIP4YX/graph.json","fetch_events":"https://pith.science/api/pith-number/I3DIXN3GFUI5VKNREJH6BIP4YX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX/action/storage_attestation","attest_author":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX/action/author_attestation","sign_citation":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX/action/citation_signature","submit_replication":"https://pith.science/pith/I3DIXN3GFUI5VKNREJH6BIP4YX/action/replication_record"}},"created_at":"2026-05-18T00:16:14.584031+00:00","updated_at":"2026-05-18T00:16:14.584031+00:00"}