{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EHKVEOUU4SCCOQ7IBQQU5UUCXH","short_pith_number":"pith:EHKVEOUU","canonical_record":{"source":{"id":"1701.06317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-23T10:17:52Z","cross_cats_sorted":[],"title_canon_sha256":"134d5ccb92c82e75f6c7e677988f79ef01e9432f5d0f98163cdf0e924685dde8","abstract_canon_sha256":"9232c7eaa5f7330d0b85361b3e4361995ade14de53e5ee0b0d6592adda98b10d"},"schema_version":"1.0"},"canonical_sha256":"21d5523a94e4842743e80c214ed282b9c5f194b4ae31d68c25d210ddd4f51361","source":{"kind":"arxiv","id":"1701.06317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06317","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06317v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06317","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"EHKVEOUU4SCC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHKVEOUU4SCCOQ7I","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHKVEOUU","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EHKVEOUU4SCCOQ7IBQQU5UUCXH","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-23T10:17:52Z","cross_cats_sorted":[],"title_canon_sha256":"134d5ccb92c82e75f6c7e677988f79ef01e9432f5d0f98163cdf0e924685dde8","abstract_canon_sha256":"9232c7eaa5f7330d0b85361b3e4361995ade14de53e5ee0b0d6592adda98b10d"},"schema_version":"1.0"},"canonical_sha256":"21d5523a94e4842743e80c214ed282b9c5f194b4ae31d68c25d210ddd4f51361","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.684656Z","signature_b64":"DepiD7sTOAJU6VdWcSH9zb7s6SGzIFI6TIDRTcIFBT3S9j/Z7gkIOIJjVzgbGQaIgd0SbqA9JoYnGMgDQ8S7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21d5523a94e4842743e80c214ed282b9c5f194b4ae31d68c25d210ddd4f51361","last_reissued_at":"2026-05-18T00:52:18.684185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.684185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06317","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:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKc0GUnTFgJ6h/hOnAnLwMsQHOyblyF43ObkPqTEVEHwabMHu8QgyobbFlZ5nj/24sbvvDIaWnK34eH6AgrfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:31:13.761258Z"},"content_sha256":"a9735603958679c6b4355609ac492f3a0afe8a9a081af0971ec4faa1eb3e753a","schema_version":"1.0","event_id":"sha256:a9735603958679c6b4355609ac492f3a0afe8a9a081af0971ec4faa1eb3e753a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EHKVEOUU4SCCOQ7IBQQU5UUCXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Raith, Anita Sch\\\"obel, Lisa Thom, Marie Schmidt","submitted_at":"2017-01-23T10:17:52Z","abstract_excerpt":"In this paper we develop two approaches to find minmax robust efficient solutions for multi-objective combinatorial optimization problems with cardinality-constrained uncertainty. First, we extend an algorithm of Bertsimas and Sim (2003) for the single-objective problem to multi-objective optimization. We propose also an enhancement to accelerate the algorithm, even for the single-objective case, and we develop a faster version for special multi-objective instances. Second, we introduce a deterministic multi-objective problem with sum and bottleneck functions, which provides a superset of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06317","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:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"orWDNgMxj/DhTEFUJ25Rd+YYiOg7Ydia66nKham7mMaAyQFe1slrTPoUZslUgxfLUtkCHCalHSI7Na2Llc7xDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:31:13.761619Z"},"content_sha256":"8ea12d87500b610616acd29cf7df773ccb07371c3afc63b76bbf4d02e979b695","schema_version":"1.0","event_id":"sha256:8ea12d87500b610616acd29cf7df773ccb07371c3afc63b76bbf4d02e979b695"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/bundle.json","state_url":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/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-06-05T10:31:13Z","links":{"resolver":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH","bundle":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/bundle.json","state":"https://pith.science/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHKVEOUU4SCCOQ7IBQQU5UUCXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EHKVEOUU4SCCOQ7IBQQU5UUCXH","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":"9232c7eaa5f7330d0b85361b3e4361995ade14de53e5ee0b0d6592adda98b10d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-23T10:17:52Z","title_canon_sha256":"134d5ccb92c82e75f6c7e677988f79ef01e9432f5d0f98163cdf0e924685dde8"},"schema_version":"1.0","source":{"id":"1701.06317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06317","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06317v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06317","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"EHKVEOUU4SCC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHKVEOUU4SCCOQ7I","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHKVEOUU","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:8ea12d87500b610616acd29cf7df773ccb07371c3afc63b76bbf4d02e979b695","target":"graph","created_at":"2026-05-18T00:52:18Z","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 this paper we develop two approaches to find minmax robust efficient solutions for multi-objective combinatorial optimization problems with cardinality-constrained uncertainty. First, we extend an algorithm of Bertsimas and Sim (2003) for the single-objective problem to multi-objective optimization. We propose also an enhancement to accelerate the algorithm, even for the single-objective case, and we develop a faster version for special multi-objective instances. Second, we introduce a deterministic multi-objective problem with sum and bottleneck functions, which provides a superset of the ","authors_text":"Andrea Raith, Anita Sch\\\"obel, Lisa Thom, Marie Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-23T10:17:52Z","title":"Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06317","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:a9735603958679c6b4355609ac492f3a0afe8a9a081af0971ec4faa1eb3e753a","target":"record","created_at":"2026-05-18T00:52:18Z","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":"9232c7eaa5f7330d0b85361b3e4361995ade14de53e5ee0b0d6592adda98b10d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-23T10:17:52Z","title_canon_sha256":"134d5ccb92c82e75f6c7e677988f79ef01e9432f5d0f98163cdf0e924685dde8"},"schema_version":"1.0","source":{"id":"1701.06317","kind":"arxiv","version":1}},"canonical_sha256":"21d5523a94e4842743e80c214ed282b9c5f194b4ae31d68c25d210ddd4f51361","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21d5523a94e4842743e80c214ed282b9c5f194b4ae31d68c25d210ddd4f51361","first_computed_at":"2026-05-18T00:52:18.684185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:18.684185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DepiD7sTOAJU6VdWcSH9zb7s6SGzIFI6TIDRTcIFBT3S9j/Z7gkIOIJjVzgbGQaIgd0SbqA9JoYnGMgDQ8S7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:18.684656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9735603958679c6b4355609ac492f3a0afe8a9a081af0971ec4faa1eb3e753a","sha256:8ea12d87500b610616acd29cf7df773ccb07371c3afc63b76bbf4d02e979b695"],"state_sha256":"3122e970f4e590ff417b43b8f715a22dbe128245932345626538d6a6097b815e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtcZ8Dj2xK2qeLNq7R92eprS8TkzqZCeZwl55opoAdbIHI/UHjviugbKkdefX+0wGW8NtGhm8TAGTalT10WlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:31:13.764079Z","bundle_sha256":"211d448633a6278df8cd7eb6ebecf555b20ed6b233a69924f873c32ccafc669b"}}