{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZAD5H7YUXDVBVHHCX6KHWUW6D3","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":"4fd4a8ba3b58e5e2cd82bb4e2d9f4a847e8e9b55910b2800c87445f6e52b08e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T21:45:49Z","title_canon_sha256":"6af968cf05df3eb478c6627d1f6e8d816b44e48ad0a8c54c7373f3395d29f1dd"},"schema_version":"1.0","source":{"id":"1110.2207","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2207","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2207v3","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2207","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZAD5H7YUXDVB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZAD5H7YUXDVBVHHC","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZAD5H7YU","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:6226787cde0a35e13c50382197c48bda08e6e4ac4df3308c6695e0d7764b9ef1","target":"graph","created_at":"2026-05-18T03:32:05Z","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 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\\}_{","authors_text":"Ruben van der Zwaan, Sungjin Im, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T21:45:49Z","title":"Minimum Latency Submodular Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2207","kind":"arxiv","version":3},"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:6fb83a5f0cf8e282797004257ea029e097770004912244050e4af34751d418bb","target":"record","created_at":"2026-05-18T03:32:05Z","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":"4fd4a8ba3b58e5e2cd82bb4e2d9f4a847e8e9b55910b2800c87445f6e52b08e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T21:45:49Z","title_canon_sha256":"6af968cf05df3eb478c6627d1f6e8d816b44e48ad0a8c54c7373f3395d29f1dd"},"schema_version":"1.0","source":{"id":"1110.2207","kind":"arxiv","version":3}},"canonical_sha256":"c807d3ff14b8ea1a9ce2bf947b52de1ed921887d854751e7f6f81554950adf28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c807d3ff14b8ea1a9ce2bf947b52de1ed921887d854751e7f6f81554950adf28","first_computed_at":"2026-05-18T03:32:05.841500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:05.841500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXIJjSaLYZ4Fzv8e2Qj9FGMLhIIdv+v7S757BMgwEdMWVt+8RucrKBT9T6GrGAEJoSDnd622cUrrcOHSmfxiAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:05.842197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2207","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fb83a5f0cf8e282797004257ea029e097770004912244050e4af34751d418bb","sha256:6226787cde0a35e13c50382197c48bda08e6e4ac4df3308c6695e0d7764b9ef1"],"state_sha256":"0f5de85151b1aa363915514bf584ed835d5b7f12be795c96734d3965befd61a3"}