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: "nash codes for noisy channels"
  Abstract: This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed receiver, who communicate over a noisy channel. The sender's strategy, called a code, maps states of nature to signals. The receiver's best response is to decode the received channel output as the state with highest expected receiver payoff. Given this decoding, an equilibrium or "Nash code" results if the sender encodes every state as prescribed. We show two theorems that give sufficient conditions for Nash codes. First, a receiver-optimal code defines a Nash code. A second, more surprising observation holds for communication over a binary channel, which is used independently a number of times, a basic model of information transmission: under a minimal "monotonicity" requirement for breaking ties when decoding, which holds generically, every code is a Nash code.

Connected through hyperedge HE-1 (induced by source paper "strategic communication with side information at the decoder"):
  with members:
    - "strong coordination of signals and actions over noisy channels with two sided state information"
    - "persuasion with limited communication capacity"
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "information theoretic approach to strategic communication as a hierarchical game"
    - "on the role of side information in strategic communication"
    - "persuasion with limited communication"
    - "algorithmic bayesian persuasion"
    - "empirical coordination with two sided state information and correlated source and state"

Connected through hyperedge HE-2 (induced by source paper "information theoretic limits of strategic communication"):
  with members:
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "information theoretic approach to strategic communication as a hierarchical game"
    - "persuasion with limited communication"
    - "algorithmic bayesian persuasion"
    - "constrained source coding with side information"
    - "estimation with strategic sensors"
    - "perfect output feedback in the two user decentralized interference channel"
    - "rate distortion theory for secrecy systems"

Connected through hyperedge HE-3 (induced by source paper "a branch price and cut algorithm for optimal decoding of ldpc codes"):
  with members:
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "budget optimal task allocation for reliable crowdsourcing systems"
    - "a separation algorithm for improved lp decoding of linear block codes"
    - "adaptive methods for linear programming decoding"

Connected through hyperedge HE-4 (induced by source paper "persuasion with limited communication capacity"):
  with members:
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "information theoretic approach to strategic communication as a hierarchical game"
    - "joint empirical coordination of source and channel"
    - "coordination using implicit 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.GT(Computer Science and Game Theory)