{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X556KXPBIR27C3FQ4U6SJUMCOD","short_pith_number":"pith:X556KXPB","schema_version":"1.0","canonical_sha256":"bf7be55de14475f16cb0e53d24d18270d17785d1b05cedc6ad71df1e82a2092f","source":{"kind":"arxiv","id":"1805.10079","version":2},"attestation_state":"computed","paper":{"title":"Piecewise constant decision rules via branch-and-bound based scenario detection for integer adjustable robust optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Krzysztof Postek, Ward Romeijnders","submitted_at":"2018-05-25T10:59:57Z","abstract_excerpt":"Multi-stage problems with uncertain parameters and integer decisions variables are among the most difficult applications of robust optimization (RO). The challenge in these problems is to find optimal here-and-now decisions, taking into account that the wait-and-see decisions have to adapt to the revealed values of the uncertain parameters. Postek and den Hertog (2016) and Bertsimas and Dunning (2016) propose to solve these problems by constructing piecewise constant decision rules by adaptively partitioning the uncertainty set. The partitions of this set are iteratively updated by separating "},"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":"1805.10079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-25T10:59:57Z","cross_cats_sorted":[],"title_canon_sha256":"989c54db73d7d778fb617e2884e61e90ca05cff9e3636f34821944f3b4d5c9ba","abstract_canon_sha256":"3611c8e1d689f62fc99dd935c594f08c8b6f0b8cb9818277ba8b74b242f22163"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:43.770048Z","signature_b64":"Sl7PrdRnO9y4qXFbBrFTSbufLkhqkn3+1qUy4DRcn0TvLYKBj1h/gUfxymZu4rKfK9W6sn+BbX2QAto7ad7+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf7be55de14475f16cb0e53d24d18270d17785d1b05cedc6ad71df1e82a2092f","last_reissued_at":"2026-05-18T00:14:43.769365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:43.769365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Piecewise constant decision rules via branch-and-bound based scenario detection for integer adjustable robust optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Krzysztof Postek, Ward Romeijnders","submitted_at":"2018-05-25T10:59:57Z","abstract_excerpt":"Multi-stage problems with uncertain parameters and integer decisions variables are among the most difficult applications of robust optimization (RO). The challenge in these problems is to find optimal here-and-now decisions, taking into account that the wait-and-see decisions have to adapt to the revealed values of the uncertain parameters. Postek and den Hertog (2016) and Bertsimas and Dunning (2016) propose to solve these problems by constructing piecewise constant decision rules by adaptively partitioning the uncertainty set. The partitions of this set are iteratively updated by separating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10079","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":""},"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":"1805.10079","created_at":"2026-05-18T00:14:43.769481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10079v2","created_at":"2026-05-18T00:14:43.769481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10079","created_at":"2026-05-18T00:14:43.769481+00:00"},{"alias_kind":"pith_short_12","alias_value":"X556KXPBIR27","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X556KXPBIR27C3FQ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X556KXPB","created_at":"2026-05-18T12:33:01.666342+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/X556KXPBIR27C3FQ4U6SJUMCOD","json":"https://pith.science/pith/X556KXPBIR27C3FQ4U6SJUMCOD.json","graph_json":"https://pith.science/api/pith-number/X556KXPBIR27C3FQ4U6SJUMCOD/graph.json","events_json":"https://pith.science/api/pith-number/X556KXPBIR27C3FQ4U6SJUMCOD/events.json","paper":"https://pith.science/paper/X556KXPB"},"agent_actions":{"view_html":"https://pith.science/pith/X556KXPBIR27C3FQ4U6SJUMCOD","download_json":"https://pith.science/pith/X556KXPBIR27C3FQ4U6SJUMCOD.json","view_paper":"https://pith.science/paper/X556KXPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10079&json=true","fetch_graph":"https://pith.science/api/pith-number/X556KXPBIR27C3FQ4U6SJUMCOD/graph.json","fetch_events":"https://pith.science/api/pith-number/X556KXPBIR27C3FQ4U6SJUMCOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X556KXPBIR27C3FQ4U6SJUMCOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X556KXPBIR27C3FQ4U6SJUMCOD/action/storage_attestation","attest_author":"https://pith.science/pith/X556KXPBIR27C3FQ4U6SJUMCOD/action/author_attestation","sign_citation":"https://pith.science/pith/X556KXPBIR27C3FQ4U6SJUMCOD/action/citation_signature","submit_replication":"https://pith.science/pith/X556KXPBIR27C3FQ4U6SJUMCOD/action/replication_record"}},"created_at":"2026-05-18T00:14:43.769481+00:00","updated_at":"2026-05-18T00:14:43.769481+00:00"}