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: "secret message transmission over quantum channels under adversarial quantum noise secrecy capacity and super activation"
  Abstract: We determine the secrecy capacities of arbitrarily varying quantum channels. Both secrecy capacity with average error probability and with maximal error probability are derived. The code we construct fulfills a stringent secrecy requirement, which is called the strong code concept.We determine when the secrecy capacity is a continuous function of the system parameters and completely characterize its discontinuity points both for average error criterion and for maximal error criterion. Furthermore, we prove the phenomenon "super-activation" for secrecy capacities of arbitrarily varying quantum channels, i.e., two quantum channels both with zero secrecy capacity, if used together, allow secure transmission with positive capacity.

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"
    - "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks"
    - "classical quantum arbitrarily varying wiretap channel ahlswede dichotomy positivity resources super activation"
    - "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"

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)