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 "the arbitrarily varying relay channel"):
  Abstract: We study the arbitrarily varying relay channel, which models communication with relaying in the presence of an active adversary. We establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency division under input and state constraints. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. Furthermore, we show that as opposed to previous relay models, the primitive relay channel has a different behavior compared to the non-primitive relay channel in the arbitrarily varying scenario.

Includes members:
  Member "the capacity of the relay channel solution to cover s problem in the gaussian case":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity regions of cloud radio access networks with limited orthogonal fronthaul")
  Member "arbitrarily varying wiretap channels with type constrained states":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "cut set bound is loose for gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity upper bounds for the relay channel via reverse hypercontractivity")
  Member "the arbitrarily varying wiretap channel secret randomness stability and super activation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "capacity approximations for gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "the arbitrarily varying multiple access channel with conferencing encoders":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "secure communication over parallel relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "pilot spoofing attack by multiple eavesdroppers")

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)