human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "information embedding on actions"):
  Abstract: The problem of optimal actuation for channel and source coding was recently formulated and solved in a number of relevant scenarios. In this class of models, actions are taken at encoders or decoders, either to acquire side information in an efficient way or to control or probe effectively the channel state. In this paper, the problem of embedding information on the actions is studied for both the source and the channel coding set-ups. In both cases, a decoder is present that observes only a function of the actions taken by an encoder or a decoder of an action-dependent point-to-point link. For the source coding model, this decoder wishes to reconstruct a lossy version of the source being transmitted over the point-to-point link, while for the channel coding problem the decoder wishes to retrieve a portion of the message conveyed over the link. For the problem of source coding with actions taken at the decoder, a single letter characterization of the set of all achievable tuples of rate, distortions at the two decoders and action cost is derived, under the assumption that the mentioned decoder observes a function of the actions non-causally, strictly causally or causally. A special case of the problem in which the actions are taken by the encoder is also solved. A single-letter characterization of the achievable capacity-cost region is then obtained for the channel coding set-up with actions. Examples are provided that shed light into the effect of information embedding on the actions for the action-dependent source and channel coding problems.

Includes members:
  Member "successive refinement with decoder cooperation and its channel coding duals":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications")
  Member "on cascade source coding with a side information vending machine":
    also connected through other hyperedges:
      (none)
  Member "on channels with action dependent states":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy harvesting communications under explicit and implicit temperature constraints")
  Member "cascade source coding with a side information vending machine":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "two way communication with adaptive data acquisition")
  Member "compression with actions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coding with action dependent side information and additional reconstruction requirements")
  Member "on real time coding with limited lookahead":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed and cascade lossy source coding with a side information vending machine")
  Member "multi terminal source coding with action dependent side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mac with action dependent state information at one encoder")
  Member "coordination using implicit communication":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strategic communication with side information at the decoder")

Question: Please tell me which class the source paper 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)