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 "lp bounds for rate distortion with variable side information"):
  Abstract: We consider a rate-distortion problem with side information at multiple decoders. Several upper and lower bounds have been proposed for this general problem or special cases of it. We provide an upper bound for general instances of this problem, which takes the form of a linear program, by utilizing random binning and simultaneous decoding techniques and compare it with the existing bounds. We also provide a lower bound for the general problem, which was inspired by a linear-programming lower bound for index coding, and show that it subsumes most of the lower bounds in literature. Using these upper and lower bounds, we explicitly characterize the rate-distortion function of a problem that can be seen as a Gaussian analogue of the "odd-cycle" index coding problem.

Includes members:
  Member "vector gaussian rate distortion with variable side information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "a rate distortion approach to index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative multi sender index coding")
  Member "source coding problems with conditionally less noisy side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "the rate distortion function for product of two sources with side information at decoders":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "common reconstructions in the successive refinement problem with receiver side information")
  Member "index coding via linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "embedded index coding")

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)