{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BYPZSAE3CU5SLNJMQTWH4TJXXN","short_pith_number":"pith:BYPZSAE3","canonical_record":{"source":{"id":"2604.11388","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-13T12:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"794a273f10e90dc9b788a0b58d5d096ec6d50fe6deb4ae9dcdd8795fa84b1878","abstract_canon_sha256":"c41034e05e6ae66a74fa7bcc7c52c9be99f0b0ff07ae8beb7c4e4b5c287c794e"},"schema_version":"1.0"},"canonical_sha256":"0e1f99009b153b25b52c84ec7e4d37bb5a57d2bbb6e07331065ca51c5a7dc75e","source":{"kind":"arxiv","id":"2604.11388","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.11388","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"2604.11388v3","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.11388","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"BYPZSAE3CU5S","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"pith_short_16","alias_value":"BYPZSAE3CU5SLNJM","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"pith_short_8","alias_value":"BYPZSAE3","created_at":"2026-05-29T02:05:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BYPZSAE3CU5SLNJMQTWH4TJXXN","target":"record","payload":{"canonical_record":{"source":{"id":"2604.11388","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-13T12:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"794a273f10e90dc9b788a0b58d5d096ec6d50fe6deb4ae9dcdd8795fa84b1878","abstract_canon_sha256":"c41034e05e6ae66a74fa7bcc7c52c9be99f0b0ff07ae8beb7c4e4b5c287c794e"},"schema_version":"1.0"},"canonical_sha256":"0e1f99009b153b25b52c84ec7e4d37bb5a57d2bbb6e07331065ca51c5a7dc75e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:44.802141Z","signature_b64":"YPw3MlHTvJriTf+XbmFFBWVmNx1SbeOUcLcSH09FjZD48l+e3aWOaVGBKgXHNie80ZhhR5wksjQF4McvS5EdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e1f99009b153b25b52c84ec7e4d37bb5a57d2bbb6e07331065ca51c5a7dc75e","last_reissued_at":"2026-05-29T02:05:44.801361Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:44.801361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.11388","source_version":3,"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-29T02:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFw7M+HQh1fWdUtMi5A66Sq32wgHyEu9gU8JIapRcl3ZQueEp97q7XcIp+ZHf5BYZOddoistSwdLx/2ORiReBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:48:46.778175Z"},"content_sha256":"da810c9ca113524d96c0a075161624c97ee569a16a190100b3e4b231830dbd88","schema_version":"1.0","event_id":"sha256:da810c9ca113524d96c0a075161624c97ee569a16a190100b3e4b231830dbd88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BYPZSAE3CU5SLNJMQTWH4TJXXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Min-Sum Set Cover on Parallel Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A bicriteria LP-based algorithm for parallel maximum coverage yields O(log m / log log m) approximations for min-sum set cover on unrelated machines and a constant-factor guarantee on related machines.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Micha{\\l} Szyfelbein","submitted_at":"2026-04-13T12:29:05Z","abstract_excerpt":"Consider the classical Min-Sum Set Cover problem: We are given a universe $\\mathcal{U}$ of $n$ elements and a collection $\\mathcal{S}$ of $k$ subsets of $\\mathcal{U}$. Moreover, a cost function is associated with each set. The goal is to find a subsequence of sets in $\\mathcal{S}$ that covers all elements in $\\mathcal{U}$, such that the sum of the covering times of the elements is minimized. The covering time of an element $u$ is the cost of all sets that appear in the sequence before $u$ is first covered. This problem can be seen as a scheduling problem on a single machine, where each job rep"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We give a randomized bicriteria (1-1/e-ε, O(log m/log log m))-approximation algorithm for Parallel Maximum Coverage based on a natural LP relaxation. This can be then used to obtain O(log m/log log m)-approximation algorithm for the Min-Sum Set Cover problem on unrelated machines. For related machines we obtain an 8e/(e+1)+ε <12.66-approximation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the stated bicriteria approximation for the Parallel Maximum Coverage subproblem holds via the LP relaxation and can be leveraged without additional hidden factors that would invalidate the derived ratios for the main Min-Sum Set Cover problems.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Approximation algorithms are given for the Parallel Min-Sum Set Cover problem, including a bicriteria (1-1/e-ε, O(log m/log log m)) result for a key subproblem leading to O(log m/log log m) for unrelated machines and <12.66 for related machines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A bicriteria LP-based algorithm for parallel maximum coverage yields O(log m / log log m) approximations for min-sum set cover on unrelated machines and a constant-factor guarantee on related machines.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6d115323f99b6f569de5a30505b3f4bc2c3e076ac83c08a665862af09e8153b6"},"source":{"id":"2604.11388","kind":"arxiv","version":3},"verdict":{"id":"e85a41e6-70ef-4cf1-9cdf-d2c3650b7327","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T16:08:39.346558Z","strongest_claim":"We give a randomized bicriteria (1-1/e-ε, O(log m/log log m))-approximation algorithm for Parallel Maximum Coverage based on a natural LP relaxation. This can be then used to obtain O(log m/log log m)-approximation algorithm for the Min-Sum Set Cover problem on unrelated machines. For related machines we obtain an 8e/(e+1)+ε <12.66-approximation.","one_line_summary":"Approximation algorithms are given for the Parallel Min-Sum Set Cover problem, including a bicriteria (1-1/e-ε, O(log m/log log m)) result for a key subproblem leading to O(log m/log log m) for unrelated machines and <12.66 for related machines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the stated bicriteria approximation for the Parallel Maximum Coverage subproblem holds via the LP relaxation and can be leveraged without additional hidden factors that would invalidate the derived ratios for the main Min-Sum Set Cover problems.","pith_extraction_headline":"A bicriteria LP-based algorithm for parallel maximum coverage yields O(log m / log log m) approximations for min-sum set cover on unrelated machines and a constant-factor guarantee on related machines."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.11388/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"e85a41e6-70ef-4cf1-9cdf-d2c3650b7327"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-29T02:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7H1r34SDXMJIukT5DKyrY//QNa330My4cDrCFhXxvj1NgX0Y0gJn5louocXZRI7dHpiqtCmc4qHl6Fgzklk4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:48:46.778750Z"},"content_sha256":"895f797cfbab6bac16f9606b435653678135b6246f63d233d4e5e6bd5bb815d5","schema_version":"1.0","event_id":"sha256:895f797cfbab6bac16f9606b435653678135b6246f63d233d4e5e6bd5bb815d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYPZSAE3CU5SLNJMQTWH4TJXXN/bundle.json","state_url":"https://pith.science/pith/BYPZSAE3CU5SLNJMQTWH4TJXXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYPZSAE3CU5SLNJMQTWH4TJXXN/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-02T20:48:46Z","links":{"resolver":"https://pith.science/pith/BYPZSAE3CU5SLNJMQTWH4TJXXN","bundle":"https://pith.science/pith/BYPZSAE3CU5SLNJMQTWH4TJXXN/bundle.json","state":"https://pith.science/pith/BYPZSAE3CU5SLNJMQTWH4TJXXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYPZSAE3CU5SLNJMQTWH4TJXXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BYPZSAE3CU5SLNJMQTWH4TJXXN","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":"c41034e05e6ae66a74fa7bcc7c52c9be99f0b0ff07ae8beb7c4e4b5c287c794e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-13T12:29:05Z","title_canon_sha256":"794a273f10e90dc9b788a0b58d5d096ec6d50fe6deb4ae9dcdd8795fa84b1878"},"schema_version":"1.0","source":{"id":"2604.11388","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.11388","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"2604.11388v3","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.11388","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"BYPZSAE3CU5S","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"pith_short_16","alias_value":"BYPZSAE3CU5SLNJM","created_at":"2026-05-29T02:05:44Z"},{"alias_kind":"pith_short_8","alias_value":"BYPZSAE3","created_at":"2026-05-29T02:05:44Z"}],"graph_snapshots":[{"event_id":"sha256:895f797cfbab6bac16f9606b435653678135b6246f63d233d4e5e6bd5bb815d5","target":"graph","created_at":"2026-05-29T02:05:44Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We give a randomized bicriteria (1-1/e-ε, O(log m/log log m))-approximation algorithm for Parallel Maximum Coverage based on a natural LP relaxation. This can be then used to obtain O(log m/log log m)-approximation algorithm for the Min-Sum Set Cover problem on unrelated machines. For related machines we obtain an 8e/(e+1)+ε <12.66-approximation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the stated bicriteria approximation for the Parallel Maximum Coverage subproblem holds via the LP relaxation and can be leveraged without additional hidden factors that would invalidate the derived ratios for the main Min-Sum Set Cover problems."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Approximation algorithms are given for the Parallel Min-Sum Set Cover problem, including a bicriteria (1-1/e-ε, O(log m/log log m)) result for a key subproblem leading to O(log m/log log m) for unrelated machines and <12.66 for related machines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A bicriteria LP-based algorithm for parallel maximum coverage yields O(log m / log log m) approximations for min-sum set cover on unrelated machines and a constant-factor guarantee on related machines."}],"snapshot_sha256":"6d115323f99b6f569de5a30505b3f4bc2c3e076ac83c08a665862af09e8153b6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.11388/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider the classical Min-Sum Set Cover problem: We are given a universe $\\mathcal{U}$ of $n$ elements and a collection $\\mathcal{S}$ of $k$ subsets of $\\mathcal{U}$. Moreover, a cost function is associated with each set. The goal is to find a subsequence of sets in $\\mathcal{S}$ that covers all elements in $\\mathcal{U}$, such that the sum of the covering times of the elements is minimized. The covering time of an element $u$ is the cost of all sets that appear in the sequence before $u$ is first covered. This problem can be seen as a scheduling problem on a single machine, where each job rep","authors_text":"Micha{\\l} Szyfelbein","cross_cats":[],"headline":"A bicriteria LP-based algorithm for parallel maximum coverage yields O(log m / log log m) approximations for min-sum set cover on unrelated machines and a constant-factor guarantee on related machines.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-13T12:29:05Z","title":"Min-Sum Set Cover on Parallel Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.11388","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-10T16:08:39.346558Z","id":"e85a41e6-70ef-4cf1-9cdf-d2c3650b7327","model_set":{"reader":"grok-4.3"},"one_line_summary":"Approximation algorithms are given for the Parallel Min-Sum Set Cover problem, including a bicriteria (1-1/e-ε, O(log m/log log m)) result for a key subproblem leading to O(log m/log log m) for unrelated machines and <12.66 for related machines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A bicriteria LP-based algorithm for parallel maximum coverage yields O(log m / log log m) approximations for min-sum set cover on unrelated machines and a constant-factor guarantee on related machines.","strongest_claim":"We give a randomized bicriteria (1-1/e-ε, O(log m/log log m))-approximation algorithm for Parallel Maximum Coverage based on a natural LP relaxation. This can be then used to obtain O(log m/log log m)-approximation algorithm for the Min-Sum Set Cover problem on unrelated machines. For related machines we obtain an 8e/(e+1)+ε <12.66-approximation.","weakest_assumption":"That the stated bicriteria approximation for the Parallel Maximum Coverage subproblem holds via the LP relaxation and can be leveraged without additional hidden factors that would invalidate the derived ratios for the main Min-Sum Set Cover problems."}},"verdict_id":"e85a41e6-70ef-4cf1-9cdf-d2c3650b7327"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:da810c9ca113524d96c0a075161624c97ee569a16a190100b3e4b231830dbd88","target":"record","created_at":"2026-05-29T02:05:44Z","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":"c41034e05e6ae66a74fa7bcc7c52c9be99f0b0ff07ae8beb7c4e4b5c287c794e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-13T12:29:05Z","title_canon_sha256":"794a273f10e90dc9b788a0b58d5d096ec6d50fe6deb4ae9dcdd8795fa84b1878"},"schema_version":"1.0","source":{"id":"2604.11388","kind":"arxiv","version":3}},"canonical_sha256":"0e1f99009b153b25b52c84ec7e4d37bb5a57d2bbb6e07331065ca51c5a7dc75e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e1f99009b153b25b52c84ec7e4d37bb5a57d2bbb6e07331065ca51c5a7dc75e","first_computed_at":"2026-05-29T02:05:44.801361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T02:05:44.801361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YPw3MlHTvJriTf+XbmFFBWVmNx1SbeOUcLcSH09FjZD48l+e3aWOaVGBKgXHNie80ZhhR5wksjQF4McvS5EdDg==","signature_status":"signed_v1","signed_at":"2026-05-29T02:05:44.802141Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.11388","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da810c9ca113524d96c0a075161624c97ee569a16a190100b3e4b231830dbd88","sha256:895f797cfbab6bac16f9606b435653678135b6246f63d233d4e5e6bd5bb815d5"],"state_sha256":"6ed90e2bc4ffc968e22fe354cb0a52a0c02916e673c1899282f78a8f5ce04430"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMJ5yO0Ze+AdfkOio1OX0IWNrlveaw8ti3VSaNsQYmehcukvj/1CJKGroCAe9QU8/M5aUlTTuQlbk67OFiH3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:48:46.781521Z","bundle_sha256":"85db11c5bdd1c65815b8bbfd755d480504f120b1e119fa91e072412737dda710"}}