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 "distortion bounds for transmitting correlated sources with common part over mac"):
  Abstract: This paper investigates the joint source-channel coding problem of sending two correlated memoryless sources with common part over a memoryless multiple access channel (MAC). An inner bound and two outer bounds on the achievable distortion region are derived. In particular, they respectively recover the existing bounds for several special cases, such as communication without common part, lossless communication, and noiseless communication. When specialized to quadratic Gaussian communication case, transmitting Gaussian sources with Gaussian common part over Gaussian MAC, the inner bound and outer bound are used to generate two new bounds. Numerical result shows that common part improves the distortion of such distributed source-channel coding problem.

Includes members:
  Member "distortion bounds for source broadcast over degraded channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint source channel secrecy using uncoded schemes towards secure source broadcast")
  Member "distortion bounds for source broadcast problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint source channel secrecy using uncoded schemes towards secure source broadcast")
  Member "outer bounds on the admissible source region for broadcast channels with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a lower bound on the expected distortion of joint source channel coding")
  Member "a new data processing inequality and its applications in distributed source and channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "estimation efficiency under privacy constraints")
  Member "rate region of the quadratic gaussian two encoder source coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")

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)