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 "lossy broadcasting in two way relay networks with common reconstructions"):
  Abstract: The broadcast phase (downlink transmission) of the two-way relay network is studied in the source coding and joint source-channel coding settings. The rates needed for reliable communication are characterised for a number of special cases including: small distortions, deterministic distortion measures, and jointly Gaussian sources with quadratic distortion measures. The broadcast problem is also studied with common-reconstruction decoding constraints, and the rates needed for reliable communication are characterised for all discrete memoryless sources and per-letter distortion measures.

Includes members:
  Member "wyner ziv coding over broadcast channels digital schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "noisy broadcast networks with receiver caching")
  Member "broadcast capacity region of two phase bidirectional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")
  Member "multiterminal source coding with complementary delivery":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "extended gray wyner system with complementary causal side information")
  Member "joint source channel coding with side information using hybrid digital analog codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimum energy analysis for robust gaussian joint source channel coding with a square law profile")

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)