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: "the rate distortion function for product of two sources with side information at decoders"
  Abstract: This paper investigates a lossy source coding problem in which two decoders can access their side-information respectively. The correlated sources are a product of two component correlated sources, and we exclusively investigate the case such that each component is degraded. We show the rate-distortion function for that case, and give the following observations. When the components are degraded in matched order, the rate distortion function of the product sources is equal to the sum of the component-wise rate distortion functions. On the otherhand, the former is strictly smaller than the latter when the component sources are degraded in mismatched order. The converse proof for the mismatched case is motivated by the enhancement technique used for broadcast channels. For binary Hamming and Gaussian examples, we evaluate the rate-distortion functions.

Connected through hyperedge HE-1 (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"
    - "rate distortion with side information at many decoders"
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-2 (induced by source paper "lp bounds for rate distortion with variable 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"
    - "a rate distortion approach to index coding"
    - "source coding problems with conditionally less noisy side information"
    - "index coding via linear programming"

Connected through hyperedge HE-3 (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"
    - "rate distortion with side information at many decoders"

Connected through hyperedge HE-4 (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"
    - "rate distortion with side information at many 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-5 (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"

Connected through hyperedge HE-6 (induced by source paper "key capacity for product sources with application to stationary gaussian processes"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "on the duality of additivity and tensorization"
    - "key capacity with limited one way communication for product sources"
    - "outer bounds for multiterminal source coding via a strong data processing inequality"
    - "distributed channel synthesis"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"
    - "separation of reliability and secrecy in rate limited secret key generation"

Connected through hyperedge HE-7 (induced by source paper "universal wyner ziv coding for distortion constrained general side information"):
  with members:
    - "channel coding and lossy source coding using a generator of constrained random numbers"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "achievability proof via output statistics of random binning"
    - "reliability in source coding with side information"
    - "rate distortion with side information at many decoders"
    - "universal source coding over generalized complementary delivery networks"
    - "efficient on line schemes for encoding individual sequences with side information at the decoder"
    - "hash property and coding theorems for sparse matrices and maximum likelihood coding"

Connected through hyperedge HE-8 (induced by source paper "source coding problems with conditionally less noisy side information"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "rate distortion with side information at many decoders"
    - "wyner ziv coding over broadcast channels digital schemes"
    - "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"

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)