{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZACOZLPBQ5QNQK436IOQGZ25PX","short_pith_number":"pith:ZACOZLPB","canonical_record":{"source":{"id":"2403.19471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-28T14:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"9162edbf5bda1ef8d3c2f923ab9c9fcd511841a53bcad652a38c216dcfbc9652","abstract_canon_sha256":"6dfc8da20454b161739f553567c58a8277fb45b0c620635a7bf9bb4644440179"},"schema_version":"1.0"},"canonical_sha256":"c804ecade18760d82b9bf21d03675d7dfec25d734257c31e2e096c0ab6042302","source":{"kind":"arxiv","id":"2403.19471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.19471","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"2403.19471v1","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19471","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZACOZLPBQ5QN","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"pith_short_16","alias_value":"ZACOZLPBQ5QNQK43","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"pith_short_8","alias_value":"ZACOZLPB","created_at":"2026-07-05T08:01:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZACOZLPBQ5QNQK436IOQGZ25PX","target":"record","payload":{"canonical_record":{"source":{"id":"2403.19471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-28T14:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"9162edbf5bda1ef8d3c2f923ab9c9fcd511841a53bcad652a38c216dcfbc9652","abstract_canon_sha256":"6dfc8da20454b161739f553567c58a8277fb45b0c620635a7bf9bb4644440179"},"schema_version":"1.0"},"canonical_sha256":"c804ecade18760d82b9bf21d03675d7dfec25d734257c31e2e096c0ab6042302","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:49.443220Z","signature_b64":"DAXgYv32xGR7Y8E9qPMu6Gwi87eyyvomv8pvj7pZltOFUgCR1DPF+Q99kHYtIp1A4joTBlzcgSpgsd13yN7PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c804ecade18760d82b9bf21d03675d7dfec25d734257c31e2e096c0ab6042302","last_reissued_at":"2026-07-05T08:01:49.442710Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:49.442710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.19471","source_version":1,"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-05T08:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUgLriDmxyZzXCoaab9djFGf9WpgyLcOeYCfRdu/sepwazq+Jo9fazgBqzPuDtJycPcVXhDitwevtQBzj4auBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T12:26:54.468957Z"},"content_sha256":"f9863d1de7accf24676103f872b97ac8224ac89b52c7c94727215f04ed556c66","schema_version":"1.0","event_id":"sha256:f9863d1de7accf24676103f872b97ac8224ac89b52c7c94727215f04ed556c66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZACOZLPBQ5QNQK436IOQGZ25PX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Flow Models for Robust Binary Optimization with Selective Adaptability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ian Yihang Zhu, Merve Bodur, Timothy C. Y. Chan","submitted_at":"2024-03-28T14:56:03Z","abstract_excerpt":"Adaptive robust optimization problems have received significant attention in recent years, but remain notoriously difficult to solve when recourse decisions are discrete in nature. In this paper, we propose new reformulation techniques for adaptive robust binary optimization (ARBO) problems with objective uncertainty. Without loss of generality, we focus on ARBO problems with \"selective adaptability\", a term we coin to describe a common class of linking constraints between first-stage and second-stage solutions. Our main contribution revolves around a collection of exact and approximate networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19471","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/2403.19471/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-05T08:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5dEAsRsUg6+fX//549dhypqJTSA+WK8FUpUD3YeBdpLeYdjLea5QVEtvxaHjrC0CxEyfCLTtOXpv0mAsmLxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T12:26:54.469266Z"},"content_sha256":"1f7f922e8b4d1e3ab9dbb4a4fb1e12ead8f3d5b441b89116fe6caa8b39e175dc","schema_version":"1.0","event_id":"sha256:1f7f922e8b4d1e3ab9dbb4a4fb1e12ead8f3d5b441b89116fe6caa8b39e175dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZACOZLPBQ5QNQK436IOQGZ25PX/bundle.json","state_url":"https://pith.science/pith/ZACOZLPBQ5QNQK436IOQGZ25PX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZACOZLPBQ5QNQK436IOQGZ25PX/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-01T12:26:54Z","links":{"resolver":"https://pith.science/pith/ZACOZLPBQ5QNQK436IOQGZ25PX","bundle":"https://pith.science/pith/ZACOZLPBQ5QNQK436IOQGZ25PX/bundle.json","state":"https://pith.science/pith/ZACOZLPBQ5QNQK436IOQGZ25PX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZACOZLPBQ5QNQK436IOQGZ25PX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZACOZLPBQ5QNQK436IOQGZ25PX","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":"6dfc8da20454b161739f553567c58a8277fb45b0c620635a7bf9bb4644440179","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-28T14:56:03Z","title_canon_sha256":"9162edbf5bda1ef8d3c2f923ab9c9fcd511841a53bcad652a38c216dcfbc9652"},"schema_version":"1.0","source":{"id":"2403.19471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.19471","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"2403.19471v1","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19471","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZACOZLPBQ5QN","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"pith_short_16","alias_value":"ZACOZLPBQ5QNQK43","created_at":"2026-07-05T08:01:49Z"},{"alias_kind":"pith_short_8","alias_value":"ZACOZLPB","created_at":"2026-07-05T08:01:49Z"}],"graph_snapshots":[{"event_id":"sha256:1f7f922e8b4d1e3ab9dbb4a4fb1e12ead8f3d5b441b89116fe6caa8b39e175dc","target":"graph","created_at":"2026-07-05T08:01:49Z","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/2403.19471/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Adaptive robust optimization problems have received significant attention in recent years, but remain notoriously difficult to solve when recourse decisions are discrete in nature. In this paper, we propose new reformulation techniques for adaptive robust binary optimization (ARBO) problems with objective uncertainty. Without loss of generality, we focus on ARBO problems with \"selective adaptability\", a term we coin to describe a common class of linking constraints between first-stage and second-stage solutions. Our main contribution revolves around a collection of exact and approximate networ","authors_text":"Ian Yihang Zhu, Merve Bodur, Timothy C. Y. Chan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-28T14:56:03Z","title":"Network Flow Models for Robust Binary Optimization with Selective Adaptability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19471","kind":"arxiv","version":1},"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:f9863d1de7accf24676103f872b97ac8224ac89b52c7c94727215f04ed556c66","target":"record","created_at":"2026-07-05T08:01:49Z","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":"6dfc8da20454b161739f553567c58a8277fb45b0c620635a7bf9bb4644440179","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-28T14:56:03Z","title_canon_sha256":"9162edbf5bda1ef8d3c2f923ab9c9fcd511841a53bcad652a38c216dcfbc9652"},"schema_version":"1.0","source":{"id":"2403.19471","kind":"arxiv","version":1}},"canonical_sha256":"c804ecade18760d82b9bf21d03675d7dfec25d734257c31e2e096c0ab6042302","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c804ecade18760d82b9bf21d03675d7dfec25d734257c31e2e096c0ab6042302","first_computed_at":"2026-07-05T08:01:49.442710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:01:49.442710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DAXgYv32xGR7Y8E9qPMu6Gwi87eyyvomv8pvj7pZltOFUgCR1DPF+Q99kHYtIp1A4joTBlzcgSpgsd13yN7PAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:01:49.443220Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.19471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9863d1de7accf24676103f872b97ac8224ac89b52c7c94727215f04ed556c66","sha256:1f7f922e8b4d1e3ab9dbb4a4fb1e12ead8f3d5b441b89116fe6caa8b39e175dc"],"state_sha256":"5fbcfc4771c32d109e5b10d3e5c5c8d376e8bedaaa811942e651ca509ff9aa70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tVTY9Q+RcEk0DLiKzAw5tusonR6kc2VUUcZ0HWYFcBB+pnRuP0sib6i0EcRK2TkVdiihwzU42b3hC7mtaqX9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T12:26:54.471403Z","bundle_sha256":"93812eecf910b7f1115218ad620114f2e9077be75437c25f22d73895e98d6b7e"}}