{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O44YXQMV75G6FN7NEASFMGYMW3","short_pith_number":"pith:O44YXQMV","canonical_record":{"source":{"id":"1102.4005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-19T17:11:56Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"249b74bcb294f4d42b434591c0f6c6492577fdee7fc319fe9bf6ce1d3350492a","abstract_canon_sha256":"3e9a36eb2a7bcacd91df9f4dc8eb1ecaa9d463a647cf1ad7fe876736401204ba"},"schema_version":"1.0"},"canonical_sha256":"77398bc195ff4de2b7ed2024561b0cb6c7feb9f94d7c11189b1ce07424363836","source":{"kind":"arxiv","id":"1102.4005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4005","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4005v1","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4005","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"O44YXQMV75G6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O44YXQMV75G6FN7N","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O44YXQMV","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O44YXQMV75G6FN7NEASFMGYMW3","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-19T17:11:56Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"249b74bcb294f4d42b434591c0f6c6492577fdee7fc319fe9bf6ce1d3350492a","abstract_canon_sha256":"3e9a36eb2a7bcacd91df9f4dc8eb1ecaa9d463a647cf1ad7fe876736401204ba"},"schema_version":"1.0"},"canonical_sha256":"77398bc195ff4de2b7ed2024561b0cb6c7feb9f94d7c11189b1ce07424363836","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:31.440232Z","signature_b64":"Dig8k65deju98Gwip5wpmRDDspo0kFc99a+4uvHiaRtFBUwPmCLdq5Nsw4b3oHu3ZG8O7wGXVXxGE41eXPgHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77398bc195ff4de2b7ed2024561b0cb6c7feb9f94d7c11189b1ce07424363836","last_reissued_at":"2026-05-18T02:22:31.439751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:31.439751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4005","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-18T02:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zhNAGvIOcDQrZ6rXBywzY/+ZXaej54WJEmoL4d9ac+XfjvMuTaTx7YYZ8En+exbreyQHrSp4cZsv2zMPIeXVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:08:34.950642Z"},"content_sha256":"e2a88f6c2dc14de2182fc4eb8eff8f8a272a7fc4f01ba46f7d0127cbc3628663","schema_version":"1.0","event_id":"sha256:e2a88f6c2dc14de2182fc4eb8eff8f8a272a7fc4f01ba46f7d0127cbc3628663"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O44YXQMV75G6FN7NEASFMGYMW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Online Set Multicover Problems Via Randomized Winnowing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Bhaskar DasGupta, Piotr Berman","submitted_at":"2011-02-19T17:11:56Z","abstract_excerpt":"In this paper, we consider the weighted online set k-multicover problem. In this problem, we have a universe V of elements, a family S of subsets of V with a positive real cost for every set in S and a \"coverage factor\" (positive integer) k. A subset of elements are presented online in an arbitrary order. When each element, say i, is presented, we are also told the collection of all (at least k) sets and their costs to which i belongs and we need to select additional sets from these sets containing i, if necessary, such that our collection of selected sets contains at least k sets that contain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4005","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-18T02:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywgVUnlhpGM81rT4K/2LaZFa7Qq+sFKlQVw4JmhX7fKgYHRnZ/S3nLhpN4b9h8GCGkva2G7A9bBm1UrSUWiICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:08:34.951346Z"},"content_sha256":"892706b74dc48eac62735ab1e3c8e5152cf96171a9842d5ca7f336436bec5150","schema_version":"1.0","event_id":"sha256:892706b74dc48eac62735ab1e3c8e5152cf96171a9842d5ca7f336436bec5150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O44YXQMV75G6FN7NEASFMGYMW3/bundle.json","state_url":"https://pith.science/pith/O44YXQMV75G6FN7NEASFMGYMW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O44YXQMV75G6FN7NEASFMGYMW3/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-28T22:08:34Z","links":{"resolver":"https://pith.science/pith/O44YXQMV75G6FN7NEASFMGYMW3","bundle":"https://pith.science/pith/O44YXQMV75G6FN7NEASFMGYMW3/bundle.json","state":"https://pith.science/pith/O44YXQMV75G6FN7NEASFMGYMW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O44YXQMV75G6FN7NEASFMGYMW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O44YXQMV75G6FN7NEASFMGYMW3","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":"3e9a36eb2a7bcacd91df9f4dc8eb1ecaa9d463a647cf1ad7fe876736401204ba","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-19T17:11:56Z","title_canon_sha256":"249b74bcb294f4d42b434591c0f6c6492577fdee7fc319fe9bf6ce1d3350492a"},"schema_version":"1.0","source":{"id":"1102.4005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4005","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4005v1","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4005","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"O44YXQMV75G6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O44YXQMV75G6FN7N","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O44YXQMV","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:892706b74dc48eac62735ab1e3c8e5152cf96171a9842d5ca7f336436bec5150","target":"graph","created_at":"2026-05-18T02:22:31Z","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":"In this paper, we consider the weighted online set k-multicover problem. In this problem, we have a universe V of elements, a family S of subsets of V with a positive real cost for every set in S and a \"coverage factor\" (positive integer) k. A subset of elements are presented online in an arbitrary order. When each element, say i, is presented, we are also told the collection of all (at least k) sets and their costs to which i belongs and we need to select additional sets from these sets containing i, if necessary, such that our collection of selected sets contains at least k sets that contain","authors_text":"Bhaskar DasGupta, Piotr Berman","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-19T17:11:56Z","title":"Approximating the Online Set Multicover Problems Via Randomized Winnowing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4005","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:e2a88f6c2dc14de2182fc4eb8eff8f8a272a7fc4f01ba46f7d0127cbc3628663","target":"record","created_at":"2026-05-18T02:22:31Z","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":"3e9a36eb2a7bcacd91df9f4dc8eb1ecaa9d463a647cf1ad7fe876736401204ba","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-19T17:11:56Z","title_canon_sha256":"249b74bcb294f4d42b434591c0f6c6492577fdee7fc319fe9bf6ce1d3350492a"},"schema_version":"1.0","source":{"id":"1102.4005","kind":"arxiv","version":1}},"canonical_sha256":"77398bc195ff4de2b7ed2024561b0cb6c7feb9f94d7c11189b1ce07424363836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77398bc195ff4de2b7ed2024561b0cb6c7feb9f94d7c11189b1ce07424363836","first_computed_at":"2026-05-18T02:22:31.439751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:31.439751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dig8k65deju98Gwip5wpmRDDspo0kFc99a+4uvHiaRtFBUwPmCLdq5Nsw4b3oHu3ZG8O7wGXVXxGE41eXPgHCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:31.440232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2a88f6c2dc14de2182fc4eb8eff8f8a272a7fc4f01ba46f7d0127cbc3628663","sha256:892706b74dc48eac62735ab1e3c8e5152cf96171a9842d5ca7f336436bec5150"],"state_sha256":"a0083e8676c270747bf60f0702fd9d751954f586b87aecf8ddbadba44af51b32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZr+oxJTpLuGG2Xt+o66Q+dyhcl3gC6MzOMO5NhOMV7DPAP7IPImkxhHXAGHrzX1OiDhkEZXxGQAdUGnDEHmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:08:34.955326Z","bundle_sha256":"3c64aaacea592de1cecb7e9fca5e123764b9c95795f200186c05a9e438e4e58a"}}