{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:427FBCUDLTBT6BMLEPQBCFQ7LG","short_pith_number":"pith:427FBCUD","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"},"canonical_sha256":"e6be508a835cc33f058b23e011161f59af4b67602da969180f326883ebedf7e9","source":{"kind":"arxiv","id":"1805.10801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10801","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10801v1","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10801","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"427FBCUDLTBT","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"427FBCUDLTBT6BML","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"427FBCUD","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:427FBCUDLTBT6BMLEPQBCFQ7LG","target":"record","payload":{"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"},"canonical_sha256":"e6be508a835cc33f058b23e011161f59af4b67602da969180f326883ebedf7e9","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"},"source_kind":"arxiv","source_id":"1805.10801","source_version":1,"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-18T00:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3NBYHCtx/stdA/nhkg8bOpnCfXJag1zH6sHQruv+t2yWCQA5SQk101kw79KWXM/0kn4YeBVSD7WJ3TLPnTzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:37:39.711275Z"},"content_sha256":"3b46fa0b690e0029861c301b24264314c2b59faaec2b4b2ba5447a09bc10d54a","schema_version":"1.0","event_id":"sha256:3b46fa0b690e0029861c301b24264314c2b59faaec2b4b2ba5447a09bc10d54a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:427FBCUDLTBT6BMLEPQBCFQ7LG","target":"graph","payload":{"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"},"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-18T00:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUKpOPf2Q1XopqO0agQZ+JGLSyAIy1JTESh88SvNukQR/TYhBO8K1RB/20vMdcqGbvxbb+S6yfYnHwrYmiRVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:37:39.712011Z"},"content_sha256":"17cc1abb88d48f643f034b2d17d5f6124941861547bb34080f4ad5b7160b4ad7","schema_version":"1.0","event_id":"sha256:17cc1abb88d48f643f034b2d17d5f6124941861547bb34080f4ad5b7160b4ad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/bundle.json","state_url":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/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-06-03T15:37:39Z","links":{"resolver":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG","bundle":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/bundle.json","state":"https://pith.science/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/427FBCUDLTBT6BMLEPQBCFQ7LG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:427FBCUDLTBT6BMLEPQBCFQ7LG","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":"144f6d8f716ef1bb9623d7c245459462596186c913959d965a9edf591c8cdd8f","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-28T07:54:42Z","title_canon_sha256":"9dc908edabde684779da51b93f47b8b922351ccc2893479af2df1bf4491826f1"},"schema_version":"1.0","source":{"id":"1805.10801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10801","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10801v1","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10801","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"427FBCUDLTBT","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"427FBCUDLTBT6BML","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"427FBCUD","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:17cc1abb88d48f643f034b2d17d5f6124941861547bb34080f4ad5b7160b4ad7","target":"graph","created_at":"2026-05-18T00:14:51Z","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":"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","authors_text":"Albert Cohen, Benjamin Arras, Markus Bachmayr","cross_cats":["math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-28T07:54:42Z","title":"Sequential sampling for optimal weighted least squares approximations in hierarchical spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10801","kind":"arxiv","version":1},"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:3b46fa0b690e0029861c301b24264314c2b59faaec2b4b2ba5447a09bc10d54a","target":"record","created_at":"2026-05-18T00:14:51Z","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":"144f6d8f716ef1bb9623d7c245459462596186c913959d965a9edf591c8cdd8f","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-05-28T07:54:42Z","title_canon_sha256":"9dc908edabde684779da51b93f47b8b922351ccc2893479af2df1bf4491826f1"},"schema_version":"1.0","source":{"id":"1805.10801","kind":"arxiv","version":1}},"canonical_sha256":"e6be508a835cc33f058b23e011161f59af4b67602da969180f326883ebedf7e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6be508a835cc33f058b23e011161f59af4b67602da969180f326883ebedf7e9","first_computed_at":"2026-05-18T00:14:51.378800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:51.378800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zYjQ/b0w9u2/ru/E2RzUkhIrquZRlEwd0w/o7zP5o5rsAslwW/LM3/3WvyRq0deU36vr/P0QXtQrYBQmGsLMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:51.379578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b46fa0b690e0029861c301b24264314c2b59faaec2b4b2ba5447a09bc10d54a","sha256:17cc1abb88d48f643f034b2d17d5f6124941861547bb34080f4ad5b7160b4ad7"],"state_sha256":"d4c646806358b575cdacc558bc71fb3689347e32e0748f6436157d58d3fc740e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xltwISFjPTrfya/TRhPYwLWhnZSK+xJtDp2bMMxqxKFs1MqDPBG8pCXnn+4OswM4DZbacrf9Ip4hJ83oG6AGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:37:39.715264Z","bundle_sha256":"e134e065b64ec72a35027a91b20a2fcefbfb65cf6434921045d6fd0d29650eab"}}