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: "rebuilding for array codes in distributed storage systems"
  Abstract: In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node in a distributed storage system that uses an EVENODD code. EVENODD codes are maximum distance separable (MDS) array codes that are used to protect against erasures, and only require XOR operations for encoding and decoding. We show that when there are two redundancy nodes, to rebuild one erased systematic node, only 3/4 of the information needs to be transmitted. Interestingly, in many cases, the required disk I/O is also minimized.

Connected through hyperedge HE-1 (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"
    - "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
    - "repair optimal mds array codes over gf 2"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-2 (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"
    - "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
    - "xoring elephants novel erasure codes for big data"
    - "repair optimal mds array codes over gf 2"

Connected through hyperedge HE-3 (induced by source paper "mds code constructions with small sub packetization and near optimal repair bandwidth"):
  with members:
    - "optimal repair of reed solomon codes achieving the cut set bound"
    - "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"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"

Connected through hyperedge HE-4 (induced by source paper "new mds codes with small sub packetization and near optimal repair bandwidth"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"
    - "repairing reed solomon codes"
    - "optimal locally repairable and secure codes for distributed storage systems"

Connected through hyperedge HE-5 (induced by source paper "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"):
  with members:
    - "repair optimal mds array codes over gf 2"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"

Connected through hyperedge HE-6 (induced by source paper "a piggybacking design framework for read and download efficient distributed storage codes"):
  with members:
    - "a high rate msr code with polynomial sub packetization level"
    - "repairing reed solomon codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "a family of optimal locally recoverable codes"
    - "update efficient regenerating codes with minimum per node storage"
    - "repair optimal mds array codes over gf 2"
    - "quasi cyclic flexible regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "core augmenting regenerating coding based recovery for single and concurrent failures in distributed storage systems"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "regenerating codes a system perspective"
    - "the core storage primitive cross object redundancy for efficient data repair access in erasure coded storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "simple regenerating codes network coding for cloud storage"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "exact minimum repair bandwidth cooperative regenerating codes for distributed storage systems"
    - "cooperative regenerating codes for distributed storage systems"

Connected through hyperedge HE-8 (induced by source paper "zigzag codes mds array codes with optimal rebuilding"):
  with members:
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "repair optimal erasure codes through hadamard designs"
    - "enabling node repair in any erasure code for distributed storage"
    - "on the existence of optimal exact repair mds codes for distributed storage"
    - "explicit codes minimizing repair bandwidth for distributed storage"
    - "explicit construction of optimal exact regenerating codes for 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)