human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "explicit polyhedral bounds on network coding rate regions via entropy function region algorithms symmetry and computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on multi source networks enumeration rate region computation and hierarchy")
  Member "constrained linear representability of polymatroids and algorithms for computing achievability proofs in network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on multi source networks enumeration rate region computation and hierarchy")
  Member "characterizing the rate region of the 4 3 3 exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "symmetry in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private information retrieval for coded storage")
  Member "xoring elephants novel erasure codes for big data":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "rate region of the 4 3 3 exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "increasing availability in distributed storage systems via clustering")
  Member "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point")
  Member "entropy vectors and network codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on multi source networks enumeration rate region computation and hierarchy")

Question: Please tell me which class the source paper 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)