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 "coordination in distributed networks via coded actions with application to power control"):
  Abstract: This paper investigates the problem of coordinating several agents through their actions. Although the methodology applies to general scenarios, the present work focuses on a situation with an asymmetric observation structure that only involves two agents. More precisely, one of the agents knows the past, present, and future realizations of a state (the system state) that affects the common payoff function of the agents; in contrast, the second agent is assumed either to know the past realizations of the system state or to have no knowledge of it. In both cases, the second agent has access to some strictly causal observations of the first agent's actions, which enables the two agents to coordinate. These scenarios are applied to the problem of distributed power control; the key idea is that a transmitter may embed information about the wireless channel state into its transmit power levels so that an observation of these levels, e.g. the signal-to-interference plus noise ratio, allows the other transmitter to coordinate its power levels. The main contributions of this paper are twofold. First, we provide a characterization of the set of feasible average payoffs when the agents repeatedly take long sequences of actions and the realizations of the system state are \acs{iid}. Second, we exploit these results in the context of distributed power control and introduce the concept of coded power control. We carry out an extensive numerical analysis of the benefits of coded power control over alternative power control policies, and highlight a simple yet non-trivial example of a power control code.

Includes members:
  Member "a cross layer approach for distributed energy efficient power control in interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "coded power control performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed power control with partial channel state information performance characterization and design")
  Member "strong coordination over a line network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coordination through shared randomness")
  Member "empirical coordination in a triangular multiterminal network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "empirical coordination subject to a fidelity criterion")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  Member "strong coordination with polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "strong coordination of signals and actions over noisy channels with two sided state information")
  Member "coordination via a relay":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed source simulation with no communication")
  Member "action dependent strictly causal state communication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "coding with action dependent side information and additional reconstruction requirements")

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)