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

Connected through hyperedge HE-1 (induced by source paper "distributed hypothesis testing with concurrent detections"):
  with members:
    - "hypothesis testing under maximal leakage privacy constraints"
    - "collaborative distributed hypothesis testing"

Connected through hyperedge HE-2 (induced by source paper "rate distortion region of a gray wyner model with side information"):
  with members:
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "source coding problems with conditionally less noisy side information"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "source coding for a simple network with receiver side information"
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-3 (induced by source paper "information theoretic caching sequential coding for computing"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "a new converse bound for coded caching"
    - "a rate distortion approach to caching"
    - "content caching and delivery over heterogeneous wireless networks"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "fundamental limits of caching with secure delivery"
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "coded caching for delay sensitive content"

Connected through hyperedge HE-4 (induced by source paper "common reconstructions in the successive refinement problem with receiver side information"):
  with members:
    - "vector gaussian rate distortion with variable side information"
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "source coding problems with conditionally less noisy side information"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-5 (induced by source paper "vector gaussian rate distortion with variable side information"):
  with members:
    - "a rate distortion approach to index coding"
    - "source coding problems with conditionally less noisy side information"
    - "the rate distortion function for product of two sources with side information at decoders"

Connected through hyperedge HE-6 (induced by source paper "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "source coding problems with conditionally less noisy side information"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "multiterminal source coding with complementary delivery"
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-7 (induced by source paper "the three terminal interactive lossy source coding problem"):
  with members:
    - "diffusion lms over multitask networks"
    - "distributed estimation in multi agent networks"
    - "interaction strictly improves the wyner ziv rate distortion function"
    - "two way source coding with a helper"
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-8 (induced by source paper "a rate distortion approach to index coding"):
  with members:
    - "vector gaussian rate distortion with variable side information"
    - "graph theory versus minimum rank for index coding"
    - "on the capacity region for index coding"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "local graph coloring and index coding"
    - "fundamental limits of caching"
    - "source coding problems with conditionally less noisy side information"
    - "index coding an interference alignment perspective"

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)