{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I4YGP7UAODLMKM6RXUEMDIO6D4","short_pith_number":"pith:I4YGP7UA","schema_version":"1.0","canonical_sha256":"473067fe8070d6c533d1bd08c1a1de1f29974a411f6681fc861986779db6600a","source":{"kind":"arxiv","id":"1811.06719","version":1},"attestation_state":"computed","paper":{"title":"Robust recoverable 0-1 optimization problems under polyhedral uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Mmikita Hradovich, Pawel Zielinski","submitted_at":"2018-11-16T09:27:42Z","abstract_excerpt":"This paper deals with a robust recoverable approach to 0-1 programming problems. It is assumed that a solution constructed in the first stage can be modified to some extent in the second stage. This modification consists in choosing a solution in some prescribed neighborhood of the current solution. The second stage solution cost can be uncertain and a polyhedral structure of uncertainty is used. The resulting robust recoverable problem is a min-max-min problem, which can be hard to solve when the number of variables is large. In this paper we provide a framework for solving robust recoverable"},"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.06719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T09:27:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7070ecc3bb33c239addd7c11880986a2982d2e3b521e84dd8e34d15d7da525d7","abstract_canon_sha256":"f2107b1c5588952059a8709e406fbeadb5202f3c2e061cc9b404394e0bd201f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:34.033473Z","signature_b64":"AYKqbM7U5IlErKkKt+5xRTuYp2iSQZsXo4RZaqeH8My0whJJibumls72rUD3aDCEQ7gDSACH5M7je5rvOnj3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"473067fe8070d6c533d1bd08c1a1de1f29974a411f6681fc861986779db6600a","last_reissued_at":"2026-05-18T00:00:34.033000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:34.033000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust recoverable 0-1 optimization problems under polyhedral uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Mmikita Hradovich, Pawel Zielinski","submitted_at":"2018-11-16T09:27:42Z","abstract_excerpt":"This paper deals with a robust recoverable approach to 0-1 programming problems. It is assumed that a solution constructed in the first stage can be modified to some extent in the second stage. This modification consists in choosing a solution in some prescribed neighborhood of the current solution. The second stage solution cost can be uncertain and a polyhedral structure of uncertainty is used. The resulting robust recoverable problem is a min-max-min problem, which can be hard to solve when the number of variables is large. In this paper we provide a framework for solving robust recoverable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06719","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.06719","created_at":"2026-05-18T00:00:34.033083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06719v1","created_at":"2026-05-18T00:00:34.033083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06719","created_at":"2026-05-18T00:00:34.033083+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4YGP7UAODLM","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4YGP7UAODLMKM6R","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4YGP7UA","created_at":"2026-05-18T12:32:28.185984+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/I4YGP7UAODLMKM6RXUEMDIO6D4","json":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4.json","graph_json":"https://pith.science/api/pith-number/I4YGP7UAODLMKM6RXUEMDIO6D4/graph.json","events_json":"https://pith.science/api/pith-number/I4YGP7UAODLMKM6RXUEMDIO6D4/events.json","paper":"https://pith.science/paper/I4YGP7UA"},"agent_actions":{"view_html":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4","download_json":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4.json","view_paper":"https://pith.science/paper/I4YGP7UA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06719&json=true","fetch_graph":"https://pith.science/api/pith-number/I4YGP7UAODLMKM6RXUEMDIO6D4/graph.json","fetch_events":"https://pith.science/api/pith-number/I4YGP7UAODLMKM6RXUEMDIO6D4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/action/storage_attestation","attest_author":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/action/author_attestation","sign_citation":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/action/citation_signature","submit_replication":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/action/replication_record"}},"created_at":"2026-05-18T00:00:34.033083+00:00","updated_at":"2026-05-18T00:00:34.033083+00:00"}