{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:65F7OE62YYDW2B6OFV4JYXA47L","short_pith_number":"pith:65F7OE62","canonical_record":{"source":{"id":"1701.06064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-21T18:11:46Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"7b3d47991c9aea5e96063bd94e4295e25581e66387d96ac6bc8e6bed574fb176","abstract_canon_sha256":"462b793a65274652751d659e5febb9bdff0a8376e4415777a9c429054573dba5"},"schema_version":"1.0"},"canonical_sha256":"f74bf713dac6076d07ce2d789c5c1cfafcaac140cc22248fc478193914aa3fb3","source":{"kind":"arxiv","id":"1701.06064","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06064","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06064v2","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06064","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"65F7OE62YYDW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"65F7OE62YYDW2B6O","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"65F7OE62","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:65F7OE62YYDW2B6OFV4JYXA47L","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-21T18:11:46Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"7b3d47991c9aea5e96063bd94e4295e25581e66387d96ac6bc8e6bed574fb176","abstract_canon_sha256":"462b793a65274652751d659e5febb9bdff0a8376e4415777a9c429054573dba5"},"schema_version":"1.0"},"canonical_sha256":"f74bf713dac6076d07ce2d789c5c1cfafcaac140cc22248fc478193914aa3fb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:37.368599Z","signature_b64":"xT9CTayW9lRuGjPjt48lAqWYqVs1Fizl5txsgY3Jg1Q13+0xGJvKuvS9q+Rwb3J1Y4u4/xo25ibs6H5p3LhODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f74bf713dac6076d07ce2d789c5c1cfafcaac140cc22248fc478193914aa3fb3","last_reissued_at":"2026-05-18T00:50:37.368125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:37.368125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06064","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-18T00:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQ30of4gPM3Oj7xPEHohVqWW1QGR1wmyutZN55bG3O1fcLIzpZfCRc0/ag/GZuc/UVoZ5xk0Elk3bUvtlmwiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:56:31.678603Z"},"content_sha256":"182beb71b4afadc7aeda37f829b044b7d7152acaad2176700c6d57b52fa659f0","schema_version":"1.0","event_id":"sha256:182beb71b4afadc7aeda37f829b044b7d7152acaad2176700c6d57b52fa659f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:65F7OE62YYDW2B6OFV4JYXA47L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"math.OC","authors_text":"Adam Kasperski, Andr\\'e Chassein, Marc Goerigk, Pawe{\\l} Zieli\\'nski","submitted_at":"2017-01-21T18:11:46Z","abstract_excerpt":"In this paper the problem of selecting $p$ out of $n$ available items is discussed, such that their total cost is minimized. We assume that costs are not known exactly, but stem from a set of possible outcomes.\n  Robust recoverable and two-stage models of this selection problem are analyzed. In the two-stage problem, up to $p$ items is chosen in the first stage, and the solution is completed once the scenario becomes revealed in the second stage. In the recoverable problem, a set of $p$ items is selected in the first stage, and can be modified by exchanging up to $k$ items in the second stage,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06064","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-18T00:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RStUAspLPwBY+hs0vYmdaL3LskXrWBsuxcK7QPwwRd0NGPpl3mQ6xMmGHrd7juYIhkwQv0i5cHKfexiu1mRhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:56:31.679290Z"},"content_sha256":"d0ddadf0cbd9f6c0e09353a857af153a2e9079842806ff14e5c56081aafe7976","schema_version":"1.0","event_id":"sha256:d0ddadf0cbd9f6c0e09353a857af153a2e9079842806ff14e5c56081aafe7976"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65F7OE62YYDW2B6OFV4JYXA47L/bundle.json","state_url":"https://pith.science/pith/65F7OE62YYDW2B6OFV4JYXA47L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65F7OE62YYDW2B6OFV4JYXA47L/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-31T04:56:31Z","links":{"resolver":"https://pith.science/pith/65F7OE62YYDW2B6OFV4JYXA47L","bundle":"https://pith.science/pith/65F7OE62YYDW2B6OFV4JYXA47L/bundle.json","state":"https://pith.science/pith/65F7OE62YYDW2B6OFV4JYXA47L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65F7OE62YYDW2B6OFV4JYXA47L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:65F7OE62YYDW2B6OFV4JYXA47L","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":"462b793a65274652751d659e5febb9bdff0a8376e4415777a9c429054573dba5","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-21T18:11:46Z","title_canon_sha256":"7b3d47991c9aea5e96063bd94e4295e25581e66387d96ac6bc8e6bed574fb176"},"schema_version":"1.0","source":{"id":"1701.06064","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06064","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06064v2","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06064","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"65F7OE62YYDW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"65F7OE62YYDW2B6O","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"65F7OE62","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:d0ddadf0cbd9f6c0e09353a857af153a2e9079842806ff14e5c56081aafe7976","target":"graph","created_at":"2026-05-18T00:50:37Z","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":"In this paper the problem of selecting $p$ out of $n$ available items is discussed, such that their total cost is minimized. We assume that costs are not known exactly, but stem from a set of possible outcomes.\n  Robust recoverable and two-stage models of this selection problem are analyzed. In the two-stage problem, up to $p$ items is chosen in the first stage, and the solution is completed once the scenario becomes revealed in the second stage. In the recoverable problem, a set of $p$ items is selected in the first stage, and can be modified by exchanging up to $k$ items in the second stage,","authors_text":"Adam Kasperski, Andr\\'e Chassein, Marc Goerigk, Pawe{\\l} Zieli\\'nski","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-21T18:11:46Z","title":"On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06064","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:182beb71b4afadc7aeda37f829b044b7d7152acaad2176700c6d57b52fa659f0","target":"record","created_at":"2026-05-18T00:50:37Z","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":"462b793a65274652751d659e5febb9bdff0a8376e4415777a9c429054573dba5","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-21T18:11:46Z","title_canon_sha256":"7b3d47991c9aea5e96063bd94e4295e25581e66387d96ac6bc8e6bed574fb176"},"schema_version":"1.0","source":{"id":"1701.06064","kind":"arxiv","version":2}},"canonical_sha256":"f74bf713dac6076d07ce2d789c5c1cfafcaac140cc22248fc478193914aa3fb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f74bf713dac6076d07ce2d789c5c1cfafcaac140cc22248fc478193914aa3fb3","first_computed_at":"2026-05-18T00:50:37.368125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:37.368125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xT9CTayW9lRuGjPjt48lAqWYqVs1Fizl5txsgY3Jg1Q13+0xGJvKuvS9q+Rwb3J1Y4u4/xo25ibs6H5p3LhODA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:37.368599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06064","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:182beb71b4afadc7aeda37f829b044b7d7152acaad2176700c6d57b52fa659f0","sha256:d0ddadf0cbd9f6c0e09353a857af153a2e9079842806ff14e5c56081aafe7976"],"state_sha256":"c989e43dc4370b03feb4a7f07ebddd89691a68338e7fba545ba205f39c063526"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vtHYx1qkbYUOHd6Jo1fvdXBFcuKalYDeF77qfdtkPawG+86HBtUve5KOIeLzwnGDs+0mBrEYnEOIFHyxg00pBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:56:31.682750Z","bundle_sha256":"a967947dc7f55fa67a00328ad6526c7273ebbef832c19d6641d3cbe4947fecc4"}}