{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LUR7PDLZTDH5NO4RY2QPJ777OE","short_pith_number":"pith:LUR7PDLZ","schema_version":"1.0","canonical_sha256":"5d23f78d7998cfd6bb91c6a0f4ffff7128547b92bd808ca8b10c93f575d55bab","source":{"kind":"arxiv","id":"2506.03561","version":3},"attestation_state":"computed","paper":{"title":"Disjunctive Benders Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Geunyeong Byeon, Inho Sin, Kaiwen Fang","submitted_at":"2025-06-04T04:26:08Z","abstract_excerpt":"We propose an enhancement to Benders decomposition (BD) that generates valid inequalities for the convex hull of the Benders reformulation, addressing the limitation that classical BD cuts are typically tight only for the continuous relaxation. Our method integrates disjunctive programming with BD and introduces a routine that leverages existing cut-generating oracles as-is to construct convex hull inequalities. For mixed-binary linear programs, the approach removes the need to solve the master problem as a mixed-integer program, even with separable subproblems. It builds on a unified normaliz"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.03561","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-04T04:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"8d38af610b1bb93ead480394d0213af9d46304dc1ec3e7f9045cf23e06104c55","abstract_canon_sha256":"118ba7f6dec80d4a608d7a9ff7c246f13da40a73201de9834b94386cf03acb3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:05.234676Z","signature_b64":"wVIrPxTQuBP0YfYIxPt07qAeV1l8QAge8s8cyBo7VKEL44EWpEOOsmBWmEkSjAb5NWFHEzdoJJABsgMbuUEUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d23f78d7998cfd6bb91c6a0f4ffff7128547b92bd808ca8b10c93f575d55bab","last_reissued_at":"2026-05-20T00:02:05.233897Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:05.233897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjunctive Benders Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Geunyeong Byeon, Inho Sin, Kaiwen Fang","submitted_at":"2025-06-04T04:26:08Z","abstract_excerpt":"We propose an enhancement to Benders decomposition (BD) that generates valid inequalities for the convex hull of the Benders reformulation, addressing the limitation that classical BD cuts are typically tight only for the continuous relaxation. Our method integrates disjunctive programming with BD and introduces a routine that leverages existing cut-generating oracles as-is to construct convex hull inequalities. For mixed-binary linear programs, the approach removes the need to solve the master problem as a mixed-integer program, even with separable subproblems. It builds on a unified normaliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03561","kind":"arxiv","version":3},"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/2506.03561/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.03561","created_at":"2026-05-20T00:02:05.234029+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03561v3","created_at":"2026-05-20T00:02:05.234029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03561","created_at":"2026-05-20T00:02:05.234029+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUR7PDLZTDH5","created_at":"2026-05-20T00:02:05.234029+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUR7PDLZTDH5NO4R","created_at":"2026-05-20T00:02:05.234029+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUR7PDLZ","created_at":"2026-05-20T00:02:05.234029+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE","json":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE.json","graph_json":"https://pith.science/api/pith-number/LUR7PDLZTDH5NO4RY2QPJ777OE/graph.json","events_json":"https://pith.science/api/pith-number/LUR7PDLZTDH5NO4RY2QPJ777OE/events.json","paper":"https://pith.science/paper/LUR7PDLZ"},"agent_actions":{"view_html":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE","download_json":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE.json","view_paper":"https://pith.science/paper/LUR7PDLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03561&json=true","fetch_graph":"https://pith.science/api/pith-number/LUR7PDLZTDH5NO4RY2QPJ777OE/graph.json","fetch_events":"https://pith.science/api/pith-number/LUR7PDLZTDH5NO4RY2QPJ777OE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE/action/storage_attestation","attest_author":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE/action/author_attestation","sign_citation":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE/action/citation_signature","submit_replication":"https://pith.science/pith/LUR7PDLZTDH5NO4RY2QPJ777OE/action/replication_record"}},"created_at":"2026-05-20T00:02:05.234029+00:00","updated_at":"2026-05-20T00:02:05.234029+00:00"}