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: "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
  Abstract: As storage systems grow in size, device failures happen more frequently than ever before. Given the commodity nature of hard drives employed, a storage system needs to tolerate a certain number of disk failures while maintaining data integrity, and to recover lost data with minimal interference to normal disk I/O operations. RAID-6, which can tolerate up to two disk failures with the minimum redundancy, is becoming widespread. However, traditional RAID-6 codes suffer from high disk I/O overhead during recovery. In this paper, we propose a new family of RAID-6 codes, the Minimum Disk I/O Repairable (MDR) codes, which achieve the optimal disk I/O overhead for single failure recoveries. Moreover, we show that MDR codes can be encoded with the minimum number of bit-wise XOR operations. Simulation results show that MDR codes help to save about half of disk read operations than traditional RAID-6 codes, and thus can reduce the recovery time by up to 40%.

Connected through hyperedge HE-1 (induced by source paper "a generic transformation to enable optimal repair in mds codes for distributed storage systems"):
  with members:
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "minimum storage regenerating codes for all parameters"
    - "enabling all node repair in minimum storage regenerating codes"
    - "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"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"
    - "optimal exact repair strategy for the parity nodes of the k 2 k zigzag code"

Connected through hyperedge HE-2 (induced by source paper "code constructions for distributed storage with low repair bandwidth and low repair complexity"):
  with members:
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "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 optimal access mds codes with nearly optimal sub packetization"
    - "a family of erasure correcting codes with low repair bandwidth and low repair complexity"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-3 (induced by source paper "a new design of binary mds array codes with asymptotically weak optimal repair"):
  with members:
    - "minimum storage regenerating codes for all parameters"
    - "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"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "repair optimal mds array codes over gf 2"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a piggybacking design framework for read and download efficient distributed storage codes"

Connected through hyperedge HE-4 (induced by source paper "binary mds array codes with optimal repair"):
  with members:
    - "a unified form of evenodd and rdp codes and their efficient decoding"
    - "a new design of binary mds array codes with asymptotically weak optimal repair"
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "xoring elephants novel erasure codes for big data"
    - "repair optimal mds array codes over gf 2"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-5 (induced by source paper "a novel construction of low complexity mds codes with optimal repair capability for distributed storage systems"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "a construction of systematic mds codes with minimum repair bandwidth"
    - "repair optimal erasure codes through hadamard designs"

Connected through hyperedge HE-6 (induced by source paper "coded caching with distributed storage"):
  with members:
    - "reduced transmission in multi server coded caching"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "coded caching in a multi server system with random topology"
    - "structural characteristics of two sender index coding"
    - "caching and delivery via interference elimination"
    - "caching aided coded multicasting with multiple random requests"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "effect of number of users in multi level coded caching"

Connected through hyperedge HE-7 (induced by source paper "optimal exact repair strategy for the parity nodes of the k 2 k zigzag code"):
  with members:
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "repair optimal erasure codes through hadamard designs"
    - "on codes for optimal rebuilding access"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-8 (induced by source paper "a family of erasure correcting codes with low repair bandwidth and low repair complexity"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a piggybacking design framework for read and download efficient distributed storage codes"
    - "locally repairable codes"

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)