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: "a systematic construction of mds codes with small sub packetization level and near optimal repair bandwidth"
  Abstract: In the literature, all the known high-rate MDS codes with the optimal repair bandwidth possess a significantly large sub-packetization level, which may prevent the codes to be implemented in practical systems. To build MDS codes with small sub-packetization level, existing constructions and theoretical bounds imply that one may sacrifice the optimality of the repair bandwidth. Partly motivated by the work of Tamo et al. (IEEE Trans. Inform. Theory, 59(3), 1597-1616, 2013), in this paper, we present a powerful transformation that can greatly reduce the sub-packetization level of any MDS codes with respect to the same code length n. As applications of the transformation, four high-rate MDS codes having both small sub-packetization level and near optimal repair bandwidth can be obtained, where two of them are also explicit and the required field sizes are comparable to the code length n. Additionally, we propose another explicit MDS code that have small sub-packetization level, near optimal repair bandwidth, and the optimal update property. The required field size is also comparable to the code length n.

Connected through hyperedge HE-1 (induced by source paper "a tradeoff between the sub packetization size and the repair bandwidth for reed solomon codes"):
  with members:
    - "on the achievability region of regenerating codes for multiple erasures"
    - "improved schemes for asymptotically optimal repair of mds 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"
    - "optimal repair schemes for some families of full length reed solomon codes"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "repairing reed solomon codes with multiple 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)