{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6E57T23DSSME7A3366ZWLKKQKJ","short_pith_number":"pith:6E57T23D","schema_version":"1.0","canonical_sha256":"f13bf9eb6394984f837bf7b365a9505255c0fe8975e5a906a40657f2a7033280","source":{"kind":"arxiv","id":"1801.01092","version":1},"attestation_state":"computed","paper":{"title":"Rational approximation of $x^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Lloyd N. Trefethen, Yuji Nakatsukasa","submitted_at":"2018-01-03T17:41:51Z","abstract_excerpt":"Let $E_{kk}^{(n)}$ denote the minimax (i.e., best supremum norm) error in approximation of $x^n$ on $[\\kern .3pt 0,1]$ by rational functions of type $(k,k)$ with $k<n$. We show that in an appropriate limit $E_{kk}^{(n)} \\sim 2\\kern .3pt H^{k+1/2}$ independently of $n$, where $H \\approx 1/9.28903$ is Halphen's constant. This is the same formula as for minimax approximation of $e^x$ on $(-\\infty,0\\kern .3pt]$."},"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":"1801.01092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-03T17:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"921633b4ea5b6605e59d007f4a67bb68952d0c78d562005415ce004793e31749","abstract_canon_sha256":"56bc69824e785fa88390e83c5ffe6a576189f2a207fad218e982f943edb93924"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.840197Z","signature_b64":"MBT+8dHQMDGGv5VI/CvG9dWnOdWHpIFDb5a/3T5sQUD8MpQclv3g2gkB/eprjDK0oxA/z+7GS0HgG/Mam45DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f13bf9eb6394984f837bf7b365a9505255c0fe8975e5a906a40657f2a7033280","last_reissued_at":"2026-05-18T00:26:47.839640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.839640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rational approximation of $x^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Lloyd N. Trefethen, Yuji Nakatsukasa","submitted_at":"2018-01-03T17:41:51Z","abstract_excerpt":"Let $E_{kk}^{(n)}$ denote the minimax (i.e., best supremum norm) error in approximation of $x^n$ on $[\\kern .3pt 0,1]$ by rational functions of type $(k,k)$ with $k<n$. We show that in an appropriate limit $E_{kk}^{(n)} \\sim 2\\kern .3pt H^{k+1/2}$ independently of $n$, where $H \\approx 1/9.28903$ is Halphen's constant. This is the same formula as for minimax approximation of $e^x$ on $(-\\infty,0\\kern .3pt]$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01092","kind":"arxiv","version":1},"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":"1801.01092","created_at":"2026-05-18T00:26:47.839728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01092v1","created_at":"2026-05-18T00:26:47.839728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01092","created_at":"2026-05-18T00:26:47.839728+00:00"},{"alias_kind":"pith_short_12","alias_value":"6E57T23DSSME","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6E57T23DSSME7A33","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6E57T23D","created_at":"2026-05-18T12:32:08.215937+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/6E57T23DSSME7A3366ZWLKKQKJ","json":"https://pith.science/pith/6E57T23DSSME7A3366ZWLKKQKJ.json","graph_json":"https://pith.science/api/pith-number/6E57T23DSSME7A3366ZWLKKQKJ/graph.json","events_json":"https://pith.science/api/pith-number/6E57T23DSSME7A3366ZWLKKQKJ/events.json","paper":"https://pith.science/paper/6E57T23D"},"agent_actions":{"view_html":"https://pith.science/pith/6E57T23DSSME7A3366ZWLKKQKJ","download_json":"https://pith.science/pith/6E57T23DSSME7A3366ZWLKKQKJ.json","view_paper":"https://pith.science/paper/6E57T23D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01092&json=true","fetch_graph":"https://pith.science/api/pith-number/6E57T23DSSME7A3366ZWLKKQKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6E57T23DSSME7A3366ZWLKKQKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6E57T23DSSME7A3366ZWLKKQKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6E57T23DSSME7A3366ZWLKKQKJ/action/storage_attestation","attest_author":"https://pith.science/pith/6E57T23DSSME7A3366ZWLKKQKJ/action/author_attestation","sign_citation":"https://pith.science/pith/6E57T23DSSME7A3366ZWLKKQKJ/action/citation_signature","submit_replication":"https://pith.science/pith/6E57T23DSSME7A3366ZWLKKQKJ/action/replication_record"}},"created_at":"2026-05-18T00:26:47.839728+00:00","updated_at":"2026-05-18T00:26:47.839728+00:00"}