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: "exchange economy in two user multiple input single output interference channels"
  Abstract: We study the conflict between two links in a multiple-input single-output interference channel. This setting is strictly competitive and can be related to perfectly competitive market models. In such models, general equilibrium theory is used to determine equilibrium measures that are Pareto optimal. First, we consider the links to be consumers that can trade goods within themselves. The goods in our setting correspond to beamforming vectors. We utilize the conflict representation of the consumers in the Edgeworth box, a graphical tool that depicts the allocation of the goods for the two consumers, to provide closed-form solution to all Pareto optimal outcomes. Afterwards, we model the situation between the links as a competitive market which additionally defines prices for the goods. The equilibrium in this economy is called Walrasian and corresponds to the prices that equate the demand to the supply of goods. We calculate the unique Walrasian equilibrium and propose a coordination process that is realized by an arbitrator which distributes the Walrasian prices to the consumers. The consumers then calculate in a decentralized manner their optimal demand corresponding to beamforming vectors that achieve the Walrasian equilibrium. This outcome is Pareto optimal and dominates the noncooperative outcome of the systems. Thus, based on the game theoretic model and solution concept, an algorithm for a distributed implementation of the beamforming problem in multiple-input single-output interference channels is provided.

Connected through hyperedge HE-1 (induced by source paper "distributed channel assignment in cognitive radio networks stable matching and walrasian equilibrium"):
  with members:
    - "a context aware matching game for user association in wireless small cell networks"
    - "distributed medium access control for energy efficient transmission in cognitive radios"
    - "fully distributed optimal channel assignment for open spectrum access"
    - "joint sensing and power allocation in nonconvex cognitive radio games nash equilibria and distributed algorithms"

Connected through hyperedge HE-2 (induced by source paper "coalitional games in miso interference channels epsilon core and coalition structure stable set"):
  with members:
    - "coalitional games in partition form for joint spectrum sensing and access in cognitive radio networks"
    - "robust monotonic optimization framework for multicell miso systems"
    - "optimal distributed beamforming for miso interference channels"
    - "coalitional game theory for communication networks a tutorial"
    - "the cost of stability in coalitional games"
    - "stable partitions in coalitional games"

Connected through hyperedge HE-3 (induced by source paper "achievable outage rate regions for the miso interference channel"):
  with members:
    - "efficient computation of pareto optimal beamforming vectors for the miso interference channel with successive interference cancellation"
    - "coordinated beamforming for multiuser miso interference channel under rate outage constraints"
    - "outage probability and outage based robust beamforming for mimo interference channels with imperfect channel state information"
    - "mimo diversity in the presence of double scattering"

Connected through hyperedge HE-4 (induced by source paper "coordinated beamforming with relaxed zero forcing the sequential orthogonal projection combining method and rate control"):
  with members:
    - "optimal beamforming in interference networks with perfect local channel information"
    - "optimal distributed beamforming for miso interference channels"
    - "cooperative interference management with miso beamforming"
    - "networked mimo with clustered linear precoding"

Connected through hyperedge HE-5 (induced by source paper "efficient computation of pareto optimal beamforming vectors for the miso interference channel with successive interference cancellation"):
  with members:
    - "optimal beamforming in interference networks with perfect local channel information"
    - "cooperative interference management with miso beamforming"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-6 (induced by source paper "pareto characterization of the multicell mimo performance region with simple receivers"):
  with members:
    - "robust monotonic optimization framework for multicell miso systems"
    - "optimality properties distributed strategies and measurement based evaluation of coordinated multicell ofdma transmission"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "mimo transmission with residual transmit rf impairments"
    - "cooperative interference management with miso beamforming"
    - "multi user miso interference channels with single user detection optimality of beamforming and the achievable rate region"

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)