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 "interference channels with arbitrarily correlated sources"):
  Abstract: Communicating arbitrarily correlated sources over interference channels is considered in this paper. A sufficient condition is found for the lossless transmission of a pair of correlated sources over a discrete memoryless interference channel. With independent sources, the sufficient condition reduces to the Han-Kobayashi achievable rate region for the interference channel. For a special correlation structure (in the sense of Slepian-Wolf, 1973), the proposed region reduces to the known achievable region for interference channels with common information. A simple example is given to show that the separation approach, with Slepian-Wolf encoding followed by optimal channel coding, is strictly suboptimal.

Includes members:
  Member "correlated sources over broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "outer bounds on the admissible source region for broadcast channels with correlated sources")
  Member "comments on broadcast channels with arbitrarily correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "outer bounds on the admissible source region for broadcast channels with correlated sources")
  Member "interference channels with common information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "caching in heterogeneous networks with per file rate constraints")

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)