{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GOCJHZMTWPXBU7T7WJ7D3AVIKB","short_pith_number":"pith:GOCJHZMT","schema_version":"1.0","canonical_sha256":"338493e593b3ee1a7e7fb27e3d82a850747c590cadf10a2769794595daf43e5a","source":{"kind":"arxiv","id":"2005.10206","version":2},"attestation_state":"computed","paper":{"title":"Numerical simulations for full history recursive multilevel Picard approximations for systems of high-dimensional partial differential equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Arnulf Jentzen, Martin Hutzenthaler, Philippe von Wurstemberger, Ramon Braunwarth, Sebastian Becker","submitted_at":"2020-05-20T17:10:58Z","abstract_excerpt":"One of the most challenging issues in applied mathematics is to develop and analyze algorithms which are able to approximately compute solutions of high-dimensional nonlinear partial differential equations (PDEs). In particular, it is very hard to develop approximation algorithms which do not suffer under the curse of dimensionality in the sense that the number of computational operations needed by the algorithm to compute an approximation of accuracy $\\epsilon > 0$ grows at most polynomially in both the reciprocal $1/\\epsilon$ of the required accuracy and the dimension $d \\in \\mathbb{N}$ of t"},"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":"2005.10206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-05-20T17:10:58Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c826947f72ce953b1ec766073792db363d3eb16902425684454d81a9e7922fc2","abstract_canon_sha256":"06d14cf545dc74e08fbae774212765b7e1e0eb72c6c6e735ce8f75d107155535"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:05.427637Z","signature_b64":"TGRxKWWCM0spZSkTkmyne9bdtQdQ9/qawfWMGFRUZX1Y1zwI7gfeB0ce5jJYsBT4YClJfkKV63pPqWXA/m+JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"338493e593b3ee1a7e7fb27e3d82a850747c590cadf10a2769794595daf43e5a","last_reissued_at":"2026-07-05T03:21:05.427211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:05.427211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical simulations for full history recursive multilevel Picard approximations for systems of high-dimensional partial differential equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Arnulf Jentzen, Martin Hutzenthaler, Philippe von Wurstemberger, Ramon Braunwarth, Sebastian Becker","submitted_at":"2020-05-20T17:10:58Z","abstract_excerpt":"One of the most challenging issues in applied mathematics is to develop and analyze algorithms which are able to approximately compute solutions of high-dimensional nonlinear partial differential equations (PDEs). In particular, it is very hard to develop approximation algorithms which do not suffer under the curse of dimensionality in the sense that the number of computational operations needed by the algorithm to compute an approximation of accuracy $\\epsilon > 0$ grows at most polynomially in both the reciprocal $1/\\epsilon$ of the required accuracy and the dimension $d \\in \\mathbb{N}$ of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.10206","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.10206/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":"2005.10206","created_at":"2026-07-05T03:21:05.427271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.10206v2","created_at":"2026-07-05T03:21:05.427271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.10206","created_at":"2026-07-05T03:21:05.427271+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOCJHZMTWPXB","created_at":"2026-07-05T03:21:05.427271+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOCJHZMTWPXBU7T7","created_at":"2026-07-05T03:21:05.427271+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOCJHZMT","created_at":"2026-07-05T03:21:05.427271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22150","citing_title":"Parameterized Representations via Implicit Stochastic Modulation for High-Dimensional and High-Order Neural PDE Solvers","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09361","citing_title":"Stochastic-Dimension Frozen Sampled Neural Network for High-Dimensional Gross-Pitaevskii Equations on Unbounded Domains","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB","json":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB.json","graph_json":"https://pith.science/api/pith-number/GOCJHZMTWPXBU7T7WJ7D3AVIKB/graph.json","events_json":"https://pith.science/api/pith-number/GOCJHZMTWPXBU7T7WJ7D3AVIKB/events.json","paper":"https://pith.science/paper/GOCJHZMT"},"agent_actions":{"view_html":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB","download_json":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB.json","view_paper":"https://pith.science/paper/GOCJHZMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.10206&json=true","fetch_graph":"https://pith.science/api/pith-number/GOCJHZMTWPXBU7T7WJ7D3AVIKB/graph.json","fetch_events":"https://pith.science/api/pith-number/GOCJHZMTWPXBU7T7WJ7D3AVIKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB/action/storage_attestation","attest_author":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB/action/author_attestation","sign_citation":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB/action/citation_signature","submit_replication":"https://pith.science/pith/GOCJHZMTWPXBU7T7WJ7D3AVIKB/action/replication_record"}},"created_at":"2026-07-05T03:21:05.427271+00:00","updated_at":"2026-07-05T03:21:05.427271+00:00"}