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: "on the existence of optimal exact repair mds codes for distributed storage"
  Abstract: The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. In this paper, we address bandwidth-optimal (n,k,d) Exact-Repair MDS codes, which allow

Connected through hyperedge HE-1 (induced by source paper "cascade codes for distributed storage systems"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "determinant codes with helper independent repair for single and multiple failures"
    - "a class of msr codes for clustered distributed storage"
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "capacity of clustered distributed storage"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"

Connected through hyperedge HE-2 (induced by source paper "efficiently repairing algebraic geometry codes"):
  with members:
    - "repairing reed solomon codes"
    - "a family of optimal locally recoverable codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "exact regenerating codes for byzantine fault tolerance in distributed storage"
    - "optimal repair of mds codes in distributed storage via subspace interference alignment"

Connected through hyperedge HE-3 (induced by source paper "repairing reed solomon codes"):
  with members:
    - "repairing reed solomon codes with two erasures"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"
    - "communication efficient secret sharing"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "update efficient regenerating codes with minimum per node storage"

Connected through hyperedge HE-4 (induced by source paper "a probabilistic approach towards exact repair regeneration codes"):
  with members:
    - "shortened regenerating codes"
    - "a note on the rate region of exact repair regenerating codes"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "new codes and inner bounds for exact repair in distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "rate region of the 4 3 3 exact repair regenerating codes"

Connected through hyperedge HE-5 (induced by source paper "when and by how much can helper node selection improve regenerating codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "explicit mbr all symbol locality codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "codes with local regeneration"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "cooperative regenerating codes"

Connected through hyperedge HE-6 (induced by source paper "codes between mbr and msr points with exact repair property"):
  with members:
    - "exact regenerating codes between mbr and msr points"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "rate region of the 4 3 3 exact repair regenerating codes"
    - "capacity and security of heterogeneous distributed storage systems"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "codes with local regeneration"

Connected through hyperedge HE-7 (induced by source paper "explicit mds codes for optimal repair bandwidth"):
  with members:
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "access vs bandwidth in codes for storage"
    - "mds array codes with optimal rebuilding"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

Connected through hyperedge HE-8 (induced by source paper "fast product matrix regenerating codes"):
  with members:
    - "core augmenting regenerating coding based recovery for single and concurrent failures in distributed storage systems"
    - "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"
    - "regenerating codes a system perspective"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "access vs bandwidth in codes for storage"
    - "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)