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 "typicality graphs large deviation analysis"):
  Abstract: Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any " > 0, the set of n-length sequences x n and y n that are jointly typical [1] according to PXY can be represented on a bipartite graph. We present a formal definition of such a graph, known as a typicality graph, and study some of its properties.

Includes members:
  Member "a new achievable rate region for the discrete memoryless multiple access channel with noiseless feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an achievable rate region for the broadcast channel with feedback")
  Member "a graph based framework for transmission of correlated sources over broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new sufficient conditions for multiple access channel with correlated sources")

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)