{"id":"https://openalex.org/W2730158636","doi":"https://doi.org/10.1109/isit.2017.8007042","title":"Storage capacity as an information-theoretic analogue of vertex cover","display_name":"Storage capacity as an information-theoretic analogue of vertex cover","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2730158636","doi":"https://doi.org/10.1109/isit.2017.8007042","mag":"2730158636"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8007042","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1706.09197","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051046818","display_name":"Arya Mazumdar","orcid":"https://orcid.org/0000-0003-4605-7996"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arya Mazumdar","raw_affiliation_strings":["College of Information and Computer Sciences, University of Massachusetts, Amherst","[College of Information and Computer Sciences, University of Massachusetts Amherst]"],"affiliations":[{"raw_affiliation_string":"College of Information and Computer Sciences, University of Massachusetts, Amherst","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"[College of Information and Computer Sciences, University of Massachusetts Amherst]","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101979548","display_name":"Andrew McGregor","orcid":"https://orcid.org/0000-0002-2124-160X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew McGregor","raw_affiliation_strings":["College of Information and Computer Sciences, University of Massachusetts, Amherst","[College of Information and Computer Sciences, University of Massachusetts Amherst]"],"affiliations":[{"raw_affiliation_string":"College of Information and Computer Sciences, University of Massachusetts, Amherst","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"[College of Information and Computer Sciences, University of Massachusetts Amherst]","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041251603","display_name":"Sofya Vorotnikova","orcid":"https://orcid.org/0000-0002-3035-1122"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sofya Vorotnikova","raw_affiliation_strings":["College of Information and Computer Sciences, University of Massachusetts, Amherst","[College of Information and Computer Sciences, University of Massachusetts Amherst]"],"affiliations":[{"raw_affiliation_string":"College of Information and Computer Sciences, University of Massachusetts, Amherst","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"[College of Information and Computer Sciences, University of Massachusetts Amherst]","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051046818"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.2072,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55049267,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2810","last_page":"2814"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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/T11478","display_name":"Caching and Content Delivery","score":0.9941999912261963,"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/T11342","display_name":"Carbon and Quantum Dots Applications","score":0.9743000268936157,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8176517486572266},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5442637801170349},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.532416820526123},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5165807008743286},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.49904394149780273},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4775034785270691},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4661822021007538},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4289756417274475},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4229070246219635},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.38630416989326477},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.352802574634552},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2916065454483032}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8176517486572266},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5442637801170349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.532416820526123},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5165807008743286},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.49904394149780273},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4775034785270691},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4661822021007538},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4289756417274475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4229070246219635},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.38630416989326477},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.352802574634552},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2916065454483032},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2017.8007042","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"mag:2730158636","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1706.09197","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:2730158636","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1706.09197","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W143489896","https://openalex.org/W1566410171","https://openalex.org/W1656795039","https://openalex.org/W1902486902","https://openalex.org/W1993830711","https://openalex.org/W2000419386","https://openalex.org/W2081008934","https://openalex.org/W2119336214","https://openalex.org/W2130507035","https://openalex.org/W2137118456","https://openalex.org/W2147634561","https://openalex.org/W2156760067","https://openalex.org/W2164684058","https://openalex.org/W2262362834","https://openalex.org/W6637158907","https://openalex.org/W6679863563"],"related_works":["https://openalex.org/W2888234005","https://openalex.org/W2964160654","https://openalex.org/W1521302999","https://openalex.org/W2965904208","https://openalex.org/W1862378619","https://openalex.org/W2914071196","https://openalex.org/W894376071","https://openalex.org/W2081449822","https://openalex.org/W1560183925","https://openalex.org/W1772739528","https://openalex.org/W2133304595","https://openalex.org/W2885321421","https://openalex.org/W2261198898","https://openalex.org/W2963857389","https://openalex.org/W2083522899","https://openalex.org/W2796243516","https://openalex.org/W2942135920","https://openalex.org/W2104835758","https://openalex.org/W2062135503","https://openalex.org/W2942388931"],"abstract_inverted_index":{"Motivated":[0],"by":[1,112,119],"applications":[2],"in":[3,58,203,255,278],"distributed":[4,256],"storage,":[5],"the":[6,17,27,34,43,47,51,94,142,149,179,200,206,221,245,274],"storage":[7,52,86,107,143,201,225,246],"capacity":[8,53,87,108,144,202,226,247,269],"of":[9,20,29,93,98,158,178,194,205,208,211,224,230,276],"a":[10,30,55,89,99,127,134,155,191,209,279],"graph":[11,31],"was":[12,104,183],"recently":[13],"defined":[14],"to":[15,66,148,197,220,249],"be":[16,24,40],"maximum":[18],"amount":[19],"information":[21,35,44,76],"that":[22,33,106,118,270],"can":[23,39,125],"stored":[25,45],"across":[26],"vertices":[28],"such":[32,70,123,232],"at":[36,46],"any":[37],"vertex":[38,96,114,212],"recovered":[41],"from":[42,252],"neighboring":[48],"vertices.":[49],"Computing":[50],"is":[54,62,109,145,216],"fundamental":[56],"problem":[57],"network":[59],"coding":[60,73,151,160,181],"and":[61,77,133,165,218,237,262],"related,":[63],"or":[64],"equivalent,":[65],"some":[67],"well-studied":[68],"problems":[69],"as":[71,88,122,233],"index":[72,150,159,180],"with":[74,235,273],"side":[75],"generalized":[78],"guessing":[79],"games.":[80],"In":[81],"this":[82,266],"paper,":[83],"we":[84,116,124,153,243],"consider":[85],"natural":[90],"information-theoretic":[91],"analogue":[92],"minimum":[95,113],"cover":[97],"graph.":[100],"Indeed,":[101],"while":[102],"it":[103,121],"known":[105,184],"upper":[110,198,261],"bounded":[111],"cover,":[115],"show":[117,259],"treating":[120],"get":[126,154],"3/2":[128,166],"approximation":[129,136,157,167,177],"for":[130,137,162,168,185,227],"planar":[131,139,163,170,186],"graphs,":[132,231],"4/3":[135],"triangle-free":[138,169],"graphs.":[140,171,187,241],"Since":[141],"closely":[146],"related":[147],"rate,":[152],"1.923":[156],"rate":[161,182],"graphs":[164],"Previously":[172],"only":[173],"an":[174],"obvious":[175],"4":[176],"We":[188,258],"then":[189],"develop":[190],"general":[192],"method":[193,215],"\u201cgadget":[195],"covering\u201d":[196],"bound":[199],"terms":[204],"average":[207],"set":[210],"covers.":[213],"This":[214],"intuitive":[217],"leads":[219],"exact":[222],"characterization":[223],"various":[228],"families":[229],"cycles":[234],"chords":[236],"certain":[238],"Cartesian":[239],"product":[240],"Finally,":[242],"generalize":[244],"notion":[248],"include":[250],"recovery":[251,268],"partial":[253,267],"failures":[254],"storage.":[257],"tight":[260],"lower":[263],"bounds":[264],"on":[265],"scales":[271],"nicely":[272],"fraction":[275],"failure":[277],"vertex.":[280]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}