{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LWUP3LOL6TBQ2TLMVNN3DBYWEV","short_pith_number":"pith:LWUP3LOL","schema_version":"1.0","canonical_sha256":"5da8fdadcbf4c30d4d6cab5bb187162548194f0626a9e2b771536633a1f89c2f","source":{"kind":"arxiv","id":"1411.5739","version":1},"attestation_state":"computed","paper":{"title":"The Online Disjoint Set Cover Problem and its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Ashwin Pananjady, Rahul Vaze, Vivek Kumar Bagaria","submitted_at":"2014-11-21T01:52:19Z","abstract_excerpt":"Given a universe $U$ of $n$ elements and a collection of subsets $\\mathcal{S}$ of $U$, the maximum disjoint set cover problem (DSCP) is to partition $\\mathcal{S}$ into as many set covers as possible, where a set cover is defined as a collection of subsets whose union is $U$. We consider the online DSCP, in which the subsets arrive one by one (possibly in an order chosen by an adversary), and must be irrevocably assigned to some partition on arrival with the objective of minimizing the competitive ratio. The competitive ratio of an online DSCP algorithm $A$ is defined as the maximum ratio of th"},"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":"1411.5739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T01:52:19Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"80c9b7f36034087d44b8671e3466b24342bbb89ed0b0e52a84434f17fc9592bc","abstract_canon_sha256":"5191c0520cca681a546fa94d34a6435596fbb326a1dd021232771720e32f722a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.303402Z","signature_b64":"RjU0Die2+5Zr0Uni03gQaTnYRDchRDeyubYs/qEnLjt4TIjFALxSTGMswAzBt3LRotU/71PiuDZp2goYlVCQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5da8fdadcbf4c30d4d6cab5bb187162548194f0626a9e2b771536633a1f89c2f","last_reissued_at":"2026-05-18T00:57:51.302829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.302829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Online Disjoint Set Cover Problem and its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Ashwin Pananjady, Rahul Vaze, Vivek Kumar Bagaria","submitted_at":"2014-11-21T01:52:19Z","abstract_excerpt":"Given a universe $U$ of $n$ elements and a collection of subsets $\\mathcal{S}$ of $U$, the maximum disjoint set cover problem (DSCP) is to partition $\\mathcal{S}$ into as many set covers as possible, where a set cover is defined as a collection of subsets whose union is $U$. We consider the online DSCP, in which the subsets arrive one by one (possibly in an order chosen by an adversary), and must be irrevocably assigned to some partition on arrival with the objective of minimizing the competitive ratio. The competitive ratio of an online DSCP algorithm $A$ is defined as the maximum ratio of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5739","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":"1411.5739","created_at":"2026-05-18T00:57:51.302903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5739v1","created_at":"2026-05-18T00:57:51.302903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5739","created_at":"2026-05-18T00:57:51.302903+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWUP3LOL6TBQ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWUP3LOL6TBQ2TLM","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWUP3LOL","created_at":"2026-05-18T12:28:38.356838+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/LWUP3LOL6TBQ2TLMVNN3DBYWEV","json":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV.json","graph_json":"https://pith.science/api/pith-number/LWUP3LOL6TBQ2TLMVNN3DBYWEV/graph.json","events_json":"https://pith.science/api/pith-number/LWUP3LOL6TBQ2TLMVNN3DBYWEV/events.json","paper":"https://pith.science/paper/LWUP3LOL"},"agent_actions":{"view_html":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV","download_json":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV.json","view_paper":"https://pith.science/paper/LWUP3LOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5739&json=true","fetch_graph":"https://pith.science/api/pith-number/LWUP3LOL6TBQ2TLMVNN3DBYWEV/graph.json","fetch_events":"https://pith.science/api/pith-number/LWUP3LOL6TBQ2TLMVNN3DBYWEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/action/storage_attestation","attest_author":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/action/author_attestation","sign_citation":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/action/citation_signature","submit_replication":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/action/replication_record"}},"created_at":"2026-05-18T00:57:51.302903+00:00","updated_at":"2026-05-18T00:57:51.302903+00:00"}