{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NGC5EW25TTSPUZKGIK5O2OCNW7","short_pith_number":"pith:NGC5EW25","schema_version":"1.0","canonical_sha256":"6985d25b5d9ce4fa654642baed384db7ce496c8b893824cdc2c18e50bc7fa1b6","source":{"kind":"arxiv","id":"1802.09792","version":1},"attestation_state":"computed","paper":{"title":"Constructing Representative Scenarios to Approximate Robust Combinatorial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marc Goerigk","submitted_at":"2018-02-27T09:41:55Z","abstract_excerpt":"In robust combinatorial optimization with discrete uncertainty, two general approximation algorithms are frequently used, which are both based on constructing a single scenario representing the whole uncertainty set. In the midpoint method, one optimizes for the average case scenario. In the element-wise worst-case approach, one constructs a scenario by taking the worst case in each component over all scenarios. Both methods are known to be $N$-approximations, where $N$ is the number of scenarios.\n  In this paper, these results are refined by reconsidering their respective proofs as optimizati"},"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":"1802.09792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-27T09:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"1b8356b2657149d469c3c589240c3f3fdcb296132c6a2397acd456c81f642522","abstract_canon_sha256":"8470c0c7a9d6aa04cc551e188eb5ddd87e91598b3bd86115078d8595244d780b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:22.172992Z","signature_b64":"jn361b7ZSX6p5mTxh/sLI9SCiRJ0tFwS2wBskGuOF6H8W+oGxH+esv72Df2CtMQy3lorSaRqWstSIgpU2dqGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6985d25b5d9ce4fa654642baed384db7ce496c8b893824cdc2c18e50bc7fa1b6","last_reissued_at":"2026-05-18T00:22:22.172339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:22.172339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Representative Scenarios to Approximate Robust Combinatorial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marc Goerigk","submitted_at":"2018-02-27T09:41:55Z","abstract_excerpt":"In robust combinatorial optimization with discrete uncertainty, two general approximation algorithms are frequently used, which are both based on constructing a single scenario representing the whole uncertainty set. In the midpoint method, one optimizes for the average case scenario. In the element-wise worst-case approach, one constructs a scenario by taking the worst case in each component over all scenarios. Both methods are known to be $N$-approximations, where $N$ is the number of scenarios.\n  In this paper, these results are refined by reconsidering their respective proofs as optimizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09792","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":"1802.09792","created_at":"2026-05-18T00:22:22.172436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09792v1","created_at":"2026-05-18T00:22:22.172436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09792","created_at":"2026-05-18T00:22:22.172436+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGC5EW25TTSP","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGC5EW25TTSPUZKG","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGC5EW25","created_at":"2026-05-18T12:32:40.477152+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/NGC5EW25TTSPUZKGIK5O2OCNW7","json":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7.json","graph_json":"https://pith.science/api/pith-number/NGC5EW25TTSPUZKGIK5O2OCNW7/graph.json","events_json":"https://pith.science/api/pith-number/NGC5EW25TTSPUZKGIK5O2OCNW7/events.json","paper":"https://pith.science/paper/NGC5EW25"},"agent_actions":{"view_html":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7","download_json":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7.json","view_paper":"https://pith.science/paper/NGC5EW25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09792&json=true","fetch_graph":"https://pith.science/api/pith-number/NGC5EW25TTSPUZKGIK5O2OCNW7/graph.json","fetch_events":"https://pith.science/api/pith-number/NGC5EW25TTSPUZKGIK5O2OCNW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/action/storage_attestation","attest_author":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/action/author_attestation","sign_citation":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/action/citation_signature","submit_replication":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/action/replication_record"}},"created_at":"2026-05-18T00:22:22.172436+00:00","updated_at":"2026-05-18T00:22:22.172436+00:00"}