{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I4YGP7UAODLMKM6RXUEMDIO6D4","short_pith_number":"pith:I4YGP7UA","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"},"canonical_sha256":"473067fe8070d6c533d1bd08c1a1de1f29974a411f6681fc861986779db6600a","source":{"kind":"arxiv","id":"1811.06719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06719","created_at":"2026-05-18T00:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06719v1","created_at":"2026-05-18T00:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06719","created_at":"2026-05-18T00:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"I4YGP7UAODLM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I4YGP7UAODLMKM6R","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I4YGP7UA","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I4YGP7UAODLMKM6RXUEMDIO6D4","target":"record","payload":{"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"},"canonical_sha256":"473067fe8070d6c533d1bd08c1a1de1f29974a411f6681fc861986779db6600a","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"},"source_kind":"arxiv","source_id":"1811.06719","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:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6NmicrMSEZHIeCie/24DJ5zd0QIM6fhD9Jbn2hkA4mMjHRzDPHeqPxsMG2SRfP8OnWhd63uVm+1AMQTFrIFgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:13:42.799010Z"},"content_sha256":"b23ed55e8e844fe708006654291da3649ffe79d00892deeb3e932c741c3975d6","schema_version":"1.0","event_id":"sha256:b23ed55e8e844fe708006654291da3649ffe79d00892deeb3e932c741c3975d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I4YGP7UAODLMKM6RXUEMDIO6D4","target":"graph","payload":{"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"},"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:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyB4gc6m1TI2L94y8fVEWNHNjmoxFaih7BOgSbgWVdQUFKcEhyiZHWIKVNzE1sY9ytXilnnoxSStp/9SQJ+3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:13:42.799354Z"},"content_sha256":"0405d88e53b3c28e731997a6a76d69f1a4d87708d3d2b7924d8b9503c80fc556","schema_version":"1.0","event_id":"sha256:0405d88e53b3c28e731997a6a76d69f1a4d87708d3d2b7924d8b9503c80fc556"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/bundle.json","state_url":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/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-03T10:13:42Z","links":{"resolver":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4","bundle":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/bundle.json","state":"https://pith.science/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4YGP7UAODLMKM6RXUEMDIO6D4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I4YGP7UAODLMKM6RXUEMDIO6D4","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":"f2107b1c5588952059a8709e406fbeadb5202f3c2e061cc9b404394e0bd201f8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T09:27:42Z","title_canon_sha256":"7070ecc3bb33c239addd7c11880986a2982d2e3b521e84dd8e34d15d7da525d7"},"schema_version":"1.0","source":{"id":"1811.06719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06719","created_at":"2026-05-18T00:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06719v1","created_at":"2026-05-18T00:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06719","created_at":"2026-05-18T00:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"I4YGP7UAODLM","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I4YGP7UAODLMKM6R","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I4YGP7UA","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:0405d88e53b3c28e731997a6a76d69f1a4d87708d3d2b7924d8b9503c80fc556","target":"graph","created_at":"2026-05-18T00:00:34Z","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":"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","authors_text":"Adam Kasperski, Mmikita Hradovich, Pawel Zielinski","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T09:27:42Z","title":"Robust recoverable 0-1 optimization problems under polyhedral uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06719","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:b23ed55e8e844fe708006654291da3649ffe79d00892deeb3e932c741c3975d6","target":"record","created_at":"2026-05-18T00:00:34Z","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":"f2107b1c5588952059a8709e406fbeadb5202f3c2e061cc9b404394e0bd201f8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-16T09:27:42Z","title_canon_sha256":"7070ecc3bb33c239addd7c11880986a2982d2e3b521e84dd8e34d15d7da525d7"},"schema_version":"1.0","source":{"id":"1811.06719","kind":"arxiv","version":1}},"canonical_sha256":"473067fe8070d6c533d1bd08c1a1de1f29974a411f6681fc861986779db6600a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"473067fe8070d6c533d1bd08c1a1de1f29974a411f6681fc861986779db6600a","first_computed_at":"2026-05-18T00:00:34.033000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:34.033000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AYKqbM7U5IlErKkKt+5xRTuYp2iSQZsXo4RZaqeH8My0whJJibumls72rUD3aDCEQ7gDSACH5M7je5rvOnj3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:34.033473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b23ed55e8e844fe708006654291da3649ffe79d00892deeb3e932c741c3975d6","sha256:0405d88e53b3c28e731997a6a76d69f1a4d87708d3d2b7924d8b9503c80fc556"],"state_sha256":"9b6c05809f3c141c894c581e445ce178c714119bd0436b0ad64b309582832ac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jU8wAjBTzEz3rNC0Ox4/KomWuASs4XEEncfUyA2iKG6axXaGUbX9lSjY5KB8MN9zZPOhLxrsNeaSUEYklzaICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:13:42.801350Z","bundle_sha256":"4f7aaff651ab14de7cd9467f7fa5843e1db7183edc72336d41ee3d1c6151783d"}}