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: "the capacity of a class of 3 receiver broadcast channels with degraded message sets"
  Abstract: Korner and Marton established the capacity region for the 2-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Korner-Marton region to more than 2 receivers is optimal. This paper shows that this is not the case. We establish the capacity region for a class of 3-receiver broadcast channels with 2 degraded message sets and show that it can be strictly larger than the straightforward extension of the Korner-Marton region. The key new idea is indirect decoding, whereby a receiver who cannot directly decode a cloud center, finds it indirectly by decoding satellite codewords. This idea is then used to establish new inner and outer bounds on the capacity region of the general 3-receiver broadcast channel with 2 and 3 degraded message sets. We show that these bounds are tight for some nontrivial cases. The results suggest that the capacity of the 3-receiver broadcast channel with degraded message sets is as at least as hard to find as the capacity of the general 2-receiver broadcast channel with common and private message.

Connected through hyperedge HE-1 (induced by source paper "three receiver broadcast channels with side information"):
  with members:
    - "the state dependent semideterministic broadcast channel"
    - "capacity bounds for multiuser channels with non causal channel state information at the transmitters"
    - "capacity regions of two new classes of 2 receiver broadcast channels"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-2 (induced by source paper "capacity of a class of broadcast relay channels"):
  with members:
    - "rate regions for relay broadcast channels"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-3 (induced by source paper "on the degrees of freedom of the k user gaussian interference channel"):
  with members:
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region"
    - "capacity bounds for the gaussian interference channel"
    - "multiple access outerbounds and the inseparability of parallel interference channels"
    - "interference alignment on the deterministic channel and application to fully connected awgn interference networks"
    - "gaussian interference channel capacity to within one bit"
    - "interference alignment and the degrees of freedom for the k user interference channel"

Connected through hyperedge HE-4 (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:
    - "fundamental constraints on multicast capacity regions"

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)