{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AYL6RRYW2G33HSM2NFDAEMXT4Y","short_pith_number":"pith:AYL6RRYW","schema_version":"1.0","canonical_sha256":"0617e8c716d1b7b3c99a69460232f3e62cf3629b4d7d4c14c51ae76128674913","source":{"kind":"arxiv","id":"1403.2480","version":2},"attestation_state":"computed","paper":{"title":"Optimization of mesh hierarchies in Multilevel Monte Carlo samplers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Abdul Lateef Haji Ali, Erik von Schwerin, Fabio Nobile, Raul Tempone","submitted_at":"2014-03-11T06:46:05Z","abstract_excerpt":"We perform a general optimization of the parameters in the Multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. We optimize hierarchies with geometric and non-geometric sequences of mesh sizes and show that geometric hierarchies, when optimized, are nearly optimal and have the same asymptotic computational complexity as non-geometric optimal hierarchies. We discuss how enforcing constraints on parameters of MLMC hierarchies affects the optimality of these hierarchies. These constraints include "},"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":"1403.2480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-03-11T06:46:05Z","cross_cats_sorted":[],"title_canon_sha256":"85221518b87b51c86497cbf8785ecbd7a151f64c9d5b62e813de0bb70b41b0c1","abstract_canon_sha256":"9d8c1745b3e637e09c9b29c54bc004e9f15bbe2496a4e983514f9a0f860a209f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:53.513615Z","signature_b64":"MBF6bCawszDDifpNPbq4CvvA6IfXLeHlHBfqpync+RxuyHHh614euCh1eQ2FBBl1FplDBTsoDAq1afWJ2OAPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0617e8c716d1b7b3c99a69460232f3e62cf3629b4d7d4c14c51ae76128674913","last_reissued_at":"2026-05-18T01:55:53.512963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:53.512963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of mesh hierarchies in Multilevel Monte Carlo samplers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Abdul Lateef Haji Ali, Erik von Schwerin, Fabio Nobile, Raul Tempone","submitted_at":"2014-03-11T06:46:05Z","abstract_excerpt":"We perform a general optimization of the parameters in the Multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. We optimize hierarchies with geometric and non-geometric sequences of mesh sizes and show that geometric hierarchies, when optimized, are nearly optimal and have the same asymptotic computational complexity as non-geometric optimal hierarchies. We discuss how enforcing constraints on parameters of MLMC hierarchies affects the optimality of these hierarchies. These constraints include "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2480","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":"1403.2480","created_at":"2026-05-18T01:55:53.513079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2480v2","created_at":"2026-05-18T01:55:53.513079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2480","created_at":"2026-05-18T01:55:53.513079+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYL6RRYW2G33","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYL6RRYW2G33HSM2","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYL6RRYW","created_at":"2026-05-18T12:28:19.803747+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/AYL6RRYW2G33HSM2NFDAEMXT4Y","json":"https://pith.science/pith/AYL6RRYW2G33HSM2NFDAEMXT4Y.json","graph_json":"https://pith.science/api/pith-number/AYL6RRYW2G33HSM2NFDAEMXT4Y/graph.json","events_json":"https://pith.science/api/pith-number/AYL6RRYW2G33HSM2NFDAEMXT4Y/events.json","paper":"https://pith.science/paper/AYL6RRYW"},"agent_actions":{"view_html":"https://pith.science/pith/AYL6RRYW2G33HSM2NFDAEMXT4Y","download_json":"https://pith.science/pith/AYL6RRYW2G33HSM2NFDAEMXT4Y.json","view_paper":"https://pith.science/paper/AYL6RRYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2480&json=true","fetch_graph":"https://pith.science/api/pith-number/AYL6RRYW2G33HSM2NFDAEMXT4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/AYL6RRYW2G33HSM2NFDAEMXT4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYL6RRYW2G33HSM2NFDAEMXT4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYL6RRYW2G33HSM2NFDAEMXT4Y/action/storage_attestation","attest_author":"https://pith.science/pith/AYL6RRYW2G33HSM2NFDAEMXT4Y/action/author_attestation","sign_citation":"https://pith.science/pith/AYL6RRYW2G33HSM2NFDAEMXT4Y/action/citation_signature","submit_replication":"https://pith.science/pith/AYL6RRYW2G33HSM2NFDAEMXT4Y/action/replication_record"}},"created_at":"2026-05-18T01:55:53.513079+00:00","updated_at":"2026-05-18T01:55:53.513079+00:00"}