{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:KNZULSNGGYXCE6SGGOVLS3RYSM","short_pith_number":"pith:KNZULSNG","canonical_record":{"source":{"id":"2312.16445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-27T07:19:45Z","cross_cats_sorted":[],"title_canon_sha256":"cb3720e7769964c501a12352bb75e9f817498fe26af8a0cc6f2382c90f3e9051","abstract_canon_sha256":"63e721d002a00fa50b3eac1fe4113e65520460bb485a146204890e526ec4a458"},"schema_version":"1.0"},"canonical_sha256":"537345c9a6362e227a4633aab96e389339aaf86d7d8d91ca9a4544d0dd039cf2","source":{"kind":"arxiv","id":"2312.16445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16445","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16445v1","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16445","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"KNZULSNGGYXC","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"pith_short_16","alias_value":"KNZULSNGGYXCE6SG","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"pith_short_8","alias_value":"KNZULSNG","created_at":"2026-07-05T07:28:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:KNZULSNGGYXCE6SGGOVLS3RYSM","target":"record","payload":{"canonical_record":{"source":{"id":"2312.16445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-27T07:19:45Z","cross_cats_sorted":[],"title_canon_sha256":"cb3720e7769964c501a12352bb75e9f817498fe26af8a0cc6f2382c90f3e9051","abstract_canon_sha256":"63e721d002a00fa50b3eac1fe4113e65520460bb485a146204890e526ec4a458"},"schema_version":"1.0"},"canonical_sha256":"537345c9a6362e227a4633aab96e389339aaf86d7d8d91ca9a4544d0dd039cf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:28:17.413691Z","signature_b64":"yiaseY40koyTRT8jatCg1HVrY39d39RQcQ7trsJ74oXo2tms0qs8lr/roqSe/6PAw4gq3ILB2Y5EFiPJEdbiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"537345c9a6362e227a4633aab96e389339aaf86d7d8d91ca9a4544d0dd039cf2","last_reissued_at":"2026-07-05T07:28:17.413274Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:28:17.413274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.16445","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:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86YpzBqSqF43r/ZYLA8Y3X+IsNotHbizMWmFGD8Cg+tbmMuumfIs+tQqlk7rkGdsRCNv6AaMtLXTHz3nDEQSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:13:53.353913Z"},"content_sha256":"b966d5766fe0065ca1bb4881d9caf5d10bee77e3681fde71c9fe47c0dad54cfd","schema_version":"1.0","event_id":"sha256:b966d5766fe0065ca1bb4881d9caf5d10bee77e3681fde71c9fe47c0dad54cfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:KNZULSNGGYXCE6SGGOVLS3RYSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ADPBA: Efficiently generating Lagrangian cuts for two-stage stochastic integer programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuanhou Gao, Mingming Xu, Xiaoyu Luo","submitted_at":"2023-12-27T07:19:45Z","abstract_excerpt":"The use of Lagrangian cuts proves effective in enhancing the lower bound of the master problem within the execution of benders-type algorithms, particularly in the context of two-stage stochastic programs. However, even the process of generating a single Lagrangian cut is notably time-intensive. In light of this challenge, we present a novel framework that integrates Lagrangian cut generation with an adaptive partition-based approach, thereby mitigating this time-related drawback to a considerable extent. Furthermore, we also discuss the dominance relationship between the generated partition-b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16445","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/2312.16445/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:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlVgoXHhtnP6+dhLDFi4bPpGLmhgLzfFtMuuWQWYfrKZposUQxiOf9Zvkg4fVoXMrtRL7jOb1qwB6hIj7K5XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:13:53.354286Z"},"content_sha256":"22f4cf32a5d5a875cb45d7bc02db67a9106ef2bac5240347150a54016c7ff18f","schema_version":"1.0","event_id":"sha256:22f4cf32a5d5a875cb45d7bc02db67a9106ef2bac5240347150a54016c7ff18f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNZULSNGGYXCE6SGGOVLS3RYSM/bundle.json","state_url":"https://pith.science/pith/KNZULSNGGYXCE6SGGOVLS3RYSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNZULSNGGYXCE6SGGOVLS3RYSM/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-06T14:13:53Z","links":{"resolver":"https://pith.science/pith/KNZULSNGGYXCE6SGGOVLS3RYSM","bundle":"https://pith.science/pith/KNZULSNGGYXCE6SGGOVLS3RYSM/bundle.json","state":"https://pith.science/pith/KNZULSNGGYXCE6SGGOVLS3RYSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNZULSNGGYXCE6SGGOVLS3RYSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:KNZULSNGGYXCE6SGGOVLS3RYSM","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":"63e721d002a00fa50b3eac1fe4113e65520460bb485a146204890e526ec4a458","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-27T07:19:45Z","title_canon_sha256":"cb3720e7769964c501a12352bb75e9f817498fe26af8a0cc6f2382c90f3e9051"},"schema_version":"1.0","source":{"id":"2312.16445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16445","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16445v1","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16445","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"KNZULSNGGYXC","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"pith_short_16","alias_value":"KNZULSNGGYXCE6SG","created_at":"2026-07-05T07:28:17Z"},{"alias_kind":"pith_short_8","alias_value":"KNZULSNG","created_at":"2026-07-05T07:28:17Z"}],"graph_snapshots":[{"event_id":"sha256:22f4cf32a5d5a875cb45d7bc02db67a9106ef2bac5240347150a54016c7ff18f","target":"graph","created_at":"2026-07-05T07:28:17Z","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/2312.16445/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The use of Lagrangian cuts proves effective in enhancing the lower bound of the master problem within the execution of benders-type algorithms, particularly in the context of two-stage stochastic programs. However, even the process of generating a single Lagrangian cut is notably time-intensive. In light of this challenge, we present a novel framework that integrates Lagrangian cut generation with an adaptive partition-based approach, thereby mitigating this time-related drawback to a considerable extent. Furthermore, we also discuss the dominance relationship between the generated partition-b","authors_text":"Chuanhou Gao, Mingming Xu, Xiaoyu Luo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-27T07:19:45Z","title":"ADPBA: Efficiently generating Lagrangian cuts for two-stage stochastic integer programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16445","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:b966d5766fe0065ca1bb4881d9caf5d10bee77e3681fde71c9fe47c0dad54cfd","target":"record","created_at":"2026-07-05T07:28:17Z","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":"63e721d002a00fa50b3eac1fe4113e65520460bb485a146204890e526ec4a458","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-27T07:19:45Z","title_canon_sha256":"cb3720e7769964c501a12352bb75e9f817498fe26af8a0cc6f2382c90f3e9051"},"schema_version":"1.0","source":{"id":"2312.16445","kind":"arxiv","version":1}},"canonical_sha256":"537345c9a6362e227a4633aab96e389339aaf86d7d8d91ca9a4544d0dd039cf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"537345c9a6362e227a4633aab96e389339aaf86d7d8d91ca9a4544d0dd039cf2","first_computed_at":"2026-07-05T07:28:17.413274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:28:17.413274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yiaseY40koyTRT8jatCg1HVrY39d39RQcQ7trsJ74oXo2tms0qs8lr/roqSe/6PAw4gq3ILB2Y5EFiPJEdbiCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:28:17.413691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.16445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b966d5766fe0065ca1bb4881d9caf5d10bee77e3681fde71c9fe47c0dad54cfd","sha256:22f4cf32a5d5a875cb45d7bc02db67a9106ef2bac5240347150a54016c7ff18f"],"state_sha256":"95023e3f805daf2506aed1e37747a47c6a9c142777939c6e079770d7cb5e6188"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vau1dTp/GFzF4SW2gBEZ17qg4S7vzHt33IxmsMp8Y87/wmnBezycLyNBTcSqKkIplVDvFgQOFMbPhdyvTtqJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T14:13:53.356650Z","bundle_sha256":"d6d9e3b83b0ba4239c7dcf22a6c06f49013cb4f77a6bb03d8f5369c149e796da"}}