{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AV4HS7XGJYK64J464NZFVINITB","short_pith_number":"pith:AV4HS7XG","schema_version":"1.0","canonical_sha256":"0578797ee64e15ee279ee3725aa1a89862eeebd7bc8bd329d6a7851708f88341","source":{"kind":"arxiv","id":"1806.01119","version":1},"attestation_state":"computed","paper":{"title":"Covering with Clubs: Complexity and Approximability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Sikora, Giancarlo Mauri, Italo Zoppis, Riccardo Dondi","submitted_at":"2018-06-04T13:51:29Z","abstract_excerpt":"Finding cohesive subgraphs in a network is a well-known problem in graph theory. Several alternative formulations of cohesive subgraph have been proposed, a notable example being $s$-club, which is a subgraph where each vertex is at distance at most $s$ to the others. Here we consider the problem of covering a given graph with the minimum number of $s$-clubs. We study the computational and approximation complexity of this problem, when $s$ is equal to 2 or 3. First, we show that deciding if there exists a cover of a graph with three $2$-clubs is NP-complete, and that deciding if there exists a"},"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":"1806.01119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-04T13:51:29Z","cross_cats_sorted":[],"title_canon_sha256":"d9d36749aac4b260ab3757f5549d3fbf0bde3672dce8232de7c23199c91b2bd3","abstract_canon_sha256":"0d8eee7c41fb397757d3973702feccbe76f787448b5360bd467d34247447339e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:17.413862Z","signature_b64":"OFmne1hycIro0lDvA5+70qvgVmewSIRmKzMjXFSoCesSjCQy2bJjVEsx9lO7fiOrIPw9OBgvfTlonSzSBYkuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0578797ee64e15ee279ee3725aa1a89862eeebd7bc8bd329d6a7851708f88341","last_reissued_at":"2026-05-18T00:14:17.413122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:17.413122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering with Clubs: Complexity and Approximability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Sikora, Giancarlo Mauri, Italo Zoppis, Riccardo Dondi","submitted_at":"2018-06-04T13:51:29Z","abstract_excerpt":"Finding cohesive subgraphs in a network is a well-known problem in graph theory. Several alternative formulations of cohesive subgraph have been proposed, a notable example being $s$-club, which is a subgraph where each vertex is at distance at most $s$ to the others. Here we consider the problem of covering a given graph with the minimum number of $s$-clubs. We study the computational and approximation complexity of this problem, when $s$ is equal to 2 or 3. First, we show that deciding if there exists a cover of a graph with three $2$-clubs is NP-complete, and that deciding if there exists a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01119","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":""},"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":"1806.01119","created_at":"2026-05-18T00:14:17.413244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01119v1","created_at":"2026-05-18T00:14:17.413244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01119","created_at":"2026-05-18T00:14:17.413244+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV4HS7XGJYK6","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV4HS7XGJYK64J46","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV4HS7XG","created_at":"2026-05-18T12:32:13.499390+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/AV4HS7XGJYK64J464NZFVINITB","json":"https://pith.science/pith/AV4HS7XGJYK64J464NZFVINITB.json","graph_json":"https://pith.science/api/pith-number/AV4HS7XGJYK64J464NZFVINITB/graph.json","events_json":"https://pith.science/api/pith-number/AV4HS7XGJYK64J464NZFVINITB/events.json","paper":"https://pith.science/paper/AV4HS7XG"},"agent_actions":{"view_html":"https://pith.science/pith/AV4HS7XGJYK64J464NZFVINITB","download_json":"https://pith.science/pith/AV4HS7XGJYK64J464NZFVINITB.json","view_paper":"https://pith.science/paper/AV4HS7XG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01119&json=true","fetch_graph":"https://pith.science/api/pith-number/AV4HS7XGJYK64J464NZFVINITB/graph.json","fetch_events":"https://pith.science/api/pith-number/AV4HS7XGJYK64J464NZFVINITB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV4HS7XGJYK64J464NZFVINITB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV4HS7XGJYK64J464NZFVINITB/action/storage_attestation","attest_author":"https://pith.science/pith/AV4HS7XGJYK64J464NZFVINITB/action/author_attestation","sign_citation":"https://pith.science/pith/AV4HS7XGJYK64J464NZFVINITB/action/citation_signature","submit_replication":"https://pith.science/pith/AV4HS7XGJYK64J464NZFVINITB/action/replication_record"}},"created_at":"2026-05-18T00:14:17.413244+00:00","updated_at":"2026-05-18T00:14:17.413244+00:00"}