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: "compression with actions"
  Abstract: We consider the setting where actions can be used to modify a state sequence before compression. The minimum rate needed to losslessly describe the optimal modified sequence is characterized when the state sequence is either non-causally or causally available at the action encoder. The achievability is closely related to the optimal channel coding strategy for channel with states. We also extend the analysis to the the lossy case.

Connected through hyperedge HE-1 (induced by source paper "coding with action dependent side information and additional reconstruction requirements"):
  with members:
    - "heegard berger and cascade source coding problems with common reconstruction constraints"
    - "information embedding on actions"
    - "mac with action dependent state information at one encoder"
    - "action dependent strictly causal state communication"
    - "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"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-2 (induced by source paper "lossless coding of correlated sources with actions"):
  with members:
    - "information embedding on actions"
    - "mac with action dependent state information at one encoder"
    - "multiple access channel with partial and controlled cribbing encoders"

Connected through hyperedge HE-3 (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"
    - "on real time coding with limited lookahead"
    - "multi terminal source coding with action dependent side information"
    - "coordination using implicit communication"
    - "distributed and cascade lossy source coding with a side information vending machine"

Connected through hyperedge HE-4 (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"
    - "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-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"
    - "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-6 (induced by source paper "estimation with a helper who knows the interference"):
  with members:
    - "information embedding and the triple role of control"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "joint source channel coding with correlated interference"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-7 (induced by source paper "lossy computing of correlated sources with fractional sampling"):
  with members:
    - "energy efficient sensing and communication of parallel gaussian sources"
    - "cascade multiterminal source coding"

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)