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: "mutual information games in multi user channels with correlated jamming"
  Abstract: We investigate the behavior of two users and one jammer in an AWGN channel with and without fading when they participate in a non-cooperative zero-sum game, with the channel's input/output mutual information as the objective function. We assume that the jammer can eavesdrop the channel and can use the information obtained to perform correlated jamming. Under various assumptions on the channel characteristics, and the extent of information available at the users and the jammer, we show the existence, or otherwise non-existence of a simultaneously optimal set of strategies for the users and the jammer. In all the cases where the channel is non-fading, we show that the game has a solution, and the optimal strategies are Gaussian signalling for the users and linear jamming for the jammer. In fading channels, we envision each player's strategy as a power allocation function over the channel states, together with the signalling strategies at each channel state. We reduce the game solution to a set of power allocation functions for the players and show that when the jammer is uncorrelated, the game has a solution, but when the jammer is correlated, a set of simultaneously optimal power allocation functions for the users and the jammer does not always exist. In this case, we characterize the max-min user power allocation strategies and the corresponding jammer power allocation strategy.

Connected through hyperedge HE-1 (induced by source paper "quadratically constrained two way adversarial channels"):
  with members:
    - "the capacity region of the arbitrarily varying mac with and without constraints"
    - "byzantine multiple access"
    - "quadratically constrained myopic adversarial channels"
    - "on avcs with quadratic constraints"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-2 (induced by source paper "quadratically constrained myopic adversarial channels"):
  with members:
    - "list decoding random euclidean codes and infinite constellations"
    - "the arbitrarily varying gaussian relay channel with sender frequency division"
    - "covert communication over adversarially jammed channels"
    - "quadratically constrained channels with causal adversaries"
    - "sufficiently myopic adversaries are blind"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "the benefit of a 1 bit jump start and the necessity of stochastic encoding in jamming channels"
    - "arbitrarily varying wiretap channels with type constrained states"

Connected through hyperedge HE-3 (induced by source paper "jamming games in the mimo wiretap channel with an active eavesdropper"):
  with members:
    - "a secure communication game with a relay helping the eavesdropper"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"
    - "half duplex active eavesdropping in fast fading channels a block markov wyner secrecy encoding scheme"
    - "spectrum sensing algorithms for cognitive radio based on statistical covariances"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "a secure communication game with a relay helping the eavesdropper"):
  with members:
    - "interference assisted secret communication"
    - "secrecy capacity of a class of orthogonal relay eavesdropper channels"
    - "the relay eavesdropper channel cooperation for secrecy"
    - "the gaussian multiple access wire tap 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)