{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RUD3Q3BOADHAT7NIIYSXPD5AON","short_pith_number":"pith:RUD3Q3BO","canonical_record":{"source":{"id":"1505.06893","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-26T10:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"d732bd79b7fd9bf696735cd9d36119641f9b32ad358a5e56ccb0bbdd52182f47","abstract_canon_sha256":"1b960746ee220c586ca666234bad8a663eb6d019ce2a84330638e1180471cddc"},"schema_version":"1.0"},"canonical_sha256":"8d07b86c2e00ce09fda84625778fa0734c782dd4e90309565fe1d50fa0fa0bea","source":{"kind":"arxiv","id":"1505.06893","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06893","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06893v3","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06893","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"RUD3Q3BOADHA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RUD3Q3BOADHAT7NI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RUD3Q3BO","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RUD3Q3BOADHAT7NIIYSXPD5AON","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06893","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-26T10:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"d732bd79b7fd9bf696735cd9d36119641f9b32ad358a5e56ccb0bbdd52182f47","abstract_canon_sha256":"1b960746ee220c586ca666234bad8a663eb6d019ce2a84330638e1180471cddc"},"schema_version":"1.0"},"canonical_sha256":"8d07b86c2e00ce09fda84625778fa0734c782dd4e90309565fe1d50fa0fa0bea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:11.837191Z","signature_b64":"LdvAsX2l3q/bmCaPb2Nl1ycmH5B4K81Of4Qyb1X1JLVMQyPsb5Rbzy2Q/WUxDsCe6u3a0GnW1CGhnEeYWNdaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d07b86c2e00ce09fda84625778fa0734c782dd4e90309565fe1d50fa0fa0bea","last_reissued_at":"2026-05-18T00:38:11.836556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:11.836556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06893","source_version":3,"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:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHkOnkIkycl0jV2nhl7G24Z27J4NscJiaNPs+qDXndmX4Q/pDjgav0JUTzFSD9Y/eDYtfRUM0lYoL0szOBoOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:40:22.466364Z"},"content_sha256":"bcb6227521930161074e711f76a62d0f67a999d8f97a8d88e1afe03e5e8d1b15","schema_version":"1.0","event_id":"sha256:bcb6227521930161074e711f76a62d0f67a999d8f97a8d88e1afe03e5e8d1b15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RUD3Q3BOADHAT7NIIYSXPD5AON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust recoverable and two-stage selection problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Pawel Zielinski","submitted_at":"2015-05-26T10:48:41Z","abstract_excerpt":"In this paper the following selection problem is discussed. A set of $n$ items is given and we wish to choose a subset of exactly $p$ items of the minimum total cost. This problem is a special case of 0-1 knapsack in which all the item weights are equal to~1. Its deterministic version has a trivial $O(n)$-time algorithm, which consists in choosing $p$ items of the smallest costs. In this paper it is assumed that the item costs are uncertain. Two robust models, namely two-stage and recoverable ones, under discrete and interval uncertainty representations, are discussed. Several positive and neg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06893","kind":"arxiv","version":3},"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:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGhPjia3EUaZLqPx1hnJMG08aqAN78AUKD+YoLI30xrUnbdBTM9HpyIBbx13zXVvHxNx9fIWIT6cQnXI+ZKIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:40:22.466720Z"},"content_sha256":"f992eaef1d0d5897f95f3258b5c701826630abd913cd4adfe3b2e4513f58f703","schema_version":"1.0","event_id":"sha256:f992eaef1d0d5897f95f3258b5c701826630abd913cd4adfe3b2e4513f58f703"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/bundle.json","state_url":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/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-04T01:40:22Z","links":{"resolver":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON","bundle":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/bundle.json","state":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RUD3Q3BOADHAT7NIIYSXPD5AON","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":"1b960746ee220c586ca666234bad8a663eb6d019ce2a84330638e1180471cddc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-26T10:48:41Z","title_canon_sha256":"d732bd79b7fd9bf696735cd9d36119641f9b32ad358a5e56ccb0bbdd52182f47"},"schema_version":"1.0","source":{"id":"1505.06893","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06893","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06893v3","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06893","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"RUD3Q3BOADHA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RUD3Q3BOADHAT7NI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RUD3Q3BO","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f992eaef1d0d5897f95f3258b5c701826630abd913cd4adfe3b2e4513f58f703","target":"graph","created_at":"2026-05-18T00:38:11Z","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 following selection problem is discussed. A set of $n$ items is given and we wish to choose a subset of exactly $p$ items of the minimum total cost. This problem is a special case of 0-1 knapsack in which all the item weights are equal to~1. Its deterministic version has a trivial $O(n)$-time algorithm, which consists in choosing $p$ items of the smallest costs. In this paper it is assumed that the item costs are uncertain. Two robust models, namely two-stage and recoverable ones, under discrete and interval uncertainty representations, are discussed. Several positive and neg","authors_text":"Adam Kasperski, Pawel Zielinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-26T10:48:41Z","title":"Robust recoverable and two-stage selection problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06893","kind":"arxiv","version":3},"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:bcb6227521930161074e711f76a62d0f67a999d8f97a8d88e1afe03e5e8d1b15","target":"record","created_at":"2026-05-18T00:38:11Z","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":"1b960746ee220c586ca666234bad8a663eb6d019ce2a84330638e1180471cddc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-26T10:48:41Z","title_canon_sha256":"d732bd79b7fd9bf696735cd9d36119641f9b32ad358a5e56ccb0bbdd52182f47"},"schema_version":"1.0","source":{"id":"1505.06893","kind":"arxiv","version":3}},"canonical_sha256":"8d07b86c2e00ce09fda84625778fa0734c782dd4e90309565fe1d50fa0fa0bea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d07b86c2e00ce09fda84625778fa0734c782dd4e90309565fe1d50fa0fa0bea","first_computed_at":"2026-05-18T00:38:11.836556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:11.836556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LdvAsX2l3q/bmCaPb2Nl1ycmH5B4K81Of4Qyb1X1JLVMQyPsb5Rbzy2Q/WUxDsCe6u3a0GnW1CGhnEeYWNdaCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:11.837191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06893","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcb6227521930161074e711f76a62d0f67a999d8f97a8d88e1afe03e5e8d1b15","sha256:f992eaef1d0d5897f95f3258b5c701826630abd913cd4adfe3b2e4513f58f703"],"state_sha256":"74917a026f8c70cd300db2d8210312ce4332d649dfcf406a8fb1937a7edb11d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kjsdVX1r2SNX+wqsbHDLPzxB33CFhjrZXNaDsGdIjqGmUaDnNhj8YxQPpHPvYjW+cDO3HPZzbkgfcsMANLtZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:40:22.468683Z","bundle_sha256":"14dde499cdee7f5a135d1f631cc9af793d4bf7d5b210342a788f22890649d9c9"}}