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 systems rate regions codes computation forbidden minors"
  Abstract: The rate regions of multilevel diversity coding systems (MDCS), a sub-class of the broader family of multi-source multi-sink networks with special structure, are investigated. After showing how to enumerate all non-isomorphic MDCS instances of a given size, the Shannon outer bound and several achievable inner bounds based on linear codes are given for the rate region of each non-isomorphic instance. For thousands of MDCS instances, the bounds match, and hence exact rate regions are proven. Results gained from these computations are summarized in key statistics involving aspects such as the sufficiency of scalar binary codes, the necessary size of vector binary codes, etc. Also, it is shown how to generate computer aided human readable converse proofs, as well as how to construct the codes for an achievability proof. Based on this large repository of rate regions, a series of results about general MDCS cases that they inspired are introduced and proved. In particular, a series of embedding operations that preserve the property of sufficiency of scalar or vector codes are presented. The utility of these operations is demonstrated by boiling the thousands of MDCS instances for which binary scalar codes are insufficient down to 12 forbidden smallest embedded MDCS instances.

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"
    - "multilevel diversity coding with regeneration"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "fundamental limits of caching"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-2 (induced by source paper "the explicit coding rate region of symmetric multilevel diversity coding"):
  with members:
    - "distributed multilevel diversity coding"
    - "multilevel diversity coding with regeneration"
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "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-3 (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-4 (induced by source paper "on multi source networks enumeration rate region computation and hierarchy"):
  with members:
    - "explicit polyhedral bounds on network coding rate regions via entropy function region algorithms symmetry and computation"
    - "constrained linear representability of polymatroids and algorithms for computing achievability proofs in network coding"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "linear rank inequalities on five or more variables"
    - "mission impossible computing the network coding capacity region"
    - "entropy vectors and network codes"
    - "dualities between entropy functions and network codes"

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)