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: "rate region of the gaussian scalar help vector source coding problem"
  Abstract: We determine the rate region of the Gaussian scalar-help-vector source-coding problem under a covariance matrix distortion constraint. The rate region is achieved by a Gaussian achievable scheme. We introduce a novel outer bounding technique to establish the converse of the main result. Our approach is based on lower bounding the problem with a potentially reduced dimensional problem by projecting the main source and imposing the distortion constraint in certain directions determined by the optimal Gaussian scheme. We also prove several properties that the optimal solution to the point-to-point rate-distortion problem for a vector Gaussian source under a covariance matrix distortion constraint satisfies. These properties play an important role in our converse proof. We further establish an outer bound to the rate region of the more general problem in which there are distortion constraints on both the sources. The outer bound is partially tight in general. We also study its tightness in some nontrivial cases.

Connected through hyperedge HE-1 (induced by source paper "source coding in networks with covariance distortion constraints"):
  with members:
    - "distributed remote vector gaussian source coding with covariance distortion constraints"
    - "an outer bound for the vector gaussian ceo problem"
    - "rate region of the vector gaussian one helper source coding problem"
    - "vector gaussian multiple description with individual and central receivers"

Connected through hyperedge HE-2 (induced by source paper "on the covariance matrix distortion constraint for the gaussian wyner ziv problem"):
  with members:
    - "distributed remote vector gaussian source coding with covariance distortion constraints"
    - "an outer bound for the vector gaussian ceo problem"
    - "vector gaussian multiple description with individual and central receivers"

Connected through hyperedge HE-3 (induced by source paper "rate region of the vector gaussian ceo problem with the trace distortion constraint"):
  with members:
    - "an outer bound for the vector gaussian ceo problem"
    - "rate region of the vector gaussian one helper source coding problem"
    - "information theoretic proofs of entropy power inequalities"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-4 (induced by source paper "secure multiterminal source coding with side information at the eavesdropper"):
  with members:
    - "rate distortion with side information at many decoders"
    - "information theoretic proofs of entropy power inequalities"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "secure lossy source coding with side information at the decoders"
    - "construction of wiretap codes from ordinary channel codes"
    - "lecture notes on network information theory"
    - "secure source coding with a helper"
    - "secure lossless compression with side information"

Connected through hyperedge HE-5 (induced by source paper "secure lossy transmission of vector gaussian sources"):
  with members:
    - "secure lossy source coding with side information at the decoders"
    - "a framework for partial secrecy"
    - "secure source coding with a helper"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "secure lossless compression with side information"
    - "lossless compression with security constraints"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels"

Connected through hyperedge HE-6 (induced by source paper "rate region of the vector gaussian one helper source coding problem"):
  with members:
    - "the gaussian many help one distributed source coding problem"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "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)