{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2VXSB2XJAZZRK6PY4UXMJDIDKL","short_pith_number":"pith:2VXSB2XJ","canonical_record":{"source":{"id":"1607.05559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-07-19T12:59:27Z","cross_cats_sorted":[],"title_canon_sha256":"f1bcc646bb7764d1447f6b888199769121ccbc2cd729e5910c879959684dc569","abstract_canon_sha256":"30343fa3b119c7fb56af52fd16fca0690f25125425a042c45338c4b5478e0f2f"},"schema_version":"1.0"},"canonical_sha256":"d56f20eae906731579f8e52ec48d0352cbe1b2c7f5573eef2aeb4965b796b4ed","source":{"kind":"arxiv","id":"1607.05559","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05559","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05559v2","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05559","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"2VXSB2XJAZZR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VXSB2XJAZZRK6PY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VXSB2XJ","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2VXSB2XJAZZRK6PY4UXMJDIDKL","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-07-19T12:59:27Z","cross_cats_sorted":[],"title_canon_sha256":"f1bcc646bb7764d1447f6b888199769121ccbc2cd729e5910c879959684dc569","abstract_canon_sha256":"30343fa3b119c7fb56af52fd16fca0690f25125425a042c45338c4b5478e0f2f"},"schema_version":"1.0"},"canonical_sha256":"d56f20eae906731579f8e52ec48d0352cbe1b2c7f5573eef2aeb4965b796b4ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:42.470432Z","signature_b64":"TRfSfW1GiwL2F7vxfkZT7r2sd2Poa4e0jANecC9XKfWAGlh5tZnj/vGGNJE1G4TyJsllPye0LqGIW/8KZnRTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d56f20eae906731579f8e52ec48d0352cbe1b2c7f5573eef2aeb4965b796b4ed","last_reissued_at":"2026-05-18T01:10:42.469955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:42.469955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05559","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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cYghh0b9b5hMfN+PLWrxWxHJqkd8oUasBiMDgdA0uliTILL3JWqNPboRR4FVvP+kSQBwwjvyuJwBxxmyN1LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:01:23.085285Z"},"content_sha256":"7b9acdb76730509436fe07d1678567c97068041d30c61ee97b91e3ecf9e3cf8a","schema_version":"1.0","event_id":"sha256:7b9acdb76730509436fe07d1678567c97068041d30c61ee97b91e3ecf9e3cf8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2VXSB2XJAZZRK6PY4UXMJDIDKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gelfand Numbers of Embeddings of Mixed Besov Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Van Kien Nguyen","submitted_at":"2016-07-19T12:59:27Z","abstract_excerpt":"Gelfand numbers represent a measure for the information complexity which is given by the number of information needed to approximate functions in a subset of a normed space with an error less than $\\varepsilon$. More precisely, Gelfand numbers coincide up to the factor 2 with the minimal error $ e^{\\rm wor}(n,\\Lambda^{\\rm all})$ which describes the error of the optimal (non-linear) algorithm that is based on $n$ arbitrary linear functionals. This explain the crucial role of Gelfand numbers in the study of approximation problems. Let $S^t_{p_1,p_1}B((0,1)^d)$ be the Besov spaces with dominating"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05559","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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41k1IdQtuERQwJGbaeP9gxpjDWGU+u2xhZP0An0gG39ZtbRwBUxzm4nRb9Eh/xiCDrmtrJ2MhrAGmmb19BLsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:01:23.086013Z"},"content_sha256":"18e46ab9b9cdf0affdeca10445333b33fdbbddca3f36adcba6ad65ae8bb91030","schema_version":"1.0","event_id":"sha256:18e46ab9b9cdf0affdeca10445333b33fdbbddca3f36adcba6ad65ae8bb91030"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/bundle.json","state_url":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/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-05-25T21:01:23Z","links":{"resolver":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL","bundle":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/bundle.json","state":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2VXSB2XJAZZRK6PY4UXMJDIDKL","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":"30343fa3b119c7fb56af52fd16fca0690f25125425a042c45338c4b5478e0f2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-07-19T12:59:27Z","title_canon_sha256":"f1bcc646bb7764d1447f6b888199769121ccbc2cd729e5910c879959684dc569"},"schema_version":"1.0","source":{"id":"1607.05559","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05559","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05559v2","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05559","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"2VXSB2XJAZZR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VXSB2XJAZZRK6PY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VXSB2XJ","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:18e46ab9b9cdf0affdeca10445333b33fdbbddca3f36adcba6ad65ae8bb91030","target":"graph","created_at":"2026-05-18T01:10:42Z","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":"Gelfand numbers represent a measure for the information complexity which is given by the number of information needed to approximate functions in a subset of a normed space with an error less than $\\varepsilon$. More precisely, Gelfand numbers coincide up to the factor 2 with the minimal error $ e^{\\rm wor}(n,\\Lambda^{\\rm all})$ which describes the error of the optimal (non-linear) algorithm that is based on $n$ arbitrary linear functionals. This explain the crucial role of Gelfand numbers in the study of approximation problems. Let $S^t_{p_1,p_1}B((0,1)^d)$ be the Besov spaces with dominating","authors_text":"Van Kien Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-07-19T12:59:27Z","title":"Gelfand Numbers of Embeddings of Mixed Besov Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05559","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:7b9acdb76730509436fe07d1678567c97068041d30c61ee97b91e3ecf9e3cf8a","target":"record","created_at":"2026-05-18T01:10:42Z","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":"30343fa3b119c7fb56af52fd16fca0690f25125425a042c45338c4b5478e0f2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2016-07-19T12:59:27Z","title_canon_sha256":"f1bcc646bb7764d1447f6b888199769121ccbc2cd729e5910c879959684dc569"},"schema_version":"1.0","source":{"id":"1607.05559","kind":"arxiv","version":2}},"canonical_sha256":"d56f20eae906731579f8e52ec48d0352cbe1b2c7f5573eef2aeb4965b796b4ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d56f20eae906731579f8e52ec48d0352cbe1b2c7f5573eef2aeb4965b796b4ed","first_computed_at":"2026-05-18T01:10:42.469955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:42.469955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TRfSfW1GiwL2F7vxfkZT7r2sd2Poa4e0jANecC9XKfWAGlh5tZnj/vGGNJE1G4TyJsllPye0LqGIW/8KZnRTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:42.470432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05559","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b9acdb76730509436fe07d1678567c97068041d30c61ee97b91e3ecf9e3cf8a","sha256:18e46ab9b9cdf0affdeca10445333b33fdbbddca3f36adcba6ad65ae8bb91030"],"state_sha256":"27e37b6f18967068ac746305655d010d2755981a17880c7cb7a70496d2becf9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xyz86EX8dBtVZotR6pbVP57VJYf9XzfCuqniLRptH9glbJBWntEyVve3RvkxBvUqWIn9dYfTckyMnYNYpaOFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:01:23.089603Z","bundle_sha256":"a9be7fed29cf031134dc69d2cd318fcb22e5b1350fa8936200764c3157bca6a4"}}