{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZRUMAPSJ5AJET5WJ3SOAC4CUZP","short_pith_number":"pith:ZRUMAPSJ","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"},"canonical_sha256":"cc68c03e49e81249f6c9dc9c017054cbca059a10838f0e667a9cf13c6b9e1582","source":{"kind":"arxiv","id":"2001.00668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.00668","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"2001.00668v1","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00668","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZRUMAPSJ5AJE","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZRUMAPSJ5AJET5WJ","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZRUMAPSJ","created_at":"2026-07-05T00:29:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZRUMAPSJ5AJET5WJ3SOAC4CUZP","target":"record","payload":{"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"},"canonical_sha256":"cc68c03e49e81249f6c9dc9c017054cbca059a10838f0e667a9cf13c6b9e1582","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"},"source_kind":"arxiv","source_id":"2001.00668","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuYfzpfvULAKKyzTuvvlb8d/e/r4M+Xgrm7bdUcd7H4vzqpEsnjHIljAmEMHvUntIJsnLjD28wDF07pzO5RNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:39:47.759764Z"},"content_sha256":"97fe152a3c32eb0681348725138e1e291949ccb77d8437ccfbf0ee2ef5e561c5","schema_version":"1.0","event_id":"sha256:97fe152a3c32eb0681348725138e1e291949ccb77d8437ccfbf0ee2ef5e561c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZRUMAPSJ5AJET5WJ3SOAC4CUZP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIHrNOSgJsTN9wrngTDEl9Nrt0RSOoW5Wa7c6m+tNYiD7ig24UKZt5RPRgzZ08ew7W66pYwUJ0luv9dxREhfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:39:47.760140Z"},"content_sha256":"a0a281e72e9c9b28e4a7e95201ee4dd1baa4a9e460712e21bf491556ebaa4e3c","schema_version":"1.0","event_id":"sha256:a0a281e72e9c9b28e4a7e95201ee4dd1baa4a9e460712e21bf491556ebaa4e3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/bundle.json","state_url":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T14:39:47Z","links":{"resolver":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP","bundle":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/bundle.json","state":"https://pith.science/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRUMAPSJ5AJET5WJ3SOAC4CUZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZRUMAPSJ5AJET5WJ3SOAC4CUZP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ac391ae2f95c5350867b768e7e90dc46d66ce5ac7977e280f827cf4618c3175d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2020-01-02T23:31:55Z","title_canon_sha256":"61bab87cecacc75d68fe525e008aeb8fb4665c1f6f23b08fbac0a4607af19d7f"},"schema_version":"1.0","source":{"id":"2001.00668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.00668","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"2001.00668v1","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00668","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZRUMAPSJ5AJE","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZRUMAPSJ5AJET5WJ","created_at":"2026-07-05T00:29:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZRUMAPSJ","created_at":"2026-07-05T00:29:31Z"}],"graph_snapshots":[{"event_id":"sha256:a0a281e72e9c9b28e4a7e95201ee4dd1baa4a9e460712e21bf491556ebaa4e3c","target":"graph","created_at":"2026-07-05T00:29:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.00668/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Patrick Kidger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2020-01-02T23:31:55Z","title":"The degree-$(n+1)$ polynomials are the most difficult $C^{\\,n + 1}$ functions to uniformly approximate with degree-$n$ polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00668","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:97fe152a3c32eb0681348725138e1e291949ccb77d8437ccfbf0ee2ef5e561c5","target":"record","created_at":"2026-07-05T00:29:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ac391ae2f95c5350867b768e7e90dc46d66ce5ac7977e280f827cf4618c3175d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2020-01-02T23:31:55Z","title_canon_sha256":"61bab87cecacc75d68fe525e008aeb8fb4665c1f6f23b08fbac0a4607af19d7f"},"schema_version":"1.0","source":{"id":"2001.00668","kind":"arxiv","version":1}},"canonical_sha256":"cc68c03e49e81249f6c9dc9c017054cbca059a10838f0e667a9cf13c6b9e1582","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc68c03e49e81249f6c9dc9c017054cbca059a10838f0e667a9cf13c6b9e1582","first_computed_at":"2026-07-05T00:29:31.248432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:31.248432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KFEH0OJ6tWjaoB+ZpRm+eHcFfplEz6ypcDasnPff6FQ/csrkPMjqjeqGDDgxatApuxpHpsidOcQq3FFoV1h1Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:31.248856Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.00668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97fe152a3c32eb0681348725138e1e291949ccb77d8437ccfbf0ee2ef5e561c5","sha256:a0a281e72e9c9b28e4a7e95201ee4dd1baa4a9e460712e21bf491556ebaa4e3c"],"state_sha256":"e54d4ceed1b922a7ce4eba82e31cd0d622679fb5f048558edc65e679d101c9da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPj7qobquHm52hQiP+I9LAmB0g/XMRQ2M9Rv9aVFun7MZWbnGQMFNOka5R45o6ESERnqLyYWXDvHsYx45I5GCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:39:47.762366Z","bundle_sha256":"99b6e343b3bfab1a1a1d3b03cdfb16360f20c9ce1a2ea7b3685111225f790f2d"}}