{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DKSJUN2TZLJMOKEOBY3RBV3J5M","short_pith_number":"pith:DKSJUN2T","schema_version":"1.0","canonical_sha256":"1aa49a3753cad2c7288e0e3710d769eb30055eb08b3825f1fbe8caa646761b3b","source":{"kind":"arxiv","id":"1811.00824","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.00824","created_at":"2026-05-17T23:54:28.156212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00824v2","created_at":"2026-05-17T23:54:28.156212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00824","created_at":"2026-05-17T23:54:28.156212+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKSJUN2TZLJM","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKSJUN2TZLJMOKEO","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKSJUN2T","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M","json":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M.json","graph_json":"https://pith.science/api/pith-number/DKSJUN2TZLJMOKEOBY3RBV3J5M/graph.json","events_json":"https://pith.science/api/pith-number/DKSJUN2TZLJMOKEOBY3RBV3J5M/events.json","paper":"https://pith.science/paper/DKSJUN2T"},"agent_actions":{"view_html":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M","download_json":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M.json","view_paper":"https://pith.science/paper/DKSJUN2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00824&json=true","fetch_graph":"https://pith.science/api/pith-number/DKSJUN2TZLJMOKEOBY3RBV3J5M/graph.json","fetch_events":"https://pith.science/api/pith-number/DKSJUN2TZLJMOKEOBY3RBV3J5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/action/storage_attestation","attest_author":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/action/author_attestation","sign_citation":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/action/citation_signature","submit_replication":"https://pith.science/pith/DKSJUN2TZLJMOKEOBY3RBV3J5M/action/replication_record"}},"created_at":"2026-05-17T23:54:28.156212+00:00","updated_at":"2026-05-17T23:54:28.156212+00:00"}