{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JKYDEYVVWVAW6KX2U3FVLTWLFC","short_pith_number":"pith:JKYDEYVV","canonical_record":{"source":{"id":"1610.04769","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-15T18:07:53Z","cross_cats_sorted":[],"title_canon_sha256":"13b9720b3d3c698975bb5b6ceafb6f60d575d27eb89fa8435b1a7e9df9e614ce","abstract_canon_sha256":"517b8a66f144bff8dad704aa6bf5d4155a209eff26c169d8a07732c685573cbc"},"schema_version":"1.0"},"canonical_sha256":"4ab03262b5b5416f2afaa6cb55cecb28969a7f270e89570d9619cb62601bdf91","source":{"kind":"arxiv","id":"1610.04769","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04769","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04769v3","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04769","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"JKYDEYVVWVAW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JKYDEYVVWVAW6KX2","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JKYDEYVV","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JKYDEYVVWVAW6KX2U3FVLTWLFC","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04769","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-15T18:07:53Z","cross_cats_sorted":[],"title_canon_sha256":"13b9720b3d3c698975bb5b6ceafb6f60d575d27eb89fa8435b1a7e9df9e614ce","abstract_canon_sha256":"517b8a66f144bff8dad704aa6bf5d4155a209eff26c169d8a07732c685573cbc"},"schema_version":"1.0"},"canonical_sha256":"4ab03262b5b5416f2afaa6cb55cecb28969a7f270e89570d9619cb62601bdf91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:09.122914Z","signature_b64":"G45OXd5ZooucSzNy+U1hxv7QDH+uiV20IY42n4NSczRpED+pZgNVUXNM0a828pU054UH1+jZxW3SAzKQf2WcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ab03262b5b5416f2afaa6cb55cecb28969a7f270e89570d9619cb62601bdf91","last_reissued_at":"2026-05-18T00:19:09.122170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:09.122170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04769","source_version":3,"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-05-18T00:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+z1OPGiQfhjrDwaf1MUgMSJn4bds41rfR7bEjnm970SODhQIY17pg2rMUz3gKDlfgyfld02fOZqUEWMwmyxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:17:10.746654Z"},"content_sha256":"4cba523389e2e479bed35ed9968174b0dd662a899ad0ad101a719d6705279021","schema_version":"1.0","event_id":"sha256:4cba523389e2e479bed35ed9968174b0dd662a899ad0ad101a719d6705279021"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JKYDEYVVWVAW6KX2U3FVLTWLFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal sampling rates for approximating analytic functions from pointwise samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alexei Shadrin, Ben Adcock, Rodrigo Platte","submitted_at":"2016-10-15T18:07:53Z","abstract_excerpt":"We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best possible convergence rate of a stable method is root-exponential in $M$, and that any method with faster exponential convergence must also be exponentially ill-conditioned at a certain rate. This result hinges on a classical theorem of Coppersmith & Rivlin concerning the maximal behaviour of polynomials bounded on an equispaced grid. In this paper, we first gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04769","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"},"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-05-18T00:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JHn7MHTfyIX755zF+KJluXD/GLR5gol4RwwhHL+1fiA5lbzM2gvn1gx7OsHfDOATKPnIP0+mbvBpjam3p/uwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:17:10.747012Z"},"content_sha256":"1f96a1978cf7104e5852be5bda04e8315886fe06aa95341d274b90f9d846b30d","schema_version":"1.0","event_id":"sha256:1f96a1978cf7104e5852be5bda04e8315886fe06aa95341d274b90f9d846b30d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKYDEYVVWVAW6KX2U3FVLTWLFC/bundle.json","state_url":"https://pith.science/pith/JKYDEYVVWVAW6KX2U3FVLTWLFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKYDEYVVWVAW6KX2U3FVLTWLFC/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-06-02T07:17:10Z","links":{"resolver":"https://pith.science/pith/JKYDEYVVWVAW6KX2U3FVLTWLFC","bundle":"https://pith.science/pith/JKYDEYVVWVAW6KX2U3FVLTWLFC/bundle.json","state":"https://pith.science/pith/JKYDEYVVWVAW6KX2U3FVLTWLFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKYDEYVVWVAW6KX2U3FVLTWLFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JKYDEYVVWVAW6KX2U3FVLTWLFC","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":"517b8a66f144bff8dad704aa6bf5d4155a209eff26c169d8a07732c685573cbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-15T18:07:53Z","title_canon_sha256":"13b9720b3d3c698975bb5b6ceafb6f60d575d27eb89fa8435b1a7e9df9e614ce"},"schema_version":"1.0","source":{"id":"1610.04769","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04769","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04769v3","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04769","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"JKYDEYVVWVAW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JKYDEYVVWVAW6KX2","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JKYDEYVV","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:1f96a1978cf7104e5852be5bda04e8315886fe06aa95341d274b90f9d846b30d","target":"graph","created_at":"2026-05-18T00:19:09Z","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"},"paper":{"abstract_excerpt":"We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best possible convergence rate of a stable method is root-exponential in $M$, and that any method with faster exponential convergence must also be exponentially ill-conditioned at a certain rate. This result hinges on a classical theorem of Coppersmith & Rivlin concerning the maximal behaviour of polynomials bounded on an equispaced grid. In this paper, we first gene","authors_text":"Alexei Shadrin, Ben Adcock, Rodrigo Platte","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-15T18:07:53Z","title":"Optimal sampling rates for approximating analytic functions from pointwise samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04769","kind":"arxiv","version":3},"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:4cba523389e2e479bed35ed9968174b0dd662a899ad0ad101a719d6705279021","target":"record","created_at":"2026-05-18T00:19:09Z","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":"517b8a66f144bff8dad704aa6bf5d4155a209eff26c169d8a07732c685573cbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-15T18:07:53Z","title_canon_sha256":"13b9720b3d3c698975bb5b6ceafb6f60d575d27eb89fa8435b1a7e9df9e614ce"},"schema_version":"1.0","source":{"id":"1610.04769","kind":"arxiv","version":3}},"canonical_sha256":"4ab03262b5b5416f2afaa6cb55cecb28969a7f270e89570d9619cb62601bdf91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ab03262b5b5416f2afaa6cb55cecb28969a7f270e89570d9619cb62601bdf91","first_computed_at":"2026-05-18T00:19:09.122170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:09.122170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G45OXd5ZooucSzNy+U1hxv7QDH+uiV20IY42n4NSczRpED+pZgNVUXNM0a828pU054UH1+jZxW3SAzKQf2WcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:09.122914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04769","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cba523389e2e479bed35ed9968174b0dd662a899ad0ad101a719d6705279021","sha256:1f96a1978cf7104e5852be5bda04e8315886fe06aa95341d274b90f9d846b30d"],"state_sha256":"0c11c538be7143f387f09897e7bb29da832479a839bfc5cabcd9382df7cece52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Texh2GGXhaF0mSfz6q7sszLE1iBxU0y1RyY5cRlx/Y9etQ4VSsIZG7WZbT5zGHjFPjgndWCR1c7BH6QSKOSyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:17:10.749004Z","bundle_sha256":"610a48880dc149b72a95e436c7e806148354e08ce4dbc94c8ea2efaf7fe28db9"}}