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: "repair locality from a combinatorial perspective"
  Abstract: Repair locality is a desirable property for erasure codes in distributed storage systems. Recently, different structures of local repair groups have been proposed in the definitions of repair locality. In this paper, the concept of regenerating set is introduced to characterize the local repair groups. A definition of locality $r^{(\delta -1)}$ (i.e., locality $r$ with repair tolerance $\delta -1$) under the most general structure of regenerating sets is given. All previously studied locality turns out to be special cases of this definition. Furthermore, three representative concepts of locality proposed before are reinvestigated under the framework of regenerating sets, and their respective upper bounds on the minimum distance are reproved in a uniform and brief form. Additionally, a more precise distance bound is derived for the square code which is a class of linear codes with locality $r^{(2)}$ and high information rate, and an explicit code construction attaining the optimal distance bound is obtained.

Connected through 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"):
  with members:
    - "on minimum distance of locally repairable codes"
    - "binary codes with locality for multiple erasures having short block length"
    - "binary codes with locality for four erasures"
    - "codes with hierarchical locality"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "an upper bound on the minimum distance of ldpc codes over gf q"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-2 (induced by source paper "linear programming bounds for distributed storage codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-3 (induced by source paper "locally repairable codes with multiple r_ i delta_ i localities"):
  with members:
    - "on the weight hierarchy of locally repairable codes"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "constructions and properties of linear locally repairable codes"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable linear codes"
    - "optimal locally repairable codes via rank metric codes"

Connected through hyperedge HE-4 (induced by source paper "irregular recovery and unequal locality for locally recoverable codes with availability"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "bounds and constructions of locally repairable codes parity check matrix approach"
    - "codes with unequal locality"
    - "achieving arbitrary locality and availability in binary codes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-5 (induced by source paper "on the weight hierarchy of locally repairable codes"):
  with members:
    - "on optimal ternary locally repairable codes"
    - "bounds and constructions of locally repairable codes parity check matrix approach"
    - "cyclic lrc codes and their subfield subcodes"
    - "weight enumerators and higher support weights of maximally recoverable codes"
    - "locally recoverable codes on algebraic curves"
    - "codes with locality for two erasures"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-6 (induced by source paper "bounds and constructions of locally repairable codes parity check matrix approach"):
  with members:
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "constructions and properties of linear locally repairable codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "cyclic lrc codes and their subfield subcodes"
    - "achieving arbitrary locality and availability in binary codes"
    - "binary linear locally repairable codes"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-7 (induced by source paper "a bound on rate of codes with locality with sequential recovery from multiple erasures"):
  with members:
    - "binary codes with locality for multiple erasures having short block length"
    - "on sequential locally repairable codes"
    - "binary codes with locality for four erasures"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "some improvements on locally repairable codes"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "binary linear locally repairable codes"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-8 (induced by source paper "binary codes with locality for multiple erasures having short block length"):
  with members:
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "some improvements on locally repairable codes"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "binary linear locally repairable codes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"

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)