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: "explicit construction of mbr codes for clustered distributed storage"
  Abstract: Capacity of the distributed storage system (DSS) is often discussed in the context of tradeoff between storage overhead and repair bandwidth. This paper considers capacity-achieving coding for the clustered form of distributed storage that reflects practical storage networks. The suggested coding scheme is shown to exactly regenerate the arbitrary failed node with minimum required bandwidth, i.e., the proposed scheme is a minimum-bandwidth-regenerating (MBR) code of clustered DSSs with general parameter setting. The proposed code is a generalization of the existing MBR code designed for nonclustered DSSs. This code can be implemented in data centers with multiple racks (clusters), depending on the desired system parameters.

Connected through hyperedge HE-1 (induced by source paper "rack aware regenerating codes for data centers"):
  with members:
    - "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"
    - "a realistic distributed storage system that minimizes data storage and repair bandwidth"
    - "capacity and security of heterogeneous distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "capacity of clustered distributed storage"):
  with members:
    - "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 realistic distributed storage system that minimizes data storage and repair bandwidth"
    - "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)