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 secret message transmission under jamming attacks"):
  Abstract: We analyze arbitrarily varying classical-quantum wiretap channels. These channels are subject to two attacks at the same time: one passive (eavesdropping) and one active (jamming). We elaborate on our previous studies [H. Boche et al., Quantum Inf. Process. 15(11), 4853–4895 (2016) and H. Boche et al., Quantum Inf. Process. 16(1), 1–48 (2016)] by introducing a reduced class of allowable codes that fulfills a more stringent secrecy requirement than earlier definitions. In addition, we prove that non-symmetrizability of the legal link is sufficient for equality of the deterministic and the common randomness assisted secrecy capacities. Finally, we focus on analytic properties of both secrecy capacities: We completely characterize their discontinuity points and their super-activation properties.

Includes members:
  Member "secure multiplex coding with dependent and non uniform multiple messages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exact exponent for soft covering")
  Member "classical quantum arbitrarily varying wiretap channel ahlswede dichotomy positivity resources super activation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "message transmission over classical quantum channels with a jammer with side information correlation as resource and common randomness generating")
  Member "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semantic security and the second largest eigenvalue of biregular graphs")
  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 "secrecy capacities of compound quantum wiretap channels and applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secret message transmission over quantum channels under adversarial quantum noise secrecy capacity and super activation")
  Member "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "message transmission over classical quantum channels with a jammer with side information message transmission capacity and resources")
  Member "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "message transmission over classical quantum channels with a jammer with side information correlation as resource and common randomness generating")
  Member "classical quantum arbitrarily varying wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "classical quantum arbitrarily varying wiretap channel common randomness assisted code and continuity")

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)