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: "multilevel diversity coding with regeneration"
  Abstract: Digital contents in large scale distributed storage systems may have different reliability and access delay requirements, and for this reason, erasure codes with different strengths need to be utilized to achieve the best storage efficiency. At the same time, in such large scale distributed storage systems, nodes fail on a regular basis, and the contents stored on them need to be regenerated and stored on other healthy nodes, the efficiency of which is an important factor affecting the overall quality of service. In this work, we formulate the problem of multilevel diversity coding with regeneration to address these considerations, for which the storage vs. repair-bandwidth tradeoff is investigated. We show that the extreme point on this tradeoff corresponding to the minimum possible storage can be achieved by a simple coding scheme, where contents with different reliability requirements are encoded separately with individual regenerating codes without any mixing. On the other hand, we establish the complete storage-repair-bandwidth tradeoff for the case of four storage nodes, which reveals that codes mixing different contents can strictly improve this tradeoff over the separate coding solution.

Connected through hyperedge HE-1 (induced by source paper "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1"):
  with members:
    - "caching and delivery via interference elimination"
    - "symmetry outer bounds and code constructions a computer aided investigation on the fundamental limits of caching"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "multilevel diversity coding systems rate regions codes computation forbidden minors"
    - "fundamental limits of caching"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-2 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "minimum storage regenerating codes for all parameters"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "hashtag erasure codes from theory to practice"
    - "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"
    - "layered exact repair regenerating codes via embedded error correction and block designs"

Connected through hyperedge HE-3 (induced by source paper "new results on multilevel diversity coding with secure regeneration"):
  with members:
    - "multilevel diversity coding with secure regeneration separate coding achieves the mbr point"
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "toward optimal secure distributed storage systems with exact repair"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "data secrecy in distributed storage systems under exact repair"
    - "information theoretically secure regenerating codes for distributed storage"
    - "on secure distributed data storage under repair dynamics"

Connected through hyperedge HE-4 (induced by source paper "the explicit coding rate region of symmetric multilevel diversity coding"):
  with members:
    - "distributed multilevel diversity coding"
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "multilevel diversity coding systems rate regions codes computation forbidden minors"
    - "secure symmetrical multilevel diversity coding"
    - "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions"
    - "information inequalities for joint distributions with interpretations and applications"
    - "approximating the gaussian multiple description rate region under symmetric distortion constraints"

Connected through hyperedge HE-5 (induced by source paper "symmetry outer bounds and code constructions a computer aided investigation on the fundamental limits of caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching for a large number of users"
    - "caching and delivery via interference elimination"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "on caching with more users than files"
    - "critical database size for effective caching"
    - "a note on the rate region of exact repair regenerating codes"
    - "order optimal rate of caching and coded multicasting with random demands"

Connected through hyperedge HE-6 (induced by source paper "optimal construction of regenerating code through rate matching in hostile networks"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "repairing reed solomon codes"
    - "beyond the mds bound in distributed cloud storage"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"
    - "mds array codes with optimal rebuilding"

Connected through hyperedge HE-7 (induced by source paper "distributed multilevel diversity coding"):
  with members:
    - "broadcasting correlated vector gaussians"
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "secure symmetrical multilevel diversity coding"
    - "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions"
    - "approximating the gaussian multiple description rate region under symmetric distortion constraints"
    - "robust distributed source coding"

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)