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

Includes members:
  Member "combinatorial message sharing and a new achievable region for multiple descriptions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "empirical coordination with multiple descriptions")
  Member "the gaussian many help one distributed source coding problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "remote source coding under gaussian noise dueling roles of power and entropy power")
  Member "approximating the gaussian multiple description rate region under symmetric distortion constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the storage cost of private information retrieval")
  Member "vector gaussian multiple description with individual and central receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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)