{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YMILT3XQ4QBYDF4EX5S4DK5WJ3","short_pith_number":"pith:YMILT3XQ","canonical_record":{"source":{"id":"1705.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T19:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"476294c0982a106558753aa3bf4fdda975a6b3770fa7367f1dcd65cd0c69e2e9","abstract_canon_sha256":"63725d41e26f58a2afc8b83c347ef09e9bc797791cb6b4adbfbd882bbe8eb548"},"schema_version":"1.0"},"canonical_sha256":"c310b9eef0e403819784bf65c1abb64ec4fa5b058c39154540d5cdce781e4330","source":{"kind":"arxiv","id":"1705.08941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08941","created_at":"2026-05-18T00:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08941v1","created_at":"2026-05-18T00:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08941","created_at":"2026-05-18T00:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"YMILT3XQ4QBY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YMILT3XQ4QBYDF4E","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YMILT3XQ","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YMILT3XQ4QBYDF4EX5S4DK5WJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T19:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"476294c0982a106558753aa3bf4fdda975a6b3770fa7367f1dcd65cd0c69e2e9","abstract_canon_sha256":"63725d41e26f58a2afc8b83c347ef09e9bc797791cb6b4adbfbd882bbe8eb548"},"schema_version":"1.0"},"canonical_sha256":"c310b9eef0e403819784bf65c1abb64ec4fa5b058c39154540d5cdce781e4330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:42.886796Z","signature_b64":"w7ThJdmr8gc1FRNXYyBRfS2rQq8p74D8Wys8bdOBLcxVmuT4wbaBRo7/w7vjWjWbWpwzsSzZuqQ1+fSgfLONDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c310b9eef0e403819784bf65c1abb64ec4fa5b058c39154540d5cdce781e4330","last_reissued_at":"2026-05-18T00:43:42.886033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:42.886033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08941","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-05-18T00:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYVlwvsXNm5Q44OMofEZS7P5kPYIy1+d3IXlnyVpaXw+ggVba34lXHBvFABVs3fAlP8hdtxSPwhrv+PK8Rg4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:36:51.665107Z"},"content_sha256":"eae51c9cc1d27f408463f37eb10d9222ad0ac75c8a8c70f0f1087bcc9854d636","schema_version":"1.0","event_id":"sha256:eae51c9cc1d27f408463f37eb10d9222ad0ac75c8a8c70f0f1087bcc9854d636"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YMILT3XQ4QBYDF4EX5S4DK5WJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Dynamic Programming with cut selection: convergence proof and numerical experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Vincent Guigues","submitted_at":"2017-05-24T19:43:09Z","abstract_excerpt":"We consider convex optimization problems formulated using dynamic programming equations. Such problems can be solved using the Dual Dynamic Programming algorithm combined with the Level 1 cut selection strategy or the Territory algorithm to select the most relevant Benders cuts. We propose a limited memory variant of Level 1 and show the convergence of DDP combined with the Territory algorithm, Level 1 or its variant for nonlinear optimization problems. In the special case of linear programs, we show convergence in a finite number of iterations. Numerical simulations illustrate the interest of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08941","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":""},"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:43:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFYeNt6TLYwZn3lAqT1NRVQ2KJcX5vxSW6HFca3B1aAH9qbtkoa7Q1QeSKj0c9A0YZJCrdV6RKt8k1thkjihDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:36:51.665478Z"},"content_sha256":"10f3bd563611f03e4107d8cc05683cb18926359d6f1f79d3abee5136e8165943","schema_version":"1.0","event_id":"sha256:10f3bd563611f03e4107d8cc05683cb18926359d6f1f79d3abee5136e8165943"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/bundle.json","state_url":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/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-30T07:36:51Z","links":{"resolver":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3","bundle":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/bundle.json","state":"https://pith.science/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMILT3XQ4QBYDF4EX5S4DK5WJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YMILT3XQ4QBYDF4EX5S4DK5WJ3","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":"63725d41e26f58a2afc8b83c347ef09e9bc797791cb6b4adbfbd882bbe8eb548","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T19:43:09Z","title_canon_sha256":"476294c0982a106558753aa3bf4fdda975a6b3770fa7367f1dcd65cd0c69e2e9"},"schema_version":"1.0","source":{"id":"1705.08941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08941","created_at":"2026-05-18T00:43:42Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08941v1","created_at":"2026-05-18T00:43:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08941","created_at":"2026-05-18T00:43:42Z"},{"alias_kind":"pith_short_12","alias_value":"YMILT3XQ4QBY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YMILT3XQ4QBYDF4E","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YMILT3XQ","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:10f3bd563611f03e4107d8cc05683cb18926359d6f1f79d3abee5136e8165943","target":"graph","created_at":"2026-05-18T00:43:42Z","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 consider convex optimization problems formulated using dynamic programming equations. Such problems can be solved using the Dual Dynamic Programming algorithm combined with the Level 1 cut selection strategy or the Territory algorithm to select the most relevant Benders cuts. We propose a limited memory variant of Level 1 and show the convergence of DDP combined with the Territory algorithm, Level 1 or its variant for nonlinear optimization problems. In the special case of linear programs, we show convergence in a finite number of iterations. Numerical simulations illustrate the interest of","authors_text":"Vincent Guigues","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T19:43:09Z","title":"Dual Dynamic Programming with cut selection: convergence proof and numerical experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08941","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:eae51c9cc1d27f408463f37eb10d9222ad0ac75c8a8c70f0f1087bcc9854d636","target":"record","created_at":"2026-05-18T00:43:42Z","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":"63725d41e26f58a2afc8b83c347ef09e9bc797791cb6b4adbfbd882bbe8eb548","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-24T19:43:09Z","title_canon_sha256":"476294c0982a106558753aa3bf4fdda975a6b3770fa7367f1dcd65cd0c69e2e9"},"schema_version":"1.0","source":{"id":"1705.08941","kind":"arxiv","version":1}},"canonical_sha256":"c310b9eef0e403819784bf65c1abb64ec4fa5b058c39154540d5cdce781e4330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c310b9eef0e403819784bf65c1abb64ec4fa5b058c39154540d5cdce781e4330","first_computed_at":"2026-05-18T00:43:42.886033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:42.886033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w7ThJdmr8gc1FRNXYyBRfS2rQq8p74D8Wys8bdOBLcxVmuT4wbaBRo7/w7vjWjWbWpwzsSzZuqQ1+fSgfLONDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:42.886796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eae51c9cc1d27f408463f37eb10d9222ad0ac75c8a8c70f0f1087bcc9854d636","sha256:10f3bd563611f03e4107d8cc05683cb18926359d6f1f79d3abee5136e8165943"],"state_sha256":"57f7163f03bc5081463c464188ebaf48cda35c4637c9687c87a6b421f3743bf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebU9kaZXa/a3eOZz+KGEWlPMDmdNhF6V0hJ/lAuDIPnT7jvAYEN7PM8Q054u9NCR10JL/dPzGttv9nKJJTeXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:36:51.668542Z","bundle_sha256":"6ce2dc9f39289944aa10cdaf03dac3bf52194737e363a2124c634e53a151d157"}}