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 "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver"):
  Abstract: The secrecy capacity problems over the general arbitrarily varying wiretap channel (AVWC), with respect to the maximal decoding error probability and strong secrecy criterion, are considered, where the channel state sequence may be known or unknown at the receiver. In the mean time, it is always assumed that the channel state sequence is known at the eavesdropper and unknown at the transmitter. Capacity results of both stochastic code (with random encoder and deterministic decoder) and random code (with random encoder and decoder) are discussed. This model includes the previous models of classic AVWC as special cases. Single-letter lower bounds on the secrecy capacities are given, which are proved to be the secrecy capacities when the main channel is less noisy than the wiretap channel. The coding scheme is based on Csiszar's almost independent coloring scheme and Ahlswede's elimination technique. Moreover, a new kind of typical sequence with respect to states is defined for this coding scheme. It is concluded that the secrecy capacity of stochastic code is identical to that of random code when the receiver knows the state sequence. Meanwhile, random code may achieve larger secrecy capacity when the state sequence is unknown by the receiver.

Includes members:
  Member "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semantic security and the second largest eigenvalue of biregular graphs")
  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 "finite state markov wiretap channel with delayed feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure polar coding with delayed wiretapping information")
  Member "the secrecy capacity of compound gaussian mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "the arbitrarily varying wiretap channel secret randomness stability and super activation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "secrecy results for compound wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secure polar coding with delayed wiretapping information")

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)