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 "linearly constrained bimatrix games in wireless communications"):
  Abstract: We develop a linearly constrained bimatrix game framework that can be used to model many practical problems in many disciplines, including jamming in packetized wireless networks. In contrast to the widely used zero-sum framework, in bimatrix games it is no longer required that the sum of the players’ utilities be zero or constant, thus, ir can be used to model a much larger class of jamming problems. Additionally, in contrast to the standard bimatrix games, in linearly constrained bimatrix games, the players’ strategies must satisfy some linear constraint/inequality, consequently, not all strategies are feasible and the existence of the Nash equilibrium (NE) is not guaranteed anymore. We provide the necessary and sufficient conditions under which the existence of the Nash equilibrium is guaranteed, and show that under linear constraints, the equilibrium pairs and the Nash equilibrium solution of the constrained game corresponds to the global maximum of a quadratic program. Finally, we use our game theoretic framework to find the optimal transmission and jamming strategies for a typical wireless link under power limited jamming.

Includes members:
  Member "on the performance of adaptive packetized wireless communication links under jamming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "security of gps ins based on road location tracking systems")
  Member "cbm a crypto coded modulation scheme for rate information concealing and robustness boosting":
    also connected through other hyperedges:
      (none)
  Member "on the capacity of rate adaptive packetized wireless communication links under jamming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "jam me if you can defeating jammer with deep dueling neural network architecture and ambient backscattering augmented communications")
  Member "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "location privacy in cognitive radio networks a survey")

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)