{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:44IQD4ZT4YVDDIBDJ7I7STEOCW","short_pith_number":"pith:44IQD4ZT","canonical_record":{"source":{"id":"1907.04413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T21:00:48Z","cross_cats_sorted":[],"title_canon_sha256":"611b06547ed23360e5179691b794d7addf95e3936794fed14ef4d7f5202d3bfe","abstract_canon_sha256":"a372661828a8eed74ad34315a572e6936488324e8f108dedea6d75e02ab3ce89"},"schema_version":"1.0"},"canonical_sha256":"e71101f333e62a31a0234fd1f94c8e15a8cec8aaa0281a8004b45b069712f25c","source":{"kind":"arxiv","id":"1907.04413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04413","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04413v1","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04413","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"44IQD4ZT4YVD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"44IQD4ZT4YVDDIBD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"44IQD4ZT","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:44IQD4ZT4YVDDIBDJ7I7STEOCW","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T21:00:48Z","cross_cats_sorted":[],"title_canon_sha256":"611b06547ed23360e5179691b794d7addf95e3936794fed14ef4d7f5202d3bfe","abstract_canon_sha256":"a372661828a8eed74ad34315a572e6936488324e8f108dedea6d75e02ab3ce89"},"schema_version":"1.0"},"canonical_sha256":"e71101f333e62a31a0234fd1f94c8e15a8cec8aaa0281a8004b45b069712f25c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.820805Z","signature_b64":"vQlI4wV0y6ozXsBXvMWWapg2uSCFTt6ilFW2lRah61zQyHRAX5jL2fm5ySM9suJIM86Mdam41iLxL+kUuphhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e71101f333e62a31a0234fd1f94c8e15a8cec8aaa0281a8004b45b069712f25c","last_reissued_at":"2026-05-17T23:41:01.820053Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.820053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04413","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-17T23:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vaXUppv1wFKLXGGuFLPj8SdmW0vcTTZ3GCTASXaUC++VXEsIYtt9pvNKv17EuSICHR90QW4Vhsd9pi7prxDDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:28.227534Z"},"content_sha256":"57ad9f157ef9d91b060fe31ac9459425145bbd4f1edecf058d686fceb9884b73","schema_version":"1.0","event_id":"sha256:57ad9f157ef9d91b060fe31ac9459425145bbd4f1edecf058d686fceb9884b73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:44IQD4ZT4YVDDIBDJ7I7STEOCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximating Partial Set Cover and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Kent Quanrud, Zhao Zhang","submitted_at":"2019-07-09T21:00:48Z","abstract_excerpt":"Partial Set Cover (PSC) is a generalization of the well-studied Set Cover problem (SC). In PSC the input consists of an integer $k$ and a set system $(U,S)$ where $U$ is a finite set, and $S \\subseteq 2^U$ is a collection of subsets of $U$. The goal is to find a subcollection $S' \\subseteq S$ of smallest cardinality such that sets in $S'$ cover at least $k$ elements of $U$; that is $|\\cup_{A \\in S'} A| \\ge k$. SC is a special case of PSC when $k = |U|$. In the weighted version each set $X \\in S$ has a non-negative weight $w(X)$ and the goal is to find a minimum weight subcollection to cover $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04413","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-17T23:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pG6QoVQYZdEaWe9OvoTr6ZNC5f7eRUDBxmH1Oxxua4h8jwJ00/tyV891zp4kSUFxzr3sQejtloO/GB/fPzJmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:28.228214Z"},"content_sha256":"0ed7fd0610c5808948bd147cf3ffcbe0621d7353a071d06d6039f806651b08fd","schema_version":"1.0","event_id":"sha256:0ed7fd0610c5808948bd147cf3ffcbe0621d7353a071d06d6039f806651b08fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44IQD4ZT4YVDDIBDJ7I7STEOCW/bundle.json","state_url":"https://pith.science/pith/44IQD4ZT4YVDDIBDJ7I7STEOCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44IQD4ZT4YVDDIBDJ7I7STEOCW/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-25T18:01:28Z","links":{"resolver":"https://pith.science/pith/44IQD4ZT4YVDDIBDJ7I7STEOCW","bundle":"https://pith.science/pith/44IQD4ZT4YVDDIBDJ7I7STEOCW/bundle.json","state":"https://pith.science/pith/44IQD4ZT4YVDDIBDJ7I7STEOCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44IQD4ZT4YVDDIBDJ7I7STEOCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:44IQD4ZT4YVDDIBDJ7I7STEOCW","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":"a372661828a8eed74ad34315a572e6936488324e8f108dedea6d75e02ab3ce89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T21:00:48Z","title_canon_sha256":"611b06547ed23360e5179691b794d7addf95e3936794fed14ef4d7f5202d3bfe"},"schema_version":"1.0","source":{"id":"1907.04413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04413","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04413v1","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04413","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"44IQD4ZT4YVD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"44IQD4ZT4YVDDIBD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"44IQD4ZT","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:0ed7fd0610c5808948bd147cf3ffcbe0621d7353a071d06d6039f806651b08fd","target":"graph","created_at":"2026-05-17T23:41:01Z","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":"Partial Set Cover (PSC) is a generalization of the well-studied Set Cover problem (SC). In PSC the input consists of an integer $k$ and a set system $(U,S)$ where $U$ is a finite set, and $S \\subseteq 2^U$ is a collection of subsets of $U$. The goal is to find a subcollection $S' \\subseteq S$ of smallest cardinality such that sets in $S'$ cover at least $k$ elements of $U$; that is $|\\cup_{A \\in S'} A| \\ge k$. SC is a special case of PSC when $k = |U|$. In the weighted version each set $X \\in S$ has a non-negative weight $w(X)$ and the goal is to find a minimum weight subcollection to cover $k","authors_text":"Chandra Chekuri, Kent Quanrud, Zhao Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T21:00:48Z","title":"On Approximating Partial Set Cover and Generalizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04413","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:57ad9f157ef9d91b060fe31ac9459425145bbd4f1edecf058d686fceb9884b73","target":"record","created_at":"2026-05-17T23:41:01Z","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":"a372661828a8eed74ad34315a572e6936488324e8f108dedea6d75e02ab3ce89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T21:00:48Z","title_canon_sha256":"611b06547ed23360e5179691b794d7addf95e3936794fed14ef4d7f5202d3bfe"},"schema_version":"1.0","source":{"id":"1907.04413","kind":"arxiv","version":1}},"canonical_sha256":"e71101f333e62a31a0234fd1f94c8e15a8cec8aaa0281a8004b45b069712f25c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e71101f333e62a31a0234fd1f94c8e15a8cec8aaa0281a8004b45b069712f25c","first_computed_at":"2026-05-17T23:41:01.820053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:01.820053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vQlI4wV0y6ozXsBXvMWWapg2uSCFTt6ilFW2lRah61zQyHRAX5jL2fm5ySM9suJIM86Mdam41iLxL+kUuphhDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:01.820805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57ad9f157ef9d91b060fe31ac9459425145bbd4f1edecf058d686fceb9884b73","sha256:0ed7fd0610c5808948bd147cf3ffcbe0621d7353a071d06d6039f806651b08fd"],"state_sha256":"8c3d2282e2b04d7e7bc0a11aa86f270f97e42380f11241cfe096f9e9dbe8d97f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xYeF4EDxCmQvAGSl1HqbIF4egi/Z99GuBD7IgHGLruaZa/rnJCaqbjcfWPqgsNnmymlmyPxjzsxJJw8nFk+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:01:28.232399Z","bundle_sha256":"7b333bd6ec8966b22814cc87c8639b9d31d3296024a43f5790918bda60b71cb0"}}