{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UUFOIXJHLZPBVYPX4HGUSVOROR","short_pith_number":"pith:UUFOIXJH","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"},"canonical_sha256":"a50ae45d275e5e1ae1f7e1cd4955d17478293c420dc5be454697954da141b07c","source":{"kind":"arxiv","id":"1803.07639","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07639","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07639v7","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07639","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"UUFOIXJHLZPB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UUFOIXJHLZPBVYPX","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UUFOIXJH","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UUFOIXJHLZPBVYPX4HGUSVOROR","target":"record","payload":{"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"},"canonical_sha256":"a50ae45d275e5e1ae1f7e1cd4955d17478293c420dc5be454697954da141b07c","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"},"source_kind":"arxiv","source_id":"1803.07639","source_version":7,"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:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BtJ3J/v7samOhTHuic4tK78PdkcXbrFx9wnr/TbRpgcWH5Cse3LvJ5FCOaQOg11ygX36WlnjHljFgQ4mYKUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:46.072505Z"},"content_sha256":"3eba688fe138e16af3a2c432ddf8915673f8474713f153f1d1ad7cf986800f5e","schema_version":"1.0","event_id":"sha256:3eba688fe138e16af3a2c432ddf8915673f8474713f153f1d1ad7cf986800f5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UUFOIXJHLZPBVYPX4HGUSVOROR","target":"graph","payload":{"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"},"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:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nx7aK1V7S/pS5+NHJlz/grLnuE5B/ULr4qJSuM3BfhJ/bkp2gmDMBsZTxnmTqxenZ1o0urvLSpPQAWumt1EKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:46.072852Z"},"content_sha256":"4ad06a8385d1a19a2ad924527b2458b8387167c9374bcc993e02d8ecefcc99aa","schema_version":"1.0","event_id":"sha256:4ad06a8385d1a19a2ad924527b2458b8387167c9374bcc993e02d8ecefcc99aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/bundle.json","state_url":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/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-06-04T22:18:46Z","links":{"resolver":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR","bundle":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/bundle.json","state":"https://pith.science/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUFOIXJHLZPBVYPX4HGUSVOROR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UUFOIXJHLZPBVYPX4HGUSVOROR","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":"c6c40ab68e1267a23576052aa9ca5a7d84429c7e9fed6bb49964cc96b5fee43e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-20T20:30:55Z","title_canon_sha256":"05e6bbbc103595c830344ce1e6c7e31b734999fc2d41756a6b2c2ca1fa98d3c1"},"schema_version":"1.0","source":{"id":"1803.07639","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07639","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07639v7","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07639","created_at":"2026-05-18T00:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"UUFOIXJHLZPB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UUFOIXJHLZPBVYPX","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UUFOIXJH","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:4ad06a8385d1a19a2ad924527b2458b8387167c9374bcc993e02d8ecefcc99aa","target":"graph","created_at":"2026-05-18T00:13:04Z","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":"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 ","authors_text":"Srinivasan Parthasarathy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-20T20:30:55Z","title":"Adaptive Greedy Algorithms for Stochastic Set Cover Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07639","kind":"arxiv","version":7},"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:3eba688fe138e16af3a2c432ddf8915673f8474713f153f1d1ad7cf986800f5e","target":"record","created_at":"2026-05-18T00:13:04Z","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":"c6c40ab68e1267a23576052aa9ca5a7d84429c7e9fed6bb49964cc96b5fee43e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-20T20:30:55Z","title_canon_sha256":"05e6bbbc103595c830344ce1e6c7e31b734999fc2d41756a6b2c2ca1fa98d3c1"},"schema_version":"1.0","source":{"id":"1803.07639","kind":"arxiv","version":7}},"canonical_sha256":"a50ae45d275e5e1ae1f7e1cd4955d17478293c420dc5be454697954da141b07c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a50ae45d275e5e1ae1f7e1cd4955d17478293c420dc5be454697954da141b07c","first_computed_at":"2026-05-18T00:13:04.395100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:04.395100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zH3gA48w3YiMD1WdCJ2kL/qgY+UkPiyZcUVvxfAlzVbzbgphcl6SmVXW8R1QK2xxH7KAXLvG+Kwv4gHZl0KjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:04.395764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07639","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eba688fe138e16af3a2c432ddf8915673f8474713f153f1d1ad7cf986800f5e","sha256:4ad06a8385d1a19a2ad924527b2458b8387167c9374bcc993e02d8ecefcc99aa"],"state_sha256":"dbfa2e2c3ad01f9cb7fb863056a2408085c3cbac5fa219cfc469e3df0258d1ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mc13QljHmmyDkUmHXx6laHYTgDTIPn5abFcM2SSVPrmhJqx3ATL0qlyjZvd/nnn6Ie0i3VuX5jsM2uwvsSX7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:18:46.075791Z","bundle_sha256":"7c359306b8d259859aa4a2fe4f6c295d23785e5d56303ab09d9915d943ae4cf5"}}