{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KHJI72QG4XTAJY2PME5E4BTR4M","short_pith_number":"pith:KHJI72QG","schema_version":"1.0","canonical_sha256":"51d28fea06e5e604e34f613a4e0671e33a466f236b583363478891f8aa0d279c","source":{"kind":"arxiv","id":"1403.5111","version":2},"attestation_state":"computed","paper":{"title":"On Solving the Maximum $k$-club Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Andreas Wotzlaw","submitted_at":"2014-03-20T12:28:43Z","abstract_excerpt":"Given a simple undirected graph $G$, the maximum $k$-club problem is to find a maximum-cardinality subset of nodes inducing a subgraph of diameter at most $k$ in $G$. This NP-hard generalization of clique, originally introduced to model low diameter clusters in social networks, is of interest in network-based data mining and clustering applications. We give two MAX-SAT formulations of the problem and show that two exact methods resulting from our encodings outperform significantly the state-of-the-art exact methods when evaluated both on sparse and dense random graphs as well as on diverse rea"},"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":"1403.5111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-20T12:28:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1409b63096d3e4df407b28fa71b83b9af721ad9da10424cf5ca9f2faafe7a290","abstract_canon_sha256":"7a89b8c374b67b967ff59fe7e69bf15471c1cc748c40b3830149d04406868a67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:55.753896Z","signature_b64":"ZLgafuPe9zR/TMWFuDlhFPoQhOEyR5hHUFF0JO0aKEjY417MVMiY1yhS5vkeBhsXVzVpxCG9XyIuuWinEoICCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d28fea06e5e604e34f613a4e0671e33a466f236b583363478891f8aa0d279c","last_reissued_at":"2026-05-18T02:54:55.753333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:55.753333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Solving the Maximum $k$-club Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Andreas Wotzlaw","submitted_at":"2014-03-20T12:28:43Z","abstract_excerpt":"Given a simple undirected graph $G$, the maximum $k$-club problem is to find a maximum-cardinality subset of nodes inducing a subgraph of diameter at most $k$ in $G$. This NP-hard generalization of clique, originally introduced to model low diameter clusters in social networks, is of interest in network-based data mining and clustering applications. We give two MAX-SAT formulations of the problem and show that two exact methods resulting from our encodings outperform significantly the state-of-the-art exact methods when evaluated both on sparse and dense random graphs as well as on diverse rea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5111","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":"1403.5111","created_at":"2026-05-18T02:54:55.753411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5111v2","created_at":"2026-05-18T02:54:55.753411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5111","created_at":"2026-05-18T02:54:55.753411+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHJI72QG4XTA","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHJI72QG4XTAJY2P","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHJI72QG","created_at":"2026-05-18T12:28:35.611951+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/KHJI72QG4XTAJY2PME5E4BTR4M","json":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M.json","graph_json":"https://pith.science/api/pith-number/KHJI72QG4XTAJY2PME5E4BTR4M/graph.json","events_json":"https://pith.science/api/pith-number/KHJI72QG4XTAJY2PME5E4BTR4M/events.json","paper":"https://pith.science/paper/KHJI72QG"},"agent_actions":{"view_html":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M","download_json":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M.json","view_paper":"https://pith.science/paper/KHJI72QG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5111&json=true","fetch_graph":"https://pith.science/api/pith-number/KHJI72QG4XTAJY2PME5E4BTR4M/graph.json","fetch_events":"https://pith.science/api/pith-number/KHJI72QG4XTAJY2PME5E4BTR4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/action/storage_attestation","attest_author":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/action/author_attestation","sign_citation":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/action/citation_signature","submit_replication":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/action/replication_record"}},"created_at":"2026-05-18T02:54:55.753411+00:00","updated_at":"2026-05-18T02:54:55.753411+00:00"}