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: "coordination and bargaining over the gaussian interference channel"
  Abstract: This work considers coordination and bargaining between two selfish users over a Gaussian interference channel using game theory. The usual information theoretic approach assumes full cooperation among users for codebook and rate selection. In the scenario investigated here, each selfish user is willing to coordinate its actions only when an incentive exists and benefits of cooperation are fairly allocated. To improve communication rates, the two users are allowed to negotiate for the use of a simple Han-Kobayashi type scheme with fixed power split and conditions for which users have incentives to cooperate are identified. The Nash bargaining solution (NBS) is used as a tool to get fair information rates. The operating point is obtained as a result of an optimization problem and compared with a TDM-based one in the literature.

Connected through hyperedge HE-1 (induced by source paper "improper signaling on the two user siso interference channel"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "interference alignment on the deterministic channel and application to fully connected awgn interference networks"
    - "gaussian interference channel capacity to within one bit"
    - "bargaining over the interference channel"

Connected through hyperedge HE-2 (induced by source paper "exchange economy in two user multiple input single output interference channels"):
  with members:
    - "pareto characterization of the multicell mimo performance region with simple receivers"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "cooperative interference management with miso beamforming"

Connected through hyperedge HE-3 (induced by source paper "a game theoretic view of the interference channel impact of coordination and bargaining"):
  with members:
    - "alternating offer bargaining games over the gaussian interference channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "coalitions in cooperative wireless networks"
    - "gaussian interference channel capacity to within one bit"
    - "cooperative game theory and the gaussian interference channel"
    - "bargaining over the interference channel"

Connected through hyperedge HE-4 (induced by source paper "alternating offer bargaining games over the gaussian interference channel"):
  with members:
    - "a game theoretic view of the interference channel impact of coordination and bargaining"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "cooperative game theory and the gaussian interference channel"

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)