{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JVYWKMXRXYROSCFWA6P376NTQN","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":"2e90a6c2f61cdb55c226996a1ebc989093ae02ab6f3f3c10b0812d95675005bc","cross_cats_sorted":["cs.CC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-09T15:56:32Z","title_canon_sha256":"c86c1f946a8dc5a77ec0e9263ac762b31363d12d87d8f0bcadf3938a13e0fbc2"},"schema_version":"1.0","source":{"id":"1209.1808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1808","created_at":"2026-06-03T23:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1808v1","created_at":"2026-06-03T23:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1808","created_at":"2026-06-03T23:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"JVYWKMXRXYRO","created_at":"2026-06-03T23:07:26Z"},{"alias_kind":"pith_short_16","alias_value":"JVYWKMXRXYROSCFW","created_at":"2026-06-03T23:07:26Z"},{"alias_kind":"pith_short_8","alias_value":"JVYWKMXR","created_at":"2026-06-03T23:07:26Z"}],"graph_snapshots":[{"event_id":"sha256:29f9a80d29ab55369bc9714ed95c290b83f19b06ddef43b9c5f5362e23bd4a0e","target":"graph","created_at":"2026-06-03T23:07:26Z","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/1209.1808/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on weighted Hilbert spaces with an underlying anchored decomposition and arbitrary weights. We focus on randomized algorithms and the randomized worst case error. We study two cost models for function evaluation which depend on the number of active variables of the chosen sample points. Multilevel algorithms behave very well with respect to the first cost model,","authors_text":"Michael Gnewuch","cross_cats":["cs.CC","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-09T15:56:32Z","title":"Lower Error Bounds for Randomized Multilevel and Changing Dimension Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1808","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:609a3fc16ef10b2563914d653f34765597243e1a3222057aa915ab7cd2c5313a","target":"record","created_at":"2026-06-03T23:07:26Z","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":"2e90a6c2f61cdb55c226996a1ebc989093ae02ab6f3f3c10b0812d95675005bc","cross_cats_sorted":["cs.CC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-09T15:56:32Z","title_canon_sha256":"c86c1f946a8dc5a77ec0e9263ac762b31363d12d87d8f0bcadf3938a13e0fbc2"},"schema_version":"1.0","source":{"id":"1209.1808","kind":"arxiv","version":1}},"canonical_sha256":"4d716532f1be22e908b6079fbff9b38346aae4c89e8feb0cae41674460681cbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d716532f1be22e908b6079fbff9b38346aae4c89e8feb0cae41674460681cbe","first_computed_at":"2026-06-03T23:07:26.340738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T23:07:26.340738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LIE6hohcYC548KrR14SZBZwK4Id/LrWrhBokfFIrX1hCN5cwZUwFcPJUEX8MozXF+7jnGlv6Qn+su6eRP3mJDw==","signature_status":"signed_v1","signed_at":"2026-06-03T23:07:26.341257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:609a3fc16ef10b2563914d653f34765597243e1a3222057aa915ab7cd2c5313a","sha256:29f9a80d29ab55369bc9714ed95c290b83f19b06ddef43b9c5f5362e23bd4a0e"],"state_sha256":"c72c89ce4b2376d64d31a79bedb9eaff68661d8cb229a90ddd278e1aa270545c"}