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 distortion with side information at many decoders"):
  Abstract: We present an achievable rate region for the multistage successive-refinement problem with side-information. We also present an upper bound for the rate-distortion function for lossy source coding with side-information at many decoders. Characterising this rate-distortion function is a long-standing open problem, and it is widely believed that the tightest upper bound is provided by Theorem 2 of Heegard and Berger's paper “Rate distortion when side information may be absent” (IEEE Trans. Inf. Theory, 1985). We give a counterexample to Heegard and Berger's result.

Includes members:
  Member "latent capacity region a case study on symmetric broadcast with common messages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an achievable rate region for two groupcast messages over the k user broadcast channel and capacity results for the combination network")
  Member "multiterminal source coding with complementary delivery":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "extended gray wyner system with complementary causal side information")
  Member "side information scalable source coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "extended gray wyner system with complementary causal side information")
  Member "on multistage successive refinement for wyner ziv source coding with degraded side informations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")

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)