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: "fundamental constraints on multicast capacity regions"
  Abstract: Much of the existing work on the broadcast channel focuses only on the sending of private messages. In this work we examine the scenario where the sender also wishes to transmit common messages to subsets of receivers. For an L user broadcast channel there are 2L - 1 subsets of receivers and correspondingly 2L - 1 independent messages. The set of achievable rates for this channel is a 2L - 1 dimensional region. There are fundamental constraints on the geometry of this region. For example, observe that if the transmitter is able to simultaneously send L rate-one private messages, error-free to all receivers, then by sending the same information in each message, it must be able to send a single rate-one common message, error-free to all receivers. This swapping of private and common messages illustrates that for any broadcast channel, the inclusion of a point R* in the achievable rate region implies the achievability of a set of other points that are not merely component-wise less than R*. We formerly define this set and characterize it for L = 2 and L = 3. Whereas for L = 2 all the points in the set arise only from operations relating to swapping private and common messages, for L = 3 a form of network coding is required.

Connected through hyperedge HE-1 (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"):
  with members:
    - "noisy broadcast networks with receiver caching"
    - "capacity results for multicasting nested message sets over combination networks"
    - "is non unique decoding necessary"
    - "generalized cut set bounds for broadcast networks"
    - "latent capacity region a case study on symmetric broadcast with common messages"

Connected through 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"):
  with members:
    - "noisy broadcast networks with receiver caching"
    - "capacity results for multicasting nested message sets over combination networks"
    - "is non unique decoding necessary"
    - "generalized cut set bounds for broadcast networks"
    - "latent capacity region a case study on symmetric broadcast with common messages"

Connected through hyperedge HE-3 (induced by source paper "generalized cut set bounds for broadcast networks"):
  with members:
    - "latent capacity region a case study on symmetric broadcast with common messages"
    - "the single source two terminal network with network coding"
    - "mission impossible computing the network coding capacity region"

Connected through hyperedge HE-4 (induced by source paper "an achievable region for a general multi terminal network and the corresponding chain graph representation"):
  with members:
    - "interference networks with general message sets a random coding scheme"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
    - "latent capacity region a case study on symmetric broadcast with common messages"
    - "on the capacity of the interference channel with a cognitive relay"
    - "lecture notes on network information theory"
    - "compute and forward harnessing interference through structured codes"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-5 (induced by source paper "an achievable region for a general multi terminal network and its chain graph representation"):
  with members:
    - "an achievable region for a general multi terminal network and the corresponding chain graph representation"
    - "interference networks with general message sets a random coding scheme"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
    - "lecture notes on network information theory"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "cognitive interference channels with confidential messages"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "latent capacity region a case study on symmetric broadcast with common messages"):
  with members:
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-7 (induced by source paper "the capacity region of a product of two unmatched gaussian broadcast channels with three particular messages and a common message"):
  with members:
    - "the capacity of a class of 3 receiver broadcast channels with degraded message sets"

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)