{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7WYMGU2P6DPAPCAX7ZFLVXCOKD","short_pith_number":"pith:7WYMGU2P","schema_version":"1.0","canonical_sha256":"fdb0c3534ff0de078817fe4abadc4e50fd613ef91ae07d1833dde41213734363","source":{"kind":"arxiv","id":"1405.5376","version":1},"attestation_state":"computed","paper":{"title":"Complexity of the robust weighted independent set problems on interval graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Pawel Zielinski","submitted_at":"2014-05-21T11:31:08Z","abstract_excerpt":"This paper deals with the max-min and min-max regret versions of the maximum weighted independent set problem on interval graphswith uncertain vertex weights. Both problems have been recently investigated by Nobibon and Leus (2014), who showed that they are NP-hard for two scenarios and strongly NP-hard if the number of scenarios is a part of the input. In this paper, new complexity and approximation results on the problems under consideration are provided, which extend the ones previously obtained. Namely, for the discrete scenario uncertainty representation it is proven that if the number of"},"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":"1405.5376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-21T11:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"89a4d075aea065e0167428c8dc9376abf60325adbf197e21a7afff80af2d6676","abstract_canon_sha256":"f5c742ab35cc73a2a5b7e2fd065da696325670af542b6ff1a6118990084f2bf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:24.361658Z","signature_b64":"QJ0vAa/ArbC761BRfuzXpLP5wJDU72zsV5z4sQ4TgEh75KX3+a+qYK89DWO9/TFPEmzLOXil0ezxwGPrVtZ3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdb0c3534ff0de078817fe4abadc4e50fd613ef91ae07d1833dde41213734363","last_reissued_at":"2026-05-18T02:51:24.360975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:24.360975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of the robust weighted independent set problems on interval graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Pawel Zielinski","submitted_at":"2014-05-21T11:31:08Z","abstract_excerpt":"This paper deals with the max-min and min-max regret versions of the maximum weighted independent set problem on interval graphswith uncertain vertex weights. Both problems have been recently investigated by Nobibon and Leus (2014), who showed that they are NP-hard for two scenarios and strongly NP-hard if the number of scenarios is a part of the input. In this paper, new complexity and approximation results on the problems under consideration are provided, which extend the ones previously obtained. Namely, for the discrete scenario uncertainty representation it is proven that if the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5376","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":"1405.5376","created_at":"2026-05-18T02:51:24.361078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5376v1","created_at":"2026-05-18T02:51:24.361078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5376","created_at":"2026-05-18T02:51:24.361078+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WYMGU2P6DPA","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WYMGU2P6DPAPCAX","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WYMGU2P","created_at":"2026-05-18T12:28:19.803747+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/7WYMGU2P6DPAPCAX7ZFLVXCOKD","json":"https://pith.science/pith/7WYMGU2P6DPAPCAX7ZFLVXCOKD.json","graph_json":"https://pith.science/api/pith-number/7WYMGU2P6DPAPCAX7ZFLVXCOKD/graph.json","events_json":"https://pith.science/api/pith-number/7WYMGU2P6DPAPCAX7ZFLVXCOKD/events.json","paper":"https://pith.science/paper/7WYMGU2P"},"agent_actions":{"view_html":"https://pith.science/pith/7WYMGU2P6DPAPCAX7ZFLVXCOKD","download_json":"https://pith.science/pith/7WYMGU2P6DPAPCAX7ZFLVXCOKD.json","view_paper":"https://pith.science/paper/7WYMGU2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5376&json=true","fetch_graph":"https://pith.science/api/pith-number/7WYMGU2P6DPAPCAX7ZFLVXCOKD/graph.json","fetch_events":"https://pith.science/api/pith-number/7WYMGU2P6DPAPCAX7ZFLVXCOKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WYMGU2P6DPAPCAX7ZFLVXCOKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WYMGU2P6DPAPCAX7ZFLVXCOKD/action/storage_attestation","attest_author":"https://pith.science/pith/7WYMGU2P6DPAPCAX7ZFLVXCOKD/action/author_attestation","sign_citation":"https://pith.science/pith/7WYMGU2P6DPAPCAX7ZFLVXCOKD/action/citation_signature","submit_replication":"https://pith.science/pith/7WYMGU2P6DPAPCAX7ZFLVXCOKD/action/replication_record"}},"created_at":"2026-05-18T02:51:24.361078+00:00","updated_at":"2026-05-18T02:51:24.361078+00:00"}