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: "optimal mds codes for cooperative repair"
  Abstract: Two widely studied models of multiple-node repair in distributed storage systems are centralized repair and cooperative repair. The centralized model assumes that all the failed nodes are recreated in one location, while the cooperative one stipulates that the failed nodes may communicate but are distinct, and the amount of data exchanged between them is included in the repair bandwidth. We present two families of $(n,k)$ MDS codes with optimal cooperative repair. Codes in the first family support optimal repair of any two erasures from any $d$ helper nodes for any given $k\le d\le n-2.$ Codes in the second family support optimal repair of any $h$ failed nodes, $2\le h\le n-k-1,$ from any $k+1$ helper nodes.

Connected through hyperedge HE-1 (induced by source paper "centralized multi node repair regenerating codes"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "repairing reed solomon codes with two erasures"
    - "repairing multiple failures for scalar mds codes"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"
    - "broadcast repair for wireless distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "repairing multiple failures for scalar mds codes"):
  with members:
    - "on the i o costs of some repair schemes for full length reed solomon codes"
    - "centralized multi node repair regenerating codes"
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "repairing reed solomon codes with two erasures"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "repairing reed solomon codes with multiple erasures"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"

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)