{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EZZC5TMQEVNFWD4IAWREBLSGIO","short_pith_number":"pith:EZZC5TMQ","canonical_record":{"source":{"id":"2602.02066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-02T13:07:27Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"title_canon_sha256":"dd3beade83f50c6d680452c0a189e34a480227de1f6fccf1cd17b8b06c092f92","abstract_canon_sha256":"2ff737f1af7432427183b8d6d237ee5c8c2c9f96ba31a38eb10e75e218edf376"},"schema_version":"1.0"},"canonical_sha256":"26722ecd90255a5b0f8805a240ae46439e02e3d944adf53b2bd32c6890363403","source":{"kind":"arxiv","id":"2602.02066","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.02066","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"2602.02066v2","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.02066","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"EZZC5TMQEVNF","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"pith_short_16","alias_value":"EZZC5TMQEVNFWD4I","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"pith_short_8","alias_value":"EZZC5TMQ","created_at":"2026-06-24T14:15:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EZZC5TMQEVNFWD4IAWREBLSGIO","target":"record","payload":{"canonical_record":{"source":{"id":"2602.02066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-02T13:07:27Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"title_canon_sha256":"dd3beade83f50c6d680452c0a189e34a480227de1f6fccf1cd17b8b06c092f92","abstract_canon_sha256":"2ff737f1af7432427183b8d6d237ee5c8c2c9f96ba31a38eb10e75e218edf376"},"schema_version":"1.0"},"canonical_sha256":"26722ecd90255a5b0f8805a240ae46439e02e3d944adf53b2bd32c6890363403","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T14:15:55.058414Z","signature_b64":"rgxdwob165Nf8I0saExb+I6gcNf00xj3SVotY2jiq23biZWCJypIgH2se8TFE1P8WkdXnqXnzM+DSxOs/ReNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26722ecd90255a5b0f8805a240ae46439e02e3d944adf53b2bd32c6890363403","last_reissued_at":"2026-06-24T14:15:55.057913Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T14:15:55.057913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.02066","source_version":2,"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-06-24T14:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEiSN0YUvctcFBXjx6ivH+aJvHCn+jY7Ybb8bZNPzSdgVjLP0NFl0KNWr3dQwjfXjfee+MFKhiPGqf8ijPg4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:47:41.678768Z"},"content_sha256":"dcb0f31d69c15f2e23909eba490d4095c0c968d37b23992c847db54acd12b881","schema_version":"1.0","event_id":"sha256:dcb0f31d69c15f2e23909eba490d4095c0c968d37b23992c847db54acd12b881"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EZZC5TMQEVNFWD4IAWREBLSGIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation of Functions: Optimal Sampling and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Finite function evaluations impose strict information-theoretic limits on approximation accuracy.","cross_cats":["cs.IT","cs.NA","math.IT"],"primary_cat":"math.NA","authors_text":"David Krieg, Mario Ullrich","submitted_at":"2026-02-02T13:07:27Z","abstract_excerpt":"We consider approximation or recovery of functions based on a finite number of function evaluations. This is a well-studied problem in optimal recovery, machine learning, and numerical analysis in general, but many fundamental insights were obtained only recently. We discuss different aspects of the information-theoretic limit that appears because of the limited amount of data available, as well as algorithms and sampling strategies that come as close to it as possible.\n  We also discuss (optimal) sampling in a broader sense, allowing other types of measurements that may be nonlinear, adaptive"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Many fundamental insights into the information-theoretic limits of function approximation from finite evaluations were obtained only recently.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The discussion presupposes standard settings from optimal recovery and information-based complexity without detailing the precise function classes or norms under consideration.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Survey of information-theoretic limits and optimal sampling for function approximation from finite evaluations, including nonlinear and adaptive measurements.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Finite function evaluations impose strict information-theoretic limits on approximation accuracy.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ed18a6c1c8d586eaa536ec49309b66dadbf26b414c7d88760dcfcf7d24835ddc"},"source":{"id":"2602.02066","kind":"arxiv","version":2},"verdict":{"id":"268bc5ba-02cf-4b63-85f3-277fd6b0bbc8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T08:41:35.553484Z","strongest_claim":"Many fundamental insights into the information-theoretic limits of function approximation from finite evaluations were obtained only recently.","one_line_summary":"Survey of information-theoretic limits and optimal sampling for function approximation from finite evaluations, including nonlinear and adaptive measurements.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The discussion presupposes standard settings from optimal recovery and information-based complexity without detailing the precise function classes or norms under consideration.","pith_extraction_headline":"Finite function evaluations impose strict information-theoretic limits on approximation accuracy."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.02066/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":2,"snapshot_sha256":"eff59e3828f031f014b8a7ed9b2f6f9e95c4a7f303d952d79baecb097a905f63"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"268bc5ba-02cf-4b63-85f3-277fd6b0bbc8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T14:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0ErTHkoYKpJJVwu30kAI32CYuAMgOXv9IJfmZGUaDucLpHBl1dvmIn19gQ7X8qTrKKvT/7ExPLDb+QkbHwqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:47:41.679435Z"},"content_sha256":"da707ae4bc0a2fb9357274b44e697e0774aebd91267a5a7ed747d35734063d05","schema_version":"1.0","event_id":"sha256:da707ae4bc0a2fb9357274b44e697e0774aebd91267a5a7ed747d35734063d05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZZC5TMQEVNFWD4IAWREBLSGIO/bundle.json","state_url":"https://pith.science/pith/EZZC5TMQEVNFWD4IAWREBLSGIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZZC5TMQEVNFWD4IAWREBLSGIO/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-08-05T22:47:41Z","links":{"resolver":"https://pith.science/pith/EZZC5TMQEVNFWD4IAWREBLSGIO","bundle":"https://pith.science/pith/EZZC5TMQEVNFWD4IAWREBLSGIO/bundle.json","state":"https://pith.science/pith/EZZC5TMQEVNFWD4IAWREBLSGIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZZC5TMQEVNFWD4IAWREBLSGIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EZZC5TMQEVNFWD4IAWREBLSGIO","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":"2ff737f1af7432427183b8d6d237ee5c8c2c9f96ba31a38eb10e75e218edf376","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-02T13:07:27Z","title_canon_sha256":"dd3beade83f50c6d680452c0a189e34a480227de1f6fccf1cd17b8b06c092f92"},"schema_version":"1.0","source":{"id":"2602.02066","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.02066","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"2602.02066v2","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.02066","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"EZZC5TMQEVNF","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"pith_short_16","alias_value":"EZZC5TMQEVNFWD4I","created_at":"2026-06-24T14:15:55Z"},{"alias_kind":"pith_short_8","alias_value":"EZZC5TMQ","created_at":"2026-06-24T14:15:55Z"}],"graph_snapshots":[{"event_id":"sha256:da707ae4bc0a2fb9357274b44e697e0774aebd91267a5a7ed747d35734063d05","target":"graph","created_at":"2026-06-24T14:15:55Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Many fundamental insights into the information-theoretic limits of function approximation from finite evaluations were obtained only recently."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The discussion presupposes standard settings from optimal recovery and information-based complexity without detailing the precise function classes or norms under consideration."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Survey of information-theoretic limits and optimal sampling for function approximation from finite evaluations, including nonlinear and adaptive measurements."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Finite function evaluations impose strict information-theoretic limits on approximation accuracy."}],"snapshot_sha256":"ed18a6c1c8d586eaa536ec49309b66dadbf26b414c7d88760dcfcf7d24835ddc"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"eff59e3828f031f014b8a7ed9b2f6f9e95c4a7f303d952d79baecb097a905f63"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.02066/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider approximation or recovery of functions based on a finite number of function evaluations. This is a well-studied problem in optimal recovery, machine learning, and numerical analysis in general, but many fundamental insights were obtained only recently. We discuss different aspects of the information-theoretic limit that appears because of the limited amount of data available, as well as algorithms and sampling strategies that come as close to it as possible.\n  We also discuss (optimal) sampling in a broader sense, allowing other types of measurements that may be nonlinear, adaptive","authors_text":"David Krieg, Mario Ullrich","cross_cats":["cs.IT","cs.NA","math.IT"],"headline":"Finite function evaluations impose strict information-theoretic limits on approximation accuracy.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-02T13:07:27Z","title":"Approximation of Functions: Optimal Sampling and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.02066","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T08:41:35.553484Z","id":"268bc5ba-02cf-4b63-85f3-277fd6b0bbc8","model_set":{"reader":"grok-4.3"},"one_line_summary":"Survey of information-theoretic limits and optimal sampling for function approximation from finite evaluations, including nonlinear and adaptive measurements.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Finite function evaluations impose strict information-theoretic limits on approximation accuracy.","strongest_claim":"Many fundamental insights into the information-theoretic limits of function approximation from finite evaluations were obtained only recently.","weakest_assumption":"The discussion presupposes standard settings from optimal recovery and information-based complexity without detailing the precise function classes or norms under consideration."}},"verdict_id":"268bc5ba-02cf-4b63-85f3-277fd6b0bbc8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dcb0f31d69c15f2e23909eba490d4095c0c968d37b23992c847db54acd12b881","target":"record","created_at":"2026-06-24T14:15:55Z","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":"2ff737f1af7432427183b8d6d237ee5c8c2c9f96ba31a38eb10e75e218edf376","cross_cats_sorted":["cs.IT","cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-02T13:07:27Z","title_canon_sha256":"dd3beade83f50c6d680452c0a189e34a480227de1f6fccf1cd17b8b06c092f92"},"schema_version":"1.0","source":{"id":"2602.02066","kind":"arxiv","version":2}},"canonical_sha256":"26722ecd90255a5b0f8805a240ae46439e02e3d944adf53b2bd32c6890363403","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26722ecd90255a5b0f8805a240ae46439e02e3d944adf53b2bd32c6890363403","first_computed_at":"2026-06-24T14:15:55.057913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T14:15:55.057913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rgxdwob165Nf8I0saExb+I6gcNf00xj3SVotY2jiq23biZWCJypIgH2se8TFE1P8WkdXnqXnzM+DSxOs/ReNDQ==","signature_status":"signed_v1","signed_at":"2026-06-24T14:15:55.058414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.02066","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcb0f31d69c15f2e23909eba490d4095c0c968d37b23992c847db54acd12b881","sha256:da707ae4bc0a2fb9357274b44e697e0774aebd91267a5a7ed747d35734063d05"],"state_sha256":"a5d6a1fc4e495d6c8e4a510b6707cc584002559d78e4e83f7f051656f57745da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLWjS/9m0SawgBcMEMW0MR76tUPhIVqJi4HQQe1pRc1tnXvwl3tttmlTZk+4RMVrrfQvI5WfKylMNheLYCarCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:47:41.684454Z","bundle_sha256":"9646507e4e96e05cd5de78a9f5113929083a1510ec54eb9d4f054717ef808469"}}