{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XDZHYGVWJIWDBH6MEGC3JGKHEY","short_pith_number":"pith:XDZHYGVW","schema_version":"1.0","canonical_sha256":"b8f27c1ab64a2c309fcc2185b499472636f675db0c2fdeaf63d66aa6de0153f6","source":{"kind":"arxiv","id":"2606.08797","version":1},"attestation_state":"computed","paper":{"title":"Scaling Decision-Focused Learning to Large Problems with Lagrangian Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hugo Percot, Louis-Martin Rousseau, Quentin Cappart, St\\'ephane Eilles-Chan Way, Tias Guns","submitted_at":"2026-06-07T19:27:59Z","abstract_excerpt":"Decision-focused learning has shown great promise for addressing predict-then-optimize problems, particularly in the presence of under-specified models. However, its practical deployment is often hindered by high computational costs and limited scalability, as it requires solving a constrained optimization problem for each training instance at every iteration. To address these challenges, we propose a novel framework that incorporates Lagrangian decomposition into the decision-focused learning paradigm. Specifically, we introduce a new surrogate objective along with two loss functions for eval"},"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":"2606.08797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-07T19:27:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"017c40f5d3db1c2a1235e8e34b0a22c2a76daa83b0631083b12e94a048374d4b","abstract_canon_sha256":"2bb7876fb3c35fb03cd9762b4d2c4db8383b4751199e72c27099e8b62ec843d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:39.769848Z","signature_b64":"WDS7aYqVSXClfsrVlqM2on71s8Y6ca7x0PtSJFzvTtZD1/FWafqkdXsiUlwjel06zFApxEvPrfLWg7Ez5lxICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8f27c1ab64a2c309fcc2185b499472636f675db0c2fdeaf63d66aa6de0153f6","last_reissued_at":"2026-06-09T02:07:39.768998Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:39.768998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Decision-Focused Learning to Large Problems with Lagrangian Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hugo Percot, Louis-Martin Rousseau, Quentin Cappart, St\\'ephane Eilles-Chan Way, Tias Guns","submitted_at":"2026-06-07T19:27:59Z","abstract_excerpt":"Decision-focused learning has shown great promise for addressing predict-then-optimize problems, particularly in the presence of under-specified models. However, its practical deployment is often hindered by high computational costs and limited scalability, as it requires solving a constrained optimization problem for each training instance at every iteration. To address these challenges, we propose a novel framework that incorporates Lagrangian decomposition into the decision-focused learning paradigm. Specifically, we introduce a new surrogate objective along with two loss functions for eval"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08797","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/2606.08797/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":"2606.08797","created_at":"2026-06-09T02:07:39.769145+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08797v1","created_at":"2026-06-09T02:07:39.769145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08797","created_at":"2026-06-09T02:07:39.769145+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDZHYGVWJIWD","created_at":"2026-06-09T02:07:39.769145+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDZHYGVWJIWDBH6M","created_at":"2026-06-09T02:07:39.769145+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDZHYGVW","created_at":"2026-06-09T02:07:39.769145+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/XDZHYGVWJIWDBH6MEGC3JGKHEY","json":"https://pith.science/pith/XDZHYGVWJIWDBH6MEGC3JGKHEY.json","graph_json":"https://pith.science/api/pith-number/XDZHYGVWJIWDBH6MEGC3JGKHEY/graph.json","events_json":"https://pith.science/api/pith-number/XDZHYGVWJIWDBH6MEGC3JGKHEY/events.json","paper":"https://pith.science/paper/XDZHYGVW"},"agent_actions":{"view_html":"https://pith.science/pith/XDZHYGVWJIWDBH6MEGC3JGKHEY","download_json":"https://pith.science/pith/XDZHYGVWJIWDBH6MEGC3JGKHEY.json","view_paper":"https://pith.science/paper/XDZHYGVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08797&json=true","fetch_graph":"https://pith.science/api/pith-number/XDZHYGVWJIWDBH6MEGC3JGKHEY/graph.json","fetch_events":"https://pith.science/api/pith-number/XDZHYGVWJIWDBH6MEGC3JGKHEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDZHYGVWJIWDBH6MEGC3JGKHEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDZHYGVWJIWDBH6MEGC3JGKHEY/action/storage_attestation","attest_author":"https://pith.science/pith/XDZHYGVWJIWDBH6MEGC3JGKHEY/action/author_attestation","sign_citation":"https://pith.science/pith/XDZHYGVWJIWDBH6MEGC3JGKHEY/action/citation_signature","submit_replication":"https://pith.science/pith/XDZHYGVWJIWDBH6MEGC3JGKHEY/action/replication_record"}},"created_at":"2026-06-09T02:07:39.769145+00:00","updated_at":"2026-06-09T02:07:39.769145+00:00"}