{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MIVYPTXPPUQJ3VGKTNPSAR2TL7","short_pith_number":"pith:MIVYPTXP","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"},"canonical_sha256":"622b87ceef7d209dd4ca9b5f2047535fca72402cc1bee69b6ffe7d2f60394429","source":{"kind":"arxiv","id":"2607.04278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04278","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04278v1","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04278","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"MIVYPTXPPUQJ","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"pith_short_16","alias_value":"MIVYPTXPPUQJ3VGK","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"pith_short_8","alias_value":"MIVYPTXP","created_at":"2026-07-07T02:19:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MIVYPTXPPUQJ3VGKTNPSAR2TL7","target":"record","payload":{"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"},"canonical_sha256":"622b87ceef7d209dd4ca9b5f2047535fca72402cc1bee69b6ffe7d2f60394429","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"},"source_kind":"arxiv","source_id":"2607.04278","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-07T02:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNDVdIcSwxAMXW+EgtcSO/16UhJF/EryoShEdDPH/Q9qTbGVzAYc0Ike8+Ykp5qHYIS9XtCCNtiLMsgqnGQiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-23T12:05:22.426899Z"},"content_sha256":"c0e65c80f1fdeb688f10184cd104ba4bf9dfc7d249e9c9dedcbee5a257d90c76","schema_version":"1.0","event_id":"sha256:c0e65c80f1fdeb688f10184cd104ba4bf9dfc7d249e9c9dedcbee5a257d90c76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MIVYPTXPPUQJ3VGKTNPSAR2TL7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-07T02:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sD434z6Mo7OJlKeP8lLGJjnDjiHDNhnGBle2IG4nj4zo/PUcCVHTRTk5ZJdNUEtqsUoh2I+urpkpFoRIwcLODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-23T12:05:22.427262Z"},"content_sha256":"e66c98658f25ccd3c0acd60c0530838f45425ba28a63f55ddd29a4d3e7fc2f14","schema_version":"1.0","event_id":"sha256:e66c98658f25ccd3c0acd60c0530838f45425ba28a63f55ddd29a4d3e7fc2f14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/bundle.json","state_url":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-23T12:05:22Z","links":{"resolver":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7","bundle":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/bundle.json","state":"https://pith.science/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIVYPTXPPUQJ3VGKTNPSAR2TL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MIVYPTXPPUQJ3VGKTNPSAR2TL7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"434504e5957b110bc53c151126086530de30e1fcff0210de4959c5941ff89b2e","cross_cats_sorted":["cs.LG","econ.EM","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2026-07-05T12:43:03Z","title_canon_sha256":"44c7e28834a7c96fb74d458cf2471cbed2cf416845a9c53f51ebbc6556079a01"},"schema_version":"1.0","source":{"id":"2607.04278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04278","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04278v1","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04278","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"MIVYPTXPPUQJ","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"pith_short_16","alias_value":"MIVYPTXPPUQJ3VGK","created_at":"2026-07-07T02:19:06Z"},{"alias_kind":"pith_short_8","alias_value":"MIVYPTXP","created_at":"2026-07-07T02:19:06Z"}],"graph_snapshots":[{"event_id":"sha256:e66c98658f25ccd3c0acd60c0530838f45425ba28a63f55ddd29a4d3e7fc2f14","target":"graph","created_at":"2026-07-07T02:19:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.04278/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Wu Guo, Xianhua Peng","cross_cats":["cs.LG","econ.EM","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2026-07-05T12:43:03Z","title":"Deep Learning for Dynamic Programming with Recursive Utility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04278","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c0e65c80f1fdeb688f10184cd104ba4bf9dfc7d249e9c9dedcbee5a257d90c76","target":"record","created_at":"2026-07-07T02:19:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"434504e5957b110bc53c151126086530de30e1fcff0210de4959c5941ff89b2e","cross_cats_sorted":["cs.LG","econ.EM","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2026-07-05T12:43:03Z","title_canon_sha256":"44c7e28834a7c96fb74d458cf2471cbed2cf416845a9c53f51ebbc6556079a01"},"schema_version":"1.0","source":{"id":"2607.04278","kind":"arxiv","version":1}},"canonical_sha256":"622b87ceef7d209dd4ca9b5f2047535fca72402cc1bee69b6ffe7d2f60394429","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"622b87ceef7d209dd4ca9b5f2047535fca72402cc1bee69b6ffe7d2f60394429","first_computed_at":"2026-07-07T02:19:06.719874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:06.719874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HPbjo3sOTJrwwwvt9ynTnCEl2ceVOv00sM0Iiw0507WyiZKSWyXwO/Dp2e/qdoVBNzPNEO2ecZVTD5UOO+hADw==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:06.720639Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0e65c80f1fdeb688f10184cd104ba4bf9dfc7d249e9c9dedcbee5a257d90c76","sha256:e66c98658f25ccd3c0acd60c0530838f45425ba28a63f55ddd29a4d3e7fc2f14"],"state_sha256":"b59e2c8f3e16a13dd43f0b66d990a2a91e6fe0dd2e44ec2e4e8b5b6cadfd60a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zHBNhLemlv/Mh/TSLowkFLHvSNQiUhanrFRYIbqJ1BLY5zBmF85BganQuhBsJw4JxNnlAet7LpQOqtNs38YAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-23T12:05:22.429781Z","bundle_sha256":"4c863e7fec73cf40f649cbf7e5354a63bd846d4d88c127662fb48316eff3e3bf"}}