human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "linear time erasure list decoding of expander codes"):
  Abstract: We give a linear-time erasure list-decoding algorithm for expander codes. More precisely, let $r > 0$ be any integer. Given an inner code $C_0$ of length $d$, and a $d$-regular bipartite expander graph $G$ with $n$ vertices on each side, we give an algorithm to list-decode the expander code $C = C(G, C_0)$ of length $nd$ from approximately $\delta \delta_r nd$ erasures in time $n \cdot \mathrm{poly}(d2^r / \delta)$, where $\delta$ and $\delta_r$ are the relative distance and the $r$'th generalized relative distance of $C_0$, respectively. To the best of our knowledge, this is the first linear-time algorithm that can list-decode expander codes from erasures beyond their (designed) distance of approximately $\delta^2 nd$. #R##N#To obtain our results, we show that an approach similar to that of (Hemenway and Wootters, Information and Computation, 2018) can be used to obtain such an erasure-list-decoding algorithm with an exponentially worse dependence of the running time on $r$ and $\delta$; then we show how to improve the dependence of the running time on these parameters.

Includes members:
  Member "ldpc codes achieve list decoding capacity":
    also connected through other hyperedges:
      (none)
  Member "improved decoding of folded reed solomon and multiplicity codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ldpc codes achieve list decoding capacity")
  Member "local list recovery of high rate tensor codes and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on taking advantage of multiple requests in error correcting codes")
  Member "linear time list recovery of high rate expander codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on list decoding of insertion and deletion errors")
  Member "deletion codes in the high noise and high rate regimes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "locally decodable codes with randomized encoding")
  Member "erasure list decodable codes from random and algebraic geometry codes":
    also connected through other hyperedges:
      (none)
  Member "local correctability of expander codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lifted multiplicity codes and the disjoint repair group property")
  Member "folded codes from function field towers and improved optimal rate list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ldpc codes achieve list decoding capacity")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)