{"id":"https://openalex.org/W7109045351","doi":"https://doi.org/10.48550/arxiv.2512.04197","title":"Constructing Low-Redundancy Codes via Distributed Graph Coloring","display_name":"Constructing Low-Redundancy Codes via Distributed Graph Coloring","publication_year":2025,"publication_date":"2025-12-03","ids":{"openalex":"https://openalex.org/W7109045351","doi":"https://doi.org/10.48550/arxiv.2512.04197"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2512.04197","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.04197","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2512.04197","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Li, Yuting","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Yuting","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Gabrys, Ryan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gabrys, Ryan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Farnoud, Farzad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Farnoud, Farzad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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/T11321","display_name":"Error Correcting Code Techniques","score":0.2635999917984009,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.2635999917984009,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.09880000352859497,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.09359999746084213,"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/hypergraph","display_name":"Hypergraph","score":0.5662000179290771},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5406000018119812},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.5192000269889832},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.42640000581741333},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.4187999963760376},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.3880000114440918},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3774999976158142},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.375900000333786}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5662000179290771},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5406000018119812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5325999855995178},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.5192000269889832},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5171999931335449},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.42640000581741333},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.4187999963760376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4131999909877777},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40119999647140503},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.3880000114440918},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3774999976158142},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.375900000333786},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.37369999289512634},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3564999997615814},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.33559998869895935},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.3158000111579895},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.31380000710487366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2903999984264374},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2768000066280365},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2512.04197","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.04197","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2512.04197","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.04197","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,37,43,55,77,95,130,155,164],"general":[3],"framework":[4],"for":[5,76,134],"constructing":[6],"error-correcting":[7],"codes":[8,93,127],"using":[9,54],"distributed":[10],"graph":[11,27,99],"coloring":[12,46,60],"under":[13],"the":[14,19,25,34,88,114,123],"LOCAL":[15],"model.":[16],"Building":[17],"on":[18,154],"correspondence":[20],"between":[21],"independent":[22],"sets":[23],"in":[24,51],"confusion":[26],"and":[28,66,121,149,159],"valid":[29],"codes,":[30],"we":[31],"show":[32],"that":[33],"color":[35],"of":[36,58,80,82,98,132,137,166],"single":[38],"vertex":[39],"-":[40,47],"consistent":[41],"with":[42,85,109],"global":[44],"proper":[45],"can":[48],"be":[49],"computed":[50],"polynomial":[52],"time":[53],"modified":[56],"version":[57],"Linial's":[59],"algorithm,":[61],"leading":[62],"to":[63,129,141],"efficient":[64],"encoding":[65],"decoding.":[67],"Our":[68],"results":[69],"include:":[70],"i)":[71],"uniquely":[72],"decodable":[73],"code":[74],"constructions":[75],"constant":[78],"number":[79],"errors":[81],"any":[83],"type":[84],"redundancy":[86,162],"twice":[87],"Gilbert-Varshamov":[89],"bound;":[90],"ii)":[91],"list-decodable":[92],"via":[94],"proposed":[96],"extension":[97],"coloring,":[100],"namely,":[101],"hypergraph":[102],"labeling;":[103],"iii)":[104],"an":[105],"incremental":[106],"synchronization":[107],"scheme":[108],"reduced":[110],"average-case":[111],"communication":[112],"when":[113],"edit":[115],"distance":[116],"is":[117,146],"not":[118,152],"precisely":[119],"known;":[120],"iv)":[122],"first":[124],"asymptotically":[125],"optimal":[126],"(up":[128],"factor":[131],"8)":[133],"correcting":[135],"bursts":[136],"unbounded-length":[138],"edits.":[139],"Compared":[140],"syndrome":[142],"compression,":[143],"our":[144],"approach":[145],"more":[147],"flexible":[148],"generalizable,":[150],"does":[151],"rely":[153],"good":[156],"base":[157],"code,":[158],"achieves":[160],"improved":[161],"across":[163],"range":[165],"parameters.":[167]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-12-06T00:00:00"}