{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3FOSV537ZAMH7MNVA7HLMYQGBG","short_pith_number":"pith:3FOSV537","schema_version":"1.0","canonical_sha256":"d95d2af77fc8187fb1b507ceb6620609a6497b1283d8d10a98e136ecb77be410","source":{"kind":"arxiv","id":"1610.05127","version":1},"attestation_state":"computed","paper":{"title":"Compromise Solutions for Robust Combinatorial Optimization with Variable-Sized Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andr\\'e Chassein, Marc Goerigk","submitted_at":"2016-10-17T14:10:43Z","abstract_excerpt":"In classic robust optimization, it is assumed that a set of possible parameter realizations, the uncertainty set, is modeled in a previous step and part of the input. As recent work has shown, finding the most suitable uncertainty set is in itself already a difficult task. We consider robust problems where the uncertainty set is not completely defined. Only the shape is known, but not its size. Such a setting is known as variable-sized uncertainty.\n  In this work we present an approach how to find a single robust solution, that performs well on average over all possible uncertainty set sizes. "},"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":"1610.05127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-17T14:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"9b979ad52b809a7985da7613f523e4759d13f000d7a41cc390c50f67fff62023","abstract_canon_sha256":"a08d45e44a4b395709913c24b356e9e0b76926967e66b48fcbdf6d2e8c2d3699"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:06.140782Z","signature_b64":"gBTV+/Efj3s3MPpB2uAigyv4QpkpHdlRzmSBg/CuSp/rNeo8W1EoEITr6zXJ8Qd5AMI99CFp97CprZQK9zCaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d95d2af77fc8187fb1b507ceb6620609a6497b1283d8d10a98e136ecb77be410","last_reissued_at":"2026-05-18T01:02:06.140039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:06.140039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compromise Solutions for Robust Combinatorial Optimization with Variable-Sized Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andr\\'e Chassein, Marc Goerigk","submitted_at":"2016-10-17T14:10:43Z","abstract_excerpt":"In classic robust optimization, it is assumed that a set of possible parameter realizations, the uncertainty set, is modeled in a previous step and part of the input. As recent work has shown, finding the most suitable uncertainty set is in itself already a difficult task. We consider robust problems where the uncertainty set is not completely defined. Only the shape is known, but not its size. Such a setting is known as variable-sized uncertainty.\n  In this work we present an approach how to find a single robust solution, that performs well on average over all possible uncertainty set sizes. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05127","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":""},"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":"1610.05127","created_at":"2026-05-18T01:02:06.140167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05127v1","created_at":"2026-05-18T01:02:06.140167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05127","created_at":"2026-05-18T01:02:06.140167+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FOSV537ZAMH","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FOSV537ZAMH7MNV","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FOSV537","created_at":"2026-05-18T12:29:55.572404+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/3FOSV537ZAMH7MNVA7HLMYQGBG","json":"https://pith.science/pith/3FOSV537ZAMH7MNVA7HLMYQGBG.json","graph_json":"https://pith.science/api/pith-number/3FOSV537ZAMH7MNVA7HLMYQGBG/graph.json","events_json":"https://pith.science/api/pith-number/3FOSV537ZAMH7MNVA7HLMYQGBG/events.json","paper":"https://pith.science/paper/3FOSV537"},"agent_actions":{"view_html":"https://pith.science/pith/3FOSV537ZAMH7MNVA7HLMYQGBG","download_json":"https://pith.science/pith/3FOSV537ZAMH7MNVA7HLMYQGBG.json","view_paper":"https://pith.science/paper/3FOSV537","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05127&json=true","fetch_graph":"https://pith.science/api/pith-number/3FOSV537ZAMH7MNVA7HLMYQGBG/graph.json","fetch_events":"https://pith.science/api/pith-number/3FOSV537ZAMH7MNVA7HLMYQGBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FOSV537ZAMH7MNVA7HLMYQGBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FOSV537ZAMH7MNVA7HLMYQGBG/action/storage_attestation","attest_author":"https://pith.science/pith/3FOSV537ZAMH7MNVA7HLMYQGBG/action/author_attestation","sign_citation":"https://pith.science/pith/3FOSV537ZAMH7MNVA7HLMYQGBG/action/citation_signature","submit_replication":"https://pith.science/pith/3FOSV537ZAMH7MNVA7HLMYQGBG/action/replication_record"}},"created_at":"2026-05-18T01:02:06.140167+00:00","updated_at":"2026-05-18T01:02:06.140167+00:00"}