{"id":"https://openalex.org/W7092556516","doi":"https://doi.org/10.1109/isit63088.2025.11195419","title":"General Coded Computing: Adversarial Settings","display_name":"General Coded Computing: Adversarial Settings","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W7092556516","doi":"https://doi.org/10.1109/isit63088.2025.11195419"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195419","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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":null,"display_name":"Parsa Moradi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]},{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Parsa Moradi","raw_affiliation_strings":["University of Minnesota, Twin Cities,Minneapolis,MN,USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Twin Cities,Minneapolis,MN,USA","institution_ids":["https://openalex.org/I4210101327","https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Hanzaleh Akbarinodehi","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hanzaleh Akbarinodehi","raw_affiliation_strings":["University of Minnesota, Twin Cities,Minneapolis,MN,USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Twin Cities,Minneapolis,MN,USA","institution_ids":["https://openalex.org/I4210101327","https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mohammad Ali Maddah-Ali","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Ali Maddah-Ali","raw_affiliation_strings":["University of Minnesota, Twin Cities,Minneapolis,MN,USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Twin Cities,Minneapolis,MN,USA","institution_ids":["https://openalex.org/I4210101327","https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"],"apc_list":null,"apc_paid":null,"fwci":2.3568,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.93220589,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9289000034332275,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9289000034332275,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.019500000402331352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.009200000204145908,"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/adversarial-system","display_name":"Adversarial system","score":0.8090999722480774},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.6121000051498413},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5063999891281128},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4713999927043915},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4332999885082245},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4260999858379364},{"id":"https://openalex.org/keywords/homomorphic-encryption","display_name":"Homomorphic encryption","score":0.4018000066280365},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.3709000051021576},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.3325999975204468}],"concepts":[{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.8090999722480774},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7026000022888184},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.6121000051498413},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5906000137329102},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5063999891281128},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4713999927043915},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4332999885082245},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.4018000066280365},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.366100013256073},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.3325999975204468},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.3059999942779541},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2896000146865845},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.2874999940395355},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2818000018596649},{"id":"https://openalex.org/C2776452267","wikidata":"https://www.wikidata.org/wiki/Q1503443","display_name":"Secrecy","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C201729545","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability theory","level":3,"score":0.2689000070095062},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195419","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G774687351","display_name":null,"funder_award_id":"CIF-2348638","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":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1540155273","https://openalex.org/W1965999112","https://openalex.org/W1982400500","https://openalex.org/W1986418190","https://openalex.org/W1990420052","https://openalex.org/W2052424275","https://openalex.org/W2112796928","https://openalex.org/W2140170995","https://openalex.org/W2784935051","https://openalex.org/W2899664803","https://openalex.org/W2950847865","https://openalex.org/W2962208489","https://openalex.org/W2963117124","https://openalex.org/W2980753584","https://openalex.org/W2993649261","https://openalex.org/W3086858324","https://openalex.org/W3119375995","https://openalex.org/W3127518390","https://openalex.org/W3137779858","https://openalex.org/W3179083954","https://openalex.org/W3201321905","https://openalex.org/W4255297036","https://openalex.org/W4298876635","https://openalex.org/W7092556516"],"related_works":[],"abstract_inverted_index":{"Conventional":[0],"coded":[1,61,69,185],"computing":[2,62,70,151,186],"frameworks":[3],"are":[4,117],"predominantly":[5],"designed":[6],"for":[7,52,84,104,119,187],"structured":[8],"computations,":[9,203],"such":[10],"as":[11],"matrix":[12],"multiplication":[13],"and":[14,24,42,58,183],"polynomial":[15],"evaluation.":[16],"These":[17],"tasks":[18],"enable":[19],"the":[20,32,38,50,66,85,88,98,125,128,150,157,193,196],"reuse":[21],"of":[22,34,40,68,75,91,127,140,166,169,195,202],"tools":[23],"techniques":[25],"from":[26],"algebraic":[27],"coding":[28],"theory":[29],"to":[30,71],"enhance":[31],"reliability":[33],"distributed":[35],"systems":[36],"in":[37,164,206],"presence":[39],"stragglers":[41],"adversarial":[43,92,118,134,162,170],"servers.":[44],"In":[45],"this":[46,95],"paper,":[47],"we":[48,82,101,154],"lay":[49],"foundation":[51],"General":[53],"Coded":[54],"Computing,":[55],"a":[56,72,105,138,178,200],"reliable":[57,184],"highly":[59],"efficient":[60],"framework":[63],"that":[64,103,156],"extends":[65],"applicability":[67],"broad":[73],"class":[74],"computations":[76],"under":[77,146],"minimal":[78,147],"structural":[79],"assumptions.":[80],"Additionally,":[81],"address,":[83],"first":[86],"time,":[87],"challenging":[89],"problem":[90],"servers":[93,116,171],"within":[94],"setting.":[96],"Under":[97],"proposed":[99,158,197],"scheme,":[100],"show":[102],"system":[106],"with":[107],"<tex":[108,113,121,143],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[109,114,122,144],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[110],"servers,":[111],"where":[112],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathcal{O}\\left(N^{a}\\right)$</tex>":[115],"some":[120],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$a":[123],"\\in[0,1)$</tex>,":[124],"supremum":[126],"average":[129],"computation":[130],"error":[131],"across":[132,199],"all":[133],"strategies":[135],"decays":[136],"at":[137,141],"rate":[139],"least":[142],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N^{\\frac{6}{5}}(a-1)$</tex>,":[145],"assumptions":[148],"on":[149],"tasks.":[152],"Moreover,":[153],"demonstrate":[155],"scheme":[159],"achieves":[160],"optimal":[161],"robustness":[163],"terms":[165],"maximum":[167],"number":[168],"it":[172],"can":[173],"tolerate.":[174],"This":[175],"development":[176],"marks":[177],"significant":[179],"step":[180],"toward":[181],"practical":[182],"general":[188],"computation.":[189],"Experimental":[190],"results":[191],"validate":[192],"effectiveness":[194],"method":[198],"variety":[201],"including":[204],"inference":[205],"deep":[207],"neural":[208],"networks.":[209]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}