{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3IFOV72Y5MQF37NSGRGAWARX3O","short_pith_number":"pith:3IFOV72Y","schema_version":"1.0","canonical_sha256":"da0aeaff58eb205dfdb2344c0b0237dbb07c8d851210dd867270ae9d6374406b","source":{"kind":"arxiv","id":"2205.12006","version":2},"attestation_state":"computed","paper":{"title":"Neur2SP: Neural Two-Stage Stochastic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"math.OC","authors_text":"Elias B. Khalil, Justin Dumouchelle, Merve Bodur, Rahul Patel","submitted_at":"2022-05-20T22:09:22Z","abstract_excerpt":"Stochastic Programming is a powerful modeling framework for decision-making under uncertainty. In this work, we tackle two-stage stochastic programs (2SPs), the most widely used class of stochastic programming models. Solving 2SPs exactly requires optimizing over an expected value function that is computationally intractable. Having a mixed-integer linear program (MIP) or a nonlinear program (NLP) in the second stage further aggravates the intractability, even when specialized algorithms that exploit problem structure are employed. Finding high-quality (first-stage) solutions -- without levera"},"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":"2205.12006","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-20T22:09:22Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"897fe0e384b70f5a17fd4b3fb1ea6ccc03d73dde96c54f69c65136beb322bc59","abstract_canon_sha256":"73b6ab910fa642e74c79c9ffbd6a47a00be32b18c02bf7df0667d0557f9551e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:12.043516Z","signature_b64":"jFRQKU7NdtJpL1huE9sLleda4uUIESz9IJzcYLtfJIfsUXIqAotKpYoVSd5/Tbw1Rw31Ks3sGYF/QTEvHtOTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da0aeaff58eb205dfdb2344c0b0237dbb07c8d851210dd867270ae9d6374406b","last_reissued_at":"2026-07-05T05:06:12.043025Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:12.043025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neur2SP: Neural Two-Stage Stochastic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"math.OC","authors_text":"Elias B. Khalil, Justin Dumouchelle, Merve Bodur, Rahul Patel","submitted_at":"2022-05-20T22:09:22Z","abstract_excerpt":"Stochastic Programming is a powerful modeling framework for decision-making under uncertainty. In this work, we tackle two-stage stochastic programs (2SPs), the most widely used class of stochastic programming models. Solving 2SPs exactly requires optimizing over an expected value function that is computationally intractable. Having a mixed-integer linear program (MIP) or a nonlinear program (NLP) in the second stage further aggravates the intractability, even when specialized algorithms that exploit problem structure are employed. Finding high-quality (first-stage) solutions -- without levera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12006","kind":"arxiv","version":2},"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/2205.12006/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":"2205.12006","created_at":"2026-07-05T05:06:12.043083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12006v2","created_at":"2026-07-05T05:06:12.043083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12006","created_at":"2026-07-05T05:06:12.043083+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IFOV72Y5MQF","created_at":"2026-07-05T05:06:12.043083+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IFOV72Y5MQF37NS","created_at":"2026-07-05T05:06:12.043083+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IFOV72Y","created_at":"2026-07-05T05:06:12.043083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.05261","citing_title":"ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programming","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11507","citing_title":"Deep Learning for Sequential Decision Making under Uncertainty: Foundations, Frameworks, and Frontiers","ref_index":100,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17026","citing_title":"Learning a Non-linear Surrogate Model for Multistage Stochastic Transmission Planning","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O","json":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O.json","graph_json":"https://pith.science/api/pith-number/3IFOV72Y5MQF37NSGRGAWARX3O/graph.json","events_json":"https://pith.science/api/pith-number/3IFOV72Y5MQF37NSGRGAWARX3O/events.json","paper":"https://pith.science/paper/3IFOV72Y"},"agent_actions":{"view_html":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O","download_json":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O.json","view_paper":"https://pith.science/paper/3IFOV72Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12006&json=true","fetch_graph":"https://pith.science/api/pith-number/3IFOV72Y5MQF37NSGRGAWARX3O/graph.json","fetch_events":"https://pith.science/api/pith-number/3IFOV72Y5MQF37NSGRGAWARX3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/action/storage_attestation","attest_author":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/action/author_attestation","sign_citation":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/action/citation_signature","submit_replication":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/action/replication_record"}},"created_at":"2026-07-05T05:06:12.043083+00:00","updated_at":"2026-07-05T05:06:12.043083+00:00"}