{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I45OKGERNOLBHSCRCZFNPVLG2F","short_pith_number":"pith:I45OKGER","schema_version":"1.0","canonical_sha256":"473ae518916b9613c851164ad7d566d1635c0f19906380d753412b261425de53","source":{"kind":"arxiv","id":"2504.07725","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Esmaeil Delfaraz, Gianlorenzo D'Angelo","submitted_at":"2025-04-10T13:18:22Z","abstract_excerpt":"In the Connected Budgeted maximum Coverage problem (CBC), we are given a collection of subsets $\\mathcal{S}$, defined over a ground set $X$, and an undirected graph $G=(V,E)$, where each node is associated with a set of $\\mathcal{S}$. Each set in $\\mathcal{S}$ has a different cost and each element of $X$ gives a different prize. The goal is to find a subcollection $\\mathcal{S}'\\subseteq \\mathcal{S}$ such that $\\mathcal{S}'$ induces a connected subgraph in $G$, the total cost of the sets in $\\mathcal{S}'$ does not exceed a budget $B$, and the total prize of the elements covered by $\\mathcal{S}'"},"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":"2504.07725","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-10T13:18:22Z","cross_cats_sorted":[],"title_canon_sha256":"deeff99a56ae3da3cbefa971d1af33f2057678ad261742bb9f4ffb97b390da16","abstract_canon_sha256":"71b4fcd963c69788b747a9863a007ffce6b1f91fb0687fc65dd1f065eacdb3fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:13.862358Z","signature_b64":"XtFI8/VeGKv7CUsdma5j4aYlgHtMRYPobFkkleTkX9VtX19jZ0Xy35vAMON98r1FqwlhWSlp5xmeGTW2Sfy5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"473ae518916b9613c851164ad7d566d1635c0f19906380d753412b261425de53","last_reissued_at":"2026-07-05T10:47:13.861934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:13.861934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Esmaeil Delfaraz, Gianlorenzo D'Angelo","submitted_at":"2025-04-10T13:18:22Z","abstract_excerpt":"In the Connected Budgeted maximum Coverage problem (CBC), we are given a collection of subsets $\\mathcal{S}$, defined over a ground set $X$, and an undirected graph $G=(V,E)$, where each node is associated with a set of $\\mathcal{S}$. Each set in $\\mathcal{S}$ has a different cost and each element of $X$ gives a different prize. The goal is to find a subcollection $\\mathcal{S}'\\subseteq \\mathcal{S}$ such that $\\mathcal{S}'$ induces a connected subgraph in $G$, the total cost of the sets in $\\mathcal{S}'$ does not exceed a budget $B$, and the total prize of the elements covered by $\\mathcal{S}'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07725","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.07725/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.07725","created_at":"2026-07-05T10:47:13.861987+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.07725v1","created_at":"2026-07-05T10:47:13.861987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07725","created_at":"2026-07-05T10:47:13.861987+00:00"},{"alias_kind":"pith_short_12","alias_value":"I45OKGERNOLB","created_at":"2026-07-05T10:47:13.861987+00:00"},{"alias_kind":"pith_short_16","alias_value":"I45OKGERNOLBHSCR","created_at":"2026-07-05T10:47:13.861987+00:00"},{"alias_kind":"pith_short_8","alias_value":"I45OKGER","created_at":"2026-07-05T10:47:13.861987+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/I45OKGERNOLBHSCRCZFNPVLG2F","json":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F.json","graph_json":"https://pith.science/api/pith-number/I45OKGERNOLBHSCRCZFNPVLG2F/graph.json","events_json":"https://pith.science/api/pith-number/I45OKGERNOLBHSCRCZFNPVLG2F/events.json","paper":"https://pith.science/paper/I45OKGER"},"agent_actions":{"view_html":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F","download_json":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F.json","view_paper":"https://pith.science/paper/I45OKGER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.07725&json=true","fetch_graph":"https://pith.science/api/pith-number/I45OKGERNOLBHSCRCZFNPVLG2F/graph.json","fetch_events":"https://pith.science/api/pith-number/I45OKGERNOLBHSCRCZFNPVLG2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/action/storage_attestation","attest_author":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/action/author_attestation","sign_citation":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/action/citation_signature","submit_replication":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/action/replication_record"}},"created_at":"2026-07-05T10:47:13.861987+00:00","updated_at":"2026-07-05T10:47:13.861987+00:00"}