{"id":"https://openalex.org/W4399378124","doi":"https://doi.org/10.1145/3662158.3662813","title":"Brief Announcement: On the Limits of Information Spread by Memory-less Agents","display_name":"Brief Announcement: On the Limits of Information Spread by Memory-less Agents","publication_year":2024,"publication_date":"2024-06-05","ids":{"openalex":"https://openalex.org/W4399378124","doi":"https://doi.org/10.1145/3662158.3662813"},"language":"en","primary_location":{"id":"doi:10.1145/3662158.3662813","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3662158.3662813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-04779986/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093973975","display_name":"Niccol\u00f2 d'Archivio","orcid":"https://orcid.org/0009-0005-9491-2928"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Niccol\u00f2 D'Archivio","raw_affiliation_strings":["Team COATI, Institut National de Recherche en Sciences et Technologies du Num\u00e9rique (INRIA), Sophia Antipolis, France","COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)"],"raw_orcid":"https://orcid.org/0009-0005-9491-2928","affiliations":[{"raw_affiliation_string":"Team COATI, Institut National de Recherche en Sciences et Technologies du Num\u00e9rique (INRIA), Sophia Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039607367","display_name":"Robin Vacus","orcid":"https://orcid.org/0000-0002-7368-4912"},"institutions":[{"id":"https://openalex.org/I71209653","display_name":"Bocconi University","ror":"https://ror.org/05crjpb27","country_code":"IT","type":"education","lineage":["https://openalex.org/I71209653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Robin Vacus","raw_affiliation_strings":["Bocconi University, Bocconi Institute for Data Science and Analytics (BIDSA), Milan, Italy"],"raw_orcid":"https://orcid.org/0000-0002-7368-4912","affiliations":[{"raw_affiliation_string":"Bocconi University, Bocconi Institute for Data Science and Analytics (BIDSA), Milan, Italy","institution_ids":["https://openalex.org/I71209653"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5093973975"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.3364,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56528961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"91","last_page":"94"},"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.9980000257492065,"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.9980000257492065,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11486","display_name":"Micro and Nano Robotics","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/3104","display_name":"Condensed Matter Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5801792144775391},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.3983122706413269}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5801792144775391},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.3983122706413269}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3662158.3662813","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3662158.3662813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04779986v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04779986v1/document","pdf_url":"https://hal.science/hal-04779986/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"https://dl.acm.org/doi/proceedings/10.1145/3662158","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04779986v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04779986v1/document","pdf_url":"https://hal.science/hal-04779986/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"https://dl.acm.org/doi/proceedings/10.1145/3662158","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.49000000953674316,"display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399378124.pdf","grobid_xml":"https://content.openalex.org/works/W4399378124.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1965735445","https://openalex.org/W2002266200","https://openalex.org/W2079583100","https://openalex.org/W2091171788","https://openalex.org/W2112164016","https://openalex.org/W2126922170","https://openalex.org/W2571158882","https://openalex.org/W2768998600","https://openalex.org/W2793492460","https://openalex.org/W3037683188","https://openalex.org/W4286502875","https://openalex.org/W4385767294","https://openalex.org/W4390575685","https://openalex.org/W4399378124"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"We":[0],"address":[1],"the":[2,9,35,60,70,78,91,110,121,131,155,163],"self-stabilizing":[3],"bit-dissemination":[4],"problem,":[5],"designed":[6],"to":[7,33,52,58,72,76,90,94,139,181],"capture":[8],"challenges":[10],"of":[11,28,62,123,192],"spreading":[12],"information":[13,86],"and":[14,22,68,75],"reaching":[15],"consensus":[16],"among":[17],"entities":[18],"with":[19,177,183],"minimal":[20,132],"cognitive":[21],"communication":[23],"capacities.":[24],"Specifically,":[25,166],"a":[26,41,63,95,101,142,147],"group":[27],"n":[29],"agents":[30,55,82,114],"is":[31,107,125,171],"required":[32],"adopt":[34],"correct":[36],"opinion,":[37],"initially":[38],"held":[39],"by":[40],"single":[42],"informed":[43,79],"individual,":[44],"choosing":[45],"from":[46,87],"two":[47],"possible":[48],"opinions.":[49],"In":[50],"order":[51],"make":[53],"decisions,":[54],"are":[56,115],"restricted":[57],"observing":[59],"opinions":[61],"few":[64],"randomly":[65],"sampled":[66],"agents,":[67],"lack":[69],"ability":[71],"communicate":[73],"further":[74],"identify":[77],"individual.":[80],"Additionally,":[81],"cannot":[83],"retain":[84],"any":[85,174],"one":[88],"round":[89],"next.":[92],"According":[93],"recent":[96],"publication":[97],"in":[98,109,162,186],"SODA":[99],"(2024),":[100],"logarithmic":[102],"convergence":[103],"time":[104],"without":[105],"memory":[106],"achievable":[108],"parallel":[111,164],"setting":[112],"(where":[113],"updated":[116],"simultaneously),":[117],"as":[118,120],"long":[119],"number":[122,191],"samples":[124],"at":[126],"least":[127],"[EQUATION].":[128],"However,":[129],"determining":[130],"sample":[133,179],"size":[134],"for":[135,159,173],"an":[136,151,189],"efficient":[137],"protocol":[138,176],"exist":[140],"remains":[141],"challenging":[143],"open":[144],"question.":[145],"As":[146],"preliminary":[148],"step":[149],"towards":[150],"answer,":[152],"we":[153,167],"establish":[154],"first":[156],"lower":[157],"bound":[158],"this":[160],"problem":[161],"setting.":[165],"demonstrate":[168],"that":[169],"it":[170],"impossible":[172],"memory-less":[175],"constant":[178],"size,":[180],"converge":[182],"high":[184],"probability":[185],"less":[187],"than":[188],"almost-linear":[190],"rounds.":[193]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}