{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MIVYPTXPPUQJ3VGKTNPSAR2TL7","short_pith_number":"pith:MIVYPTXP","schema_version":"1.0","canonical_sha256":"622b87ceef7d209dd4ca9b5f2047535fca72402cc1bee69b6ffe7d2f60394429","source":{"kind":"arxiv","id":"2607.04278","version":1},"attestation_state":"computed","paper":{"title":"Deep Learning for Dynamic Programming with Recursive Utility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.EM","math.OC","stat.ML"],"primary_cat":"q-fin.CP","authors_text":"Wu Guo, Xianhua Peng","submitted_at":"2026-07-05T12:43:03Z","abstract_excerpt":"We propose the first deep learning algorithm, the Certainty Equivalent Learning (CEL) algorithm, for solving high-dimensional discrete-time dynamic programming problems with recursive utility. Dynamic programming with recursive utility is numerically challenging because the recursive utility does not have an explicit representation and the Bellman equation contains a certainty equivalent that is difficult to evaluate. The CEL algorithm learns this certainty-equivalent value directly with neural networks and jointly approximates value functions, policy functions, and certainty-equivalent functi"},"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":"2607.04278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2026-07-05T12:43:03Z","cross_cats_sorted":["cs.LG","econ.EM","math.OC","stat.ML"],"title_canon_sha256":"44c7e28834a7c96fb74d458cf2471cbed2cf416845a9c53f51ebbc6556079a01","abstract_canon_sha256":"434504e5957b110bc53c151126086530de30e1fcff0210de4959c5941ff89b2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:06.720639Z","signature_b64":"HPbjo3sOTJrwwwvt9ynTnCEl2ceVOv00sM0Iiw0507WyiZKSWyXwO/Dp2e/qdoVBNzPNEO2ecZVTD5UOO+hADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"622b87ceef7d209dd4ca9b5f2047535fca72402cc1bee69b6ffe7d2f60394429","last_reissued_at":"2026-07-07T02:19:06.719874Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:06.719874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning for Dynamic Programming with Recursive Utility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.EM","math.OC","stat.ML"],"primary_cat":"q-fin.CP","authors_text":"Wu Guo, Xianhua Peng","submitted_at":"2026-07-05T12:43:03Z","abstract_excerpt":"We propose the first deep learning algorithm, the Certainty Equivalent Learning (CEL) algorithm, for solving high-dimensional discrete-time dynamic programming problems with recursive utility. Dynamic programming with recursive utility is numerically challenging because the recursive utility does not have an explicit representation and the Bellman equation contains a certainty equivalent that is difficult to evaluate. The CEL algorithm learns this certainty-equivalent value directly with neural networks and jointly approximates value functions, policy functions, and certainty-equivalent functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04278","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/2607.04278/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":"2607.04278","created_at":"2026-07-07T02:19:06.719985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04278v1","created_at":"2026-07-07T02:19:06.719985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04278","created_at":"2026-07-07T02:19:06.719985+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIVYPTXPPUQJ","created_at":"2026-07-07T02:19:06.719985+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIVYPTXPPUQJ3VGK","created_at":"2026-07-07T02:19:06.719985+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIVYPTXP","created_at":"2026-07-07T02:19:06.719985+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/MIVYPTXPPUQJ3VGKTNPSAR2TL7","json":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7.json","graph_json":"https://pith.science/api/pith-number/MIVYPTXPPUQJ3VGKTNPSAR2TL7/graph.json","events_json":"https://pith.science/api/pith-number/MIVYPTXPPUQJ3VGKTNPSAR2TL7/events.json","paper":"https://pith.science/paper/MIVYPTXP"},"agent_actions":{"view_html":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7","download_json":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7.json","view_paper":"https://pith.science/paper/MIVYPTXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04278&json=true","fetch_graph":"https://pith.science/api/pith-number/MIVYPTXPPUQJ3VGKTNPSAR2TL7/graph.json","fetch_events":"https://pith.science/api/pith-number/MIVYPTXPPUQJ3VGKTNPSAR2TL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/action/storage_attestation","attest_author":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/action/author_attestation","sign_citation":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/action/citation_signature","submit_replication":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/action/replication_record"}},"created_at":"2026-07-07T02:19:06.719985+00:00","updated_at":"2026-07-07T02:19:06.719985+00:00"}