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: "rack aware regenerating codes for data centers"
  Abstract: Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high, it is critical to design erasure codes that minimize the cross-rack repair bandwidth during failure repair. In this paper, we analyze the optimal trade-off between storage redundancy and cross-rack repair bandwidth specifically for data centers, subject to the condition that the original data can be reconstructed from a sufficient number of any non-failed nodes. We characterize the optimal trade-off curve under functional repair, and propose a general family of erasure codes called rack-aware regenerating codes (RRC), which achieve the optimal trade-off. We further propose exact repair constructions of RRC that have minimum storage redundancy and minimum cross-rack repair bandwidth, respectively. We show that (i) the minimum storage redundancy constructions support a wide range of parameters and have cross-rack repair bandwidth that is strictly less than that of the classical minimum storage regenerating codes in most cases, and (ii) the minimum cross-rack repair bandwidth constructions support all the parameters and have less cross-rack repair bandwidth than that of the minimum bandwidth regenerating codes for almost all of the parameters.

Connected through hyperedge HE-1 (induced by source paper "topology aware cooperative data protection in blockchain based decentralized storage networks"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "hierarchical coding to enable scalability and flexibility in heterogeneous cloud storage"
    - "deconstructing the blockchain to approach physical limits"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "multi rack distributed data storage networks"
    - "blockchain in internet of things challenges and solutions"
    - "non homogeneous two rack model for distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "a class of msr codes for clustered distributed storage"
    - "erasure coding for distributed storage an overview"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "increasing availability in distributed storage systems via clustering"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"

Connected through hyperedge HE-3 (induced by source paper "capacity of distributed storage systems with clusters and separate nodes"):
  with members:
    - "storage and repair bandwidth tradeoff for distributed storage systems with clusters and separate nodes"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "the storage vs repair bandwidth trade off for multiple failures in clustered storage networks"
    - "capacity of clustered distributed storage"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"

Connected through hyperedge HE-4 (induced by source paper "optimal repairing schemes for reed solomon codes with alphabet sizes linear in lengths under the rack aware model"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "on two to one mappings over finite fields"
    - "constructions of locally recoverable codes which are optimal"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "repairing reed solomon codes"
    - "a family of optimal locally recoverable codes"
    - "a repair framework for scalar mds codes"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-5 (induced by source paper "repair pipelining for erasure coded storage algorithms and evaluation"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "xoring elephants novel erasure codes for big data"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"

Connected through hyperedge HE-6 (induced by source paper "storage and repair bandwidth tradeoff for distributed storage systems with clusters and separate nodes"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"
    - "non homogeneous two rack model for distributed storage systems"
    - "capacity and security of heterogeneous distributed storage systems"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "cost bandwidth tradeoff in distributed storage systems"

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)