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: "exact minimum repair bandwidth cooperative regenerating codes for distributed storage systems"
  Abstract: In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes to introduce redundancy for the purpose of improving the data repair performance in distributed storage. Most of the studies on regenerating codes focus on the single-failure recovery, but it is not uncommon to see two or more node failures at the same time in large storage networks. To exploit the opportunity of repairing multiple failed nodes simultaneously, a cooperative repair mechanism, in the sense that the nodes to be repaired can exchange data among themselves, is investigated. A lower bound on the repair-bandwidth for cooperative repair is derived and a construction of a family of exact cooperative regenerating codes matching this lower bound is presented.

Connected through hyperedge HE-1 (induced by source paper "scalar mscr codes via the product matrix construction"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "cooperative repair of multiple node failures in distributed storage systems"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "optimal rebuilding of multiple erasures in mds codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "repairing multiple failures in the suh ramchandran regenerating codes"

Connected through hyperedge HE-2 (induced by source paper "security concerns in minimum storage cooperative regenerating codes"):
  with members:
    - "on secrecy capacity of minimum storage regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "codes between mbr and msr points with exact repair property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "exact repair regenerating codes via layered erasure correction and block designs"

Connected through hyperedge HE-3 (induced by source paper "cooperative repair of multiple node failures in distributed storage systems"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "security concerns in minimum storage cooperative regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "cooperative local repair in distributed storage"
    - "repairing reed solomon codes"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "xoring elephants novel erasure codes for big data"

Connected through hyperedge HE-4 (induced by source paper "information theoretically secure erasure codes for distributed storage"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "generalization of rashmi shah kumar minimum storage regenerating codes"

Connected through hyperedge HE-5 (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"
    - "cooperative regenerating codes for distributed storage systems"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-6 (induced by source paper "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"):
  with members:
    - "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"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "on the existence of optimal exact repair mds codes for distributed storage"
    - "fractional repetition codes for repair in distributed storage systems"
    - "exact regeneration codes for distributed storage repair using interference alignment"
    - "searching for minimum storage regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "repairing multiple failures in the suh ramchandran regenerating codes"):
  with members:
    - "exact scalar minimum storage coordinated regenerating codes"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"
    - "cross mbcr exact minimum bandwith coordinated regenerating codes"
    - "cooperative regenerating codes"
    - "cooperative regenerating codes for distributed storage systems"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-8 (induced by source paper "secure cooperative regenerating codes for distributed storage systems"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "update efficient regenerating codes with minimum per node storage"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact scalar minimum storage coordinated regenerating codes"
    - "error resilience in distributed storage via rank metric 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)