human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "stair codes a general family of erasure codes for tolerating device and sector failures"
  Abstract: Practical storage systems often adopt erasure codes to tolerate device failures and sector failures, both of which are prevalent in the field. However, traditional erasure codes employ device-level redundancy to protect against sector failures, and hence incur significant space overhead. Recent sector-disk (SD) codes are available only for limited configurations. By making a relaxed but practical assumption, we construct a general family of erasure codes called \emph{STAIR codes}, which efficiently and provably tolerate both device and sector failures without any restriction on the size of a storage array and the numbers of tolerable device failures and sector failures. We propose the \emph{upstairs encoding} and \emph{downstairs encoding} methods, which provide complementary performance advantages for different configurations. We conduct extensive experiments on STAIR codes in terms of space saving, encoding/decoding speed, and update cost. We demonstrate that STAIR codes not only improve space efficiency over traditional erasure codes, but also provide better computational efficiency than SD codes based on our special code construction. Finally, we present analytical models that characterize the reliability of STAIR codes, and show that the support of a wider range of configurations by STAIR codes is critical for tolerating sector failure bursts discovered in the field.

Connected through hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes"):
  with members:
    - "array codes with local properties"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "on optimal locally repairable codes with super linear length"
    - "explicit optimal length locally repairable codes of distance 5"
    - "locality and availability of array codes constructed from subspaces"
    - "optimal locally repairable codes via elliptic curves"

Connected through hyperedge HE-2 (induced by source paper "babel storage uncoordinated content delivery from multiple coded storage systems"):
  with members:
    - "mds coded distributed caching for low delay wireless content delivery"
    - "liquid cloud storage"
    - "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead"
    - "capacity bounds for distributed storage"
    - "cache aided interference channels"
    - "xoring elephants novel erasure codes for big data"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "locally repairable codes"

Connected through hyperedge HE-3 (induced by source paper "extended integrated interleaved codes over any field with applications to locally recoverable codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "erasure coding for distributed storage an overview"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "bounds and constructions for linear locally repairable codes over binary fields"
    - "optimal binary linear locally repairable codes with disjoint repair groups"
    - "extended product and integrated interleaved codes"

Connected through hyperedge HE-4 (induced by source paper "on partial maximally recoverable and maximally recoverable codes"):
  with members:
    - "codes with locality for two erasures"
    - "a family of optimal locally recoverable codes"
    - "construction of partial mds pmds and sector disk sd codes with two global parity symbols"
    - "explicit maximally recoverable codes with locality"
    - "construction of pmds and sd codes extending raid 5"
    - "construction of two sd codes"
    - "partial mds codes and their application to raid type of architectures"
    - "locally repairable codes"

Connected through hyperedge HE-5 (induced by source paper "weight enumerators and higher support weights of maximally recoverable codes"):
  with members:
    - "on partial maximally recoverable and maximally recoverable codes"
    - "codes with locality for two erasures"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols in non linear codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "partial mds codes and their application to raid type of architectures"

Question: Please tell me which class the center node 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)