{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZRUMAPSJ5AJET5WJ3SOAC4CUZP","short_pith_number":"pith:ZRUMAPSJ","schema_version":"1.0","canonical_sha256":"cc68c03e49e81249f6c9dc9c017054cbca059a10838f0e667a9cf13c6b9e1582","source":{"kind":"arxiv","id":"2001.00668","version":1},"attestation_state":"computed","paper":{"title":"The degree-$(n+1)$ polynomials are the most difficult $C^{\\,n + 1}$ functions to uniformly approximate with degree-$n$ polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Patrick Kidger","submitted_at":"2020-01-02T23:31:55Z","abstract_excerpt":"There exist well-known tight bounds on the error between a function $f \\in C^{\\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree $n + 1$."},"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":"2001.00668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2020-01-02T23:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"61bab87cecacc75d68fe525e008aeb8fb4665c1f6f23b08fbac0a4607af19d7f","abstract_canon_sha256":"ac391ae2f95c5350867b768e7e90dc46d66ce5ac7977e280f827cf4618c3175d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:31.248856Z","signature_b64":"KFEH0OJ6tWjaoB+ZpRm+eHcFfplEz6ypcDasnPff6FQ/csrkPMjqjeqGDDgxatApuxpHpsidOcQq3FFoV1h1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc68c03e49e81249f6c9dc9c017054cbca059a10838f0e667a9cf13c6b9e1582","last_reissued_at":"2026-07-05T00:29:31.248432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:31.248432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The degree-$(n+1)$ polynomials are the most difficult $C^{\\,n + 1}$ functions to uniformly approximate with degree-$n$ polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Patrick Kidger","submitted_at":"2020-01-02T23:31:55Z","abstract_excerpt":"There exist well-known tight bounds on the error between a function $f \\in C^{\\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree $n + 1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00668","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.00668/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":"2001.00668","created_at":"2026-07-05T00:29:31.248494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.00668v1","created_at":"2026-07-05T00:29:31.248494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00668","created_at":"2026-07-05T00:29:31.248494+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRUMAPSJ5AJE","created_at":"2026-07-05T00:29:31.248494+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRUMAPSJ5AJET5WJ","created_at":"2026-07-05T00:29:31.248494+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRUMAPSJ","created_at":"2026-07-05T00:29:31.248494+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/ZRUMAPSJ5AJET5WJ3SOAC4CUZP","json":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP.json","graph_json":"https://pith.science/api/pith-number/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/graph.json","events_json":"https://pith.science/api/pith-number/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/events.json","paper":"https://pith.science/paper/ZRUMAPSJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP","download_json":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP.json","view_paper":"https://pith.science/paper/ZRUMAPSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.00668&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/action/storage_attestation","attest_author":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/action/author_attestation","sign_citation":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/action/citation_signature","submit_replication":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/action/replication_record"}},"created_at":"2026-07-05T00:29:31.248494+00:00","updated_at":"2026-07-05T00:29:31.248494+00:00"}