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: "a realistic distributed storage system the rack model"
  Abstract: In a realistic distributed storage environment, storage nodes are usually placed in racks, a metallic support designed to accommodate electronic equipment. It is known that the communication (bandwidth) cost between nodes which are in the same rack is much lower than between nodes which are in different racks. #R##N#In this paper, a new model, where the storage nodes are placed in two racks, is proposed and analyzed. Moreover, the two-rack model is generalized to any number of racks. In this model, the storage nodes have different repair costs depending on the rack where they are placed. A threshold function, which minimizes the amount of stored data per node and the bandwidth needed to regenerate a failed node, is shown. This threshold function generalizes the ones given for previous distributed storage models. The tradeoff curve obtained from this threshold function is compared with the ones obtained from the previous models, and it is shown that this new model outperforms the previous ones in terms of repair cost.

Connected through hyperedge HE-1 (induced by source paper "the storage versus repair bandwidth trade off for clustered storage systems"):
  with members:
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "capacity of clustered distributed storage"
    - "a note on secure minimum storage regenerating codes"
    - "architecture aware coding for distributed storage repairable block failure resilient codes"
    - "non homogeneous two rack model for distributed storage systems"
    - "capacity and security of heterogeneous distributed storage systems"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-2 (induced by source paper "multi rack distributed data storage networks"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "increasing availability in distributed storage systems via clustering"
    - "capacity of clustered distributed storage"
    - "maximally recoverable codes for grid like topologies"
    - "architecture aware coding for distributed storage repairable block failure resilient codes"
    - "codes with hierarchical locality"
    - "xoring elephants novel erasure codes for big data"
    - "a realistic distributed storage system that minimizes data storage and repair bandwidth"

Connected through hyperedge HE-3 (induced by source paper "the storage vs repair bandwidth trade off for multiple failures in clustered storage networks"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "capacity of clustered distributed storage"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "architecture aware coding for distributed storage repairable block failure resilient codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "cooperative regenerating codes"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-4 (induced by source paper "architecture aware coding for distributed storage repairable block failure resilient codes"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "optimal fractional repetition codes based on graphs and designs"
    - "repairable block failure resilient codes"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-5 (induced by source paper "repairable block failure resilient codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "explicit mbr all symbol locality codes"
    - "codes with local regeneration"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

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)