{"id":"https://openalex.org/W7131430473","doi":"https://doi.org/10.48550/arxiv.2602.21022","title":"Is a LOCAL algorithm computable?","display_name":"Is a LOCAL algorithm computable?","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7131430473","doi":"https://doi.org/10.48550/arxiv.2602.21022"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.21022","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078408424","display_name":"Antonio Cruciani","orcid":"https://orcid.org/0000-0002-9538-4275"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cruciani, Antonio","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025342406","display_name":"Avinandan Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Avinandan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053359236","display_name":"Massimo Equi","orcid":"https://orcid.org/0000-0001-8609-0040"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Equi, Massimo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126822184","display_name":"Henrik Lievonen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lievonen, Henrik","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5099801505","display_name":"Diep Luong-Le","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luong-Le, Diep","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126831880","display_name":"Augusto Modanese","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Modanese, Augusto","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126141338","display_name":"Jukka Suomela","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Suomela, Jukka","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5078408424"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.44589999318122864,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.44589999318122864,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.3571000099182129,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.06549999862909317,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computability","display_name":"Computability","score":0.8167999982833862},{"id":"https://openalex.org/keywords/computable-analysis","display_name":"Computable analysis","score":0.6262999773025513},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5202999711036682},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5156000256538391},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.4771000146865845},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4399999976158142},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.39649999141693115}],"concepts":[{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.8167999982833862},{"id":"https://openalex.org/C27318111","wikidata":"https://www.wikidata.org/wiki/Q5157264","display_name":"Computable analysis","level":3,"score":0.6262999773025513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.573199987411499},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5202999711036682},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5156000256538391},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.4771000146865845},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4399999976158142},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4235000014305115},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.39649999141693115},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36329999566078186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3601999878883362},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3465000092983246},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3244999945163727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3124000132083893},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28859999775886536}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.21022","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.21022","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.21022","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.21022","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.6936817765235901,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Common":[0],"definitions":[1],"of":[2,79,84,111,115,195],"the":[3,18,74,82,85,113,116,129,142,157,174,189,215,220],"\"standard\"":[4],"LOCAL":[5,86,143],"model":[6,144,159,176],"tend":[7],"to":[8,38,98],"be":[9,135,150],"sloppy":[10],"and":[11,47,193,222],"even":[12,66],"self-contradictory":[13],"on":[14,166,210],"one":[15],"point:":[16],"do":[17,179],"nodes":[19],"update":[20],"their":[21],"state":[22],"using":[23],"an":[24,124],"arbitrary":[25],"function":[26],"or":[27],"a":[28],"computable":[29,158,175,221],"function?":[30],"So":[31],"far,":[32],"this":[33,58,63],"distinction":[34],"has":[35,214],"been":[36],"safe":[37],"neglect,":[39],"since":[40],"problems":[41,55,71,80],"where":[42],"it":[43],"matters":[44,65],"seem":[45],"contrived":[46],"quite":[48],"different":[49],"from":[50],"e.g.":[51],"typical":[52],"local":[53],"graph":[54],"studied":[56,77],"in":[57,81,137,152,156,173,198,219],"context.":[59],"We":[60,185],"show":[61,90,120,187],"that":[62,91,121,188],"question":[64],"for":[67,200],"locally":[68],"checkable":[69],"labeling":[70],"(LCLs),":[72],"perhaps":[73],"most":[75],"widely":[76],"family":[78],"context":[83],"model.":[87],"Furthermore,":[88],"we":[89,107,119,161,178],"assumptions":[92],"about":[93,183],"computability":[94,192],"are":[95],"directly":[96],"connected":[97],"another":[99],"aspect":[100],"already":[101],"recognized":[102],"as":[103],"highly":[104],"relevant:":[105],"whether":[106],"have":[108,207],"any":[109,163,201,208],"knowledge":[110,194],"$n$,":[112,211],"size":[114],"graph.":[117],"Concretely,":[118],"there":[122],"is":[123,145],"LCL":[125,202],"problem":[126,203],"$\u03a0$":[127,133,148,169,213],"with":[128],"following":[130],"properties:":[131],"1.":[132],"can":[134,149],"solved":[136,151],"$O(\\log":[138,153],"n)$":[139,154],"rounds":[140,155,172],"if":[141,160,177,205],"uncomputable.":[146],"2.":[147],"know":[162,181],"upper":[164],"bound":[165,209],"$n$.":[167,184],"3.":[168],"requires":[170],"$\u03a9(\\sqrt{n})$":[171],"not":[180],"anything":[182],"also":[186],"connection":[190],"between":[191],"$n$":[196],"holds":[197],"general:":[199],"$\u03a0$,":[204],"you":[206],"then":[212],"same":[216],"round":[217],"complexity":[218],"uncomputable":[223],"models.":[224]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-26T00:00:00"}