{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WSF6OKOWUDD2PBJGMHESJNNIXT","short_pith_number":"pith:WSF6OKOW","schema_version":"1.0","canonical_sha256":"b48be729d6a0c7a7852661c924b5a8bced291aa56e4707cad5b0bfdd0b6fe7b5","source":{"kind":"arxiv","id":"2607.22550","version":1},"attestation_state":"computed","paper":{"title":"Learning to Optimize at Scale: A Benders Decomposition-TransfORmers Framework for Stochastic Combinatorial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Esra Buyuktahtakin Toy, Josh Cooper, Kimiya Jozani, Seung Jin Choi","submitted_at":"2026-05-13T01:40:21Z","abstract_excerpt":"We propose a learning-augmented Benders decomposition framework to solve large-scale two-stage stochastic mixed-integer programs. We focus on the two-stage stochastic capacitated lot-sizing problem (TSSCLSP) under demand uncertainty. Our method accelerates the convergence of the decomposition by using a pre-trained TransfORmer model to rapidly generate high-quality approximate solutions for the scenario subproblems. This hybrid strategy uses the TransfORmer predictions to generate strong optimality and feasibility cuts, effectively guiding the Benders master problem. Our framework includes a n"},"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":"2607.22550","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T01:40:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8c17a4b6360e064a5fe78c8994759c8a6cf3cb29d7b29fb075c1bd37d5ef4a01","abstract_canon_sha256":"5ac448227a916fcf20de77e79a94052f93d46e38b4ed3ab089fa6ab7b7b63278"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T00:21:41.735748Z","signature_b64":"v1kK2M6JUXkA3Jb7uUZsnlYG3mJZmJtVOaeQftN6ZDbT7l4M0LYUZSVoae5HL9e4XNl6/Wal3pZeUUEp5Dj1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b48be729d6a0c7a7852661c924b5a8bced291aa56e4707cad5b0bfdd0b6fe7b5","last_reissued_at":"2026-07-28T00:21:41.734864Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T00:21:41.734864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Optimize at Scale: A Benders Decomposition-TransfORmers Framework for Stochastic Combinatorial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Esra Buyuktahtakin Toy, Josh Cooper, Kimiya Jozani, Seung Jin Choi","submitted_at":"2026-05-13T01:40:21Z","abstract_excerpt":"We propose a learning-augmented Benders decomposition framework to solve large-scale two-stage stochastic mixed-integer programs. We focus on the two-stage stochastic capacitated lot-sizing problem (TSSCLSP) under demand uncertainty. Our method accelerates the convergence of the decomposition by using a pre-trained TransfORmer model to rapidly generate high-quality approximate solutions for the scenario subproblems. This hybrid strategy uses the TransfORmer predictions to generate strong optimality and feasibility cuts, effectively guiding the Benders master problem. Our framework includes a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22550","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/2607.22550/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":"2607.22550","created_at":"2026-07-28T00:21:41.735308+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.22550v1","created_at":"2026-07-28T00:21:41.735308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22550","created_at":"2026-07-28T00:21:41.735308+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSF6OKOWUDD2","created_at":"2026-07-28T00:21:41.735308+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSF6OKOWUDD2PBJG","created_at":"2026-07-28T00:21:41.735308+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSF6OKOW","created_at":"2026-07-28T00:21:41.735308+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/WSF6OKOWUDD2PBJGMHESJNNIXT","json":"https://pith.science/pith/WSF6OKOWUDD2PBJGMHESJNNIXT.json","graph_json":"https://pith.science/api/pith-number/WSF6OKOWUDD2PBJGMHESJNNIXT/graph.json","events_json":"https://pith.science/api/pith-number/WSF6OKOWUDD2PBJGMHESJNNIXT/events.json","paper":"https://pith.science/paper/WSF6OKOW"},"agent_actions":{"view_html":"https://pith.science/pith/WSF6OKOWUDD2PBJGMHESJNNIXT","download_json":"https://pith.science/pith/WSF6OKOWUDD2PBJGMHESJNNIXT.json","view_paper":"https://pith.science/paper/WSF6OKOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.22550&json=true","fetch_graph":"https://pith.science/api/pith-number/WSF6OKOWUDD2PBJGMHESJNNIXT/graph.json","fetch_events":"https://pith.science/api/pith-number/WSF6OKOWUDD2PBJGMHESJNNIXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSF6OKOWUDD2PBJGMHESJNNIXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSF6OKOWUDD2PBJGMHESJNNIXT/action/storage_attestation","attest_author":"https://pith.science/pith/WSF6OKOWUDD2PBJGMHESJNNIXT/action/author_attestation","sign_citation":"https://pith.science/pith/WSF6OKOWUDD2PBJGMHESJNNIXT/action/citation_signature","submit_replication":"https://pith.science/pith/WSF6OKOWUDD2PBJGMHESJNNIXT/action/replication_record"}},"created_at":"2026-07-28T00:21:41.735308+00:00","updated_at":"2026-07-28T00:21:41.735308+00:00"}