{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NW5CL7OQI45D4UVAISVP47WRQK","short_pith_number":"pith:NW5CL7OQ","schema_version":"1.0","canonical_sha256":"6dba25fdd0473a3e52a044aafe7ed1829b9153ed19331908cb9e943d7453cf8a","source":{"kind":"arxiv","id":"2401.00778","version":3},"attestation_state":"computed","paper":{"title":"A convergence analysis of Lawson's iteration for computing polynomial and rational minimax approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Lei-Hong Zhang, Shanheng Han","submitted_at":"2024-01-01T14:56:01Z","abstract_excerpt":"Lawson's iteration is a classical and effective method for solving the linear (polynomial) minimax approximation problem in the complex plane. Extension of Lawson's iteration for the rational minimax approximation problem with both computationally high efficiency and theoretical guarantee is challenging. A recent work [L.-H. Zhang, L. Yang, W. H. Yang and Y.-N. Zhang, A convex dual problem for the rational minimax approximation and Lawson's iteration, Math. Comp., 94(2025), 2457-2494.] reveals that Lawson's iteration can be viewed as a method for solving the dual problem of the original ration"},"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":"2401.00778","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-01-01T14:56:01Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"aea15f4d353e9099c90c5d585b8f6ad2aa1464111f974da777b59cd0e86ce882","abstract_canon_sha256":"1315d82aaae519f5c737abcbf84c0b2210811dfcf0d8c206ac8afb4cab769d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:44.950780Z","signature_b64":"HVWdVp3ZviVRTt517TTE9IZ1P8vhLcd696ynD1HMsvsJrd0+mncImzTw6SAoE3hvBgpdJyAI5MERAphND+eCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dba25fdd0473a3e52a044aafe7ed1829b9153ed19331908cb9e943d7453cf8a","last_reissued_at":"2026-07-05T11:49:44.950332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:44.950332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A convergence analysis of Lawson's iteration for computing polynomial and rational minimax approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Lei-Hong Zhang, Shanheng Han","submitted_at":"2024-01-01T14:56:01Z","abstract_excerpt":"Lawson's iteration is a classical and effective method for solving the linear (polynomial) minimax approximation problem in the complex plane. Extension of Lawson's iteration for the rational minimax approximation problem with both computationally high efficiency and theoretical guarantee is challenging. A recent work [L.-H. Zhang, L. Yang, W. H. Yang and Y.-N. Zhang, A convex dual problem for the rational minimax approximation and Lawson's iteration, Math. Comp., 94(2025), 2457-2494.] reveals that Lawson's iteration can be viewed as a method for solving the dual problem of the original ration"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00778","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.00778/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.00778","created_at":"2026-07-05T11:49:44.950397+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.00778v3","created_at":"2026-07-05T11:49:44.950397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00778","created_at":"2026-07-05T11:49:44.950397+00:00"},{"alias_kind":"pith_short_12","alias_value":"NW5CL7OQI45D","created_at":"2026-07-05T11:49:44.950397+00:00"},{"alias_kind":"pith_short_16","alias_value":"NW5CL7OQI45D4UVA","created_at":"2026-07-05T11:49:44.950397+00:00"},{"alias_kind":"pith_short_8","alias_value":"NW5CL7OQ","created_at":"2026-07-05T11:49:44.950397+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.10665","citing_title":"Interpolation constrained rational minimax approximation with barycentric representation","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK","json":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK.json","graph_json":"https://pith.science/api/pith-number/NW5CL7OQI45D4UVAISVP47WRQK/graph.json","events_json":"https://pith.science/api/pith-number/NW5CL7OQI45D4UVAISVP47WRQK/events.json","paper":"https://pith.science/paper/NW5CL7OQ"},"agent_actions":{"view_html":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK","download_json":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK.json","view_paper":"https://pith.science/paper/NW5CL7OQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.00778&json=true","fetch_graph":"https://pith.science/api/pith-number/NW5CL7OQI45D4UVAISVP47WRQK/graph.json","fetch_events":"https://pith.science/api/pith-number/NW5CL7OQI45D4UVAISVP47WRQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK/action/storage_attestation","attest_author":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK/action/author_attestation","sign_citation":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK/action/citation_signature","submit_replication":"https://pith.science/pith/NW5CL7OQI45D4UVAISVP47WRQK/action/replication_record"}},"created_at":"2026-07-05T11:49:44.950397+00:00","updated_at":"2026-07-05T11:49:44.950397+00:00"}