000169130 001__ 169130 000169130 005__ 20260219161517.0 000169130 0247_ $$2doi$$a10.1038/s42005-025-02474-7 000169130 0248_ $$2sideral$$a148225 000169130 037__ $$aART-2026-148225 000169130 041__ $$aeng 000169130 100__ $$aFerraz de Arruda, Guilherme 000169130 245__ $$aAssigning entities to teams as a hypergraph discovery problem 000169130 260__ $$c2026 000169130 5060_ $$aAccess copy available to the general public$$fUnrestricted 000169130 5203_ $$aAssigning agents to teams under strict task and effort constraints is crucial in business, science, and engineering, where disruptions can cause significant losses. Current methods do not explore hypergraph-based solutions that explicitly optimize algebraic connectivity under constraints, leaving unresolved how to systematically form robust, recoverable teams. We present a hypergraph-based team assignment algorithm where nodes represent agents and hyperedges represent tasks. The search is guided by input constraints and aims to optimize resilience and diffusion by maximizing the algebraic connectivity of an edge-dependent, vertex-weighted hypergraph. We employ constrained simulated annealing to find a satisfactory hypergraph by enforcing both the minimum effort required for task completion and the maximum effort agents can exert. We evaluate robustness by assessing solution recovery after node removal attacks. Our results demonstrate that the hypergraph formulation yields more robust solutions than the bipartite formulation and the greedy approach. 000169130 536__ $$9info:eu-repo/grantAgreement/ES/DGA/E36-23R-FENOL$$9info:eu-repo/grantAgreement/ES/MICINN/PID2023-149409NB-I00 000169130 540__ $$9info:eu-repo/semantics/openAccess$$aby-nc-nd$$uhttps://creativecommons.org/licenses/by-nc-nd/4.0/deed.es 000169130 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/publishedVersion 000169130 700__ $$aHe, Wan 000169130 700__ $$aHeydaribeni, Nasimeh 000169130 700__ $$aJavidi, Tara 000169130 700__ $$0(orcid)0000-0002-0895-1893$$aMoreno, Yamir$$uUniversidad de Zaragoza 000169130 700__ $$aEliassi-Rad, Tina 000169130 7102_ $$12004$$2405$$aUniversidad de Zaragoza$$bDpto. Física Teórica$$cÁrea Física Teórica 000169130 773__ $$g9, 1 (2026), [15 pp.]$$tCommunications Physics$$x2399-3650 000169130 8564_ $$s1432941$$uhttps://zaguan.unizar.es/record/169130/files/texto_completo.pdf$$yVersión publicada 000169130 8564_ $$s3000701$$uhttps://zaguan.unizar.es/record/169130/files/texto_completo.jpg?subformat=icon$$xicon$$yVersión publicada 000169130 909CO $$ooai:zaguan.unizar.es:169130$$particulos$$pdriver 000169130 951__ $$a2026-02-19-14:11:08 000169130 980__ $$aARTICLE