{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:THMP3GB2XDNUMAUY7AMIOSDJXW","short_pith_number":"pith:THMP3GB2","schema_version":"1.0","canonical_sha256":"99d8fd983ab8db460298f818874869bdb90af6ff054068a7d1bdd789a4adb6c0","source":{"kind":"arxiv","id":"2003.10507","version":2},"attestation_state":"computed","paper":{"title":"A Comparison of Discrete and Polyhedral Uncertainty Sets for Robust Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francis Garuba, Marc Goerigk, Peter Jacko","submitted_at":"2020-03-23T19:36:09Z","abstract_excerpt":"We consider a network design and expansion problem, where we need to make a capacity investment now, such that uncertain future demand can be satisfied as closely as possible. To use a robust optimization approach, we need to construct an uncertainty set that contains all scenarios that we believe to be possible. In this paper we discuss how to construct two common types of uncertainty sets, which are discrete and polyhedral uncertainty, using real-world data. We employ clustering to generate a discrete uncertainty set, and place hyperplanes sequentially to generate a polyhedral uncertainty se"},"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":"2003.10507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-23T19:36:09Z","cross_cats_sorted":[],"title_canon_sha256":"6f179aad7e2ec6fc48aebff1e219809ef974e1058d813254a5be7caa2365e067","abstract_canon_sha256":"00fff19c77cfeb745d170c44ee9dc69a650aad16fc96d988b50578ccc4faa0f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:26.677076Z","signature_b64":"bHayiLOzEKD+jWmls4pjhxV0vmY5Uv+HkwG1dlar+nx9W8MxYGWCGs60CGPqPM6mEdpOcTexjuPxN04xYzaLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99d8fd983ab8db460298f818874869bdb90af6ff054068a7d1bdd789a4adb6c0","last_reissued_at":"2026-07-05T02:19:26.676638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:26.676638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison of Discrete and Polyhedral Uncertainty Sets for Robust Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francis Garuba, Marc Goerigk, Peter Jacko","submitted_at":"2020-03-23T19:36:09Z","abstract_excerpt":"We consider a network design and expansion problem, where we need to make a capacity investment now, such that uncertain future demand can be satisfied as closely as possible. To use a robust optimization approach, we need to construct an uncertainty set that contains all scenarios that we believe to be possible. In this paper we discuss how to construct two common types of uncertainty sets, which are discrete and polyhedral uncertainty, using real-world data. We employ clustering to generate a discrete uncertainty set, and place hyperplanes sequentially to generate a polyhedral uncertainty se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.10507","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/2003.10507/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":"2003.10507","created_at":"2026-07-05T02:19:26.676700+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.10507v2","created_at":"2026-07-05T02:19:26.676700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.10507","created_at":"2026-07-05T02:19:26.676700+00:00"},{"alias_kind":"pith_short_12","alias_value":"THMP3GB2XDNU","created_at":"2026-07-05T02:19:26.676700+00:00"},{"alias_kind":"pith_short_16","alias_value":"THMP3GB2XDNUMAUY","created_at":"2026-07-05T02:19:26.676700+00:00"},{"alias_kind":"pith_short_8","alias_value":"THMP3GB2","created_at":"2026-07-05T02:19:26.676700+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.07368","citing_title":"A K-adaptability Approach to Proton Radiation Therapy Robust Treatment Planning","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW","json":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW.json","graph_json":"https://pith.science/api/pith-number/THMP3GB2XDNUMAUY7AMIOSDJXW/graph.json","events_json":"https://pith.science/api/pith-number/THMP3GB2XDNUMAUY7AMIOSDJXW/events.json","paper":"https://pith.science/paper/THMP3GB2"},"agent_actions":{"view_html":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW","download_json":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW.json","view_paper":"https://pith.science/paper/THMP3GB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.10507&json=true","fetch_graph":"https://pith.science/api/pith-number/THMP3GB2XDNUMAUY7AMIOSDJXW/graph.json","fetch_events":"https://pith.science/api/pith-number/THMP3GB2XDNUMAUY7AMIOSDJXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW/action/storage_attestation","attest_author":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW/action/author_attestation","sign_citation":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW/action/citation_signature","submit_replication":"https://pith.science/pith/THMP3GB2XDNUMAUY7AMIOSDJXW/action/replication_record"}},"created_at":"2026-07-05T02:19:26.676700+00:00","updated_at":"2026-07-05T02:19:26.676700+00:00"}