{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5SVQ6T5J7LLBSLWN64GKQHP4YP","short_pith_number":"pith:5SVQ6T5J","schema_version":"1.0","canonical_sha256":"ecab0f4fa9fad6192ecdf70ca81dfcc3ede7936c2bd8e0c1530bc6f4a60bf8b8","source":{"kind":"arxiv","id":"1807.00402","version":2},"attestation_state":"computed","paper":{"title":"Adaptive approximation by optimal weighted least squares methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Giovanni Migliorati","submitted_at":"2018-07-01T21:51:46Z","abstract_excerpt":"Given any domain $X\\subseteq \\mathbb{R}^d$ and a probability measure $\\rho$ on $X$, we study the problem of approximating in $L^2(X,\\rho)$ a given function $u:X\\to\\mathbb{R}$, using its noiseless pointwise evaluations at random samples. For any given linear space $V\\subset L^2(X,\\rho)$ with dimension $n$, previous works have shown that stable and optimally converging Weighted Least-Squares (WLS) estimators can be constructed using $m$ random samples distributed according to an auxiliary probability measure $\\mu$ that depends on $V$, with $m$ being linearly proportional to $n$ up to a logarithm"},"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":"1807.00402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-01T21:51:46Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"dde6f09cd8ec2be5a238edf1ff52a0b46a6afbcecad79466515107e2447547b4","abstract_canon_sha256":"2bc286867e4838e9de74a6120fa0e71cc5a99e75e4e47399e82de0a59a64dbc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.263724Z","signature_b64":"QUfnJ91gGz6BEM4N+rlhfbK0OcmYVLiSDAavHKpKs3Favigi2HUBCm2tDpgWXRVB1eogpH9Tdh2neDY6m+AXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecab0f4fa9fad6192ecdf70ca81dfcc3ede7936c2bd8e0c1530bc6f4a60bf8b8","last_reissued_at":"2026-05-17T23:41:01.263093Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.263093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive approximation by optimal weighted least squares methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Giovanni Migliorati","submitted_at":"2018-07-01T21:51:46Z","abstract_excerpt":"Given any domain $X\\subseteq \\mathbb{R}^d$ and a probability measure $\\rho$ on $X$, we study the problem of approximating in $L^2(X,\\rho)$ a given function $u:X\\to\\mathbb{R}$, using its noiseless pointwise evaluations at random samples. For any given linear space $V\\subset L^2(X,\\rho)$ with dimension $n$, previous works have shown that stable and optimally converging Weighted Least-Squares (WLS) estimators can be constructed using $m$ random samples distributed according to an auxiliary probability measure $\\mu$ that depends on $V$, with $m$ being linearly proportional to $n$ up to a logarithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00402","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":"1807.00402","created_at":"2026-05-17T23:41:01.263194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00402v2","created_at":"2026-05-17T23:41:01.263194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00402","created_at":"2026-05-17T23:41:01.263194+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SVQ6T5J7LLB","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SVQ6T5J7LLBSLWN","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SVQ6T5J","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01249","citing_title":"Near-optimal sampling strategies for multivariate function approximation on general domains","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP","json":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP.json","graph_json":"https://pith.science/api/pith-number/5SVQ6T5J7LLBSLWN64GKQHP4YP/graph.json","events_json":"https://pith.science/api/pith-number/5SVQ6T5J7LLBSLWN64GKQHP4YP/events.json","paper":"https://pith.science/paper/5SVQ6T5J"},"agent_actions":{"view_html":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP","download_json":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP.json","view_paper":"https://pith.science/paper/5SVQ6T5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00402&json=true","fetch_graph":"https://pith.science/api/pith-number/5SVQ6T5J7LLBSLWN64GKQHP4YP/graph.json","fetch_events":"https://pith.science/api/pith-number/5SVQ6T5J7LLBSLWN64GKQHP4YP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP/action/storage_attestation","attest_author":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP/action/author_attestation","sign_citation":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP/action/citation_signature","submit_replication":"https://pith.science/pith/5SVQ6T5J7LLBSLWN64GKQHP4YP/action/replication_record"}},"created_at":"2026-05-17T23:41:01.263194+00:00","updated_at":"2026-05-17T23:41:01.263194+00:00"}