{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ASTISFDGPASFHCRTNK4PYSD2RY","short_pith_number":"pith:ASTISFDG","schema_version":"1.0","canonical_sha256":"04a68914667824538a336ab8fc487a8e372fb69217316ff5144abc25b7216e02","source":{"kind":"arxiv","id":"1809.06506","version":2},"attestation_state":"computed","paper":{"title":"On the Partition Set Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kasturi Varadarajan, Tanmay Inamdar","submitted_at":"2018-09-18T02:26:03Z","abstract_excerpt":"Several algorithms with an approximation guarantee of $O(\\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here, the elements are partitioned into $r$ \\emph{color classes}, and we are required to cover at least $k_t$ elements from each color class $\\mathcal{C}_t$, using the minimum number of sets. We give a randomized LP-rounding algorithm that is an $O(\\beta + \\log r)$ approximation for the Partition Set Cover problem. Here $\\beta$ denotes the approximation guarantee fo"},"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":"1809.06506","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T02:26:03Z","cross_cats_sorted":[],"title_canon_sha256":"75d8f1214aab6f557408f69815ec6b24cee580d08f321553d7bc8bb1adfef461","abstract_canon_sha256":"488cd3afe092c27cc510cae27f89c3d62a58f33ceb916e94bc61d6667bcb3fb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.737367Z","signature_b64":"Wdh+VOsghgQSg/leYE19LcBQj8gOrpMn84IRnoA0KgqyUQrHpRRf70OM0vjbv8/qw01uhnI5Y3QGlbOztqhKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04a68914667824538a336ab8fc487a8e372fb69217316ff5144abc25b7216e02","last_reissued_at":"2026-05-17T23:59:27.736845Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.736845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Partition Set Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kasturi Varadarajan, Tanmay Inamdar","submitted_at":"2018-09-18T02:26:03Z","abstract_excerpt":"Several algorithms with an approximation guarantee of $O(\\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here, the elements are partitioned into $r$ \\emph{color classes}, and we are required to cover at least $k_t$ elements from each color class $\\mathcal{C}_t$, using the minimum number of sets. We give a randomized LP-rounding algorithm that is an $O(\\beta + \\log r)$ approximation for the Partition Set Cover problem. Here $\\beta$ denotes the approximation guarantee fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06506","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":"1809.06506","created_at":"2026-05-17T23:59:27.736931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06506v2","created_at":"2026-05-17T23:59:27.736931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06506","created_at":"2026-05-17T23:59:27.736931+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASTISFDGPASF","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASTISFDGPASFHCRT","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASTISFDG","created_at":"2026-05-18T12:32:13.499390+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/ASTISFDGPASFHCRTNK4PYSD2RY","json":"https://pith.science/pith/ASTISFDGPASFHCRTNK4PYSD2RY.json","graph_json":"https://pith.science/api/pith-number/ASTISFDGPASFHCRTNK4PYSD2RY/graph.json","events_json":"https://pith.science/api/pith-number/ASTISFDGPASFHCRTNK4PYSD2RY/events.json","paper":"https://pith.science/paper/ASTISFDG"},"agent_actions":{"view_html":"https://pith.science/pith/ASTISFDGPASFHCRTNK4PYSD2RY","download_json":"https://pith.science/pith/ASTISFDGPASFHCRTNK4PYSD2RY.json","view_paper":"https://pith.science/paper/ASTISFDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06506&json=true","fetch_graph":"https://pith.science/api/pith-number/ASTISFDGPASFHCRTNK4PYSD2RY/graph.json","fetch_events":"https://pith.science/api/pith-number/ASTISFDGPASFHCRTNK4PYSD2RY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASTISFDGPASFHCRTNK4PYSD2RY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASTISFDGPASFHCRTNK4PYSD2RY/action/storage_attestation","attest_author":"https://pith.science/pith/ASTISFDGPASFHCRTNK4PYSD2RY/action/author_attestation","sign_citation":"https://pith.science/pith/ASTISFDGPASFHCRTNK4PYSD2RY/action/citation_signature","submit_replication":"https://pith.science/pith/ASTISFDGPASFHCRTNK4PYSD2RY/action/replication_record"}},"created_at":"2026-05-17T23:59:27.736931+00:00","updated_at":"2026-05-17T23:59:27.736931+00:00"}