human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "classical quantum arbitrarily varying wiretap channel ahlswede dichotomy positivity resources super activation"
  Abstract: We establish the Ahlswede dichotomy for arbitrarily varying classical---quantum wiretap channels, i.e., either the deterministic secrecy capacity of the channel is zero, or it equals its randomness-assisted secrecy capacity. We analyze the secrecy capacity of these channels when the sender and the receiver use various resources. It turns out that randomness, common randomness, and correlation as resources are very helpful for achieving a positive secrecy capacity. We prove the phenomenon "super-activation" for arbitrarily varying classical---quantum wiretap channels, i.e., two channels, both with zero deterministic secrecy capacity, if used together allow perfect secure transmission.

Connected through hyperedge HE-1 (induced by source paper "message transmission over classical quantum channels with a jammer with side information correlation as resource and common randomness generating"):
  with members:
    - "message transmission over classical quantum channels with a jammer with side information message transmission capacity and resources"
    - "secret message transmission over quantum channels under adversarial quantum noise secrecy capacity and super activation"
    - "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks"
    - "classical quantum arbitrarily varying wiretap channel common randomness assisted code and continuity"
    - "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"

Connected through hyperedge HE-2 (induced by source paper "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "secrecy capacities of compound quantum wiretap channels and applications"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"
    - "classical quantum arbitrarily varying wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "classical quantum arbitrarily varying wiretap channel common randomness assisted code and continuity"):
  with members:
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "secrecy capacities of compound quantum wiretap channels and applications"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "secrecy results for compound wiretap channels"
    - "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"
    - "classical quantum arbitrarily varying wiretap channel"
    - "capacity results for arbitrarily varying wiretap channels"

Question: Please tell me which class the center node 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)