{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RUD3Q3BOADHAT7NIIYSXPD5AON","short_pith_number":"pith:RUD3Q3BO","schema_version":"1.0","canonical_sha256":"8d07b86c2e00ce09fda84625778fa0734c782dd4e90309565fe1d50fa0fa0bea","source":{"kind":"arxiv","id":"1505.06893","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.06893","created_at":"2026-05-18T00:38:11.836654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06893v3","created_at":"2026-05-18T00:38:11.836654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06893","created_at":"2026-05-18T00:38:11.836654+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUD3Q3BOADHA","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUD3Q3BOADHAT7NI","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUD3Q3BO","created_at":"2026-05-18T12:29:39.896362+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/RUD3Q3BOADHAT7NIIYSXPD5AON","json":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON.json","graph_json":"https://pith.science/api/pith-number/RUD3Q3BOADHAT7NIIYSXPD5AON/graph.json","events_json":"https://pith.science/api/pith-number/RUD3Q3BOADHAT7NIIYSXPD5AON/events.json","paper":"https://pith.science/paper/RUD3Q3BO"},"agent_actions":{"view_html":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON","download_json":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON.json","view_paper":"https://pith.science/paper/RUD3Q3BO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06893&json=true","fetch_graph":"https://pith.science/api/pith-number/RUD3Q3BOADHAT7NIIYSXPD5AON/graph.json","fetch_events":"https://pith.science/api/pith-number/RUD3Q3BOADHAT7NIIYSXPD5AON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/action/storage_attestation","attest_author":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/action/author_attestation","sign_citation":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/action/citation_signature","submit_replication":"https://pith.science/pith/RUD3Q3BOADHAT7NIIYSXPD5AON/action/replication_record"}},"created_at":"2026-05-18T00:38:11.836654+00:00","updated_at":"2026-05-18T00:38:11.836654+00:00"}