{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:427FBCUDLTBT6BMLEPQBCFQ7LG","short_pith_number":"pith:427FBCUD","schema_version":"1.0","canonical_sha256":"e6be508a835cc33f058b23e011161f59af4b67602da969180f326883ebedf7e9","source":{"kind":"arxiv","id":"1805.10801","version":1},"attestation_state":"computed","paper":{"title":"Sequential sampling for optimal weighted least squares approximations in hierarchical spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Albert Cohen, Benjamin Arras, Markus Bachmayr","submitted_at":"2018-05-28T07:54:42Z","abstract_excerpt":"We consider the problem of approximating an unknown function $u\\in L^2(D,\\rho)$ from its evaluations at given sampling points $x^1,\\dots,x^n\\in D$, where $D\\subset \\mathbb{R}^d$ is a general domain and $\\rho$ is a probability measure. The approximation is picked in a linear space $V_m$ where $m=\\dim(V_m)$ and computed by a weighted least squares method. Recent results show the advantages of picking the sampling points at random according to a well-chosen probability measure $\\mu$ that depends both on $V_m$ and $\\rho$. With such a random design, the weighted least squares approximation is prove"},"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":"1805.10801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-28T07:54:42Z","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"title_canon_sha256":"9dc908edabde684779da51b93f47b8b922351ccc2893479af2df1bf4491826f1","abstract_canon_sha256":"144f6d8f716ef1bb9623d7c245459462596186c913959d965a9edf591c8cdd8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:51.379578Z","signature_b64":"zYjQ/b0w9u2/ru/E2RzUkhIrquZRlEwd0w/o7zP5o5rsAslwW/LM3/3WvyRq0deU36vr/P0QXtQrYBQmGsLMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6be508a835cc33f058b23e011161f59af4b67602da969180f326883ebedf7e9","last_reissued_at":"2026-05-18T00:14:51.378800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:51.378800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential sampling for optimal weighted least squares approximations in hierarchical spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Albert Cohen, Benjamin Arras, Markus Bachmayr","submitted_at":"2018-05-28T07:54:42Z","abstract_excerpt":"We consider the problem of approximating an unknown function $u\\in L^2(D,\\rho)$ from its evaluations at given sampling points $x^1,\\dots,x^n\\in D$, where $D\\subset \\mathbb{R}^d$ is a general domain and $\\rho$ is a probability measure. The approximation is picked in a linear space $V_m$ where $m=\\dim(V_m)$ and computed by a weighted least squares method. Recent results show the advantages of picking the sampling points at random according to a well-chosen probability measure $\\mu$ that depends both on $V_m$ and $\\rho$. With such a random design, the weighted least squares approximation is prove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10801","kind":"arxiv","version":1},"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":"1805.10801","created_at":"2026-05-18T00:14:51.378920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10801v1","created_at":"2026-05-18T00:14:51.378920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10801","created_at":"2026-05-18T00:14:51.378920+00:00"},{"alias_kind":"pith_short_12","alias_value":"427FBCUDLTBT","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"427FBCUDLTBT6BML","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"427FBCUD","created_at":"2026-05-18T12:32:05.422762+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/427FBCUDLTBT6BMLEPQBCFQ7LG","json":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG.json","graph_json":"https://pith.science/api/pith-number/427FBCUDLTBT6BMLEPQBCFQ7LG/graph.json","events_json":"https://pith.science/api/pith-number/427FBCUDLTBT6BMLEPQBCFQ7LG/events.json","paper":"https://pith.science/paper/427FBCUD"},"agent_actions":{"view_html":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG","download_json":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG.json","view_paper":"https://pith.science/paper/427FBCUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10801&json=true","fetch_graph":"https://pith.science/api/pith-number/427FBCUDLTBT6BMLEPQBCFQ7LG/graph.json","fetch_events":"https://pith.science/api/pith-number/427FBCUDLTBT6BMLEPQBCFQ7LG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/action/storage_attestation","attest_author":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/action/author_attestation","sign_citation":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/action/citation_signature","submit_replication":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/action/replication_record"}},"created_at":"2026-05-18T00:14:51.378920+00:00","updated_at":"2026-05-18T00:14:51.378920+00:00"}