{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FSZ5VZGRBOEOEBL64M3LBPUAU6","short_pith_number":"pith:FSZ5VZGR","schema_version":"1.0","canonical_sha256":"2cb3dae4d10b88e2057ee336b0be80a79bee3347fa777d9e3cdc4957eff42623","source":{"kind":"arxiv","id":"2201.04985","version":1},"attestation_state":"computed","paper":{"title":"Benchmarking Problems for Robust Discrete Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Marc Goerigk, Mohammad Khosravi","submitted_at":"2022-01-13T13:47:00Z","abstract_excerpt":"Robust discrete optimization is a highly active field of research where a plenitude of combinations between decision criteria, uncertainty sets and underlying nominal problems are considered. Usually, a robust problem becomes harder to solve than its nominal counterpart, even if it remains in the same complexity class. For this reason, specialized solution algorithms have been developed. To further drive the development of stronger solution algorithms and to facilitate the comparison between methods, a set of benchmark instances is necessary but so far missing. In this paper we propose a furth"},"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":"2201.04985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-01-13T13:47:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3f9a0ab10422058c52f39cf5d0f8f54c9b1098c4af128ca7a548b0ec1a2376ca","abstract_canon_sha256":"234fff61b85a925aab1967a510db3b221497f1034e8e164b8c00a7c02e7e82f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:14.923273Z","signature_b64":"DCSRBRjr+l3IDRiy+3mBYm30oOWyydjg1q+c1+7Y4mscTfrhX/qZAn9qjNdQMBI0/eUySKG2ZArOaIxWOfVpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cb3dae4d10b88e2057ee336b0be80a79bee3347fa777d9e3cdc4957eff42623","last_reissued_at":"2026-07-05T03:48:14.922902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:14.922902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking Problems for Robust Discrete Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Marc Goerigk, Mohammad Khosravi","submitted_at":"2022-01-13T13:47:00Z","abstract_excerpt":"Robust discrete optimization is a highly active field of research where a plenitude of combinations between decision criteria, uncertainty sets and underlying nominal problems are considered. Usually, a robust problem becomes harder to solve than its nominal counterpart, even if it remains in the same complexity class. For this reason, specialized solution algorithms have been developed. To further drive the development of stronger solution algorithms and to facilitate the comparison between methods, a set of benchmark instances is necessary but so far missing. In this paper we propose a furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.04985","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.04985/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2201.04985","created_at":"2026-07-05T03:48:14.922955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.04985v1","created_at":"2026-07-05T03:48:14.922955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.04985","created_at":"2026-07-05T03:48:14.922955+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSZ5VZGRBOEO","created_at":"2026-07-05T03:48:14.922955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSZ5VZGRBOEOEBL6","created_at":"2026-07-05T03:48:14.922955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSZ5VZGR","created_at":"2026-07-05T03:48:14.922955+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/FSZ5VZGRBOEOEBL64M3LBPUAU6","json":"https://pith.science/pith/FSZ5VZGRBOEOEBL64M3LBPUAU6.json","graph_json":"https://pith.science/api/pith-number/FSZ5VZGRBOEOEBL64M3LBPUAU6/graph.json","events_json":"https://pith.science/api/pith-number/FSZ5VZGRBOEOEBL64M3LBPUAU6/events.json","paper":"https://pith.science/paper/FSZ5VZGR"},"agent_actions":{"view_html":"https://pith.science/pith/FSZ5VZGRBOEOEBL64M3LBPUAU6","download_json":"https://pith.science/pith/FSZ5VZGRBOEOEBL64M3LBPUAU6.json","view_paper":"https://pith.science/paper/FSZ5VZGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.04985&json=true","fetch_graph":"https://pith.science/api/pith-number/FSZ5VZGRBOEOEBL64M3LBPUAU6/graph.json","fetch_events":"https://pith.science/api/pith-number/FSZ5VZGRBOEOEBL64M3LBPUAU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSZ5VZGRBOEOEBL64M3LBPUAU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSZ5VZGRBOEOEBL64M3LBPUAU6/action/storage_attestation","attest_author":"https://pith.science/pith/FSZ5VZGRBOEOEBL64M3LBPUAU6/action/author_attestation","sign_citation":"https://pith.science/pith/FSZ5VZGRBOEOEBL64M3LBPUAU6/action/citation_signature","submit_replication":"https://pith.science/pith/FSZ5VZGRBOEOEBL64M3LBPUAU6/action/replication_record"}},"created_at":"2026-07-05T03:48:14.922955+00:00","updated_at":"2026-07-05T03:48:14.922955+00:00"}