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 channel with colored gaussian noise"):
  Abstract: We address the arbitrarily varying channel (AVC) with colored Gaussian noise. The work consists of three parts. First, we study the general discrete AVC with fixed parameters, where the channel depends on two state sequences, one arbitrary and the other fixed and known. This model can be viewed as a combination of the AVC and the time-varying channel. We determine both the deterministic code capacity and the random code capacity. Super-additivity is demonstrated, showing that the deterministic code capacity can be strictly larger than the weighted sum of the parametric capacities.  In the second part, we consider the arbitrarily varying Gaussian product channel (AVGPC). Hughes and Narayan characterized the random code capacity through min-max optimization leading to a "double" water filling solution. Here, we establish the deterministic code capacity and also discuss the game-theoretic meaning and the connection between double water filling and Nash equilibrium. As in the case of the standard Gaussian AVC, the deterministic code capacity is discontinuous in the input constraint, and depends on which of the input or state constraint is higher. As opposed to Shannon's classic water filling solution, it is observed that deterministic coding using independent scalar codes is suboptimal for the AVGPC.  Finally, we establish the capacity of the AVC with colored Gaussian noise, where double water filling is performed in the frequency domain. The analysis relies on our preceding results, on the AVC with fixed parameters and the AVGPC.

Includes members:
  Member "the capacity region of the arbitrarily varying mac with and without constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quadratically constrained two way adversarial channels")
  Member "the arbitrarily varying relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying gaussian relay channel with sender frequency division")
  Member "minimax theorems for finite blocklength lossy joint source channel coding over an avc":
    also connected through other hyperedges:
      (none)
  Member "the arbitrarily varying gaussian relay channel with sender frequency division":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quadratically constrained myopic adversarial channels")
  Member "communication over an arbitrarily varying channel under a state myopic encoder":
    also connected through other hyperedges:
      (none)
  Member "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver":
    also connected through other hyperedges:
      (none)
  Member "semi robust communications over a broadcast channel":
    also connected through other hyperedges:
      (none)
  Member "arbitrarily varying wiretap channels with type constrained states":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "key and message semantic security over state dependent channels")

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)