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: "semi deterministic broadcast channels with cooperation and a dual source coding problem"
  Abstract: The semi-deterministic broadcast channel (BC) where the decoders may cooperate via a finite-capacity one-sided link is considered. The capacity region is derived via a novel converse that uses a probabilistic construction of auxiliary random variables that depends on the distribution induced by the codebook. The BC is shown to be operationally equivalent to a certain class of relay-broadcast channels (RBCs) and the correspondence between their capacity regions is established. Furthermore, a source coding problem called the Ahlswede-Korner (AK) problem with one-sided encoder cooperation, is considered. Duality principles relating the two problems are presented and the optimal rate region for the source coding setting is derived. The best coding scheme incorporates several source coding techniques, such as Wyner-Ziv coding, binning and superposition coding. The capacity region of the semi-deterministic BC and the admissible region of the AK problem are shown to be dual to one another in the sense that the information measures defining the corner points of both regions coincide. Finally, several special cases of the BC setting and their capacity regions are inspected. It is shown that the special cases and their results preserve the dual relation to corresponding source coding problems.

Connected through hyperedge HE-1 (induced by source paper "feedback and partial message side information on the semideterministic broadcast channel"):
  with members:
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "a unified scheme for two receiver broadcast channels with receiver message side information"
    - "coding schemes with rate limited feedback that improve over the nofeedback capacity for a large class of broadcast channels"
    - "an achievable rate region for the broadcast channel with feedback"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "rate regions for relay broadcast channels"

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)