{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ZNOAQ6OTD5AEMBBFQRJGVT5K6I","short_pith_number":"pith:ZNOAQ6OT","canonical_record":{"source":{"id":"2211.02169","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-03T22:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"af251aef39065527b6253b2ea6cfaad2dad7f507a1560f2392171f3803407620","abstract_canon_sha256":"11c01a5809ef6e7a644fba98f909c4f8f5ef145e01188b316dd90623701cb125"},"schema_version":"1.0"},"canonical_sha256":"cb5c0879d31f4046042584526acfaaf230dfea2a586dd887786c6dbb713e4aa4","source":{"kind":"arxiv","id":"2211.02169","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02169","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02169v2","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02169","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZNOAQ6OTD5AE","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZNOAQ6OTD5AEMBBF","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZNOAQ6OT","created_at":"2026-07-05T07:12:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ZNOAQ6OTD5AEMBBFQRJGVT5K6I","target":"record","payload":{"canonical_record":{"source":{"id":"2211.02169","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-03T22:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"af251aef39065527b6253b2ea6cfaad2dad7f507a1560f2392171f3803407620","abstract_canon_sha256":"11c01a5809ef6e7a644fba98f909c4f8f5ef145e01188b316dd90623701cb125"},"schema_version":"1.0"},"canonical_sha256":"cb5c0879d31f4046042584526acfaaf230dfea2a586dd887786c6dbb713e4aa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:47.146473Z","signature_b64":"XrV0r2NzbuvIy9PX+LwH2TBmVR8lmfFH/6uni5y0NZEtQtirVWpHl8LOKo/QgUq0u5COVmQSOfxbm83t2eDsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb5c0879d31f4046042584526acfaaf230dfea2a586dd887786c6dbb713e4aa4","last_reissued_at":"2026-07-05T07:12:47.146000Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:47.146000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.02169","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-05T07:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaxGk029DJ+3N5pBjVp4cPlBboJ74tSEZD9GELm0+mSN7eAtqNbi5q29v0aCiZVjZtz+EdPnDFQvDo0+2y7aDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:22:32.091214Z"},"content_sha256":"933fcc06066850e5bc278198767670e3ad3c35d16ae18acd6e40bebeac9c22f6","schema_version":"1.0","event_id":"sha256:933fcc06066850e5bc278198767670e3ad3c35d16ae18acd6e40bebeac9c22f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ZNOAQ6OTD5AEMBBFQRJGVT5K6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leveraging Decision Diagrams to Solve Two-stage Stochastic Programs with Binary Recourse and Logical Linking Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Merve Bodur, Moira MacNeil","submitted_at":"2022-11-03T22:50:04Z","abstract_excerpt":"Two-stage stochastic programs with binary recourse are challenging to solve and efficient solution methods for such problems have been limited. In this work, we generalize an existing binary decision diagram-based (BDD-based) approach of Lozano and Smith (Math. Program., 2018) to solve a special class of two-stage stochastic programs with binary recourse. In this setting, the first-stage decisions impact the second-stage constraints. Our modified problem extends the second-stage problem to a more general setting where logical expressions of the first-stage solutions enforce constraints in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02169","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/2211.02169/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-05T07:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYQZJqvkCzkL66N8bypCl+hz2kFzVmjnn02mEvqFyjHocSnJX3AgcW+sxutU3I30w+vnEEUh20RNONMtdW4ZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:22:32.091820Z"},"content_sha256":"23d1a06136faa740db4f9fa6d9cea39af598b8a6460670b93d6402b129dadb73","schema_version":"1.0","event_id":"sha256:23d1a06136faa740db4f9fa6d9cea39af598b8a6460670b93d6402b129dadb73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNOAQ6OTD5AEMBBFQRJGVT5K6I/bundle.json","state_url":"https://pith.science/pith/ZNOAQ6OTD5AEMBBFQRJGVT5K6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNOAQ6OTD5AEMBBFQRJGVT5K6I/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-06T08:22:32Z","links":{"resolver":"https://pith.science/pith/ZNOAQ6OTD5AEMBBFQRJGVT5K6I","bundle":"https://pith.science/pith/ZNOAQ6OTD5AEMBBFQRJGVT5K6I/bundle.json","state":"https://pith.science/pith/ZNOAQ6OTD5AEMBBFQRJGVT5K6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNOAQ6OTD5AEMBBFQRJGVT5K6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ZNOAQ6OTD5AEMBBFQRJGVT5K6I","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":"11c01a5809ef6e7a644fba98f909c4f8f5ef145e01188b316dd90623701cb125","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-03T22:50:04Z","title_canon_sha256":"af251aef39065527b6253b2ea6cfaad2dad7f507a1560f2392171f3803407620"},"schema_version":"1.0","source":{"id":"2211.02169","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02169","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02169v2","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02169","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZNOAQ6OTD5AE","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZNOAQ6OTD5AEMBBF","created_at":"2026-07-05T07:12:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZNOAQ6OT","created_at":"2026-07-05T07:12:47Z"}],"graph_snapshots":[{"event_id":"sha256:23d1a06136faa740db4f9fa6d9cea39af598b8a6460670b93d6402b129dadb73","target":"graph","created_at":"2026-07-05T07:12:47Z","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/2211.02169/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Two-stage stochastic programs with binary recourse are challenging to solve and efficient solution methods for such problems have been limited. In this work, we generalize an existing binary decision diagram-based (BDD-based) approach of Lozano and Smith (Math. Program., 2018) to solve a special class of two-stage stochastic programs with binary recourse. In this setting, the first-stage decisions impact the second-stage constraints. Our modified problem extends the second-stage problem to a more general setting where logical expressions of the first-stage solutions enforce constraints in the ","authors_text":"Merve Bodur, Moira MacNeil","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-03T22:50:04Z","title":"Leveraging Decision Diagrams to Solve Two-stage Stochastic Programs with Binary Recourse and Logical Linking Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02169","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:933fcc06066850e5bc278198767670e3ad3c35d16ae18acd6e40bebeac9c22f6","target":"record","created_at":"2026-07-05T07:12:47Z","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":"11c01a5809ef6e7a644fba98f909c4f8f5ef145e01188b316dd90623701cb125","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-03T22:50:04Z","title_canon_sha256":"af251aef39065527b6253b2ea6cfaad2dad7f507a1560f2392171f3803407620"},"schema_version":"1.0","source":{"id":"2211.02169","kind":"arxiv","version":2}},"canonical_sha256":"cb5c0879d31f4046042584526acfaaf230dfea2a586dd887786c6dbb713e4aa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb5c0879d31f4046042584526acfaaf230dfea2a586dd887786c6dbb713e4aa4","first_computed_at":"2026-07-05T07:12:47.146000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:47.146000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XrV0r2NzbuvIy9PX+LwH2TBmVR8lmfFH/6uni5y0NZEtQtirVWpHl8LOKo/QgUq0u5COVmQSOfxbm83t2eDsDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:47.146473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02169","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:933fcc06066850e5bc278198767670e3ad3c35d16ae18acd6e40bebeac9c22f6","sha256:23d1a06136faa740db4f9fa6d9cea39af598b8a6460670b93d6402b129dadb73"],"state_sha256":"ec7f05dcc9187d60a6ae718d6d9ead22c8b0f39abe6e33065b284856b827d5e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wHVl/xpog8j64kzG/9LFn0TUDY+b3B3TfOtA5KrXOJjGBzxsjPj2o8lOI9gk5whfaNvcoAUiiyUNnx2ziJ7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:22:32.097555Z","bundle_sha256":"8850606c61c6863f9f6a2763f8df98420039add43247b24401d73ddb49ff27d9"}}