{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DKSJUN2TZLJMOKEOBY3RBV3J5M","short_pith_number":"pith:DKSJUN2T","canonical_record":{"source":{"id":"1811.00824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-02T11:20:04Z","cross_cats_sorted":["cs.CC","cs.DM","cs.PF"],"title_canon_sha256":"c105567cd5032214420628c0199075835c19ca558a8b01777d236539cdfe1853","abstract_canon_sha256":"9221931cf33a76449f5aaf99810371dc5e607b652b9a72250c1e1182237abd4c"},"schema_version":"1.0"},"canonical_sha256":"1aa49a3753cad2c7288e0e3710d769eb30055eb08b3825f1fbe8caa646761b3b","source":{"kind":"arxiv","id":"1811.00824","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00824","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00824v2","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00824","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"DKSJUN2TZLJM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DKSJUN2TZLJMOKEO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DKSJUN2T","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DKSJUN2TZLJMOKEOBY3RBV3J5M","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-02T11:20:04Z","cross_cats_sorted":["cs.CC","cs.DM","cs.PF"],"title_canon_sha256":"c105567cd5032214420628c0199075835c19ca558a8b01777d236539cdfe1853","abstract_canon_sha256":"9221931cf33a76449f5aaf99810371dc5e607b652b9a72250c1e1182237abd4c"},"schema_version":"1.0"},"canonical_sha256":"1aa49a3753cad2c7288e0e3710d769eb30055eb08b3825f1fbe8caa646761b3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:28.156812Z","signature_b64":"JucEwIAgANnf8Cw39rKTBDx6rmTGmQA/XgGofmwhHWj9VEcAUExoNCU4Mpk4ROqOotV2EVEsUKqT43SuekESBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aa49a3753cad2c7288e0e3710d769eb30055eb08b3825f1fbe8caa646761b3b","last_reissued_at":"2026-05-17T23:54:28.156106Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:28.156106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00824","source_version":2,"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:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rA2gdhrc1rjyWKgH2vykM4qqKWd5NuKhg7kMjbU8s9gYd5lgEl2O4pHGV8koRRjq1oNz2ddJugvbW5n0ChUgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:29:36.377862Z"},"content_sha256":"2b3027e0afb7a5398dfdcdc0bd3a5a881d3a5c35853e3fc6f752e21fefa335a6","schema_version":"1.0","event_id":"sha256:2b3027e0afb7a5398dfdcdc0bd3a5a881d3a5c35853e3fc6f752e21fefa335a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DKSJUN2TZLJMOKEOBY3RBV3J5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating Hard Instances for Robust Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.PF"],"primary_cat":"math.OC","authors_text":"Marc Goerigk, Stephen J. Maher","submitted_at":"2018-11-02T11:20:04Z","abstract_excerpt":"While research in robust optimization has attracted considerable interest over the last decades, its algorithmic development has been hindered by several factors. One of them is a missing set of benchmark instances that make algorithm performance better comparable, and makes reproducing instances unnecessary. Such a benchmark set should contain hard instances in particular, but so far, the standard approach to produce instances has been to sample values randomly from a uniform distribution.\n  In this paper we introduce a new method to produce hard instances for min-max combinatorial optimizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00824","kind":"arxiv","version":2},"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:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2X/iIcCWH6jV5LmZgVd622ClLyk2JwRVT2IXB604ZRMidIGu4foagt08GCbFeYnz05k9spP4J/eqQUaTZJ3QDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:29:36.378570Z"},"content_sha256":"19e0cd1dd6ce71557835316de9006e065ff2df5d24479c04feba47597bca864e","schema_version":"1.0","event_id":"sha256:19e0cd1dd6ce71557835316de9006e065ff2df5d24479c04feba47597bca864e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/bundle.json","state_url":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/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-31T02:29:36Z","links":{"resolver":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M","bundle":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/bundle.json","state":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DKSJUN2TZLJMOKEOBY3RBV3J5M","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":"9221931cf33a76449f5aaf99810371dc5e607b652b9a72250c1e1182237abd4c","cross_cats_sorted":["cs.CC","cs.DM","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-02T11:20:04Z","title_canon_sha256":"c105567cd5032214420628c0199075835c19ca558a8b01777d236539cdfe1853"},"schema_version":"1.0","source":{"id":"1811.00824","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00824","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00824v2","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00824","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"DKSJUN2TZLJM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DKSJUN2TZLJMOKEO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DKSJUN2T","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:19e0cd1dd6ce71557835316de9006e065ff2df5d24479c04feba47597bca864e","target":"graph","created_at":"2026-05-17T23:54:28Z","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":"While research in robust optimization has attracted considerable interest over the last decades, its algorithmic development has been hindered by several factors. One of them is a missing set of benchmark instances that make algorithm performance better comparable, and makes reproducing instances unnecessary. Such a benchmark set should contain hard instances in particular, but so far, the standard approach to produce instances has been to sample values randomly from a uniform distribution.\n  In this paper we introduce a new method to produce hard instances for min-max combinatorial optimizati","authors_text":"Marc Goerigk, Stephen J. Maher","cross_cats":["cs.CC","cs.DM","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-02T11:20:04Z","title":"Generating Hard Instances for Robust Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00824","kind":"arxiv","version":2},"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:2b3027e0afb7a5398dfdcdc0bd3a5a881d3a5c35853e3fc6f752e21fefa335a6","target":"record","created_at":"2026-05-17T23:54:28Z","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":"9221931cf33a76449f5aaf99810371dc5e607b652b9a72250c1e1182237abd4c","cross_cats_sorted":["cs.CC","cs.DM","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-02T11:20:04Z","title_canon_sha256":"c105567cd5032214420628c0199075835c19ca558a8b01777d236539cdfe1853"},"schema_version":"1.0","source":{"id":"1811.00824","kind":"arxiv","version":2}},"canonical_sha256":"1aa49a3753cad2c7288e0e3710d769eb30055eb08b3825f1fbe8caa646761b3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1aa49a3753cad2c7288e0e3710d769eb30055eb08b3825f1fbe8caa646761b3b","first_computed_at":"2026-05-17T23:54:28.156106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:28.156106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JucEwIAgANnf8Cw39rKTBDx6rmTGmQA/XgGofmwhHWj9VEcAUExoNCU4Mpk4ROqOotV2EVEsUKqT43SuekESBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:28.156812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00824","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b3027e0afb7a5398dfdcdc0bd3a5a881d3a5c35853e3fc6f752e21fefa335a6","sha256:19e0cd1dd6ce71557835316de9006e065ff2df5d24479c04feba47597bca864e"],"state_sha256":"4b57edd7b35affdad95bdcd7151d2d1d1edba693daef241e11d00f87d78afaec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A55Ppgv1gnG1xUKnx+93Zfl7KDWU0D/VDxNonEV70/AcdVI2nEBiymnU95OYFUscjvMAn8M2/gza9+4zCRXCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:29:36.382459Z","bundle_sha256":"2fd437fc6a96402d16a49d800c1e6faff14320a8790ba4af093b80f595b68aeb"}}