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 "an achievable rate region for two groupcast messages over the k user broadcast channel and capacity results for the combination network"):
  Abstract: Using an order-theoretic framework, a novel achievable rate region is obtained for the general $K$-receiver discrete memoryless broadcast channel over which two groupcast messages are to be transmitted, with each message required by an arbitrary group of receivers. The associated achievability scheme is an amalgamation of random coding techniques with novel features including {\em up-set} message-splitting, message set expansion including the generation of possibly multiple auxiliary codebooks for certain compositions of split messages using superposition coding with subset inclusion order, partial interference decoding at all receivers in general, joint unique decoding at receivers that desire both messages, and non-unique or indirect decoding at receivers that desire only one of the two messages. While the generality of such a scheme implies that its rate region coincides with all previously found capacity regions for special classes of broadcast channels with two private or two {\em nested} groupcast messages, wherein the group of receivers desiring one message is contained in that desiring the other, we show that, when specialized to the so-called {\em combination network}, our inner bound coincides with the capacity region for three different scenarios, namely, (a) the two messages are intended for two distinct sets of $K{-}1$ receivers each and (b) two nested messages in which one message is intended for one or (c) two (common) receivers and both messages are intended for all other (private) receivers. Moreover, we show that there is a trade-off between the complexity of the coding scheme and that of the distribution of the auxiliary random variables and the encoding function that must be chosen to achieve the capacity region in these scenarios.

Includes members:
  Member "noisy broadcast networks with receiver caching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "capacity results for multicasting nested message sets over combination networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the k user dm broadcast channel with two groupcast messages achievable rate regions and the combination network as a case study")
  Member "is non unique decoding necessary":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "harnessing correlations in distributed erasure coded key value stores")
  Member "generalized cut set bounds for broadcast networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the k user dm broadcast channel with two groupcast messages achievable rate regions and the combination network as a case study")
  Member "latent capacity region a case study on symmetric broadcast with common messages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the k user dm broadcast channel with two groupcast messages achievable rate regions and the combination network as a case study")
  Member "fundamental constraints on multicast capacity regions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the k user dm broadcast channel with two groupcast messages achievable rate regions and the combination network as a case study")

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)