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 that minimizes data storage and repair bandwidth"
  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 within a rack is much lower than the communication (bandwidth) cost between nodes within different racks. #R##N#In this paper, a new model, where the storage nodes are placed in two racks, is proposed and analyzed. In this model, the storage nodes have different repair costs to repair a node 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 threshold function from 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 "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"
    - "rack aware regenerating codes for data centers"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "rack aware regenerating codes for data centers"):
  with members:
    - "explicit construction of mbr codes for clustered distributed storage"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"
    - "xoring elephants novel erasure codes for big data"
    - "capacity and security of heterogeneous distributed storage systems"

Connected through hyperedge HE-3 (induced by source paper "increasing availability in distributed storage systems via clustering"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "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"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "achieving arbitrary locality and availability in binary codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "locality and availability in distributed storage"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"

Connected through hyperedge HE-4 (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"
    - "locally repairable codes with multiple repair alternatives"

Connected through hyperedge HE-5 (induced by source paper "capacity of clustered distributed storage"):
  with members:
    - "explicit construction of mbr codes for clustered distributed storage"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "secure clustered distributed storage against eavesdroppers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "architecture aware coding for distributed storage repairable block failure resilient codes"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "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 "optimal repair layering for erasure coded data centers from theory to practice"):
  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"
    - "xoring elephants novel erasure codes for big data"
    - "non homogeneous two rack model for 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"

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)