{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2VXSB2XJAZZRK6PY4UXMJDIDKL","short_pith_number":"pith:2VXSB2XJ","schema_version":"1.0","canonical_sha256":"d56f20eae906731579f8e52ec48d0352cbe1b2c7f5573eef2aeb4965b796b4ed","source":{"kind":"arxiv","id":"1607.05559","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.05559","created_at":"2026-05-18T01:10:42.470031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05559v2","created_at":"2026-05-18T01:10:42.470031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05559","created_at":"2026-05-18T01:10:42.470031+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VXSB2XJAZZR","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VXSB2XJAZZRK6PY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VXSB2XJ","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL","json":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL.json","graph_json":"https://pith.science/api/pith-number/2VXSB2XJAZZRK6PY4UXMJDIDKL/graph.json","events_json":"https://pith.science/api/pith-number/2VXSB2XJAZZRK6PY4UXMJDIDKL/events.json","paper":"https://pith.science/paper/2VXSB2XJ"},"agent_actions":{"view_html":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL","download_json":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL.json","view_paper":"https://pith.science/paper/2VXSB2XJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05559&json=true","fetch_graph":"https://pith.science/api/pith-number/2VXSB2XJAZZRK6PY4UXMJDIDKL/graph.json","fetch_events":"https://pith.science/api/pith-number/2VXSB2XJAZZRK6PY4UXMJDIDKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/action/storage_attestation","attest_author":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/action/author_attestation","sign_citation":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/action/citation_signature","submit_replication":"https://pith.science/pith/2VXSB2XJAZZRK6PY4UXMJDIDKL/action/replication_record"}},"created_at":"2026-05-18T01:10:42.470031+00:00","updated_at":"2026-05-18T01:10:42.470031+00:00"}