{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K3H7TWBY2P4YGTIQ3WRDZ4AYSA","short_pith_number":"pith:K3H7TWBY","canonical_record":{"source":{"id":"1811.08185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-20T11:25:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"abd1faa9f0f945d841467cdcc1ae5dcf314214d218c0b9dde219ab3d125b1ffd","abstract_canon_sha256":"f2491338c9a1590c6a43ccf9cc34b1763c516de51b816e985b3b59cdb24f021b"},"schema_version":"1.0"},"canonical_sha256":"56cff9d838d3f9834d10dda23cf018902d1cf0b2c9d288fcf86efe86ee6a62a2","source":{"kind":"arxiv","id":"1811.08185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08185","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08185v1","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08185","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"K3H7TWBY2P4Y","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K3H7TWBY2P4YGTIQ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K3H7TWBY","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K3H7TWBY2P4YGTIQ3WRDZ4AYSA","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-20T11:25:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"abd1faa9f0f945d841467cdcc1ae5dcf314214d218c0b9dde219ab3d125b1ffd","abstract_canon_sha256":"f2491338c9a1590c6a43ccf9cc34b1763c516de51b816e985b3b59cdb24f021b"},"schema_version":"1.0"},"canonical_sha256":"56cff9d838d3f9834d10dda23cf018902d1cf0b2c9d288fcf86efe86ee6a62a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:30.894771Z","signature_b64":"tgsyaEMu0HHYCDLs3uKWhNiNQulsPU+Wsvq3nWliYm5a7lfXvGiex1qkn+iF3bFku3Fq7qvJEM02lEa5boWJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56cff9d838d3f9834d10dda23cf018902d1cf0b2c9d288fcf86efe86ee6a62a2","last_reissued_at":"2026-05-17T23:41:30.894044Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:30.894044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08185","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:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lM/xQtkftZHtCEjxCqHrPuuDwOHsBLqfpYcDZWu+xGyAHDahOOHPtkK6r7595uGdUg+otKGAt7NaN4CA2dE6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:47:12.212852Z"},"content_sha256":"7f36f08c8912519f208166ca37a8f00ea5f4ddc6fdebc03f77dcb362ba7ed2b1","schema_version":"1.0","event_id":"sha256:7f36f08c8912519f208166ca37a8f00ea5f4ddc6fdebc03f77dcb362ba7ed2b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K3H7TWBY2P4YGTIQ3WRDZ4AYSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithm for the Partial Set Multi-Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ding-Zhu Du, Guangmo Tong, James Willson, Yingli Ran, Yishuo Shi, Zhao Zhang","submitted_at":"2018-11-20T11:25:54Z","abstract_excerpt":"Partial set cover problem and set multi-cover problem are two generalizations of set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element set $E$, a collection of sets $\\mathcal S\\subseteq 2^E$, a total covering ratio $q$ which is a constant between 0 and 1, each set $S\\in\\mathcal S$ is associated with a cost $c_S$, each element $e\\in E$ is associated with a covering requirement $r_e$, the goal is to find a minimum cost sub-collection $\\mathcal S'\\subseteq\\mathcal S$ to fully cover at least $q|E|$ elements, where element"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08185","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:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3/iZvuMmEC27vAcWtu26SH4HfSrq4ajWOoOhl98UuIol58EwM+WNKf/hTz15AYp7Gk1KOaibE/e6UgOuHGRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:47:12.213201Z"},"content_sha256":"7e0f492279126a9e805b6fcef92d047ec9e0a2b4f7cc816d0b9b8451d1fc6ffc","schema_version":"1.0","event_id":"sha256:7e0f492279126a9e805b6fcef92d047ec9e0a2b4f7cc816d0b9b8451d1fc6ffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/bundle.json","state_url":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/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-24T05:47:12Z","links":{"resolver":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA","bundle":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/bundle.json","state":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K3H7TWBY2P4YGTIQ3WRDZ4AYSA","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":"f2491338c9a1590c6a43ccf9cc34b1763c516de51b816e985b3b59cdb24f021b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-20T11:25:54Z","title_canon_sha256":"abd1faa9f0f945d841467cdcc1ae5dcf314214d218c0b9dde219ab3d125b1ffd"},"schema_version":"1.0","source":{"id":"1811.08185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08185","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08185v1","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08185","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"K3H7TWBY2P4Y","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K3H7TWBY2P4YGTIQ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K3H7TWBY","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:7e0f492279126a9e805b6fcef92d047ec9e0a2b4f7cc816d0b9b8451d1fc6ffc","target":"graph","created_at":"2026-05-17T23:41:30Z","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 problem and set multi-cover problem are two generalizations of set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element set $E$, a collection of sets $\\mathcal S\\subseteq 2^E$, a total covering ratio $q$ which is a constant between 0 and 1, each set $S\\in\\mathcal S$ is associated with a cost $c_S$, each element $e\\in E$ is associated with a covering requirement $r_e$, the goal is to find a minimum cost sub-collection $\\mathcal S'\\subseteq\\mathcal S$ to fully cover at least $q|E|$ elements, where element","authors_text":"Ding-Zhu Du, Guangmo Tong, James Willson, Yingli Ran, Yishuo Shi, Zhao Zhang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-20T11:25:54Z","title":"Approximation Algorithm for the Partial Set Multi-Cover Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08185","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:7f36f08c8912519f208166ca37a8f00ea5f4ddc6fdebc03f77dcb362ba7ed2b1","target":"record","created_at":"2026-05-17T23:41:30Z","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":"f2491338c9a1590c6a43ccf9cc34b1763c516de51b816e985b3b59cdb24f021b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-20T11:25:54Z","title_canon_sha256":"abd1faa9f0f945d841467cdcc1ae5dcf314214d218c0b9dde219ab3d125b1ffd"},"schema_version":"1.0","source":{"id":"1811.08185","kind":"arxiv","version":1}},"canonical_sha256":"56cff9d838d3f9834d10dda23cf018902d1cf0b2c9d288fcf86efe86ee6a62a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56cff9d838d3f9834d10dda23cf018902d1cf0b2c9d288fcf86efe86ee6a62a2","first_computed_at":"2026-05-17T23:41:30.894044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:30.894044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgsyaEMu0HHYCDLs3uKWhNiNQulsPU+Wsvq3nWliYm5a7lfXvGiex1qkn+iF3bFku3Fq7qvJEM02lEa5boWJAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:30.894771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f36f08c8912519f208166ca37a8f00ea5f4ddc6fdebc03f77dcb362ba7ed2b1","sha256:7e0f492279126a9e805b6fcef92d047ec9e0a2b4f7cc816d0b9b8451d1fc6ffc"],"state_sha256":"ad4ca45b443030fcaab0c97aa7757f671824bc6817484d172d7479bd6c869cdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ry+Az0GDRYnSz/ZJgXaEcbw0Hl3lezE2tgCmmUQp/FCQm0Gr95flIbuMhrJ3ICUueoyh0defxBv3lFOEnmKGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:47:12.215219Z","bundle_sha256":"f60b74f2e2355f5c5e3b1af170d7a59623b556254e40372f84c41277160246e3"}}