{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LWUP3LOL6TBQ2TLMVNN3DBYWEV","short_pith_number":"pith:LWUP3LOL","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"},"canonical_sha256":"5da8fdadcbf4c30d4d6cab5bb187162548194f0626a9e2b771536633a1f89c2f","source":{"kind":"arxiv","id":"1411.5739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5739","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5739v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5739","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"LWUP3LOL6TBQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LWUP3LOL6TBQ2TLM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LWUP3LOL","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LWUP3LOL6TBQ2TLMVNN3DBYWEV","target":"record","payload":{"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"},"canonical_sha256":"5da8fdadcbf4c30d4d6cab5bb187162548194f0626a9e2b771536633a1f89c2f","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"},"source_kind":"arxiv","source_id":"1411.5739","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlx3EN3xej1C7kFcWu9GMfi6LS9O2rlf2pjSZDUZ1UkTpZ2BjmK5ksDm0k+OF+o0P5IdfB5VT4o1gLbRwEWAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:08:03.182359Z"},"content_sha256":"8aa65bad2386fb1daa4aba72248e38cfe8b446c7bfc07b02dfea047d7c145caa","schema_version":"1.0","event_id":"sha256:8aa65bad2386fb1daa4aba72248e38cfe8b446c7bfc07b02dfea047d7c145caa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LWUP3LOL6TBQ2TLMVNN3DBYWEV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMaJEehpUlpBtYYiDxd8BNVGkTOEUMh+mPVGrFSu76u7bcPxXcpGE2UYiaZB0TCtGHbv2NFxSTSgob1uW5LyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:08:03.182710Z"},"content_sha256":"2c4c0434b20897ae52eafb3f0e76b7f4a0c791b9cdd0cdaa6db33c87f62aa44f","schema_version":"1.0","event_id":"sha256:2c4c0434b20897ae52eafb3f0e76b7f4a0c791b9cdd0cdaa6db33c87f62aa44f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/bundle.json","state_url":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T11:08:03Z","links":{"resolver":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV","bundle":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/bundle.json","state":"https://pith.science/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWUP3LOL6TBQ2TLMVNN3DBYWEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LWUP3LOL6TBQ2TLMVNN3DBYWEV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5191c0520cca681a546fa94d34a6435596fbb326a1dd021232771720e32f722a","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T01:52:19Z","title_canon_sha256":"80c9b7f36034087d44b8671e3466b24342bbb89ed0b0e52a84434f17fc9592bc"},"schema_version":"1.0","source":{"id":"1411.5739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5739","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5739v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5739","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"LWUP3LOL6TBQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LWUP3LOL6TBQ2TLM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LWUP3LOL","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:2c4c0434b20897ae52eafb3f0e76b7f4a0c791b9cdd0cdaa6db33c87f62aa44f","target":"graph","created_at":"2026-05-18T00:57:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ashwin Pananjady, Rahul Vaze, Vivek Kumar Bagaria","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T01:52:19Z","title":"The Online Disjoint Set Cover Problem and its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5739","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8aa65bad2386fb1daa4aba72248e38cfe8b446c7bfc07b02dfea047d7c145caa","target":"record","created_at":"2026-05-18T00:57:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5191c0520cca681a546fa94d34a6435596fbb326a1dd021232771720e32f722a","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T01:52:19Z","title_canon_sha256":"80c9b7f36034087d44b8671e3466b24342bbb89ed0b0e52a84434f17fc9592bc"},"schema_version":"1.0","source":{"id":"1411.5739","kind":"arxiv","version":1}},"canonical_sha256":"5da8fdadcbf4c30d4d6cab5bb187162548194f0626a9e2b771536633a1f89c2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5da8fdadcbf4c30d4d6cab5bb187162548194f0626a9e2b771536633a1f89c2f","first_computed_at":"2026-05-18T00:57:51.302829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.302829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RjU0Die2+5Zr0Uni03gQaTnYRDchRDeyubYs/qEnLjt4TIjFALxSTGMswAzBt3LRotU/71PiuDZp2goYlVCQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.303402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aa65bad2386fb1daa4aba72248e38cfe8b446c7bfc07b02dfea047d7c145caa","sha256:2c4c0434b20897ae52eafb3f0e76b7f4a0c791b9cdd0cdaa6db33c87f62aa44f"],"state_sha256":"204fc92463a773688d2f70341860fcbb6d44699352bc647b4a7541a9ee048d1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paP1cwzQAXKeHUeTT1ATYIrQjPvdMqAi2MFdgh5zXiOVoI85yIbMYJNriQQdsxK6vVUobg/kgCs0mOhbPNNNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:08:03.184668Z","bundle_sha256":"8ee29f784c415a10f712d23ef8790f86b4a133d4e3707c15fa2f7cc9d3fdecbb"}}