{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JGKOW3SVUASKUS4LORCKVTG7B4","short_pith_number":"pith:JGKOW3SV","canonical_record":{"source":{"id":"2401.15901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-29T06:00:27Z","cross_cats_sorted":[],"title_canon_sha256":"fef32d68d7bfd46a7b59070925139707bf3a8474e33aac9a9d82aba667c1f858","abstract_canon_sha256":"213e3b6fc00bf28dde90b7b47a728da2db0beb2d5225d9e2e62c89a7b129d913"},"schema_version":"1.0"},"canonical_sha256":"4994eb6e55a024aa4b8b7444aaccdf0f282d5094a66c9efe7c2ec428a21541d8","source":{"kind":"arxiv","id":"2401.15901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.15901","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"arxiv_version","alias_value":"2401.15901v1","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15901","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"pith_short_12","alias_value":"JGKOW3SVUASK","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"pith_short_16","alias_value":"JGKOW3SVUASKUS4L","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"pith_short_8","alias_value":"JGKOW3SV","created_at":"2026-07-05T07:38:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JGKOW3SVUASKUS4LORCKVTG7B4","target":"record","payload":{"canonical_record":{"source":{"id":"2401.15901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-29T06:00:27Z","cross_cats_sorted":[],"title_canon_sha256":"fef32d68d7bfd46a7b59070925139707bf3a8474e33aac9a9d82aba667c1f858","abstract_canon_sha256":"213e3b6fc00bf28dde90b7b47a728da2db0beb2d5225d9e2e62c89a7b129d913"},"schema_version":"1.0"},"canonical_sha256":"4994eb6e55a024aa4b8b7444aaccdf0f282d5094a66c9efe7c2ec428a21541d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:41.180760Z","signature_b64":"4YQpQnMiz1k55y9OVVvmNGl1Bqe41di+R8scl8Te9YYO2wocowEM1Cti56BvEGvYIu1EQIe1p6BVB0op8AuuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4994eb6e55a024aa4b8b7444aaccdf0f282d5094a66c9efe7c2ec428a21541d8","last_reissued_at":"2026-07-05T07:38:41.180366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:41.180366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.15901","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-05T07:38:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yer4BUoHlm2Z4SeXY3bE7tTXyxyqx8Tt7utiESVhueQjH/2kB7K1TXoamLdrozN62EIKi0c1inOOR7TI7nXpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:34:03.160548Z"},"content_sha256":"7bfaf7ac65f30d7863fa703e508f316768b9468600dfd01b9058da1edeff14b4","schema_version":"1.0","event_id":"sha256:7bfaf7ac65f30d7863fa703e508f316768b9468600dfd01b9058da1edeff14b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JGKOW3SVUASKUS4LORCKVTG7B4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gao Chuanhou, Luo Xiaoyu","submitted_at":"2024-01-29T06:00:27Z","abstract_excerpt":"We propose to generate Lagrangian cut for two-stage stochastic integer program by batch, in contrast to the existing methods which solve each Lagrangian subproblem at every iteration. We establish two convergence properties of the proposed algorithm. Then we demonstrate that the improvement in the lower bound achieved by incorporating the Lagrangian cut adheres to the `triangle inequality', thereby showcasing the superiority of our proposed method over existing approaches. Moreover, we suggest acquiring Lagrangian cuts for unresolved scenarios by averaging the coefficients of the acquired Lagr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15901","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/2401.15901/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-05T07:38:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CIh3IeykOWnlj+IiGl6q9NnVD6N3VSkIx2KePiOy+Z1vAjBhqhEZOKSlUlHPRi95PT9LAHvx06HhAuyVF+RhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:34:03.161069Z"},"content_sha256":"e6b8eaad497fb6f692fe8dd240042f4a9ec3148081e8a0bde69bd0c235162b99","schema_version":"1.0","event_id":"sha256:e6b8eaad497fb6f692fe8dd240042f4a9ec3148081e8a0bde69bd0c235162b99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGKOW3SVUASKUS4LORCKVTG7B4/bundle.json","state_url":"https://pith.science/pith/JGKOW3SVUASKUS4LORCKVTG7B4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGKOW3SVUASKUS4LORCKVTG7B4/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-08-05T10:34:03Z","links":{"resolver":"https://pith.science/pith/JGKOW3SVUASKUS4LORCKVTG7B4","bundle":"https://pith.science/pith/JGKOW3SVUASKUS4LORCKVTG7B4/bundle.json","state":"https://pith.science/pith/JGKOW3SVUASKUS4LORCKVTG7B4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGKOW3SVUASKUS4LORCKVTG7B4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JGKOW3SVUASKUS4LORCKVTG7B4","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":"213e3b6fc00bf28dde90b7b47a728da2db0beb2d5225d9e2e62c89a7b129d913","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-29T06:00:27Z","title_canon_sha256":"fef32d68d7bfd46a7b59070925139707bf3a8474e33aac9a9d82aba667c1f858"},"schema_version":"1.0","source":{"id":"2401.15901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.15901","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"arxiv_version","alias_value":"2401.15901v1","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15901","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"pith_short_12","alias_value":"JGKOW3SVUASK","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"pith_short_16","alias_value":"JGKOW3SVUASKUS4L","created_at":"2026-07-05T07:38:41Z"},{"alias_kind":"pith_short_8","alias_value":"JGKOW3SV","created_at":"2026-07-05T07:38:41Z"}],"graph_snapshots":[{"event_id":"sha256:e6b8eaad497fb6f692fe8dd240042f4a9ec3148081e8a0bde69bd0c235162b99","target":"graph","created_at":"2026-07-05T07:38:41Z","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/2401.15901/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose to generate Lagrangian cut for two-stage stochastic integer program by batch, in contrast to the existing methods which solve each Lagrangian subproblem at every iteration. We establish two convergence properties of the proposed algorithm. Then we demonstrate that the improvement in the lower bound achieved by incorporating the Lagrangian cut adheres to the `triangle inequality', thereby showcasing the superiority of our proposed method over existing approaches. Moreover, we suggest acquiring Lagrangian cuts for unresolved scenarios by averaging the coefficients of the acquired Lagr","authors_text":"Gao Chuanhou, Luo Xiaoyu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-29T06:00:27Z","title":"Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15901","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:7bfaf7ac65f30d7863fa703e508f316768b9468600dfd01b9058da1edeff14b4","target":"record","created_at":"2026-07-05T07:38:41Z","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":"213e3b6fc00bf28dde90b7b47a728da2db0beb2d5225d9e2e62c89a7b129d913","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-29T06:00:27Z","title_canon_sha256":"fef32d68d7bfd46a7b59070925139707bf3a8474e33aac9a9d82aba667c1f858"},"schema_version":"1.0","source":{"id":"2401.15901","kind":"arxiv","version":1}},"canonical_sha256":"4994eb6e55a024aa4b8b7444aaccdf0f282d5094a66c9efe7c2ec428a21541d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4994eb6e55a024aa4b8b7444aaccdf0f282d5094a66c9efe7c2ec428a21541d8","first_computed_at":"2026-07-05T07:38:41.180366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:38:41.180366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4YQpQnMiz1k55y9OVVvmNGl1Bqe41di+R8scl8Te9YYO2wocowEM1Cti56BvEGvYIu1EQIe1p6BVB0op8AuuDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:38:41.180760Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.15901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bfaf7ac65f30d7863fa703e508f316768b9468600dfd01b9058da1edeff14b4","sha256:e6b8eaad497fb6f692fe8dd240042f4a9ec3148081e8a0bde69bd0c235162b99"],"state_sha256":"37b984070c003ec2fc47a0d31e0eb4ab082cb6358d5b26bb20f6baaa586d5bdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cO+o3ewiv1Rtav65xATFVGrV3yFIvlXxRadSWPmGd6yJA8q8sC5pqkbFdvQM/3xRI6F44q/02pKo2sOrhEMJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T10:34:03.165152Z","bundle_sha256":"369b9e67cc04bd52cbe35ab0f5d699c5314f2f69dc8143337b3c51e5449e5c61"}}