{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GHCM4KWXYTT7GO53MK5VZIH7YF","short_pith_number":"pith:GHCM4KWX","schema_version":"1.0","canonical_sha256":"31c4ce2ad7c4e7f33bbb62bb5ca0ffc15a714b30fcc2aa5c7f6ffb2d77ae8964","source":{"kind":"arxiv","id":"1911.03188","version":1},"attestation_state":"computed","paper":{"title":"Generalised multilevel Picard approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.AP","math.PR"],"primary_cat":"math.NA","authors_text":"Arnulf Jentzen, Michael B. Giles, Timo Welti","submitted_at":"2019-11-08T11:18:27Z","abstract_excerpt":"It is one of the most challenging problems in applied mathematics to approximatively solve high-dimensional partial differential equations (PDEs). In particular, most of the numerical approximation schemes studied in the scientific literature suffer under the curse of dimensionality in the sense that the number of computational operations needed to compute an approximation with an error of size at most $ \\varepsilon > 0 $ grows at least exponentially in the PDE dimension $ d \\in \\mathbb{N} $ or in the reciprocal of $ \\varepsilon $. Recently, so-called full-history recursive multilevel Picard ("},"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":"1911.03188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-11-08T11:18:27Z","cross_cats_sorted":["cs.NA","math.AP","math.PR"],"title_canon_sha256":"70ab0e1f59cd7f322c29c0776b25c6a0ed7969192c9a46aa2dc56f240c70cc40","abstract_canon_sha256":"9b8480735342ae243e590a1087ce44ab75d11cad469bac193b61d70f32b0eba9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:00.387383Z","signature_b64":"bKABqpMKovyhoOQyyMtcgqrSakraOEsng0inO4OgkuPJEwYOSIrbVZDoBgWIeyF+Jx8mbThehadovOifWu18Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31c4ce2ad7c4e7f33bbb62bb5ca0ffc15a714b30fcc2aa5c7f6ffb2d77ae8964","last_reissued_at":"2026-07-05T00:18:00.387032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:00.387032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalised multilevel Picard approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.AP","math.PR"],"primary_cat":"math.NA","authors_text":"Arnulf Jentzen, Michael B. Giles, Timo Welti","submitted_at":"2019-11-08T11:18:27Z","abstract_excerpt":"It is one of the most challenging problems in applied mathematics to approximatively solve high-dimensional partial differential equations (PDEs). In particular, most of the numerical approximation schemes studied in the scientific literature suffer under the curse of dimensionality in the sense that the number of computational operations needed to compute an approximation with an error of size at most $ \\varepsilon > 0 $ grows at least exponentially in the PDE dimension $ d \\in \\mathbb{N} $ or in the reciprocal of $ \\varepsilon $. Recently, so-called full-history recursive multilevel Picard ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.03188","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.03188/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.03188","created_at":"2026-07-05T00:18:00.387088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.03188v1","created_at":"2026-07-05T00:18:00.387088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03188","created_at":"2026-07-05T00:18:00.387088+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHCM4KWXYTT7","created_at":"2026-07-05T00:18:00.387088+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHCM4KWXYTT7GO53","created_at":"2026-07-05T00:18:00.387088+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHCM4KWX","created_at":"2026-07-05T00:18:00.387088+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.13722","citing_title":"Deep neural networks with ReLU, leaky ReLU, and softplus activation provably overcome the curse of dimensionality for Kolmogorov partial differential equations with Lipschitz nonlinearities in the $L^","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF","json":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF.json","graph_json":"https://pith.science/api/pith-number/GHCM4KWXYTT7GO53MK5VZIH7YF/graph.json","events_json":"https://pith.science/api/pith-number/GHCM4KWXYTT7GO53MK5VZIH7YF/events.json","paper":"https://pith.science/paper/GHCM4KWX"},"agent_actions":{"view_html":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF","download_json":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF.json","view_paper":"https://pith.science/paper/GHCM4KWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.03188&json=true","fetch_graph":"https://pith.science/api/pith-number/GHCM4KWXYTT7GO53MK5VZIH7YF/graph.json","fetch_events":"https://pith.science/api/pith-number/GHCM4KWXYTT7GO53MK5VZIH7YF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF/action/storage_attestation","attest_author":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF/action/author_attestation","sign_citation":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF/action/citation_signature","submit_replication":"https://pith.science/pith/GHCM4KWXYTT7GO53MK5VZIH7YF/action/replication_record"}},"created_at":"2026-07-05T00:18:00.387088+00:00","updated_at":"2026-07-05T00:18:00.387088+00:00"}