{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3IFOV72Y5MQF37NSGRGAWARX3O","short_pith_number":"pith:3IFOV72Y","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"},"canonical_sha256":"da0aeaff58eb205dfdb2344c0b0237dbb07c8d851210dd867270ae9d6374406b","source":{"kind":"arxiv","id":"2205.12006","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.12006","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"2205.12006v2","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12006","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"3IFOV72Y5MQF","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"pith_short_16","alias_value":"3IFOV72Y5MQF37NS","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"pith_short_8","alias_value":"3IFOV72Y","created_at":"2026-07-05T05:06:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3IFOV72Y5MQF37NSGRGAWARX3O","target":"record","payload":{"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"},"canonical_sha256":"da0aeaff58eb205dfdb2344c0b0237dbb07c8d851210dd867270ae9d6374406b","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"},"source_kind":"arxiv","source_id":"2205.12006","source_version":2,"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-05T05:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jbOxzeIXay8SzEcUV7UUc3NhTYXZ7xHJ9vFblbwBB+WRkUejd1rOP1Na2UXcpG2kABMRs4pl5kTSB4hb8+oAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:51:59.485734Z"},"content_sha256":"4d039c24a11bd4435e941ea97b77305977012960e470088590465e7088e1034d","schema_version":"1.0","event_id":"sha256:4d039c24a11bd4435e941ea97b77305977012960e470088590465e7088e1034d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3IFOV72Y5MQF37NSGRGAWARX3O","target":"graph","payload":{"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"},"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-05T05:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QvQy4u+zUjYmnKeS1x7DP9JI0KMc80ttkZhL5HEIBaCej/orbNpRL4zC14Cx803R7A73pmrZSJ+WQj9qDu5HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:51:59.486388Z"},"content_sha256":"0b2cd9a29a4546867170e007106fa93ee1436cb2d956d995cd2827b7c340d617","schema_version":"1.0","event_id":"sha256:0b2cd9a29a4546867170e007106fa93ee1436cb2d956d995cd2827b7c340d617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/bundle.json","state_url":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IFOV72Y5MQF37NSGRGAWARX3O/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-08-05T19:51:59Z","links":{"resolver":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O","bundle":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/bundle.json","state":"https://pith.science/pith/3IFOV72Y5MQF37NSGRGAWARX3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IFOV72Y5MQF37NSGRGAWARX3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3IFOV72Y5MQF37NSGRGAWARX3O","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":"73b6ab910fa642e74c79c9ffbd6a47a00be32b18c02bf7df0667d0557f9551e2","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-20T22:09:22Z","title_canon_sha256":"897fe0e384b70f5a17fd4b3fb1ea6ccc03d73dde96c54f69c65136beb322bc59"},"schema_version":"1.0","source":{"id":"2205.12006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.12006","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"2205.12006v2","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12006","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"3IFOV72Y5MQF","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"pith_short_16","alias_value":"3IFOV72Y5MQF37NS","created_at":"2026-07-05T05:06:12Z"},{"alias_kind":"pith_short_8","alias_value":"3IFOV72Y","created_at":"2026-07-05T05:06:12Z"}],"graph_snapshots":[{"event_id":"sha256:0b2cd9a29a4546867170e007106fa93ee1436cb2d956d995cd2827b7c340d617","target":"graph","created_at":"2026-07-05T05:06:12Z","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/2205.12006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Elias B. Khalil, Justin Dumouchelle, Merve Bodur, Rahul Patel","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-20T22:09:22Z","title":"Neur2SP: Neural Two-Stage Stochastic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12006","kind":"arxiv","version":2},"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:4d039c24a11bd4435e941ea97b77305977012960e470088590465e7088e1034d","target":"record","created_at":"2026-07-05T05:06:12Z","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":"73b6ab910fa642e74c79c9ffbd6a47a00be32b18c02bf7df0667d0557f9551e2","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-05-20T22:09:22Z","title_canon_sha256":"897fe0e384b70f5a17fd4b3fb1ea6ccc03d73dde96c54f69c65136beb322bc59"},"schema_version":"1.0","source":{"id":"2205.12006","kind":"arxiv","version":2}},"canonical_sha256":"da0aeaff58eb205dfdb2344c0b0237dbb07c8d851210dd867270ae9d6374406b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da0aeaff58eb205dfdb2344c0b0237dbb07c8d851210dd867270ae9d6374406b","first_computed_at":"2026-07-05T05:06:12.043025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:06:12.043025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jFRQKU7NdtJpL1huE9sLleda4uUIESz9IJzcYLtfJIfsUXIqAotKpYoVSd5/Tbw1Rw31Ks3sGYF/QTEvHtOTCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:06:12.043516Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.12006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d039c24a11bd4435e941ea97b77305977012960e470088590465e7088e1034d","sha256:0b2cd9a29a4546867170e007106fa93ee1436cb2d956d995cd2827b7c340d617"],"state_sha256":"c6e10f181bea32b50c4667b83ebf05aad4f8a01562203e6e510aec64b860a6e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAaXVswtBvfd5PgjkUKMdJnbcrwvcUkDC2lT4nHyt0Cs3i10fnX30Q/VqdLtbFtZz/il1X2LwwJg5452FTcsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:51:59.492753Z","bundle_sha256":"cb4e1b91a61e24cf145bd632b4867bb38f018cedac05bb211c3e97fb398ee64c"}}