{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:I45OKGERNOLBHSCRCZFNPVLG2F","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":"71b4fcd963c69788b747a9863a007ffce6b1f91fb0687fc65dd1f065eacdb3fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-10T13:18:22Z","title_canon_sha256":"deeff99a56ae3da3cbefa971d1af33f2057678ad261742bb9f4ffb97b390da16"},"schema_version":"1.0","source":{"id":"2504.07725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.07725","created_at":"2026-07-05T10:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"2504.07725v1","created_at":"2026-07-05T10:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07725","created_at":"2026-07-05T10:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"I45OKGERNOLB","created_at":"2026-07-05T10:47:13Z"},{"alias_kind":"pith_short_16","alias_value":"I45OKGERNOLBHSCR","created_at":"2026-07-05T10:47:13Z"},{"alias_kind":"pith_short_8","alias_value":"I45OKGER","created_at":"2026-07-05T10:47:13Z"}],"graph_snapshots":[{"event_id":"sha256:570c79db640fdaa84dddebcc7c4fc49e52f306592b7301c6d7ac13bc05a1665e","target":"graph","created_at":"2026-07-05T10:47:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.07725/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}'","authors_text":"Esmaeil Delfaraz, Gianlorenzo D'Angelo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-10T13:18:22Z","title":"Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07725","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:5d2c9ac96d7bff434f79460bb58d7ee3b86b37085a40acc213a78148f1827507","target":"record","created_at":"2026-07-05T10:47:13Z","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":"71b4fcd963c69788b747a9863a007ffce6b1f91fb0687fc65dd1f065eacdb3fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-10T13:18:22Z","title_canon_sha256":"deeff99a56ae3da3cbefa971d1af33f2057678ad261742bb9f4ffb97b390da16"},"schema_version":"1.0","source":{"id":"2504.07725","kind":"arxiv","version":1}},"canonical_sha256":"473ae518916b9613c851164ad7d566d1635c0f19906380d753412b261425de53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"473ae518916b9613c851164ad7d566d1635c0f19906380d753412b261425de53","first_computed_at":"2026-07-05T10:47:13.861934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:47:13.861934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XtFI8/VeGKv7CUsdma5j4aYlgHtMRYPobFkkleTkX9VtX19jZ0Xy35vAMON98r1FqwlhWSlp5xmeGTW2Sfy5BA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:47:13.862358Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.07725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d2c9ac96d7bff434f79460bb58d7ee3b86b37085a40acc213a78148f1827507","sha256:570c79db640fdaa84dddebcc7c4fc49e52f306592b7301c6d7ac13bc05a1665e"],"state_sha256":"8f0dcc2462dc8ca680c57f35b39e19d37298b2237151388b12268d9d24dc0a4b"}