{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OM5RBP4RV64TWEKS7MK5ZGAKL5","short_pith_number":"pith:OM5RBP4R","schema_version":"1.0","canonical_sha256":"733b10bf91afb93b1152fb15dc980a5f61a35d6a37b7ff7967f67109231eddab","source":{"kind":"arxiv","id":"1809.02362","version":3},"attestation_state":"computed","paper":{"title":"A proof that artificial neural networks overcome the curse of dimensionality in the numerical approximation of Black-Scholes partial differential equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.PR","q-fin.MF"],"primary_cat":"math.NA","authors_text":"Arnulf Jentzen, Fabian Hornung, Philippe von Wurstemberger, Philipp Grohs","submitted_at":"2018-09-07T09:03:55Z","abstract_excerpt":"Artificial neural networks (ANNs) have very successfully been used in numerical simulations for a series of computational problems ranging from image classification/image recognition, speech recognition, time series analysis, game intelligence, and computational advertising to numerical approximations of partial differential equations (PDEs). Such numerical simulations suggest that ANNs have the capacity to very efficiently approximate high-dimensional functions and, especially, indicate that ANNs seem to admit the fundamental power to overcome the curse of dimensionality when approximating th"},"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":"1809.02362","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-07T09:03:55Z","cross_cats_sorted":["cs.LG","cs.NA","math.PR","q-fin.MF"],"title_canon_sha256":"be6ace2fec49742819e74c5b22ca62070c411a863d37b2f29ac48a3726e79dfb","abstract_canon_sha256":"1017fd758d250546d2a6ba9c2c783d688cf425b262e6cc5d560b4ab4f6fc0ea9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:36:17.743447Z","signature_b64":"dQd7V5nKwBTC0JQW/y61qgPlV1GUWPp9PTK4FC8uo6dxH8dkF/fzX0jwyaNBWok6caPECNVZoEXrzW34twEYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"733b10bf91afb93b1152fb15dc980a5f61a35d6a37b7ff7967f67109231eddab","last_reissued_at":"2026-07-05T06:36:17.742910Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:36:17.742910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof that artificial neural networks overcome the curse of dimensionality in the numerical approximation of Black-Scholes partial differential equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.PR","q-fin.MF"],"primary_cat":"math.NA","authors_text":"Arnulf Jentzen, Fabian Hornung, Philippe von Wurstemberger, Philipp Grohs","submitted_at":"2018-09-07T09:03:55Z","abstract_excerpt":"Artificial neural networks (ANNs) have very successfully been used in numerical simulations for a series of computational problems ranging from image classification/image recognition, speech recognition, time series analysis, game intelligence, and computational advertising to numerical approximations of partial differential equations (PDEs). Such numerical simulations suggest that ANNs have the capacity to very efficiently approximate high-dimensional functions and, especially, indicate that ANNs seem to admit the fundamental power to overcome the curse of dimensionality when approximating th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02362","kind":"arxiv","version":3},"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/1809.02362/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":"1809.02362","created_at":"2026-07-05T06:36:17.742970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02362v3","created_at":"2026-07-05T06:36:17.742970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02362","created_at":"2026-07-05T06:36:17.742970+00:00"},{"alias_kind":"pith_short_12","alias_value":"OM5RBP4RV64T","created_at":"2026-07-05T06:36:17.742970+00:00"},{"alias_kind":"pith_short_16","alias_value":"OM5RBP4RV64TWEKS","created_at":"2026-07-05T06:36:17.742970+00:00"},{"alias_kind":"pith_short_8","alias_value":"OM5RBP4R","created_at":"2026-07-05T06:36:17.742970+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2112.14523","citing_title":"Deep neural network approximation theory for high-dimensional functions","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5","json":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5.json","graph_json":"https://pith.science/api/pith-number/OM5RBP4RV64TWEKS7MK5ZGAKL5/graph.json","events_json":"https://pith.science/api/pith-number/OM5RBP4RV64TWEKS7MK5ZGAKL5/events.json","paper":"https://pith.science/paper/OM5RBP4R"},"agent_actions":{"view_html":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5","download_json":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5.json","view_paper":"https://pith.science/paper/OM5RBP4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02362&json=true","fetch_graph":"https://pith.science/api/pith-number/OM5RBP4RV64TWEKS7MK5ZGAKL5/graph.json","fetch_events":"https://pith.science/api/pith-number/OM5RBP4RV64TWEKS7MK5ZGAKL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5/action/storage_attestation","attest_author":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5/action/author_attestation","sign_citation":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5/action/citation_signature","submit_replication":"https://pith.science/pith/OM5RBP4RV64TWEKS7MK5ZGAKL5/action/replication_record"}},"created_at":"2026-07-05T06:36:17.742970+00:00","updated_at":"2026-07-05T06:36:17.742970+00:00"}