{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TNSHXYDJPAHWW4GFS3GWW5T2S3","short_pith_number":"pith:TNSHXYDJ","schema_version":"1.0","canonical_sha256":"9b647be069780f6b70c596cd6b767a96cb1496ebf5974d800c1a2700f1e22435","source":{"kind":"arxiv","id":"1511.07642","version":2},"attestation_state":"computed","paper":{"title":"Multivariate Complexity Analysis of Geometric {\\sc Red Blue Set Cover}","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pradeesha Ashok, Saket Saurabh, Sudeshna Kolay","submitted_at":"2015-11-24T10:53:03Z","abstract_excerpt":"We investigate the parameterized complexity of GENERALIZED RED BLUE SET COVER (Gen-RBSC), a generalization of the classic SET COVER problem and the more recently studied RED BLUE SET COVER problem. Given a universe $U$ containing $b$ blue elements and $r$ red elements, positive integers $k_\\ell$ and $k_r$, and a family $\\F$ of $\\ell$ sets over $U$, the \\srbsc\\ problem is to decide whether there is a subfamily $\\F'\\subseteq \\F$ of size at most $k_\\ell$ that covers all blue elements, but at most $k_r$ of the red elements. This generalizes SET COVER and thus in full generality it is intractable i"},"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":"1511.07642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-24T10:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"362ba53008a72f9ce5fc1ffd41675f438f8e4f926d1346c655b16ab9c67182b9","abstract_canon_sha256":"22fa88f03b39e1dcc4d5647b33fa533222a907080345df3e8bec5c6bf01b1cad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:02.348423Z","signature_b64":"RS5AI6KY5qZDsYINDGoqW0c0d0QddPRp3Y/sE3j+cEG67t/e8Nrrsr6X+DurxtLd4HpHk7G6gcP7QqPY0Z81CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b647be069780f6b70c596cd6b767a96cb1496ebf5974d800c1a2700f1e22435","last_reissued_at":"2026-05-18T01:26:02.347982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:02.347982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multivariate Complexity Analysis of Geometric {\\sc Red Blue Set Cover}","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pradeesha Ashok, Saket Saurabh, Sudeshna Kolay","submitted_at":"2015-11-24T10:53:03Z","abstract_excerpt":"We investigate the parameterized complexity of GENERALIZED RED BLUE SET COVER (Gen-RBSC), a generalization of the classic SET COVER problem and the more recently studied RED BLUE SET COVER problem. Given a universe $U$ containing $b$ blue elements and $r$ red elements, positive integers $k_\\ell$ and $k_r$, and a family $\\F$ of $\\ell$ sets over $U$, the \\srbsc\\ problem is to decide whether there is a subfamily $\\F'\\subseteq \\F$ of size at most $k_\\ell$ that covers all blue elements, but at most $k_r$ of the red elements. This generalizes SET COVER and thus in full generality it is intractable i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07642","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.07642","created_at":"2026-05-18T01:26:02.348043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07642v2","created_at":"2026-05-18T01:26:02.348043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07642","created_at":"2026-05-18T01:26:02.348043+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNSHXYDJPAHW","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNSHXYDJPAHWW4GF","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNSHXYDJ","created_at":"2026-05-18T12:29:42.218222+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/TNSHXYDJPAHWW4GFS3GWW5T2S3","json":"https://pith.science/pith/TNSHXYDJPAHWW4GFS3GWW5T2S3.json","graph_json":"https://pith.science/api/pith-number/TNSHXYDJPAHWW4GFS3GWW5T2S3/graph.json","events_json":"https://pith.science/api/pith-number/TNSHXYDJPAHWW4GFS3GWW5T2S3/events.json","paper":"https://pith.science/paper/TNSHXYDJ"},"agent_actions":{"view_html":"https://pith.science/pith/TNSHXYDJPAHWW4GFS3GWW5T2S3","download_json":"https://pith.science/pith/TNSHXYDJPAHWW4GFS3GWW5T2S3.json","view_paper":"https://pith.science/paper/TNSHXYDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07642&json=true","fetch_graph":"https://pith.science/api/pith-number/TNSHXYDJPAHWW4GFS3GWW5T2S3/graph.json","fetch_events":"https://pith.science/api/pith-number/TNSHXYDJPAHWW4GFS3GWW5T2S3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNSHXYDJPAHWW4GFS3GWW5T2S3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNSHXYDJPAHWW4GFS3GWW5T2S3/action/storage_attestation","attest_author":"https://pith.science/pith/TNSHXYDJPAHWW4GFS3GWW5T2S3/action/author_attestation","sign_citation":"https://pith.science/pith/TNSHXYDJPAHWW4GFS3GWW5T2S3/action/citation_signature","submit_replication":"https://pith.science/pith/TNSHXYDJPAHWW4GFS3GWW5T2S3/action/replication_record"}},"created_at":"2026-05-18T01:26:02.348043+00:00","updated_at":"2026-05-18T01:26:02.348043+00:00"}