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 "rate region of the vector gaussian ceo problem with the trace distortion constraint"):
  Abstract: We establish a new extremal inequality, which is further leveraged to give a complete characterization of the rate region of the vector Gaussian CEO problem with the trace distortion constraint. The proof of this extremal inequality hinges on a careful analysis of the Karush-Kuhn-Tucker necessary conditions for the non-convex optimization problem associated with the Berger-Tung scheme, which enables us to integrate the perturbation argument by Wang and Chen with the distortion projection method by Rahman and Wagner.

Includes members:
  Member "an outer bound for the vector gaussian ceo problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "rate region of the vector gaussian one helper source coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "source coding in networks with covariance distortion constraints")
  Member "information theoretic proofs of entropy power inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "rate region of the gaussian scalar help vector source coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "source coding in networks with covariance distortion constraints")
  Member "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "an extremal inequality motivated by multiterminal information theoretic problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)