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 "vector gaussian successive refinement with degraded side information"):
  Abstract: We investigate the problem of the successive refinement for Wyner-Ziv coding with degraded side information and obtain a complete characterization of the rate region for the quadratic vector Gaussian case. The achievability part is based on the evaluation of the Tian-Diggavi inner bound that involves Gaussian auxiliary random vectors. For the converse part, a matching outer bound is obtained with the aid of a new extremal inequality. Herein, the proof of this extremal inequality depends on the integration of the monotone path argument and the doubling trick as well as information-estimation relations.

Includes members:
  Member "the sum rate of vector gaussian multiple description coding with tree structured covariance distortion constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust distributed compression of symmetrically correlated gaussian sources")
  Member "vector gaussian rate distortion with variable side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "common reconstructions in the successive refinement problem with receiver side information")
  Member "broadcasting correlated vector gaussians":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communicating correlated sources over mac and interference channels i separation based schemes")
  Member "new results on multiple input multiple output broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure broadcasting using independent secret keys")
  Member "private broadcasting over independent parallel channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the secrecy capacity of gaussian mimo channels with finite memory full version")
  Member "information theoretic proofs of entropy power inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sensitivity analysis for binary sampling systems via quantitative fisher information lower bounds")
  Member "secure lossy transmission of vector gaussian sources":
    also connected through other hyperedges:
      (none)
  Member "capacity equivocation region of the gaussian mimo wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "individual secrecy for broadcast channels with receiver side information")

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)