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 "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"):
  Abstract: We establish Ahlswede Dichotomy for arbitrarily varying classical-quantum wiretap channels. This means that either the deterministic secrecy capacity of an arbitrarily varying classical-quantum wiretap channel is zero or it equals its randomness assisted secrecy capacity. We analyze the secrecy capacity of arbitrarily varying classical-quantum wiretap channels when the sender and the receiver use various resources. It turns out that having randomness, common randomness, and correlation as resources are very helpful for achieving a positive deterministic secrecy capacity of arbitrarily varying classical-quantum wiretap channels. We prove the phenomenon ?super-activation? for arbitrarily varying classical-quantum wiretap channels, i.e., if we use two arbitrarily varying classical-quantum wiretap channels, both with zero deterministic secrecy capacity together,they allow perfect secure transmission.

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 "secrecy capacities of compound quantum wiretap channels and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks")
  Member "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "message transmission over classical quantum channels with a jammer with side information message transmission capacity and resources")
  Member "secrecy results for compound wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure polar coding with delayed wiretapping information")
  Member "classical quantum arbitrarily varying wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks")
  Member "capacity results for arbitrarily varying wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "capacity results for compound wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure broadcasting using independent secret keys")

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)