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: "the arbitrarily varying gaussian relay channel with sender frequency division"
  Abstract: We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel input is subject to a low power limit, the deterministic code capacity may be strictly lower than the random code capacity, and the gap vanishes as the input becomes less constrained. A second model addressed in this paper is the general case of primitive arbitrarily varying relay channels. We develop lower and upper bounds on the random code capacity, and give conditions under which the deterministic code capacity coincides with the random code capacity, and conditions under which it is lower. Then, we establish the capacity of the primitive counterpart of the arbitrarily varying Gaussian relay channel with sender frequency division. In this case, the deterministic and random code capacities are the same.

Connected through hyperedge HE-1 (induced by source paper "the arbitrarily varying channel with colored gaussian noise"):
  with members:
    - "the capacity region of the arbitrarily varying mac with and without constraints"
    - "the arbitrarily varying relay channel"
    - "minimax theorems for finite blocklength lossy joint source channel coding over an avc"
    - "communication over an arbitrarily varying channel under a state myopic encoder"
    - "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver"
    - "semi robust communications over a broadcast channel"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"

Connected through hyperedge HE-2 (induced by source paper "quadratically constrained myopic adversarial channels"):
  with members:
    - "list decoding random euclidean codes and infinite constellations"
    - "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"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"

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)