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: "explicit mds codes for optimal repair bandwidth"
  Abstract: MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of#R##N#redundancy or parity symbols. If an MDS code has r parities and no more than r erasures occur, then by transmitting#R##N#all the remaining data in the code, the original information can be recovered. However, it was shown that in order#R##N#to recover a single symbol erasure, only a fraction of 1/r of the information needs to be transmitted. This fraction#R##N#is called the repair bandwidth (fraction). Explicit code constructions were given in previous works. If we view each#R##N#symbol in the code as a vector or a column over some field, then the code forms a 2D array and such codes are#R##N#especially widely used in storage systems. In this paper, we address the following question: given the length of the#R##N#column l, number of parities r, can we construct high-rate MDS array codes with optimal repair bandwidth of 1/r,#R##N#whose code length is as long as possible? In this paper, we give code constructions such that the code length is#R##N#(r +1) log_r l.

Connected through hyperedge HE-1 (induced by source paper "improved schemes for asymptotically optimal repair of mds codes"):
  with members:
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "repairing reed solomon codes with two erasures"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "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"
    - "general sub packetized access optimal regenerating codes"

Connected through hyperedge HE-2 (induced by source paper "explicit constructions of optimal access mds codes with nearly optimal sub packetization"):
  with members:
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "when can helper node selection improve regenerating codes part ii an explicit exact repair code construction"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "when can helper node selection improve regenerating codes part i graph based analysis"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "a high rate msr code with polynomial sub packetization level"

Connected through hyperedge HE-3 (induced by source paper "explicit constructions of high rate mds array codes with optimal repair bandwidth"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "optimal rebuilding of multiple erasures in mds codes"
    - "constructions of high rate msr codes over small fields"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "regenerating codes for errors and erasures in distributed 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)