{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EXOWJJHNQ2FFLNVIQ3ZF4SUXB4","short_pith_number":"pith:EXOWJJHN","canonical_record":{"source":{"id":"1702.00880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-03T00:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"2a06bca506d37404db892109c7e029964645a4dfc46b4c96d77755d289b280b0","abstract_canon_sha256":"1753b4fd158d80b7a69adaa970259378a1817e285cf06949e3abdca39e99f8b5"},"schema_version":"1.0"},"canonical_sha256":"25dd64a4ed868a55b6a886f25e4a970f110ca5ec5e8610ddf3f836801ace8a28","source":{"kind":"arxiv","id":"1702.00880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00880","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00880v1","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00880","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"EXOWJJHNQ2FF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EXOWJJHNQ2FFLNVI","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EXOWJJHN","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EXOWJJHNQ2FFLNVIQ3ZF4SUXB4","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-03T00:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"2a06bca506d37404db892109c7e029964645a4dfc46b4c96d77755d289b280b0","abstract_canon_sha256":"1753b4fd158d80b7a69adaa970259378a1817e285cf06949e3abdca39e99f8b5"},"schema_version":"1.0"},"canonical_sha256":"25dd64a4ed868a55b6a886f25e4a970f110ca5ec5e8610ddf3f836801ace8a28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:29.525774Z","signature_b64":"B33ju6ddCQHl34inwVenlsLtD503DdHEHtrtxPqlRd3GvZdxg3ruvXYlJxwrmx63aHJHj/BUHw8Gi3Yd7vwqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25dd64a4ed868a55b6a886f25e4a970f110ca5ec5e8610ddf3f836801ace8a28","last_reissued_at":"2026-05-18T00:51:29.525304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:29.525304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00880","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:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIG1A6FOnxzQdELmL14sXS7d2eMYIBXUE+I7q1i041hRb3H7m7K407w//INdT2grv9hcLOg8A20trUKF1h8gCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:28:32.736006Z"},"content_sha256":"84a34fe246c97dce51b2413242c9514bdc58f49a046f99782679e3fad14937d4","schema_version":"1.0","event_id":"sha256:84a34fe246c97dce51b2413242c9514bdc58f49a046f99782679e3fad14937d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EXOWJJHNQ2FFLNVIQ3ZF4SUXB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrew Eberhard, Brian Dandurand, James Luedtke, Jeff Linderoth, Jeffrey Christiansen, Natashia Boland","submitted_at":"2017-02-03T00:38:28Z","abstract_excerpt":"We present a new primal-dual algorithm for computing the value of the Lagrangian dual of a stochastic mixed-integer program (SMIP) formed by relaxing its nonanticipativity constraints. This dual is widely used in decomposition methods for the solution of SMIPs. The algorithm relies on the well-known progressive hedging method, but unlike previous progressive hedging approaches for SMIP, our algorithm can be shown to converge to the optimal Lagrangian dual value. The key improvement in the new algorithm is an inner loop of optimized linearization steps, similar to those taken in the classical F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00880","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:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whM3RFHcBfK7W/w0EOAdphkszQTxfe+N5eQetbDTyjJN76ODw0YZ5s8uaKkRiaBYms6321pblWfSKg3rVwIfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:28:32.736786Z"},"content_sha256":"ca7aa41aec30818c3da8eaf42c00b941bda5eb42c42d284354879b8a9a64e78b","schema_version":"1.0","event_id":"sha256:ca7aa41aec30818c3da8eaf42c00b941bda5eb42c42d284354879b8a9a64e78b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXOWJJHNQ2FFLNVIQ3ZF4SUXB4/bundle.json","state_url":"https://pith.science/pith/EXOWJJHNQ2FFLNVIQ3ZF4SUXB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXOWJJHNQ2FFLNVIQ3ZF4SUXB4/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-31T16:28:32Z","links":{"resolver":"https://pith.science/pith/EXOWJJHNQ2FFLNVIQ3ZF4SUXB4","bundle":"https://pith.science/pith/EXOWJJHNQ2FFLNVIQ3ZF4SUXB4/bundle.json","state":"https://pith.science/pith/EXOWJJHNQ2FFLNVIQ3ZF4SUXB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXOWJJHNQ2FFLNVIQ3ZF4SUXB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EXOWJJHNQ2FFLNVIQ3ZF4SUXB4","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":"1753b4fd158d80b7a69adaa970259378a1817e285cf06949e3abdca39e99f8b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-03T00:38:28Z","title_canon_sha256":"2a06bca506d37404db892109c7e029964645a4dfc46b4c96d77755d289b280b0"},"schema_version":"1.0","source":{"id":"1702.00880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00880","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00880v1","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00880","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"EXOWJJHNQ2FF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EXOWJJHNQ2FFLNVI","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EXOWJJHN","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:ca7aa41aec30818c3da8eaf42c00b941bda5eb42c42d284354879b8a9a64e78b","target":"graph","created_at":"2026-05-18T00:51:29Z","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 present a new primal-dual algorithm for computing the value of the Lagrangian dual of a stochastic mixed-integer program (SMIP) formed by relaxing its nonanticipativity constraints. This dual is widely used in decomposition methods for the solution of SMIPs. The algorithm relies on the well-known progressive hedging method, but unlike previous progressive hedging approaches for SMIP, our algorithm can be shown to converge to the optimal Lagrangian dual value. The key improvement in the new algorithm is an inner loop of optimized linearization steps, similar to those taken in the classical F","authors_text":"Andrew Eberhard, Brian Dandurand, James Luedtke, Jeff Linderoth, Jeffrey Christiansen, Natashia Boland","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-03T00:38:28Z","title":"Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00880","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:84a34fe246c97dce51b2413242c9514bdc58f49a046f99782679e3fad14937d4","target":"record","created_at":"2026-05-18T00:51:29Z","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":"1753b4fd158d80b7a69adaa970259378a1817e285cf06949e3abdca39e99f8b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-03T00:38:28Z","title_canon_sha256":"2a06bca506d37404db892109c7e029964645a4dfc46b4c96d77755d289b280b0"},"schema_version":"1.0","source":{"id":"1702.00880","kind":"arxiv","version":1}},"canonical_sha256":"25dd64a4ed868a55b6a886f25e4a970f110ca5ec5e8610ddf3f836801ace8a28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25dd64a4ed868a55b6a886f25e4a970f110ca5ec5e8610ddf3f836801ace8a28","first_computed_at":"2026-05-18T00:51:29.525304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:29.525304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B33ju6ddCQHl34inwVenlsLtD503DdHEHtrtxPqlRd3GvZdxg3ruvXYlJxwrmx63aHJHj/BUHw8Gi3Yd7vwqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:29.525774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84a34fe246c97dce51b2413242c9514bdc58f49a046f99782679e3fad14937d4","sha256:ca7aa41aec30818c3da8eaf42c00b941bda5eb42c42d284354879b8a9a64e78b"],"state_sha256":"3c71505a0f428bd25c20bfd57be3844ba63c4e6595d52ba581e2a466746fb79f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHw7xN9YZoOfJzEu9rVDmqESGl2qKgmcD7syiOpwq6xvlq7JmDZL3N2qZqonRVy26i7rrBOUsg75ZW1pNvsjBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:28:32.740869Z","bundle_sha256":"9a76e0a6e2ba04ef3497f3c63e71a23078cbe0de9902e9c9f3235b3e7f012698"}}