{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4FSFGTOOM6LM2HVC5KMNIRHD3H","short_pith_number":"pith:4FSFGTOO","canonical_record":{"source":{"id":"1802.05072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T12:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"654a0a388244b5e74a1e50297f91f256fcd64aea5fc60b83f9155261fb5f36cf","abstract_canon_sha256":"e41ad91ddc2a5fb0a5e264c791252afcdd9f1a91d1b6b251cae427ba3c628b29"},"schema_version":"1.0"},"canonical_sha256":"e164534dce6796cd1ea2ea98d444e3d9fd6980768ff9c33fce542ca398846c62","source":{"kind":"arxiv","id":"1802.05072","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05072","created_at":"2026-05-17T23:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05072v3","created_at":"2026-05-17T23:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05072","created_at":"2026-05-17T23:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"4FSFGTOOM6LM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4FSFGTOOM6LM2HVC","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4FSFGTOO","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4FSFGTOOM6LM2HVC5KMNIRHD3H","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T12:46:02Z","cross_cats_sorted":[],"title_canon_sha256":"654a0a388244b5e74a1e50297f91f256fcd64aea5fc60b83f9155261fb5f36cf","abstract_canon_sha256":"e41ad91ddc2a5fb0a5e264c791252afcdd9f1a91d1b6b251cae427ba3c628b29"},"schema_version":"1.0"},"canonical_sha256":"e164534dce6796cd1ea2ea98d444e3d9fd6980768ff9c33fce542ca398846c62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:07.424981Z","signature_b64":"YL+QJdSpHvjvnKLppH9DH/VN2SI2iw4Loh8SrzMHkyUBVNYVAuhv7KOMer2GbXboPw44RunTKDmQtl5+3y5nBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e164534dce6796cd1ea2ea98d444e3d9fd6980768ff9c33fce542ca398846c62","last_reissued_at":"2026-05-17T23:50:07.424268Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:07.424268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05072","source_version":3,"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-17T23:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sADTHsTlBr4W7XXzqi5SJWfMFJk6hTCGTsw6un6DxqnP2o/QhqPkzdADAee+etgc80O3tQdNNQAofVDQZNJ0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:44:29.366463Z"},"content_sha256":"3411882c7b8a5ba717b1a02808fc02ba48603a81fed9f18a46c06b5a797445c5","schema_version":"1.0","event_id":"sha256:3411882c7b8a5ba717b1a02808fc02ba48603a81fed9f18a46c06b5a797445c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4FSFGTOOM6LM2HVC5KMNIRHD3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for Min-max-min Robustness for Combinatorial Problems with Budgeted Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andr\\'e Chassein, Jannis Kurtz, Marc Goerigk, Michael Poss","submitted_at":"2018-02-14T12:46:02Z","abstract_excerpt":"We consider robust combinatorial optimization problems where the decision maker can react to a scenario by choosing from a finite set of $k$ solutions. This approach is appropriate for decision problems under uncertainty where the implementation of decisions requires preparing the ground. We focus on the case that the set of possible scenarios is described through a budgeted uncertainty set and provide three algorithms for the problem. The first algorithm solves heuristically the dualized problem, a non-convex mixed-integer non-linear program (MINLP), via an alternating optimization approach. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05072","kind":"arxiv","version":3},"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-17T23:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+KxfVXBP/n3WWe/eCjzh7eCr95gWCHgQM9gqJwt9gieEXO7cOo/U/qzJ37XiTF4WeeAX5oZqvZ9zrQhEp5JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:44:29.367150Z"},"content_sha256":"9a9e60effad3dea34c424bc1e60be2836a4b326a96a83306b321c7616f01239f","schema_version":"1.0","event_id":"sha256:9a9e60effad3dea34c424bc1e60be2836a4b326a96a83306b321c7616f01239f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FSFGTOOM6LM2HVC5KMNIRHD3H/bundle.json","state_url":"https://pith.science/pith/4FSFGTOOM6LM2HVC5KMNIRHD3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FSFGTOOM6LM2HVC5KMNIRHD3H/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-28T15:44:29Z","links":{"resolver":"https://pith.science/pith/4FSFGTOOM6LM2HVC5KMNIRHD3H","bundle":"https://pith.science/pith/4FSFGTOOM6LM2HVC5KMNIRHD3H/bundle.json","state":"https://pith.science/pith/4FSFGTOOM6LM2HVC5KMNIRHD3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FSFGTOOM6LM2HVC5KMNIRHD3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4FSFGTOOM6LM2HVC5KMNIRHD3H","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":"e41ad91ddc2a5fb0a5e264c791252afcdd9f1a91d1b6b251cae427ba3c628b29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T12:46:02Z","title_canon_sha256":"654a0a388244b5e74a1e50297f91f256fcd64aea5fc60b83f9155261fb5f36cf"},"schema_version":"1.0","source":{"id":"1802.05072","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05072","created_at":"2026-05-17T23:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05072v3","created_at":"2026-05-17T23:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05072","created_at":"2026-05-17T23:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"4FSFGTOOM6LM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4FSFGTOOM6LM2HVC","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4FSFGTOO","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:9a9e60effad3dea34c424bc1e60be2836a4b326a96a83306b321c7616f01239f","target":"graph","created_at":"2026-05-17T23:50:07Z","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":"We consider robust combinatorial optimization problems where the decision maker can react to a scenario by choosing from a finite set of $k$ solutions. This approach is appropriate for decision problems under uncertainty where the implementation of decisions requires preparing the ground. We focus on the case that the set of possible scenarios is described through a budgeted uncertainty set and provide three algorithms for the problem. The first algorithm solves heuristically the dualized problem, a non-convex mixed-integer non-linear program (MINLP), via an alternating optimization approach. ","authors_text":"Andr\\'e Chassein, Jannis Kurtz, Marc Goerigk, Michael Poss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T12:46:02Z","title":"Faster Algorithms for Min-max-min Robustness for Combinatorial Problems with Budgeted Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05072","kind":"arxiv","version":3},"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:3411882c7b8a5ba717b1a02808fc02ba48603a81fed9f18a46c06b5a797445c5","target":"record","created_at":"2026-05-17T23:50:07Z","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":"e41ad91ddc2a5fb0a5e264c791252afcdd9f1a91d1b6b251cae427ba3c628b29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T12:46:02Z","title_canon_sha256":"654a0a388244b5e74a1e50297f91f256fcd64aea5fc60b83f9155261fb5f36cf"},"schema_version":"1.0","source":{"id":"1802.05072","kind":"arxiv","version":3}},"canonical_sha256":"e164534dce6796cd1ea2ea98d444e3d9fd6980768ff9c33fce542ca398846c62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e164534dce6796cd1ea2ea98d444e3d9fd6980768ff9c33fce542ca398846c62","first_computed_at":"2026-05-17T23:50:07.424268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:07.424268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YL+QJdSpHvjvnKLppH9DH/VN2SI2iw4Loh8SrzMHkyUBVNYVAuhv7KOMer2GbXboPw44RunTKDmQtl5+3y5nBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:07.424981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05072","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3411882c7b8a5ba717b1a02808fc02ba48603a81fed9f18a46c06b5a797445c5","sha256:9a9e60effad3dea34c424bc1e60be2836a4b326a96a83306b321c7616f01239f"],"state_sha256":"80899184b5c248fb2abc2d9676278e980abce7978c2d37a036db1c5a0188e7d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtF0GqSankOajX+Ji9NMo0JaH3k42OU2TGRS+6GQv6A76RNrkvRZFG20SrSDdsnk0JnyQgfT1PfwlwU7KnJCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:44:29.370594Z","bundle_sha256":"21b085dda0830cc9f0a52b451afdeccd8f039e9db7b77ec6509d0e433ad24c14"}}