{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TMHXU4H5TLVH3OAYUCGKED3B6U","short_pith_number":"pith:TMHXU4H5","canonical_record":{"source":{"id":"1707.00812","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-04T04:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"0c4573fe42722309942a93fbe18bbdfc42dba2f326ab2ba3b75b850a946524b1","abstract_canon_sha256":"e40094f1ebf20d28317c14e4a31c9c9d75fdf161bc00e63359c1c43f59dac601"},"schema_version":"1.0"},"canonical_sha256":"9b0f7a70fd9aea7db818a08ca20f61f5211c29f899ca498bc09d6e7a45053b27","source":{"kind":"arxiv","id":"1707.00812","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00812","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00812v4","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00812","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"TMHXU4H5TLVH","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TMHXU4H5TLVH3OAY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TMHXU4H5","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TMHXU4H5TLVH3OAYUCGKED3B6U","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00812","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-04T04:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"0c4573fe42722309942a93fbe18bbdfc42dba2f326ab2ba3b75b850a946524b1","abstract_canon_sha256":"e40094f1ebf20d28317c14e4a31c9c9d75fdf161bc00e63359c1c43f59dac601"},"schema_version":"1.0"},"canonical_sha256":"9b0f7a70fd9aea7db818a08ca20f61f5211c29f899ca498bc09d6e7a45053b27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.523163Z","signature_b64":"HhK4If3KjZOYttXqXRbDJ3e5mw+DJONrxDkqLOt+nYLUn48prUVJbEDA826nahrq99hmUDl3uCJ1ExVKuylTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b0f7a70fd9aea7db818a08ca20f61f5211c29f899ca498bc09d6e7a45053b27","last_reissued_at":"2026-05-18T00:29:51.522679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.522679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00812","source_version":4,"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-05-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SeDYshPCy2mhh2IjTL6N063DbodxbCg/WxQYz3+WqnqZuCAAWNxGP7x65ErKlPj5kwIQ/f1ZxKa1VrBlLIlHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:24:10.774827Z"},"content_sha256":"0571f29c697943c56f505b8f07ac6ebbd89416a27d907c85f568b426329c8426","schema_version":"1.0","event_id":"sha256:0571f29c697943c56f505b8f07ac6ebbd89416a27d907c85f568b426329c8426"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TMHXU4H5TLVH3OAYUCGKED3B6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inexact cuts for Deterministic and Stochastic Dual Dynamic Programming applied to convex nonlinear optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Vincent Guigues","submitted_at":"2017-07-04T04:02:04Z","abstract_excerpt":"We introduce an extension of Dual Dynamic Programming (DDP) to solve convex nonlinear dynamic programming equations. We call Inexact DDP (IDDP) this extension which applies to situations where some or all primal and dual subproblems to be solved along the iterations of the method are solved with a bounded error. We show that any accumulation point of the sequence of decisions is an approximate solution to the dynamic programming equations. When these errors tend to zero as the number of iterations goes to infinity, we show that IDDP solves the dynamic programming equations. We extend the analy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00812","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUBOvHaoPKScVHEXJX+gELvKKpZAKw/RekOyB8EzdnFoGZBFp/weceRrOv9GdEJO+TPfAnGcw4TEKCaDySAJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:24:10.775665Z"},"content_sha256":"9f3b6ca573a71f9db33ae93436fa2178a70e04cb52fd6a1c44e905cc580d6498","schema_version":"1.0","event_id":"sha256:9f3b6ca573a71f9db33ae93436fa2178a70e04cb52fd6a1c44e905cc580d6498"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMHXU4H5TLVH3OAYUCGKED3B6U/bundle.json","state_url":"https://pith.science/pith/TMHXU4H5TLVH3OAYUCGKED3B6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMHXU4H5TLVH3OAYUCGKED3B6U/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-05-31T05:24:10Z","links":{"resolver":"https://pith.science/pith/TMHXU4H5TLVH3OAYUCGKED3B6U","bundle":"https://pith.science/pith/TMHXU4H5TLVH3OAYUCGKED3B6U/bundle.json","state":"https://pith.science/pith/TMHXU4H5TLVH3OAYUCGKED3B6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMHXU4H5TLVH3OAYUCGKED3B6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TMHXU4H5TLVH3OAYUCGKED3B6U","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":"e40094f1ebf20d28317c14e4a31c9c9d75fdf161bc00e63359c1c43f59dac601","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-04T04:02:04Z","title_canon_sha256":"0c4573fe42722309942a93fbe18bbdfc42dba2f326ab2ba3b75b850a946524b1"},"schema_version":"1.0","source":{"id":"1707.00812","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00812","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00812v4","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00812","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"TMHXU4H5TLVH","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TMHXU4H5TLVH3OAY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TMHXU4H5","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:9f3b6ca573a71f9db33ae93436fa2178a70e04cb52fd6a1c44e905cc580d6498","target":"graph","created_at":"2026-05-18T00:29:51Z","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"},"paper":{"abstract_excerpt":"We introduce an extension of Dual Dynamic Programming (DDP) to solve convex nonlinear dynamic programming equations. We call Inexact DDP (IDDP) this extension which applies to situations where some or all primal and dual subproblems to be solved along the iterations of the method are solved with a bounded error. We show that any accumulation point of the sequence of decisions is an approximate solution to the dynamic programming equations. When these errors tend to zero as the number of iterations goes to infinity, we show that IDDP solves the dynamic programming equations. We extend the analy","authors_text":"Vincent Guigues","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-04T04:02:04Z","title":"Inexact cuts for Deterministic and Stochastic Dual Dynamic Programming applied to convex nonlinear optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00812","kind":"arxiv","version":4},"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:0571f29c697943c56f505b8f07ac6ebbd89416a27d907c85f568b426329c8426","target":"record","created_at":"2026-05-18T00:29:51Z","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":"e40094f1ebf20d28317c14e4a31c9c9d75fdf161bc00e63359c1c43f59dac601","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-04T04:02:04Z","title_canon_sha256":"0c4573fe42722309942a93fbe18bbdfc42dba2f326ab2ba3b75b850a946524b1"},"schema_version":"1.0","source":{"id":"1707.00812","kind":"arxiv","version":4}},"canonical_sha256":"9b0f7a70fd9aea7db818a08ca20f61f5211c29f899ca498bc09d6e7a45053b27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b0f7a70fd9aea7db818a08ca20f61f5211c29f899ca498bc09d6e7a45053b27","first_computed_at":"2026-05-18T00:29:51.522679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:51.522679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HhK4If3KjZOYttXqXRbDJ3e5mw+DJONrxDkqLOt+nYLUn48prUVJbEDA826nahrq99hmUDl3uCJ1ExVKuylTDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:51.523163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00812","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0571f29c697943c56f505b8f07ac6ebbd89416a27d907c85f568b426329c8426","sha256:9f3b6ca573a71f9db33ae93436fa2178a70e04cb52fd6a1c44e905cc580d6498"],"state_sha256":"f24ace61a1d14d9ce4b8c66ac04702b2a09eac620832247250a265a879b61e6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BGYmsRu7blYvTUINmTLG7K4Dbc9f/ys5E7JkEteg1jvZEHppvF5M+AeyDXZXg79k70+Nd9MOp/GKLNYR1UDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:24:10.779508Z","bundle_sha256":"7090bae7ff17d8236c79419a321e39147e4615d978143407264df11696d7d213"}}