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"
  Abstract: We derive a lower bound on the capacity of classical-quantum arbitrarily varying wiretap channel and determine the capacity of the classicalquantum arbitrarily varying wiretap channel with channel state information at the transmitter.

Connected through hyperedge HE-1 (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"
    - "classical quantum arbitrarily varying wiretap channel ahlswede dichotomy positivity resources super activation"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "classical quantum arbitrarily varying wiretap channel common randomness assisted code and continuity"):
  with members:
    - "classical quantum arbitrarily varying wiretap channel ahlswede dichotomy positivity resources super activation"
    - "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"
    - "capacity results for arbitrarily varying wiretap channels"

Connected through hyperedge HE-3 (induced by source paper "classical quantum arbitrarily varying wiretap channel ahlswede dichotomy positivity resources super activation"):
  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"
    - "secrecy results for compound wiretap channels"

Connected through hyperedge HE-4 (induced by source paper "secrecy capacities of compound quantum wiretap channels and applications"):
  with members:
    - "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"
    - "capacity results for compound wiretap channels"

Connected through hyperedge HE-5 (induced by source paper "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"):
  with members:
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "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"
    - "capacity results for arbitrarily varying wiretap channels"
    - "capacity results for compound 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)