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: "multi terminal source coding with action dependent side information"
  Abstract: We consider multi-terminal source coding with a single encoder and multiple decoders where either the encoder or the decoders can take cost constrained actions which affect the quality of the side information present at the decoders. For the scenario where decoders take actions, we characterize the rate-cost trade-off region for lossless source coding, and give an achievability scheme for lossy source coding for two decoders which is optimum for a variety of special cases of interest. For the case where the encoder takes actions, we characterize the rate-cost trade-off for a class of lossless source coding scenarios with multiple decoders. Finally, we also consider extensions to other multi-terminal source coding settings with actions, and characterize the rate -distortion-cost tradeoff for a case of successive refinement with actions.

Connected through hyperedge HE-1 (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"
    - "coordination using implicit communication"
    - "distributed and cascade lossy source coding with a side information vending machine"

Connected through hyperedge HE-2 (induced by source paper "mac with action dependent state information at one encoder"):
  with members:
    - "coding with action dependent side information and additional reconstruction requirements"
    - "multiple access channels with states causally known at transmitters"
    - "two way communication with adaptive data acquisition"
    - "source coding problems with conditionally less noisy side information"
    - "a note on multiple access channels with strictly causal state information"
    - "multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "multiaccess channels with state known to some encoders and independent messages"
    - "duality between channel capacity and rate distortion with two sided state information"

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"
    - "robust coding for lossy computing with receiver side observation costs"
    - "distributed and cascade lossy source coding with a side information vending machine"
    - "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"
    - "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"
    - "source coding with a side information vending machine"

Connected through hyperedge HE-5 (induced by source paper "cascade source coding with a side information vending machine"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "compression with actions"
    - "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-6 (induced by source paper "on real time coding with limited lookahead"):
  with members:
    - "information theoretic viewpoints on optimal causal coding decoding problems"
    - "lecture notes on network information theory"
    - "zero error feedback capacity via dynamic programming"
    - "source coding with a side information vending machine"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-7 (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"
    - "robust coding for lossy computing with receiver side observation costs"
    - "source coding with a side information vending machine"
    - "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"

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)