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 "repair locality with multiple erasure tolerance"):
  Abstract: In distributed storage systems, erasure codes with locality    \(r\)    are preferred because a coordinate can be locally repaired by accessing at most    \(r\)    other coordinates which in turn greatly reduces the disk I/O complexity for small    \(r\)   . However, the local repair may not be performed when some of the    \(r\)    coordinates are also erased. To overcome this problem, we propose the   \((r,\delta )_{c}\)   -locality providing    \(\delta -1\)    nonoverlapping local repair groups of size no more than    \(r\)    for a coordinate. Consequently, the repair locality    \(r\)    can tolerate    \(\delta -1\)    erasures in total. We derive an upper bound on the minimum distance for any linear    \([n,k]\)    code with information    \((r,\delta )_{c}\)   -locality. Then, we prove existence of the codes that attain this bound when    \(n\geq k(r(\delta -1)+1)\)   . Although the locality    \((r,\delta )\)    defined by Prakash  et al.  provides the same level of locality and local repair tolerance as our definition, codes with    \((r,\delta )_{c}\)   -locality attaining the bound are proved to have more advantage in the minimum distance. In particular, we construct a class of codes with all symbol    \((r,\delta )_{c}\)   -locality where the gain in minimum distance is    \(\Omega (\sqrt {r})\)    and the information rate is close to 1.

Includes members:
  Member "repair locality from a combinatorial perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal locally repairable linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal locally repairable codes via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "locally repairable codes with multiple repair alternatives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "array codes for functional pir and batch codes")
  Member "storage codes coding rate and repair locality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locality and availability of array codes constructed from subspaces")
  Member "explicit mbr all symbol locality codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  Member "optimal locally repairable codes and connections to matroid theory":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")

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)