{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KHJI72QG4XTAJY2PME5E4BTR4M","short_pith_number":"pith:KHJI72QG","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"},"canonical_sha256":"51d28fea06e5e604e34f613a4e0671e33a466f236b583363478891f8aa0d279c","source":{"kind":"arxiv","id":"1403.5111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5111","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5111v2","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5111","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"KHJI72QG4XTA","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KHJI72QG4XTAJY2P","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KHJI72QG","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KHJI72QG4XTAJY2PME5E4BTR4M","target":"record","payload":{"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"},"canonical_sha256":"51d28fea06e5e604e34f613a4e0671e33a466f236b583363478891f8aa0d279c","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"},"source_kind":"arxiv","source_id":"1403.5111","source_version":2,"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-05-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gm5IHGmyamliYu8xh4f/qjKm6odL9DWc+0jui5reng+auWiMxa09i61In+iBFpbVjJ7p3NwoZ91nqGQJcTlpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:10:36.107177Z"},"content_sha256":"7a3cac17593aa3823aec372d0284a3b9c855b8905abbbe72f16234680f2b194c","schema_version":"1.0","event_id":"sha256:7a3cac17593aa3823aec372d0284a3b9c855b8905abbbe72f16234680f2b194c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KHJI72QG4XTAJY2PME5E4BTR4M","target":"graph","payload":{"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"},"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-05-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPPyY1wix8mlxr9vNu/iTwbb/M+y8iLjW/s8fZg3dMLTWewlOZzRFigxcDgShr+C0+2Z0ZMcgy06mdr15CbzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:10:36.107690Z"},"content_sha256":"151e324437065bdd542376221c0fd906d5884aaa6e3a480fdebc0436023db438","schema_version":"1.0","event_id":"sha256:151e324437065bdd542376221c0fd906d5884aaa6e3a480fdebc0436023db438"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/bundle.json","state_url":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHJI72QG4XTAJY2PME5E4BTR4M/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-06-24T22:10:36Z","links":{"resolver":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M","bundle":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/bundle.json","state":"https://pith.science/pith/KHJI72QG4XTAJY2PME5E4BTR4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHJI72QG4XTAJY2PME5E4BTR4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KHJI72QG4XTAJY2PME5E4BTR4M","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":"7a89b8c374b67b967ff59fe7e69bf15471c1cc748c40b3830149d04406868a67","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-20T12:28:43Z","title_canon_sha256":"1409b63096d3e4df407b28fa71b83b9af721ad9da10424cf5ca9f2faafe7a290"},"schema_version":"1.0","source":{"id":"1403.5111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5111","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5111v2","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5111","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"KHJI72QG4XTA","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KHJI72QG4XTAJY2P","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KHJI72QG","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:151e324437065bdd542376221c0fd906d5884aaa6e3a480fdebc0436023db438","target":"graph","created_at":"2026-05-18T02:54:55Z","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"},"paper":{"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","authors_text":"Andreas Wotzlaw","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-20T12:28:43Z","title":"On Solving the Maximum $k$-club Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5111","kind":"arxiv","version":2},"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:7a3cac17593aa3823aec372d0284a3b9c855b8905abbbe72f16234680f2b194c","target":"record","created_at":"2026-05-18T02:54:55Z","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":"7a89b8c374b67b967ff59fe7e69bf15471c1cc748c40b3830149d04406868a67","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-20T12:28:43Z","title_canon_sha256":"1409b63096d3e4df407b28fa71b83b9af721ad9da10424cf5ca9f2faafe7a290"},"schema_version":"1.0","source":{"id":"1403.5111","kind":"arxiv","version":2}},"canonical_sha256":"51d28fea06e5e604e34f613a4e0671e33a466f236b583363478891f8aa0d279c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51d28fea06e5e604e34f613a4e0671e33a466f236b583363478891f8aa0d279c","first_computed_at":"2026-05-18T02:54:55.753333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:55.753333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLgafuPe9zR/TMWFuDlhFPoQhOEyR5hHUFF0JO0aKEjY417MVMiY1yhS5vkeBhsXVzVpxCG9XyIuuWinEoICCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:55.753896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a3cac17593aa3823aec372d0284a3b9c855b8905abbbe72f16234680f2b194c","sha256:151e324437065bdd542376221c0fd906d5884aaa6e3a480fdebc0436023db438"],"state_sha256":"489114a564c42e7c40f42e8a8aed9242569c010d7492bac27baa16284cd5cd87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNRRAiGYDd7y50cTom2vYGk+z5ZK65AIMJL71/K9W1wGrcwU34i7Ev4V2drBFMdzCp3m20DVaD5MHt9QlgG/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:10:36.110358Z","bundle_sha256":"424915e9724cf9d746f2308b7e8c48afba3b623b347fe0e0e2877195e1b3d63c"}}