{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:I45OKGERNOLBHSCRCZFNPVLG2F","short_pith_number":"pith:I45OKGER","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"},"canonical_sha256":"473ae518916b9613c851164ad7d566d1635c0f19906380d753412b261425de53","source":{"kind":"arxiv","id":"2504.07725","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:I45OKGERNOLBHSCRCZFNPVLG2F","target":"record","payload":{"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"},"canonical_sha256":"473ae518916b9613c851164ad7d566d1635c0f19906380d753412b261425de53","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"},"source_kind":"arxiv","source_id":"2504.07725","source_version":1,"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-07-05T10:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJDAqB7Oy+Iev4cKtcxvKcD65QQ2rojgLObOCtGWlNrR9juOUsmsKV8Et8352DRCckMWajDPNva9VOC1raKQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:21:04.932661Z"},"content_sha256":"5d2c9ac96d7bff434f79460bb58d7ee3b86b37085a40acc213a78148f1827507","schema_version":"1.0","event_id":"sha256:5d2c9ac96d7bff434f79460bb58d7ee3b86b37085a40acc213a78148f1827507"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:I45OKGERNOLBHSCRCZFNPVLG2F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GjoSU1Gk69pxvGBkn3Te5gVjpn4zcuPzVk3SR778sWoJRzISc+tLD56QFBp3MH+vlS1hs4LUMfntspIpLGHkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:21:04.933034Z"},"content_sha256":"570c79db640fdaa84dddebcc7c4fc49e52f306592b7301c6d7ac13bc05a1665e","schema_version":"1.0","event_id":"sha256:570c79db640fdaa84dddebcc7c4fc49e52f306592b7301c6d7ac13bc05a1665e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/bundle.json","state_url":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I45OKGERNOLBHSCRCZFNPVLG2F/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-07-06T15:21:04Z","links":{"resolver":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F","bundle":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/bundle.json","state":"https://pith.science/pith/I45OKGERNOLBHSCRCZFNPVLG2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I45OKGERNOLBHSCRCZFNPVLG2F/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HtgdOY1vA8nMwGk3s5qXIqOAtIn2sOAxdh61+D4QnkJ5y22Sa3+9n2p8QWS0jESAGWsGf2r9S0XbK3pMX1YPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:21:04.935184Z","bundle_sha256":"b6aaf993e4991bf3bf3e61b12cfc35fdb9c30dd3c64141cb1c8f0dd619578f1a"}}