{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UUFOIXJHLZPBVYPX4HGUSVOROR","short_pith_number":"pith:UUFOIXJH","schema_version":"1.0","canonical_sha256":"a50ae45d275e5e1ae1f7e1cd4955d17478293c420dc5be454697954da141b07c","source":{"kind":"arxiv","id":"1803.07639","version":7},"attestation_state":"computed","paper":{"title":"Adaptive Greedy Algorithms for Stochastic Set Cover Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Srinivasan Parthasarathy","submitted_at":"2018-03-20T20:30:55Z","abstract_excerpt":"We study adaptive greedy algorithms for the problems of stochastic set cover with perfect and imperfect coverages. In stochastic set cover with perfect coverage, we are given a set of items and a ground set B. Evaluating an item reveals its state which is a random subset of B drawn from the state distribution of the item. Every element in B is assumed to be present in the state of some item with probability 1. For this problem, we show that the adaptive greedy algorithm has an approximation ratio of H(|B|), the |B|th Harmonic number. In stochastic set cover with imperfect coverage, an element "},"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":"1803.07639","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-20T20:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"05e6bbbc103595c830344ce1e6c7e31b734999fc2d41756a6b2c2ca1fa98d3c1","abstract_canon_sha256":"c6c40ab68e1267a23576052aa9ca5a7d84429c7e9fed6bb49964cc96b5fee43e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:04.395764Z","signature_b64":"zH3gA48w3YiMD1WdCJ2kL/qgY+UkPiyZcUVvxfAlzVbzbgphcl6SmVXW8R1QK2xxH7KAXLvG+Kwv4gHZl0KjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a50ae45d275e5e1ae1f7e1cd4955d17478293c420dc5be454697954da141b07c","last_reissued_at":"2026-05-18T00:13:04.395100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:04.395100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Greedy Algorithms for Stochastic Set Cover Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Srinivasan Parthasarathy","submitted_at":"2018-03-20T20:30:55Z","abstract_excerpt":"We study adaptive greedy algorithms for the problems of stochastic set cover with perfect and imperfect coverages. In stochastic set cover with perfect coverage, we are given a set of items and a ground set B. Evaluating an item reveals its state which is a random subset of B drawn from the state distribution of the item. Every element in B is assumed to be present in the state of some item with probability 1. For this problem, we show that the adaptive greedy algorithm has an approximation ratio of H(|B|), the |B|th Harmonic number. In stochastic set cover with imperfect coverage, an element "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07639","kind":"arxiv","version":7},"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":"1803.07639","created_at":"2026-05-18T00:13:04.395208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07639v7","created_at":"2026-05-18T00:13:04.395208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07639","created_at":"2026-05-18T00:13:04.395208+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUFOIXJHLZPB","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUFOIXJHLZPBVYPX","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUFOIXJH","created_at":"2026-05-18T12:32:56.356000+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/UUFOIXJHLZPBVYPX4HGUSVOROR","json":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR.json","graph_json":"https://pith.science/api/pith-number/UUFOIXJHLZPBVYPX4HGUSVOROR/graph.json","events_json":"https://pith.science/api/pith-number/UUFOIXJHLZPBVYPX4HGUSVOROR/events.json","paper":"https://pith.science/paper/UUFOIXJH"},"agent_actions":{"view_html":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR","download_json":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR.json","view_paper":"https://pith.science/paper/UUFOIXJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07639&json=true","fetch_graph":"https://pith.science/api/pith-number/UUFOIXJHLZPBVYPX4HGUSVOROR/graph.json","fetch_events":"https://pith.science/api/pith-number/UUFOIXJHLZPBVYPX4HGUSVOROR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/action/storage_attestation","attest_author":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/action/author_attestation","sign_citation":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/action/citation_signature","submit_replication":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/action/replication_record"}},"created_at":"2026-05-18T00:13:04.395208+00:00","updated_at":"2026-05-18T00:13:04.395208+00:00"}