{"id":"https://openalex.org/W4386075254","doi":"https://doi.org/10.1109/isit54713.2023.10206523","title":"Weighted Graph Coloring for Quantized Computing","display_name":"Weighted Graph Coloring for Quantized Computing","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386075254","doi":"https://doi.org/10.1109/isit54713.2023.10206523"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206523","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091783801","display_name":"Derya Malak","orcid":"https://orcid.org/0000-0002-5991-6641"},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Derya Malak","raw_affiliation_strings":["EURECOM,Communication Systems Department,France,06904"],"affiliations":[{"raw_affiliation_string":"EURECOM,Communication Systems Department,France,06904","institution_ids":["https://openalex.org/I1902872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091783801"],"corresponding_institution_ids":["https://openalex.org/I1902872"],"apc_list":null,"apc_paid":null,"fwci":0.5361,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6488281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2290","last_page":"2295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9980999827384949,"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/bipartite-graph","display_name":"Bipartite graph","score":0.6953083276748657},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.5959762334823608},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5262298583984375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4640786647796631},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41757044196128845},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4164779484272003},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3877197802066803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.363740473985672},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.34887194633483887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33458012342453003},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33442384004592896}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6953083276748657},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.5959762334823608},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5262298583984375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4640786647796631},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41757044196128845},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4164779484272003},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3877197802066803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.363740473985672},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.34887194633483887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33458012342453003},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33442384004592896}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206523","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1545658340","https://openalex.org/W1561272249","https://openalex.org/W1893639437","https://openalex.org/W1966292582","https://openalex.org/W2002501531","https://openalex.org/W2019307453","https://openalex.org/W2026641099","https://openalex.org/W2045603582","https://openalex.org/W2048235391","https://openalex.org/W2071801393","https://openalex.org/W2099213070","https://openalex.org/W2112426745","https://openalex.org/W2119336214","https://openalex.org/W2140227342","https://openalex.org/W2144970857","https://openalex.org/W2150412388","https://openalex.org/W2155676967","https://openalex.org/W2164651000","https://openalex.org/W2164684058","https://openalex.org/W2169962394","https://openalex.org/W2783678193","https://openalex.org/W2806273311","https://openalex.org/W2915411157","https://openalex.org/W2922342388","https://openalex.org/W2950346378","https://openalex.org/W2963498933","https://openalex.org/W3032894621","https://openalex.org/W3033172986","https://openalex.org/W3038230323","https://openalex.org/W3089294269","https://openalex.org/W3125314015","https://openalex.org/W3127518390","https://openalex.org/W3197624035","https://openalex.org/W3201582037","https://openalex.org/W3212424730","https://openalex.org/W3216593605","https://openalex.org/W4210348829","https://openalex.org/W4239800961","https://openalex.org/W4288708382","https://openalex.org/W4289655492","https://openalex.org/W4302366875","https://openalex.org/W4310902047","https://openalex.org/W4313291224","https://openalex.org/W4384644387","https://openalex.org/W6635653562","https://openalex.org/W6728975057","https://openalex.org/W6752557422","https://openalex.org/W6839784153"],"related_works":["https://openalex.org/W2948148442","https://openalex.org/W2461250372","https://openalex.org/W2394342941","https://openalex.org/W2169853506","https://openalex.org/W2547124190","https://openalex.org/W1558425494","https://openalex.org/W2350586049","https://openalex.org/W2385628723","https://openalex.org/W2169871401","https://openalex.org/W3008492011"],"abstract_inverted_index":{"We":[0,36],"consider":[1],"the":[2,32,39,56,62,70,78,83,92,116,128,137,144,151],"problem":[3],"of":[4,8,11,73,80,86,147],"distributed":[5,148],"lossless":[6,134],"computation":[7],"a":[9,24],"function":[10,130],"two":[12,28],"sources":[13,93],"by":[14,59],"one":[15],"common":[16],"user.":[17],"To":[18],"do":[19],"so,":[20],"we":[21,142,166],"first":[22],"build":[23,95],"bipartite":[25,40],"graph,":[26],"where":[27,52],"disjoint":[29],"parts":[30],"denote":[31],"individual":[33],"source":[34,44,63,101],"outcomes.":[35],"then":[37],"project":[38],"graph":[41,50],"onto":[42],"each":[43],"to":[45,66,115,126],"obtain":[46],"an":[47,132,155],"edge-weighted":[48],"characteristic":[49,74,81],"(EWCG),":[51],"edge":[53,90],"weights":[54],"capture":[55,99],"function\u2019s":[57],"structure,":[58],"how":[60],"much":[61],"outcomes":[64],"are":[65],"be":[67],"distinguished,":[68],"generalizing":[69],"classical":[71],"notion":[72],"graphs.":[75],"Via":[76],"exploiting":[77],"notions":[79],"graphs,":[82,88,108],"fractional":[84],"coloring":[85,161],"such":[87,107],"and":[89,112,163],"weights,":[91],"separately":[94],"multi-fold":[96],"graphs":[97],"that":[98,118,165],"vector-valued":[100],"sequences,":[102],"determine":[103],"vertex":[104],"colorings":[105],"for":[106],"encode":[109],"these":[110],"colorings,":[111],"send":[113],"them":[114],"user":[117],"performs":[119],"minimum-entropy":[120],"decoding":[121],"on":[122],"its":[123],"received":[124],"information":[125],"recover":[127],"desired":[129],"in":[131],"asymptotically":[133],"manner.":[135],"For":[136],"proposed":[138],"EWCG":[139],"compression":[140,169],"setup,":[141],"characterize":[143],"fundamental":[145],"limits":[146],"compression,":[149],"verify":[150],"communication":[152],"complexity":[153],"through":[154],"example,":[156],"contrast":[157],"it":[158],"with":[159],"traditional":[160,175],"schemes,":[162],"demonstrate":[164],"can":[167],"attain":[168],"gains":[170],"higher":[171],"than":[172],"%30":[173],"over":[174],"coloring.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-25T21:42:39.735039","created_date":"2025-10-10T00:00:00"}