{"id":"https://openalex.org/W3196805318","doi":"https://doi.org/10.1109/isit45174.2021.9517818","title":"Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching","display_name":"Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3196805318","doi":"https://doi.org/10.1109/isit45174.2021.9517818","mag":"3196805318"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9517818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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/A5046058485","display_name":"Vijith Kumar K P","orcid":null},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vijith Kumar K P","raw_affiliation_strings":["IIT,Department of EEE,Guwahati,INDIA","Department of EEE, IIT, Guwahati, INDIA"],"affiliations":[{"raw_affiliation_string":"IIT,Department of EEE,Guwahati,INDIA","institution_ids":["https://openalex.org/I1317621060"]},{"raw_affiliation_string":"Department of EEE, IIT, Guwahati, INDIA","institution_ids":["https://openalex.org/I1317621060"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031492698","display_name":"Brijesh Kumar","orcid":"https://orcid.org/0000-0001-9719-956X"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Brijesh Kumar Rai","raw_affiliation_strings":["IIT,Department of EEE,Guwahati,INDIA","Department of EEE, IIT, Guwahati, INDIA"],"affiliations":[{"raw_affiliation_string":"IIT,Department of EEE,Guwahati,INDIA","institution_ids":["https://openalex.org/I1317621060"]},{"raw_affiliation_string":"Department of EEE, IIT, Guwahati, INDIA","institution_ids":["https://openalex.org/I1317621060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044945535","display_name":"Tony Jacob","orcid":"https://orcid.org/0000-0003-3180-3212"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tony Jacob","raw_affiliation_strings":["IIT,Department of EEE,Guwahati,INDIA","Department of EEE, IIT, Guwahati, INDIA"],"affiliations":[{"raw_affiliation_string":"IIT,Department of EEE,Guwahati,INDIA","institution_ids":["https://openalex.org/I1317621060"]},{"raw_affiliation_string":"Department of EEE, IIT, Guwahati, INDIA","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046058485"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.148466,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2537","last_page":"2541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":1.0,"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.9943000078201294,"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/T12288","display_name":"Optimization and Search Problems","score":0.9919000267982483,"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/pareto-principle","display_name":"Pareto principle","score":0.8134583234786987},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.7018004655838013},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6691336631774902},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.6111215949058533},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5992428660392761},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5676431059837341},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5562618970870972},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4397753179073334},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.2722410559654236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2706904709339142},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.235472172498703},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.17880460619926453}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.8134583234786987},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.7018004655838013},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6691336631774902},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.6111215949058533},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5992428660392761},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5676431059837341},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5562618970870972},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4397753179073334},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.2722410559654236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2706904709339142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.235472172498703},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17880460619926453},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit45174.2021.9517818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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":14,"referenced_works":["https://openalex.org/W2106248279","https://openalex.org/W2482095914","https://openalex.org/W2527594325","https://openalex.org/W2547052808","https://openalex.org/W2799278985","https://openalex.org/W2889585362","https://openalex.org/W2945973722","https://openalex.org/W2952955989","https://openalex.org/W2963594337","https://openalex.org/W2975933913","https://openalex.org/W2976568847","https://openalex.org/W3082381348","https://openalex.org/W3103610239","https://openalex.org/W3106164725"],"related_works":["https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W1963790170","https://openalex.org/W2586328217","https://openalex.org/W3125131255","https://openalex.org/W2049264236","https://openalex.org/W2009156627","https://openalex.org/W2728870795","https://openalex.org/W2102258838","https://openalex.org/W317165722"],"abstract_inverted_index":{"The":[0,19],"problem":[1,20,26,89],"of":[2,36,90,102,124],"coded":[3,82,125],"caching":[4,126],"was":[5,62],"introduced":[6,57,87],"by":[7],"Maddah-Ali":[8],"and":[9,11,38,86,110],"Niesen":[10],"has":[12],"been":[13],"extensively":[14],"studied":[15],"in":[16],"recent":[17],"years.":[18],"is":[21,35,41,52,84],"fundamentally":[22],"a":[23,42],"multi-objective":[24],"optimization":[25],"where":[27],"the":[28,46,49,58,88,100,107,120,146],"rates":[29],"achieved":[30],"for":[31,67,127],"each":[32],"demand":[33,69,150],"type":[34],"interest":[37],"Pareto":[39,92,121],"optimality":[40],"natural":[43],"framework.":[44],"Under":[45],"constraint":[47],"that":[48,75,105,114],"placement":[50,83],"phase":[51],"uncoded,":[53],"Yu":[54],"et":[55,72],"al.":[56,73],"YMA":[59,108],"scheme":[60,109],"which":[61,143],"shown":[63],"to":[64,117],"be":[65],"universal":[66,79],"all":[68],"types.":[70,151],"Vijith":[71],"showed":[74],"there":[76],"are":[77],"no":[78],"schemes":[80,104],"when":[81,132],"permitted":[85],"finding":[91,103],"optimal":[93,122],"schemes.":[94],"In":[95],"this":[96],"paper":[97],"we":[98],"study":[99],"possibility":[101],"dominate":[106],"demonstrate,":[111],"rather":[112],"surprisingly,":[113],"they":[115],"continue":[116],"operate":[118],"at":[119],"frontier":[123],"(N,":[128],"K)":[129],"cache":[130],"networks":[131],"<tex":[133],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[134],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$K$</tex>":[135],"\u2264":[136],"3.":[137],"We":[138],"introduce":[139],"new":[140],"lower":[141],"bounds":[142],"partially":[144],"characterize":[145],"tradeoffs":[147],"between":[148],"different":[149]},"counts_by_year":[],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}