human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "the sum rate of vector gaussian multiple description coding with tree structured covariance distortion constraints"
  Abstract: A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established by generalizing Ozarow's celebrated converse argument through the introduction of auxiliary random variables that form a Markov tree. For the quadratic vector Gaussian case, this lower bound is shown to be achievable by an extended version of the El Gamal-Cover scheme, yielding a complete sum-rate characterization.

Connected through hyperedge HE-1 (induced by source paper "vector gaussian successive refinement with degraded side information"):
  with members:
    - "vector gaussian rate distortion with variable side information"
    - "broadcasting correlated vector gaussians"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "private broadcasting over independent parallel channels"
    - "information theoretic proofs of entropy power inequalities"
    - "secure lossy transmission of vector gaussian sources"
    - "capacity equivocation region of the gaussian mimo wiretap channel"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"

Connected through hyperedge HE-2 (induced by source paper "robust distributed compression of symmetrically correlated gaussian sources"):
  with members:
    - "generalized gaussian multiterminal source coding the symmetric case"
    - "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem"
    - "multiuser successive refinement and multiple description coding"
    - "multiple description quantization via gram schmidt orthogonalization"
    - "robust distributed source coding"
    - "vector gaussian multiple description with individual and central receivers"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Question: Please tell me which class the center node 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)