{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5WVJYHJ6IA6ODCCSC4MM4VJSWB","short_pith_number":"pith:5WVJYHJ6","canonical_record":{"source":{"id":"1611.09754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T17:55:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"917397e89241fafe71f8cabdf11c26975b65b22b76ce0539bb2bf68b27b09d52","abstract_canon_sha256":"517d420b3b4d931f37d1f628f5a79ee73cff9717ad9b61b7a4462715ba7ce0f8"},"schema_version":"1.0"},"canonical_sha256":"edaa9c1d3e403ce188521718ce5532b06c32c520933374f19a8035ad05035ae7","source":{"kind":"arxiv","id":"1611.09754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09754","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09754v1","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09754","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"pith_short_12","alias_value":"5WVJYHJ6IA6O","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5WVJYHJ6IA6ODCCS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5WVJYHJ6","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5WVJYHJ6IA6ODCCSC4MM4VJSWB","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T17:55:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"917397e89241fafe71f8cabdf11c26975b65b22b76ce0539bb2bf68b27b09d52","abstract_canon_sha256":"517d420b3b4d931f37d1f628f5a79ee73cff9717ad9b61b7a4462715ba7ce0f8"},"schema_version":"1.0"},"canonical_sha256":"edaa9c1d3e403ce188521718ce5532b06c32c520933374f19a8035ad05035ae7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:13.107553Z","signature_b64":"HIyik+KrvliPlQTNKvjnDKHG0YidBR2Cyk/T/KciJqTtejyybojuBzNGjJ/9H+Gqbw1mGUMh11rfE3b2RwPtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edaa9c1d3e403ce188521718ce5532b06c32c520933374f19a8035ad05035ae7","last_reissued_at":"2026-05-18T00:56:13.106909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:13.106909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09754","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:56:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zxmixatyqr51sVB9lplXuP8I2c8KU5IGQEXR9Vo+wdpHJTMi6ha8FefPI28DXp+T1V95LUDl3j18hevYm2xCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:35:22.791711Z"},"content_sha256":"aa5ca76e21bd246ff4f10caac3ba92cf9123ba795c9d4385cfa0002c40ab4496","schema_version":"1.0","event_id":"sha256:aa5ca76e21bd246ff4f10caac3ba92cf9123ba795c9d4385cfa0002c40ab4496"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5WVJYHJ6IA6ODCCSC4MM4VJSWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Scenario Aggregation to Approximate Robust Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Chassein, Marc Goerigk","submitted_at":"2016-11-29T17:55:38Z","abstract_excerpt":"As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, this method still gives the best-known bound on a wide range of problems, such as robust shortest path, or robust assignment problems.\n  In this paper we present a simple extension of the midpoint method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09754","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:56:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O007PmeZgIlRXQhVI98YMkcm45nRm59I/ZimPSH27rlCzRjVMnyNZChWF/0FCxJKBqqGqcxelRVAa5BodShwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:35:22.792406Z"},"content_sha256":"7d606c6640cd6c0e1e8d3436e6a0e3b7e1ccfbf5c1836090fde21b86d656f632","schema_version":"1.0","event_id":"sha256:7d606c6640cd6c0e1e8d3436e6a0e3b7e1ccfbf5c1836090fde21b86d656f632"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/bundle.json","state_url":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/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-30T23:35:22Z","links":{"resolver":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB","bundle":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/bundle.json","state":"https://pith.science/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WVJYHJ6IA6ODCCSC4MM4VJSWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5WVJYHJ6IA6ODCCSC4MM4VJSWB","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":"517d420b3b4d931f37d1f628f5a79ee73cff9717ad9b61b7a4462715ba7ce0f8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T17:55:38Z","title_canon_sha256":"917397e89241fafe71f8cabdf11c26975b65b22b76ce0539bb2bf68b27b09d52"},"schema_version":"1.0","source":{"id":"1611.09754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09754","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09754v1","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09754","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"pith_short_12","alias_value":"5WVJYHJ6IA6O","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5WVJYHJ6IA6ODCCS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5WVJYHJ6","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:7d606c6640cd6c0e1e8d3436e6a0e3b7e1ccfbf5c1836090fde21b86d656f632","target":"graph","created_at":"2026-05-18T00:56:13Z","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":"As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, this method still gives the best-known bound on a wide range of problems, such as robust shortest path, or robust assignment problems.\n  In this paper we present a simple extension of the midpoint method","authors_text":"Andr\\'e Chassein, Marc Goerigk","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T17:55:38Z","title":"On Scenario Aggregation to Approximate Robust Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09754","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:aa5ca76e21bd246ff4f10caac3ba92cf9123ba795c9d4385cfa0002c40ab4496","target":"record","created_at":"2026-05-18T00:56:13Z","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":"517d420b3b4d931f37d1f628f5a79ee73cff9717ad9b61b7a4462715ba7ce0f8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-29T17:55:38Z","title_canon_sha256":"917397e89241fafe71f8cabdf11c26975b65b22b76ce0539bb2bf68b27b09d52"},"schema_version":"1.0","source":{"id":"1611.09754","kind":"arxiv","version":1}},"canonical_sha256":"edaa9c1d3e403ce188521718ce5532b06c32c520933374f19a8035ad05035ae7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edaa9c1d3e403ce188521718ce5532b06c32c520933374f19a8035ad05035ae7","first_computed_at":"2026-05-18T00:56:13.106909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:13.106909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HIyik+KrvliPlQTNKvjnDKHG0YidBR2Cyk/T/KciJqTtejyybojuBzNGjJ/9H+Gqbw1mGUMh11rfE3b2RwPtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:13.107553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa5ca76e21bd246ff4f10caac3ba92cf9123ba795c9d4385cfa0002c40ab4496","sha256:7d606c6640cd6c0e1e8d3436e6a0e3b7e1ccfbf5c1836090fde21b86d656f632"],"state_sha256":"2838bae27cfabfa1e7e0b95aadc3c9c6a99eae860aa77d594f8bd3d33d1542ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uzime1j+zmLTJtkBURMkcp4pnB/vej+w3GgeWHoORDixFVTy9Y6g87GTYHsP0zQoqwHp+mhYRGHLko+HF2N9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:35:22.799702Z","bundle_sha256":"0b533f70a7aed66b232dfa19459e85bc4d989a9b14c9e89b28f6573bfb2dcd10"}}