{"id":"https://openalex.org/W4416177671","doi":"https://doi.org/10.1145/3798129.3800807","title":"Can Like Attract Like? A Study of Homonymous Gathering in Networks","display_name":"Can Like Attract Like? A Study of Homonymous Gathering in Networks","publication_year":2025,"publication_date":"2025-11-10","ids":{"openalex":"https://openalex.org/W4416177671","doi":"https://doi.org/10.1145/3798129.3800807"},"language":"en","primary_location":{"id":"doi:10.1145/3798129.3800807","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800807","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800807","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108768268","display_name":"St\u00e9phane Devismes","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Devismes, St\u00e9phane","raw_affiliation_strings":["MIS - Mod\u00e9lisation, Information et Syst\u00e8mes - UR UPJV 4290 (Universit\u00e9 de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - \r\n80039 AMIENS CEDEX 1 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIS - Mod\u00e9lisation, Information et Syst\u00e8mes - UR UPJV 4290 (Universit\u00e9 de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - \r\n80039 AMIENS CEDEX 1 - France)","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036192968","display_name":"Yoann Dieudonn\u00e9","orcid":"https://orcid.org/0000-0002-9593-7802"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dieudonn\u00e9, Yoann","raw_affiliation_strings":["MIS - Mod\u00e9lisation, Information et Syst\u00e8mes - UR UPJV 4290 (Universit\u00e9 de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - \r\n80039 AMIENS CEDEX 1 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIS - Mod\u00e9lisation, Information et Syst\u00e8mes - UR UPJV 4290 (Universit\u00e9 de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - \r\n80039 AMIENS CEDEX 1 - France)","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038247454","display_name":"Arnaud Labourel","orcid":"https://orcid.org/0000-0003-0162-1899"},"institutions":[{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I4210114274","display_name":"Laboratoire d\u2019Informatique et Syst\u00e8mes","ror":"https://ror.org/0257sgk90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I143002897","https://openalex.org/I21491767","https://openalex.org/I4210114274"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Labourel, Arnaud","raw_affiliation_strings":["LIS - Laboratoire d'Informatique et des Syst\u00e8mes (LIS) (Marseille, Toulon) (Aix Marseille Universit\u00e9 \u2013 Campus de Saint J\u00e9r\u00f4me \u2013 Bat. Polytech, 52 Av. Escadrille Normandie Niemen, 13397 Marseille Cedex 20 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIS - Laboratoire d'Informatique et des Syst\u00e8mes (LIS) (Marseille, Toulon) (Aix Marseille Universit\u00e9 \u2013 Campus de Saint J\u00e9r\u00f4me \u2013 Bat. Polytech, 52 Av. Escadrille Normandie Niemen, 13397 Marseille Cedex 20 - France)","institution_ids":["https://openalex.org/I4210114274","https://openalex.org/I21491767"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108768268"],"corresponding_institution_ids":["https://openalex.org/I4647051"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34950247,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"933","last_page":"942"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.8083999752998352,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.8083999752998352,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.16339999437332153,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.004999999888241291,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7455000281333923},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5745000243186951},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5059000253677368},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.4560000002384186},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4203000068664551},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.41260001063346863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40450000762939453},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.35519999265670776}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7455000281333923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6516000032424927},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5745000243186951},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5059000253677368},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.4560000002384186},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4203000068664551},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.41260001063346863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3725000023841858},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36959999799728394},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2921000123023987},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2856000065803528},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C26760741","wikidata":"https://www.wikidata.org/wiki/Q160402","display_name":"Perception","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800807","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800807","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2510.25451","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.25451","pdf_url":"https://arxiv.org/pdf/2510.25451","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-05356504v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05356504","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2025","raw_type":"Preprints, Working Papers, ..."}],"best_oa_location":{"id":"doi:10.1145/3798129.3800807","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800807","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0,147],"team":[1,148,266,283],"of":[2,9,51,90,95,160,179,191,224,298],"mobile":[3,75],"agents,":[4],"starting":[5],"from":[6],"distinct":[7,115,129],"nodes":[8],"a":[10,70,176,246,250,286],"network,":[11],"have":[12,113],"to":[13,121,130,152,215,244,263,273,281,293],"meet":[14],"at":[15],"the":[16,27,52,87,93,96,100,144,180,201,205,213,230,254],"same":[17,28,145],"node":[18],"and":[19,59,99],"declare":[20],"that":[21,111,141,166,188],"they":[22,31],"all":[23,125,190,268],"met.":[24],"Agents":[25],"execute":[26],"algorithm,":[29],"which":[30],"start":[32,94],"when":[33,267],"activated":[34],"by":[35,39,138],"an":[36,40,164,186],"adversary":[37],"or":[38],"agent":[41,98],"entering":[42],"their":[43],"initial":[44,158],"node.":[45],"When":[46],"activated,":[47],"agents":[48,112,140,214],"traverse":[49],"edges":[50],"network":[53],"in":[54,73,193,208,234],"synchronous":[55],"rounds.":[56],"Their":[57],"perception":[58],"communication":[60],"are":[61,270],"strictly":[62],"local.":[63],"This":[64,210],"task,":[65],"known":[66,119],"as":[67],"gathering,":[68],"is":[69,150,163,171,200,229,241],"central":[71],"problem":[72],"distributed":[74],"systems.":[76],"Most":[77],"prior":[78],"work":[79],"focuses":[80],"on":[81],"minimizing":[82],"its":[83],"time":[84],"complexity,":[85],"i.e.,":[86],"worst-case":[88],"number":[89],"rounds":[91],"between":[92],"earliest":[97],"task":[101],"completion.":[102],"To":[103],"break":[104],"possible":[105],"symmetries,":[106],"deterministic":[107,132,256],"solutions":[108],"typically":[109],"assume":[110],"pairwise":[114,128],"IDs,":[116],"called":[117],"labels,":[118],"only":[120,218],"themselves.":[122],"But":[123],"must":[124],"labels":[126,269],"be":[127,153,274,297],"guarantee":[131],"gathering?":[133],"We":[134,174,184,237],"address":[135,294],"this":[136,239,280],"question":[137],"considering":[139],"may":[142,296],"share":[143,217],"label.":[146],"L":[149],"said":[151],"gatherable":[154,181],"if,":[155],"for":[156,276],"every":[157],"setting":[159],"L,":[161],"there":[162],"algorithm":[165,187,211,258],"solves":[167],"gathering.":[168],"Our":[169,291],"contribution":[170],"threefold.":[172],"(1)":[173],"give":[175],"full":[177],"characterization":[178],"teams.":[182],"(2)":[183],"design":[185],"gathers":[189],"them":[192],"poly$(n,\\log\u03bb)$":[194],"time,":[195],"where":[196,227],"$n$":[197],"(resp.":[198,204],"$\u03bb$)":[199],"graph":[202],"order":[203],"smallest":[206],"label":[207,232],"L).":[209],"requires":[212],"initially":[216],"$O(\\log":[219],"\\log":[220,221],"\u03bc)$":[222],"bits":[223],"common":[225,261],"knowledge,":[226],"$\u03bc$":[228],"largest":[231],"multiplicity":[233],"L.":[235],"(3)":[236],"show":[238],"dependency":[240],"almost":[242],"optimal":[243],"get":[245,253],"poly$(n,\\log\u03bb)$-time":[247,257],"complexity.":[248],"As":[249],"by-product,":[251],"we":[252],"first":[255],"requiring":[259],"no":[260],"knowledge":[262],"gather":[264],"any":[265,282],"distinct.":[271],"Known":[272],"achievable":[275],"two-agent":[277],"teams,":[278],"extending":[279],"size":[284],"faced":[285],"major":[287],"challenge:":[288],"termination":[289],"detection.":[290],"techniques":[292],"it":[295],"independent":[299],"interest.":[300]},"counts_by_year":[],"updated_date":"2026-06-10T14:10:52.464848","created_date":"2025-10-31T00:00:00"}