{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NGC5EW25TTSPUZKGIK5O2OCNW7","short_pith_number":"pith:NGC5EW25","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"},"canonical_sha256":"6985d25b5d9ce4fa654642baed384db7ce496c8b893824cdc2c18e50bc7fa1b6","source":{"kind":"arxiv","id":"1802.09792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09792","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09792v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09792","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"NGC5EW25TTSP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGC5EW25TTSPUZKG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGC5EW25","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NGC5EW25TTSPUZKGIK5O2OCNW7","target":"record","payload":{"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"},"canonical_sha256":"6985d25b5d9ce4fa654642baed384db7ce496c8b893824cdc2c18e50bc7fa1b6","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"},"source_kind":"arxiv","source_id":"1802.09792","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlJLzopOu3nxiApYQKhnxI0UjB8pUVPzQhDCjMIaTSyXU+UJexSPiSB12smbD1D2EfEJuTYNhLL2PYXi1x3rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:38:34.828941Z"},"content_sha256":"1a0a88d5cc4bfaf974e1d8fae15b03fdf3ad333d6151c3859c9718dc28073dea","schema_version":"1.0","event_id":"sha256:1a0a88d5cc4bfaf974e1d8fae15b03fdf3ad333d6151c3859c9718dc28073dea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NGC5EW25TTSPUZKGIK5O2OCNW7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xy1LcOH9CL18I2OEMftHk/MK41W6yioRc3Els+eTg8wfnU2pMtVLcsSlTJXYASU9w9ASudLt33UA0WSm8FmuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:38:34.829758Z"},"content_sha256":"9aa824b25bb77c3db697d42fd00474e6bd2952e14ed97bbfb9410bb483c8754d","schema_version":"1.0","event_id":"sha256:9aa824b25bb77c3db697d42fd00474e6bd2952e14ed97bbfb9410bb483c8754d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/bundle.json","state_url":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T17:38:34Z","links":{"resolver":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7","bundle":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/bundle.json","state":"https://pith.science/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGC5EW25TTSPUZKGIK5O2OCNW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NGC5EW25TTSPUZKGIK5O2OCNW7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8470c0c7a9d6aa04cc551e188eb5ddd87e91598b3bd86115078d8595244d780b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-27T09:41:55Z","title_canon_sha256":"1b8356b2657149d469c3c589240c3f3fdcb296132c6a2397acd456c81f642522"},"schema_version":"1.0","source":{"id":"1802.09792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09792","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09792v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09792","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"NGC5EW25TTSP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGC5EW25TTSPUZKG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGC5EW25","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:9aa824b25bb77c3db697d42fd00474e6bd2952e14ed97bbfb9410bb483c8754d","target":"graph","created_at":"2026-05-18T00:22:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Marc Goerigk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-27T09:41:55Z","title":"Constructing Representative Scenarios to Approximate Robust Combinatorial Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09792","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1a0a88d5cc4bfaf974e1d8fae15b03fdf3ad333d6151c3859c9718dc28073dea","target":"record","created_at":"2026-05-18T00:22:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8470c0c7a9d6aa04cc551e188eb5ddd87e91598b3bd86115078d8595244d780b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-27T09:41:55Z","title_canon_sha256":"1b8356b2657149d469c3c589240c3f3fdcb296132c6a2397acd456c81f642522"},"schema_version":"1.0","source":{"id":"1802.09792","kind":"arxiv","version":1}},"canonical_sha256":"6985d25b5d9ce4fa654642baed384db7ce496c8b893824cdc2c18e50bc7fa1b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6985d25b5d9ce4fa654642baed384db7ce496c8b893824cdc2c18e50bc7fa1b6","first_computed_at":"2026-05-18T00:22:22.172339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:22.172339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jn361b7ZSX6p5mTxh/sLI9SCiRJ0tFwS2wBskGuOF6H8W+oGxH+esv72Df2CtMQy3lorSaRqWstSIgpU2dqGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:22.172992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a0a88d5cc4bfaf974e1d8fae15b03fdf3ad333d6151c3859c9718dc28073dea","sha256:9aa824b25bb77c3db697d42fd00474e6bd2952e14ed97bbfb9410bb483c8754d"],"state_sha256":"e198a1ec856aedb4e6ad461079678934dc1ae668d83ff8a1094ff35114d77a02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZ4vKIS6ewYkrMohq0TZGyUcizpuK/yoPXmP+8Q43QP8KzKSSkENOt9eleY+MQG7HDvULz0dOzMnz5HIt7loBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:38:34.833812Z","bundle_sha256":"9ab75392d42624bf8f014ffa4e47e92df1c2c8bda13a99ad4bd8ac77255a17d9"}}