{"paper":{"title":"Maximizing the Cohesion is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NI","authors_text":"Adrien Friggeri (ENS / LIP Laboratoire de l'Informatique du Parall\\'elisme / INRIA Grenoble Rh\\^one-Alpes, Eric Fleury (ENS / LIP Laboratoire de l'Informatique du Parall\\'elisme / INRIA Grenoble Rh\\^one-Alpes, IXXI)","submitted_at":"2011-09-09T13:04:05Z","abstract_excerpt":"We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1994","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"}