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 "a multiway relay channel with balanced sources"):
  Abstract: We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless sources in a certain class   ${\mathcal{P}^\ast}$  , and we demonstrate that strict source-channel separation is optimal within this class. We show how to test whether a given source belongs to   ${\mathcal{P}^\ast}$  , we give a balanced-information regularity condition for   ${\mathcal{P}^\ast}$  , and we express   ${\mathcal{P}^\ast}$   in terms of conditional multiple-mutual information. Finally, we show that   ${\mathcal{P}^\ast}$   is useful for a centralized storage problem.

Includes members:
  Member "information theoretic caching sequential coding for computing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relaxed wyner s common information")
  Member "multi way relay networks orthogonal uplink source channel separation and code design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "slepian wolf coding for broadcasting with cooperative base stations")
  Member "the three user finite field multi way relay channel with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "the capacity region of restricted multi way relay channels with deterministic uplinks":
    also connected through other hyperedges:
      (none)
  Member "the capacity region of multiway relay channels over finite fields with full data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the single uniprior index coding problem the single sender case and the multi sender extension")
  Member "malleable coding with fixed reuse":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "malleable coding with fixed segment reuse")
  Member "network information flow with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for networks with correlated sources and characterisation of distributions by entropies")

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)