{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RNCBNCVNSDIUNA7TR3IQMYRXIH","short_pith_number":"pith:RNCBNCVN","schema_version":"1.0","canonical_sha256":"8b44168aad90d14683f38ed106623741e7eb0cfe5c9d856f708809ad9834d23b","source":{"kind":"arxiv","id":"1807.07516","version":2},"attestation_state":"computed","paper":{"title":"Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Christian Komusiewicz, Marten Picker, Rolf Niedermeier","submitted_at":"2018-07-19T16:14:01Z","abstract_excerpt":"Finding large \"cliquish\" subgraphs is a central topic in graph mining and community detection. A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter one (these are cliques), one asks for subgraphs of diameter at most two (these are 2-clubs). A drawback of the 2-club model is that it produces star-like hub-and-spoke structures as maximum-cardinality solutions. Hence, we study 2-clubs with the additional constraint to be well-connected. More specifically, we investigate the algorithmic complexity for three variants of well-connected 2-clubs, all established in the "},"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":"1807.07516","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T16:14:01Z","cross_cats_sorted":[],"title_canon_sha256":"5d8d192cf86eb33923bf52f3e3f5a7bd5657025a5ea66c82eb541d5ea701079e","abstract_canon_sha256":"1d9d96bb35b0bc8068d62afdd137669a9aeef5eddad442c5bca410542ef24190"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:46.730772Z","signature_b64":"c7A1HWF4g/aozgJQGn3vRLnEfA7VAAZlngNz5VpbIHBmosObOgtRzVXqBfjVV/1bDKwItzrlaR8MG4KP73E5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b44168aad90d14683f38ed106623741e7eb0cfe5c9d856f708809ad9834d23b","last_reissued_at":"2026-05-17T23:57:46.730218Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:46.730218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Christian Komusiewicz, Marten Picker, Rolf Niedermeier","submitted_at":"2018-07-19T16:14:01Z","abstract_excerpt":"Finding large \"cliquish\" subgraphs is a central topic in graph mining and community detection. A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter one (these are cliques), one asks for subgraphs of diameter at most two (these are 2-clubs). A drawback of the 2-club model is that it produces star-like hub-and-spoke structures as maximum-cardinality solutions. Hence, we study 2-clubs with the additional constraint to be well-connected. More specifically, we investigate the algorithmic complexity for three variants of well-connected 2-clubs, all established in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07516","kind":"arxiv","version":2},"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":"1807.07516","created_at":"2026-05-17T23:57:46.730328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07516v2","created_at":"2026-05-17T23:57:46.730328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07516","created_at":"2026-05-17T23:57:46.730328+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNCBNCVNSDIU","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNCBNCVNSDIUNA7T","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNCBNCVN","created_at":"2026-05-18T12:32:50.500415+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/RNCBNCVNSDIUNA7TR3IQMYRXIH","json":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH.json","graph_json":"https://pith.science/api/pith-number/RNCBNCVNSDIUNA7TR3IQMYRXIH/graph.json","events_json":"https://pith.science/api/pith-number/RNCBNCVNSDIUNA7TR3IQMYRXIH/events.json","paper":"https://pith.science/paper/RNCBNCVN"},"agent_actions":{"view_html":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH","download_json":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH.json","view_paper":"https://pith.science/paper/RNCBNCVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07516&json=true","fetch_graph":"https://pith.science/api/pith-number/RNCBNCVNSDIUNA7TR3IQMYRXIH/graph.json","fetch_events":"https://pith.science/api/pith-number/RNCBNCVNSDIUNA7TR3IQMYRXIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/action/storage_attestation","attest_author":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/action/author_attestation","sign_citation":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/action/citation_signature","submit_replication":"https://pith.science/pith/RNCBNCVNSDIUNA7TR3IQMYRXIH/action/replication_record"}},"created_at":"2026-05-17T23:57:46.730328+00:00","updated_at":"2026-05-17T23:57:46.730328+00:00"}