{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IJP2E6PDWVZU2KYISN3WGU7WP7","short_pith_number":"pith:IJP2E6PD","schema_version":"1.0","canonical_sha256":"425fa279e3b5734d2b0893776353f67fc503b86c752382215bf480e4177b2586","source":{"kind":"arxiv","id":"1812.04895","version":2},"attestation_state":"computed","paper":{"title":"Mixed Uncertainty Sets for Robust Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"math.OC","authors_text":"Marc Goerigk, Rahul Roy, Trivikram Dokka","submitted_at":"2018-12-12T11:04:32Z","abstract_excerpt":"In robust optimization, the uncertainty set is used to model all possible outcomes of uncertain parameters. In the classic setting, one assumes that this set is provided by the decision maker based on the data available to her. Only recently it has been recognized that the process of building useful uncertainty sets is in itself a challenging task that requires mathematical support.\n  In this paper, we propose an approach to go beyond the classic setting, by assuming multiple uncertainty sets to be prepared, each with a weight showing the degree of belief that the set is a \"true\" model of unce"},"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":"1812.04895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-12T11:04:32Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"935ea4f7ddc5af1c1ec86a0293dd22f68b26a1670affe76d324d96fd50a498b3","abstract_canon_sha256":"bdc2ca15d2c25a676f6418b70933a27994d70ac8976baa786bbcb5975d2d9950"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:53.496026Z","signature_b64":"gA079BxEFJEgv5pfzoC9xEYmcn+U4vew7O4Mi/c4wUeYaY6gRHhcRD498ZCJvDgTahmm9Itrt3/D3JDiFRwtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"425fa279e3b5734d2b0893776353f67fc503b86c752382215bf480e4177b2586","last_reissued_at":"2026-05-17T23:55:53.495380Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:53.495380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed Uncertainty Sets for Robust Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"math.OC","authors_text":"Marc Goerigk, Rahul Roy, Trivikram Dokka","submitted_at":"2018-12-12T11:04:32Z","abstract_excerpt":"In robust optimization, the uncertainty set is used to model all possible outcomes of uncertain parameters. In the classic setting, one assumes that this set is provided by the decision maker based on the data available to her. Only recently it has been recognized that the process of building useful uncertainty sets is in itself a challenging task that requires mathematical support.\n  In this paper, we propose an approach to go beyond the classic setting, by assuming multiple uncertainty sets to be prepared, each with a weight showing the degree of belief that the set is a \"true\" model of unce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04895","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":"1812.04895","created_at":"2026-05-17T23:55:53.495491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04895v2","created_at":"2026-05-17T23:55:53.495491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04895","created_at":"2026-05-17T23:55:53.495491+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJP2E6PDWVZU","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJP2E6PDWVZU2KYI","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJP2E6PD","created_at":"2026-05-18T12:32:31.084164+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/IJP2E6PDWVZU2KYISN3WGU7WP7","json":"https://pith.science/pith/IJP2E6PDWVZU2KYISN3WGU7WP7.json","graph_json":"https://pith.science/api/pith-number/IJP2E6PDWVZU2KYISN3WGU7WP7/graph.json","events_json":"https://pith.science/api/pith-number/IJP2E6PDWVZU2KYISN3WGU7WP7/events.json","paper":"https://pith.science/paper/IJP2E6PD"},"agent_actions":{"view_html":"https://pith.science/pith/IJP2E6PDWVZU2KYISN3WGU7WP7","download_json":"https://pith.science/pith/IJP2E6PDWVZU2KYISN3WGU7WP7.json","view_paper":"https://pith.science/paper/IJP2E6PD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04895&json=true","fetch_graph":"https://pith.science/api/pith-number/IJP2E6PDWVZU2KYISN3WGU7WP7/graph.json","fetch_events":"https://pith.science/api/pith-number/IJP2E6PDWVZU2KYISN3WGU7WP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJP2E6PDWVZU2KYISN3WGU7WP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJP2E6PDWVZU2KYISN3WGU7WP7/action/storage_attestation","attest_author":"https://pith.science/pith/IJP2E6PDWVZU2KYISN3WGU7WP7/action/author_attestation","sign_citation":"https://pith.science/pith/IJP2E6PDWVZU2KYISN3WGU7WP7/action/citation_signature","submit_replication":"https://pith.science/pith/IJP2E6PDWVZU2KYISN3WGU7WP7/action/replication_record"}},"created_at":"2026-05-17T23:55:53.495491+00:00","updated_at":"2026-05-17T23:55:53.495491+00:00"}