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: "on locality in distributed storage systems"
  Abstract: This paper studies the design of codes for distributed storage systems (DSS) that enable local repair in the event of node failure. This paper presents locally repairable codes based on low degree multivariate polynomials. Its code construction mechanism extends work on Noisy Interpolating Set by Dvir et al. \cite{dvir2011}. The paper presents two classes of codes that allow node repair to be performed by contacting 2 and 3 surviving nodes respectively. It further shows that both classes are good in terms of their rate and minimum distance, and allow their rate to be bartered for greater flexibility in the repair process.

Connected through hyperedge HE-1 (induced by source paper "repairing generalized reed muller codes"):
  with members:
    - "locality and availability of array codes constructed from subspaces"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing reed solomon codes with multiple erasures"
    - "cooperative local repair in distributed storage"
    - "repairing reed solomon codes"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-2 (induced by source paper "binary linear locally repairable codes"):
  with members:
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "cyclic lrc codes and their subfield subcodes"
    - "repair locality with multiple erasure tolerance"
    - "repairable fountain codes"
    - "constructions of optimal and almost optimal locally repairable codes"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"

Connected through hyperedge HE-3 (induced by source paper "optimal linear and cyclic locally repairable codes over small fields"):
  with members:
    - "locality and availability in distributed storage"
    - "repair locality from a combinatorial perspective"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "erasure codes with simplex locality"
    - "optimal locally repairable codes via rank metric codes"
    - "locally repairable codes with multiple repair alternatives"
    - "an upper bound on the size of locally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "error correcting regenerating and locally repairable codes via rank metric codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "storage codes coding rate and repair locality"
    - "explicit mbr all symbol locality codes"
    - "regenerating codes for errors and erasures in distributed storage"
    - "codes with local regeneration"

Connected through hyperedge HE-5 (induced by source paper "optimal locally repairable codes and connections to matroid theory"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "on the combinatorics of locally repairable codes via matroid theory"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "update efficiency and local repairability limits for capacity approaching codes"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols in non linear codes"
    - "an upper bound on the size of locally recoverable codes"

Connected through hyperedge HE-6 (induced by source paper "optimal locally repairable codes via rank metric codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "storage codes coding rate and repair locality"
    - "codes with local regeneration"
    - "error resilience in distributed storage via rank metric codes"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"

Connected through hyperedge HE-7 (induced by source paper "storage codes coding rate and repair locality"):
  with members:
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "cooperative regenerating codes"
    - "simple regenerating codes network coding for cloud storage"
    - "self repairing codes for distributed storage a projective geometric construction"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "cooperative regenerating codes for distributed storage systems"

Connected through hyperedge HE-8 (induced by source paper "optimal locally repairable linear codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "optimal locally repairable codes and connections to matroid theory"
    - "codes with local regeneration"
    - "non homogeneous distributed storage systems"
    - "partial mds codes and their application to raid type of architectures"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "simple regenerating codes network coding for cloud storage"

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)