{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:24W4RZ7CZGNAI2K2ZYOJS7D2S6","short_pith_number":"pith:24W4RZ7C","canonical_record":{"source":{"id":"1102.3540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2011-02-17T10:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"40b5a35c9ef1d79add1d72a65ef391d46fb7a2ae433686dd72a13e5083be42fb","abstract_canon_sha256":"3fa3b4217430e45bead9fbf4069f364f7e96f988aa8c69f5981450c760fa5a3f"},"schema_version":"1.0"},"canonical_sha256":"d72dc8e7e2c99a04695ace1c997c7a97aa07bd66f93d5b9c17e454bb6071e5b9","source":{"kind":"arxiv","id":"1102.3540","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3540","created_at":"2026-05-18T04:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3540v2","created_at":"2026-05-18T04:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3540","created_at":"2026-05-18T04:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"24W4RZ7CZGNA","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"24W4RZ7CZGNAI2K2","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"24W4RZ7C","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:24W4RZ7CZGNAI2K2ZYOJS7D2S6","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2011-02-17T10:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"40b5a35c9ef1d79add1d72a65ef391d46fb7a2ae433686dd72a13e5083be42fb","abstract_canon_sha256":"3fa3b4217430e45bead9fbf4069f364f7e96f988aa8c69f5981450c760fa5a3f"},"schema_version":"1.0"},"canonical_sha256":"d72dc8e7e2c99a04695ace1c997c7a97aa07bd66f93d5b9c17e454bb6071e5b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:47.190447Z","signature_b64":"kl0RxHMZl4xqZ2kWS/ArClsde1+UxLDZFO6wxLWjTdAVCVUJTIPv2C/Vudob/Cdn0B5YmVbNYMuK2Hh6pV78DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d72dc8e7e2c99a04695ace1c997c7a97aa07bd66f93d5b9c17e454bb6071e5b9","last_reissued_at":"2026-05-18T04:27:47.189940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:47.189940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3540","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-05-18T04:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZiemvmSkAyJN7gEJenxJK/aPZ8cmOhXLU35pKMqwkKQd73B7Ds13IpYNZ2Xx/94G67FKvKW22ZPU557+dECfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:32:28.531153Z"},"content_sha256":"3de9c9f318ed42cd650f2216e527b5ea46eb36f1e9ee404d63be1c6de1ccdca6","schema_version":"1.0","event_id":"sha256:3de9c9f318ed42cd650f2216e527b5ea46eb36f1e9ee404d63be1c6de1ccdca6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:24W4RZ7CZGNAI2K2ZYOJS7D2S6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive algorithms in sampling recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Dinh D\\~ung","submitted_at":"2011-02-17T10:09:09Z","abstract_excerpt":"We study optimal algorithms in adaptive sampling recovery of smooth functions defined on the unit $d$-cube ${\\II}^d:= [0,1]^d$. The recovery error is measured in the quasi-norm $\\|\\cdot\\|_q$ of $L_q := L_q(\\II^d)$. For $B$ a subset in $L_q,$ we define a sampling algorithm of recovery with the free choice of sample points and recovering functions from $B$ as follows. For each $f$ from the quasi-normed Besov space $B^\\alpha_{p,\\theta}$, we choose $n$ sample points. This choice defines $n$ sampled values. Based on these sample points and sampled values, we choose a function from $B$ for recoverin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3540","kind":"arxiv","version":2},"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-18T04:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTqH8/Ne9FM3JTNBtOlh3kXHUPeQfqqpAtNY7ReGptcJ/bwrQyswTbAyiXl5Gd9d6qAHrtu+kKNm1eY/t6aJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:32:28.531539Z"},"content_sha256":"21da494fa044ea22f2588455a725286731c88f154216855e97db4dc5e4bfe4b2","schema_version":"1.0","event_id":"sha256:21da494fa044ea22f2588455a725286731c88f154216855e97db4dc5e4bfe4b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24W4RZ7CZGNAI2K2ZYOJS7D2S6/bundle.json","state_url":"https://pith.science/pith/24W4RZ7CZGNAI2K2ZYOJS7D2S6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24W4RZ7CZGNAI2K2ZYOJS7D2S6/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-02T14:32:28Z","links":{"resolver":"https://pith.science/pith/24W4RZ7CZGNAI2K2ZYOJS7D2S6","bundle":"https://pith.science/pith/24W4RZ7CZGNAI2K2ZYOJS7D2S6/bundle.json","state":"https://pith.science/pith/24W4RZ7CZGNAI2K2ZYOJS7D2S6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24W4RZ7CZGNAI2K2ZYOJS7D2S6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:24W4RZ7CZGNAI2K2ZYOJS7D2S6","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":"3fa3b4217430e45bead9fbf4069f364f7e96f988aa8c69f5981450c760fa5a3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2011-02-17T10:09:09Z","title_canon_sha256":"40b5a35c9ef1d79add1d72a65ef391d46fb7a2ae433686dd72a13e5083be42fb"},"schema_version":"1.0","source":{"id":"1102.3540","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3540","created_at":"2026-05-18T04:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3540v2","created_at":"2026-05-18T04:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3540","created_at":"2026-05-18T04:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"24W4RZ7CZGNA","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"24W4RZ7CZGNAI2K2","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"24W4RZ7C","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:21da494fa044ea22f2588455a725286731c88f154216855e97db4dc5e4bfe4b2","target":"graph","created_at":"2026-05-18T04:27:47Z","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 study optimal algorithms in adaptive sampling recovery of smooth functions defined on the unit $d$-cube ${\\II}^d:= [0,1]^d$. The recovery error is measured in the quasi-norm $\\|\\cdot\\|_q$ of $L_q := L_q(\\II^d)$. For $B$ a subset in $L_q,$ we define a sampling algorithm of recovery with the free choice of sample points and recovering functions from $B$ as follows. For each $f$ from the quasi-normed Besov space $B^\\alpha_{p,\\theta}$, we choose $n$ sample points. This choice defines $n$ sampled values. Based on these sample points and sampled values, we choose a function from $B$ for recoverin","authors_text":"Dinh D\\~ung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2011-02-17T10:09:09Z","title":"Adaptive algorithms in sampling recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3540","kind":"arxiv","version":2},"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:3de9c9f318ed42cd650f2216e527b5ea46eb36f1e9ee404d63be1c6de1ccdca6","target":"record","created_at":"2026-05-18T04:27:47Z","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":"3fa3b4217430e45bead9fbf4069f364f7e96f988aa8c69f5981450c760fa5a3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2011-02-17T10:09:09Z","title_canon_sha256":"40b5a35c9ef1d79add1d72a65ef391d46fb7a2ae433686dd72a13e5083be42fb"},"schema_version":"1.0","source":{"id":"1102.3540","kind":"arxiv","version":2}},"canonical_sha256":"d72dc8e7e2c99a04695ace1c997c7a97aa07bd66f93d5b9c17e454bb6071e5b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d72dc8e7e2c99a04695ace1c997c7a97aa07bd66f93d5b9c17e454bb6071e5b9","first_computed_at":"2026-05-18T04:27:47.189940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:47.189940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kl0RxHMZl4xqZ2kWS/ArClsde1+UxLDZFO6wxLWjTdAVCVUJTIPv2C/Vudob/Cdn0B5YmVbNYMuK2Hh6pV78DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:47.190447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3540","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3de9c9f318ed42cd650f2216e527b5ea46eb36f1e9ee404d63be1c6de1ccdca6","sha256:21da494fa044ea22f2588455a725286731c88f154216855e97db4dc5e4bfe4b2"],"state_sha256":"d880692178892278d3007573f0227bf94b03c5ee72b59719708dfc6741b7d7cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q1QCgjoqBUOy2G6XR/g1uxWbIn8mSkGV4KQ1yTgVi2EEVdpTAGMu21WcF7uYUeuI4kzbFO1VTVuwpV1afm+zCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:32:28.533700Z","bundle_sha256":"ff3695de5640cd3e608339d4733c0caf20082cccd30cdb5790686d672927949d"}}