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 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.

Includes members:
  Member "the gaussian many help one distributed source coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "remote source coding under gaussian noise dueling roles of power and entropy power")
  Member "an extremal inequality motivated by multiterminal information theoretic problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "rate region of the quadratic gaussian two encoder source coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")

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)