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: "on the capacity of rate adaptive packetized wireless communication links under jamming"
  Abstract: We formulate the interaction between the communicating nodes and an adversary within a game-theoretic context. We show that earlier information-theoretic capacity results for a jammed channel correspond to a pure Nash Equilibrium (NE). However, when both players are allowed to randomize their actions (i.e., coding rate and jamming power) new mixed Nash equilibria appear with surprising properties. We show the existence of a threshold ($J_{TH}$) such that if the jammer average power exceeds $J_{TH}$, the channel capacity at the NE is the same as if the jammer was using its maximum allowable power, $J_{Max}$, all the time. This indicates that randomization significantly advantages powerful jammers. We also show how the NE strategies can be derived, and we provide very simple (e.g., semi-uniform) approximations to the optimal communication and jamming strategies. Such strategies are very simple to implement in current hardware and software.

Connected through hyperedge HE-1 (induced by source paper "jam me if you can defeating jammer with deep dueling neural network architecture and ambient backscattering augmented communications"):
  with members:
    - "ambient backscatter communications a contemporary survey"
    - "anti jamming communications using spectrum waterfall a deep reinforcement learning approach"
    - "cooperative access schemes for efficient swipt transmissions in cognitive radio networks"
    - "learning both weights and connections for efficient neural networks"
    - "dueling network architectures for deep reinforcement learning"
    - "a learning theoretic approach to energy harvesting communication system optimization"
    - "in band full duplex wireless challenges and opportunities"

Connected through hyperedge HE-2 (induced by source paper "security of gps ins based on road location tracking systems"):
  with members:
    - "pinme tracking a smartphone user around the world"
    - "cascading denial of service attacks on wi fi networks"
    - "on the performance of adaptive packetized wireless communication links under jamming"

Connected through hyperedge HE-3 (induced by source paper "linearly constrained bimatrix games in wireless communications"):
  with members:
    - "on the performance of adaptive packetized wireless communication links under jamming"
    - "cbm a crypto coded modulation scheme for rate information concealing and robustness boosting"
    - "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks"

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)