{"id":"https://openalex.org/W4289713107","doi":"https://doi.org/10.1109/isit50566.2022.9834902","title":"Graph-based codes for hierarchical recovery","display_name":"Graph-based codes for hierarchical recovery","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289713107","doi":"https://doi.org/10.1109/isit50566.2022.9834902"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834902","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834902","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5012036098","display_name":"Allison Beemer","orcid":"https://orcid.org/0000-0002-1759-5026"},"institutions":[{"id":"https://openalex.org/I124727415","display_name":"University of Wisconsin\u2013Eau Claire","ror":"https://ror.org/03mnm0t94","country_code":"US","type":"education","lineage":["https://openalex.org/I124727415"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Allison Beemer","raw_affiliation_strings":["University of Wisconsin-Eau Claire,Dept. of Mathematics,Eau Claire,WI,U.S.A","Dept. of Mathematics, University of Wisconsin-Eau Claire, Eau Claire, WI, U.S.A"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Eau Claire,Dept. of Mathematics,Eau Claire,WI,U.S.A","institution_ids":["https://openalex.org/I124727415"]},{"raw_affiliation_string":"Dept. of Mathematics, University of Wisconsin-Eau Claire, Eau Claire, WI, U.S.A","institution_ids":["https://openalex.org/I124727415"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022933628","display_name":"Rutuja Kshirsagar","orcid":null},"institutions":[{"id":"https://openalex.org/I4210111877","display_name":"Zapata (United States)","ror":"https://ror.org/01bhrtv82","country_code":"US","type":"company","lineage":["https://openalex.org/I4210111877"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rutuja Kshirsagar","raw_affiliation_strings":["Zapata Computing, Inc,Boston,MA,U.S.A","Zapata Computing, Inc, Boston, MA, U.S.A"],"affiliations":[{"raw_affiliation_string":"Zapata Computing, Inc,Boston,MA,U.S.A","institution_ids":["https://openalex.org/I4210111877"]},{"raw_affiliation_string":"Zapata Computing, Inc, Boston, MA, U.S.A","institution_ids":["https://openalex.org/I4210111877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084201022","display_name":"Gretchen L. Matthews","orcid":"https://orcid.org/0000-0002-8977-8171"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gretchen L. Matthews","raw_affiliation_strings":["Virginia Tech,Dept. of Mathematics,Blacksburg,VA,U.S.A","Dept. of Mathematics, Virginia Tech, Blacksburg, VA, U.S.A"],"affiliations":[{"raw_affiliation_string":"Virginia Tech,Dept. of Mathematics,Blacksburg,VA,U.S.A","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Dept. of Mathematics, Virginia Tech, Blacksburg, VA, U.S.A","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012036098"],"corresponding_institution_ids":["https://openalex.org/I124727415"],"apc_list":null,"apc_paid":null,"fwci":0.4324,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.46496107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1554","last_page":"1559"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9991999864578247,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9991999864578247,"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.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/T12029","display_name":"DNA and Biological Computing","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.8447617888450623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6904312968254089},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.637089192867279},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4573203921318054},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.42847371101379395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3271636366844177},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.31735169887542725},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.27151626348495483},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.26841259002685547},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21612057089805603},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13394367694854736}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.8447617888450623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6904312968254089},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.637089192867279},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4573203921318054},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.42847371101379395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3271636366844177},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31735169887542725},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.27151626348495483},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.26841259002685547},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21612057089805603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13394367694854736},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834902","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834902","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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":17,"referenced_works":["https://openalex.org/W1866030559","https://openalex.org/W1993830711","https://openalex.org/W2069554151","https://openalex.org/W2080339104","https://openalex.org/W2095882513","https://openalex.org/W2115104320","https://openalex.org/W2116815462","https://openalex.org/W2133068391","https://openalex.org/W2140227657","https://openalex.org/W2141572292","https://openalex.org/W2167943285","https://openalex.org/W2339524574","https://openalex.org/W2595628957","https://openalex.org/W2623918255","https://openalex.org/W2964317282","https://openalex.org/W2967056459","https://openalex.org/W2997603713"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W1556451512","https://openalex.org/W2052368793","https://openalex.org/W2352714217","https://openalex.org/W2086895107","https://openalex.org/W157919863","https://openalex.org/W2911439725","https://openalex.org/W2071304218"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,19,78,100],"consider":[4,79],"approaches":[5],"to":[6,10,34,59,105],"designing":[7],"Tanner":[8,22],"codes":[9,23,37],"protect":[11],"against":[12],"symbol":[13],"loss":[14],"from":[15,28],"multiple":[16,48],"erasures.":[17,98],"First,":[18],"note":[20],"that":[21,47,55],"inherit":[24],"locality":[25,40,84],"and":[26,41],"availability":[27],"their":[29],"inner":[30],"codes,":[31],"allowing":[32],"one":[33],"design":[35],"longer":[36],"with":[38],"specified":[39],"availability.":[42],"Availability":[43],"is":[44],"desirable":[45],"in":[46],"disjoint":[49],"repair":[50,60,72,114],"groups":[51,73],"increase":[52],"the":[53,71,90,95,112],"likelihood":[54],"symbols":[56],"are":[57],"available":[58],"erased":[61],"ones.":[62],"Even":[63],"so,":[64],"particular":[65],"patterns":[66],"of":[67,97],"erasures":[68],"well-distributed":[69],"across":[70],"may":[74],"prevent":[75],"recovery.":[76],"Hence,":[77],"an":[80],"alternative":[81],"using":[82],"hierarchical":[83,102],"which":[85],"implements":[86],"tiered":[87],"recovery,":[88],"where":[89],"tier":[91],"utilized":[92],"depends":[93],"on":[94],"number":[96],"Finally,":[99],"define":[101],"stopping":[103],"sets":[104],"characterize":[106],"local":[107],"message-passing":[108],"decoder":[109],"failure":[110],"at":[111],"various":[113],"levels.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}