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: "source coding with a side information vending machine"
  Abstract: We study source coding in the presence of side information, when the system can take actions that affect the availability, quality, or nature of the side information. We begin by extending the Wyner-Ziv problem of source coding with decoder side information to the case where the decoder is allowed to choose actions affecting the side information. We then consider the setting where actions are taken by the encoder, based on its observation of the source. Actions may have costs that are commensurate with the quality of the side information they yield, and an overall per-symbol cost constraint may be imposed. We characterize the achievable tradeoffs between rate, distortion, and cost in some of these problem settings. Among our findings is the fact that even in the absence of a cost constraint, greedily choosing the action associated with the `best' side information is, in general, sub-optimal. A few examples are worked out.

Connected through hyperedge HE-1 (induced by source paper "blahut arimoto algorithm and code design for action dependent source coding problems"):
  with members:
    - "polar codes are optimal for lossy source coding"
    - "binary quantization using belief propagation with decimation over factor graphs of ldgm codes"
    - "iterative quantization using codes on graphs"

Connected through hyperedge HE-2 (induced by source paper "information embedding on actions"):
  with members:
    - "successive refinement with decoder cooperation and its channel coding duals"
    - "on cascade source coding with a side information vending machine"
    - "on channels with action dependent states"
    - "cascade source coding with a side information vending machine"
    - "compression with actions"
    - "on real time coding with limited lookahead"
    - "multi terminal source coding with action dependent side information"
    - "coordination using implicit communication"

Connected through hyperedge HE-3 (induced by source paper "two way communication with adaptive data acquisition"):
  with members:
    - "coding with action dependent side information and additional reconstruction requirements"
    - "cascade source coding with a side information vending machine"
    - "compression with actions"
    - "multi terminal source coding with action dependent side information"
    - "robust coding for lossy computing with receiver side observation costs"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "two way source coding with a helper"

Connected through hyperedge HE-4 (induced by source paper "on cascade source coding with a side information vending machine"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "cascade source coding with a side information vending machine"
    - "multi terminal source coding with action dependent side information"
    - "robust coding for lossy computing with receiver side observation costs"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "cascade triangular and two way source coding with degraded side information at the second user"

Connected through hyperedge HE-5 (induced by source paper "on real time coding with limited lookahead"):
  with members:
    - "information theoretic viewpoints on optimal causal coding decoding problems"
    - "multi terminal source coding with action dependent side information"
    - "lecture notes on network information theory"
    - "zero error feedback capacity via dynamic programming"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-6 (induced by source paper "distributed and cascade lossy source coding with a side information vending machine"):
  with members:
    - "on real time coding with limited lookahead"
    - "multi terminal source coding with action dependent side information"
    - "robust coding for lossy computing with receiver side observation costs"
    - "alphabet sizes of auxiliary random variables in canonical inner bounds"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-7 (induced by source paper "robust coding for lossy computing with receiver side observation costs"):
  with members:
    - "robust coding for lossy computing with observation costs"
    - "on network functional compression"

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)