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: "coding with action dependent side information and additional reconstruction requirements"
  Abstract: Two classes of source/channel coding problems, namely, coding with action-dependent side information and coding with additional signal reconstruction are considered in a unified fashion. In the source coding setting, a decoder wishes to reconstruct the source subject to a distortion constraint, while an encoder is required to estimate the decoder’s reconstruction reliably. Side information is action-dependent in the sense that its quality and/or availability at the encoder or decoder can be influenced by a cost-constrained action sequence. In the channel coding dual, the decoder wishes to decode both the message and the channel input sequence reliably, and the channel state information available at the encoder or decoder is assumed to depend on the action sequence. We consider discrete memoryless systems and characterize single letter expressions for the rate-distortion-cost function and channel capacity for the respective source and channel coding problems.

Connected through hyperedge HE-1 (induced by source paper "mac with action dependent state information at one encoder"):
  with members:
    - "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"
    - "multi terminal source coding with action dependent side 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-2 (induced by source paper "two way communication with adaptive data acquisition"):
  with members:
    - "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"
    - "source coding with a side information vending machine"
    - "two way source coding with a helper"

Connected through hyperedge HE-3 (induced by source paper "on channels with action dependent states"):
  with members:
    - "action dependent strictly causal state communication"

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)