{"id":"https://openalex.org/W7165766446","doi":"https://doi.org/10.4230/lipics.sand.2026.27","title":"Brief Announcement: Adaptive Self-Organization in Anonymous Dynamic Networks","display_name":"Brief Announcement: Adaptive Self-Organization in Anonymous Dynamic Networks","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165766446","doi":"https://doi.org/10.4230/lipics.sand.2026.27"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26261","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.27/LIPIcs.SAND.2026.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.27/LIPIcs.SAND.2026.27.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104621290","display_name":"Garrett Parzych","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Parzych, Garrett","raw_affiliation_strings":["School of Computing and Augmented Intelligence, Biodesign Center for Biocomputing, Security and Society, Arizona State University, Tempe, AZ, USA"],"raw_orcid":"https://orcid.org/0009-0008-4789-9603","affiliations":[{"raw_affiliation_string":"School of Computing and Augmented Intelligence, Biodesign Center for Biocomputing, Security and Society, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070425572","display_name":"Joshua J. Daymude","orcid":"https://orcid.org/0000-0001-7294-5626"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daymude, Joshua J.","raw_affiliation_strings":["School of Computing and Augmented Intelligence, Biodesign Center for Biocomputing, Security and Society, Arizona State University, Tempe, AZ, USA"],"raw_orcid":"https://orcid.org/0000-0001-7294-5626","affiliations":[{"raw_affiliation_string":"School of Computing and Augmented Intelligence, Biodesign Center for Biocomputing, Security and Society, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66715522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.43619999289512634,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.43619999289512634,"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.19660000503063202,"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.07419999688863754,"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/adversarial-system","display_name":"Adversarial system","score":0.5378000140190125},{"id":"https://openalex.org/keywords/signal","display_name":"SIGNAL (programming language)","score":0.4846999943256378},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.45260000228881836},{"id":"https://openalex.org/keywords/dynamic-network-analysis","display_name":"Dynamic network analysis","score":0.4092999994754791},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3781999945640564},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.37209999561309814},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3549000024795532},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.33219999074935913},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.3140000104904175}],"concepts":[{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.5378000140190125},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.4846999943256378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4652999937534332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4611000120639801},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.4092999994754791},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3781999945640564},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.37209999561309814},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3443000018596649},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.33219999074935913},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2985000014305115},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.29760000109672546},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C52970973","wikidata":"https://www.wikidata.org/wiki/Q2497134","display_name":"Adaptive system","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2667999863624573},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C87414783","wikidata":"https://www.wikidata.org/wiki/Q1002603","display_name":"Degree distribution","level":3,"score":0.2522999942302704},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26261","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.27/LIPIcs.SAND.2026.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.27","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.27","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26261","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.27","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.27/LIPIcs.SAND.2026.27.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"score":0.4150126874446869,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G7245595530","display_name":"AF: Medium: Concurrency and Adaptive Self-Organization in Anonymous Dynamic Networks","funder_award_id":"2312537","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165766446.pdf","grobid_xml":"https://content.openalex.org/works/W7165766446.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,108,140],"introduce":[1],"the":[2,9,20,44,55,77,82,105,116,137,157,170,175,228],"problem":[3,106],"of":[4,11,23,31,57,120,151,161,172,180,208,219],"adaptive":[5,121,220],"self-organization":[6,122,221],"in":[7,76,94,174,188],"which":[8,60,189],"nodes":[10,113,133,167,173,226],"an":[12],"anonymous,":[13],"synchronous":[14],"dynamic":[15,83],"network":[16,45,84],"must":[17,85,134],"distributively":[18],"change":[19,54,164],"collective":[21],"distribution":[22,96,102],"their":[24],"responses":[25],"(or":[26,71],"\"colors\")":[27],"as":[28],"a":[29,50,69,95,100,143,177,184,205],"function":[30],"time-varying":[32],"environmental":[33],"signals,":[34],"even":[35,155],"when":[36,156,225],"these":[37,209],"signals":[38],"are":[39,114,123,195],"only":[40,117],"perceived":[41],"locally":[42],"and":[43,59,92,159,192],"topology":[46],"changes":[47],"adversarially.":[48],"Specifically,":[49],"signal":[51,58,64,70,162,193],"adversary":[52],"may":[53],"type":[56],"node(s)":[61],"witness":[62],"that":[63,88,111,153,211],"arbitrarily":[65],"between":[66],"rounds.":[67],"If":[68],"lack":[72],"thereof)":[73],"s":[74],"persists":[75],"system":[78],"for":[79,148],"sufficiently":[80],"long,":[81],"stabilize":[86,135],"such":[87],"nodes'":[89],"colors":[90],"reach":[91],"remain":[93],"closely":[97],"approximating":[98],"r(s),":[99],"goal":[101,127,229],"defined":[103],"by":[104],"instance.":[107],"first":[109],"prove":[110],"if":[112],"deterministic,":[115],"solvable":[118],"instances":[119,152,218],"those":[124,130],"with":[125,136,222],"homogeneous":[126],"distributions,":[128],"i.e.,":[129],"where":[131],"all":[132],"same":[138],"color.":[139],"then":[141],"present":[142,204],"linear-time,":[144],"logarithmic-memory,":[145],"deterministic":[146],"algorithm":[147,182],"this":[149,181],"subclass":[150],"works":[154],"multiplicity":[158],"location":[160],"witnesses":[163],"arbitrarily.":[165],"When":[166],"know":[168,227],"n,":[169],"number":[171],"network,":[176],"small":[178],"adaptation":[179],"achieves":[183],"stronger":[185],"convergence":[186],"property":[187],"adversarial":[190],"edge":[191],"dynamics":[194],"entirely":[196],"unable":[197],"to":[198],"disturb":[199],"stabilized":[200],"configurations.":[201],"Finally,":[202],"we":[203],"randomized":[206],"extension":[207],"algorithms":[210],"solves":[212],"arbitrary":[213],"(i.e.,":[214],"not":[215],"necessarily":[216],"homogeneous)":[217],"high":[223],"probability":[224],"distributions.":[230]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-06-25T00:00:00"}