{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZAD5H7YUXDVBVHHCX6KHWUW6D3","short_pith_number":"pith:ZAD5H7YU","schema_version":"1.0","canonical_sha256":"c807d3ff14b8ea1a9ce2bf947b52de1ed921887d854751e7f6f81554950adf28","source":{"kind":"arxiv","id":"1110.2207","version":3},"attestation_state":"computed","paper":{"title":"Minimum Latency Submodular Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ruben van der Zwaan, Sungjin Im, Viswanath Nagarajan","submitted_at":"2011-10-10T21:45:49Z","abstract_excerpt":"We study the Minimum Latency Submodular Cover problem (MLSC), which consists of a metric $(V,d)$ with source $r\\in V$ and $m$ monotone submodular functions $f_1, f_2, ..., f_m: 2^V \\rightarrow [0,1]$. The goal is to find a path originating at $r$ that minimizes the total cover time of all functions. This generalizes well-studied problems, such as Submodular Ranking [AzarG11] and Group Steiner Tree [GKR00]. We give a polynomial time $O(\\log \\frac{1}{\\eps} \\cdot \\log^{2+\\delta} |V|)$-approximation algorithm for MLSC, where $\\epsilon>0$ is the smallest non-zero marginal increase of any $\\{f_i\\}_{"},"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":"1110.2207","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T21:45:49Z","cross_cats_sorted":[],"title_canon_sha256":"6af968cf05df3eb478c6627d1f6e8d816b44e48ad0a8c54c7373f3395d29f1dd","abstract_canon_sha256":"4fd4a8ba3b58e5e2cd82bb4e2d9f4a847e8e9b55910b2800c87445f6e52b08e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:05.842197Z","signature_b64":"wXIJjSaLYZ4Fzv8e2Qj9FGMLhIIdv+v7S757BMgwEdMWVt+8RucrKBT9T6GrGAEJoSDnd622cUrrcOHSmfxiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c807d3ff14b8ea1a9ce2bf947b52de1ed921887d854751e7f6f81554950adf28","last_reissued_at":"2026-05-18T03:32:05.841500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:05.841500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Latency Submodular Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ruben van der Zwaan, Sungjin Im, Viswanath Nagarajan","submitted_at":"2011-10-10T21:45:49Z","abstract_excerpt":"We study the Minimum Latency Submodular Cover problem (MLSC), which consists of a metric $(V,d)$ with source $r\\in V$ and $m$ monotone submodular functions $f_1, f_2, ..., f_m: 2^V \\rightarrow [0,1]$. The goal is to find a path originating at $r$ that minimizes the total cover time of all functions. This generalizes well-studied problems, such as Submodular Ranking [AzarG11] and Group Steiner Tree [GKR00]. We give a polynomial time $O(\\log \\frac{1}{\\eps} \\cdot \\log^{2+\\delta} |V|)$-approximation algorithm for MLSC, where $\\epsilon>0$ is the smallest non-zero marginal increase of any $\\{f_i\\}_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2207","kind":"arxiv","version":3},"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":"1110.2207","created_at":"2026-05-18T03:32:05.841602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2207v3","created_at":"2026-05-18T03:32:05.841602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2207","created_at":"2026-05-18T03:32:05.841602+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAD5H7YUXDVB","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAD5H7YUXDVBVHHC","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAD5H7YU","created_at":"2026-05-18T12:26:47.523578+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/ZAD5H7YUXDVBVHHCX6KHWUW6D3","json":"https://pith.science/pith/ZAD5H7YUXDVBVHHCX6KHWUW6D3.json","graph_json":"https://pith.science/api/pith-number/ZAD5H7YUXDVBVHHCX6KHWUW6D3/graph.json","events_json":"https://pith.science/api/pith-number/ZAD5H7YUXDVBVHHCX6KHWUW6D3/events.json","paper":"https://pith.science/paper/ZAD5H7YU"},"agent_actions":{"view_html":"https://pith.science/pith/ZAD5H7YUXDVBVHHCX6KHWUW6D3","download_json":"https://pith.science/pith/ZAD5H7YUXDVBVHHCX6KHWUW6D3.json","view_paper":"https://pith.science/paper/ZAD5H7YU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2207&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAD5H7YUXDVBVHHCX6KHWUW6D3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAD5H7YUXDVBVHHCX6KHWUW6D3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAD5H7YUXDVBVHHCX6KHWUW6D3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAD5H7YUXDVBVHHCX6KHWUW6D3/action/storage_attestation","attest_author":"https://pith.science/pith/ZAD5H7YUXDVBVHHCX6KHWUW6D3/action/author_attestation","sign_citation":"https://pith.science/pith/ZAD5H7YUXDVBVHHCX6KHWUW6D3/action/citation_signature","submit_replication":"https://pith.science/pith/ZAD5H7YUXDVBVHHCX6KHWUW6D3/action/replication_record"}},"created_at":"2026-05-18T03:32:05.841602+00:00","updated_at":"2026-05-18T03:32:05.841602+00:00"}