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 "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"):
  Abstract: The Wyner–Ahlswede–Korner (WAK) empirical-coordination problem where the encoders cooperate via a finite-capacity one-sided link is considered. The coordination-capacity region is derived by combining several source coding techniques, such as Wyner–Ziv coding, binning, and superposition coding. Furthermore, a semi-deterministic (SD) broadcast channel (BC) with one-sided decoder cooperation is considered. Duality principles relating the two problems are presented, and the capacity region for the SD-BC setting is derived. The direct part follows from an achievable region for a general BC that is tight for the SD scenario. A converse is established by using telescoping identities. The SD-BC is shown to be operationally equivalent to a class of relay-BCs, and the correspondence between their capacity regions is established. The capacity region of the SD-BC is transformed into an equivalent region that is shown to be dual to the admissible region of the WAK problem in the sense that the information measures defining the corner points of both regions coincide. Achievability and converse proofs for the equivalent region are provided. For the converse, we use a probabilistic construction of auxiliary random variables that depends on the distribution induced by the codebook. Several examples illustrate the results.

Includes members:
  Member "empirical coordination in a triangular multiterminal network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "empirical coordination subject to a fidelity criterion")
  Member "successive refinement with decoder cooperation and its channel coding duals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications")
  Member "evaluation of marton s inner bound for the general broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the direction of discrimination an information theoretic analysis of disparate impact in machine learning")
  Member "mac with action dependent state information at one encoder":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "the state dependent semideterministic broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications")
  Member "multiterminal source coding under logarithmic loss":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "the compound multiple access channel with partially cooperating encoders":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the capacity region of the arbitrarily varying mac with and without constraints")
  Member "compound multiple access channels with partial cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "novel outer bounds and capacity results for the interference channel with conferencing receivers")

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)