{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CQSLDOKIIKXBGSPUIRKNGL6MH3","short_pith_number":"pith:CQSLDOKI","schema_version":"1.0","canonical_sha256":"1424b1b94842ae1349f44454d32fcc3ec86dee10e8018c2014ad00c34d316ff8","source":{"kind":"arxiv","id":"2010.00327","version":2},"attestation_state":"computed","paper":{"title":"A new upper bound for sampling numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Martin Sch\\\"afer, Nicolas Nagel, Tino Ullrich","submitted_at":"2020-09-30T08:32:18Z","abstract_excerpt":"We provide a new upper bound for sampling numbers $(g_n)_{n\\in \\mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants $C,c>0$ (which are specified in the paper) such that $$\n  g^2_n \\leq \\frac{C\\log(n)}{n}\\sum\\limits_{k\\geq \\lfloor cn \\rfloor} \\sigma_k^2\\quad,\\quad n\\geq 2\\,, $$ where $(\\sigma_k)_{k\\in \\mathbb{N}}$ is the sequence of singular numbers (approximation numbers) of the Hilbert-Schmidt embedding $\\text{Id}:H(K) \\to L_2(D,\\varrho_D)$. The algorithm which realizes the"},"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":"2010.00327","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-30T08:32:18Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8315db4d803796183a0cc1a7b7fa8daf31e7eddeafba9e2fb96770c80ffa6f6d","abstract_canon_sha256":"1d47770f0c04157f0bcd9f9c582803ba7a5db8f30f8249fd78a63d64fb1db168"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:11.253871Z","signature_b64":"pDwNQg5x66vWY3pF9vt/nHnmuJW6CmQLplNF36LP3k0ssKpY8ah2QRmFJ6o+qNglyV/PhOjL5Za88nbW/f2ABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1424b1b94842ae1349f44454d32fcc3ec86dee10e8018c2014ad00c34d316ff8","last_reissued_at":"2026-07-05T02:14:11.253475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:11.253475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new upper bound for sampling numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Martin Sch\\\"afer, Nicolas Nagel, Tino Ullrich","submitted_at":"2020-09-30T08:32:18Z","abstract_excerpt":"We provide a new upper bound for sampling numbers $(g_n)_{n\\in \\mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants $C,c>0$ (which are specified in the paper) such that $$\n  g^2_n \\leq \\frac{C\\log(n)}{n}\\sum\\limits_{k\\geq \\lfloor cn \\rfloor} \\sigma_k^2\\quad,\\quad n\\geq 2\\,, $$ where $(\\sigma_k)_{k\\in \\mathbb{N}}$ is the sequence of singular numbers (approximation numbers) of the Hilbert-Schmidt embedding $\\text{Id}:H(K) \\to L_2(D,\\varrho_D)$. The algorithm which realizes the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00327","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.00327/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":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":"2010.00327","created_at":"2026-07-05T02:14:11.253527+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00327v2","created_at":"2026-07-05T02:14:11.253527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00327","created_at":"2026-07-05T02:14:11.253527+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQSLDOKIIKXB","created_at":"2026-07-05T02:14:11.253527+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQSLDOKIIKXBGSPU","created_at":"2026-07-05T02:14:11.253527+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQSLDOKI","created_at":"2026-07-05T02:14:11.253527+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.02797","citing_title":"Some lower bounds for optimal sampling recovery of functions with mixed smoothness","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3","json":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3.json","graph_json":"https://pith.science/api/pith-number/CQSLDOKIIKXBGSPUIRKNGL6MH3/graph.json","events_json":"https://pith.science/api/pith-number/CQSLDOKIIKXBGSPUIRKNGL6MH3/events.json","paper":"https://pith.science/paper/CQSLDOKI"},"agent_actions":{"view_html":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3","download_json":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3.json","view_paper":"https://pith.science/paper/CQSLDOKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00327&json=true","fetch_graph":"https://pith.science/api/pith-number/CQSLDOKIIKXBGSPUIRKNGL6MH3/graph.json","fetch_events":"https://pith.science/api/pith-number/CQSLDOKIIKXBGSPUIRKNGL6MH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3/action/storage_attestation","attest_author":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3/action/author_attestation","sign_citation":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3/action/citation_signature","submit_replication":"https://pith.science/pith/CQSLDOKIIKXBGSPUIRKNGL6MH3/action/replication_record"}},"created_at":"2026-07-05T02:14:11.253527+00:00","updated_at":"2026-07-05T02:14:11.253527+00:00"}