{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2LNWQYDZE4M54T6ZSJ5A7QZNBK","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":"2d3e2af97f4778f60133534b5c176d83a0a7159a2d4f7f5cc3dd2ee4c2827665","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-06T10:02:59Z","title_canon_sha256":"1ac7c183172e1a7d4e37ef3e6e38549baa2bf0963ac672920da8f180d5a96b5f"},"schema_version":"1.0","source":{"id":"1903.02276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02276","created_at":"2026-06-04T20:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02276v1","created_at":"2026-06-04T20:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02276","created_at":"2026-06-04T20:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"2LNWQYDZE4M5","created_at":"2026-06-04T20:13:58Z"},{"alias_kind":"pith_short_16","alias_value":"2LNWQYDZE4M54T6Z","created_at":"2026-06-04T20:13:58Z"},{"alias_kind":"pith_short_8","alias_value":"2LNWQYDZ","created_at":"2026-06-04T20:13:58Z"}],"graph_snapshots":[{"event_id":"sha256:14c3810a4fa67ede5afe694ca3f662ba70f98882fb6b5adf6cc2a18da667fdd3","target":"graph","created_at":"2026-06-04T20:13:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.02276/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Smolyak's method, also known as hyperbolic cross approximation or sparse grid method, is a powerful tool to tackle multivariate tensor product problems solely with the help of efficient algorithms for the corresponding univariate problem. In this paper we study the randomized setting, i.e., we randomize Smolyak's method. We provide upper and lower error bounds for randomized Smolyak algorithms with explicitly given dependence on the number of variables and the number of information evaluations used. The error criteria we consider are the worst-case root mean square error (the typical error cri","authors_text":"Marcin Wnuk, Michael Gnewuch","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-06T10:02:59Z","title":"Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02276","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:72050aeb65e494515175e1323b8282316e96b7c49123649b7e3392e2bac4493d","target":"record","created_at":"2026-06-04T20:13:58Z","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":"2d3e2af97f4778f60133534b5c176d83a0a7159a2d4f7f5cc3dd2ee4c2827665","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-06T10:02:59Z","title_canon_sha256":"1ac7c183172e1a7d4e37ef3e6e38549baa2bf0963ac672920da8f180d5a96b5f"},"schema_version":"1.0","source":{"id":"1903.02276","kind":"arxiv","version":1}},"canonical_sha256":"d2db6860792719de4fd9927a0fc32d0a8c08dd6a24a32e2297027ad342699f8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2db6860792719de4fd9927a0fc32d0a8c08dd6a24a32e2297027ad342699f8b","first_computed_at":"2026-06-04T20:13:58.705497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:13:58.705497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IFFT5MuXzVveUG6ppdpk9QUV/yfFV4baeO0wXH2M+mkvbSmadmIU6k9qKtjXWD6x2Lx6KQYzjrOw5Pgu7WK6Cg==","signature_status":"signed_v1","signed_at":"2026-06-04T20:13:58.705948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72050aeb65e494515175e1323b8282316e96b7c49123649b7e3392e2bac4493d","sha256:14c3810a4fa67ede5afe694ca3f662ba70f98882fb6b5adf6cc2a18da667fdd3"],"state_sha256":"b90c14c14e236e811019c01809f07831c1aa76d088f94d9e90cc3ba21ba14df3"}