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: "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
  Abstract: We give a complete characterization of the correlated random coding secrecy capacity of arbitrarily varying wiretap channels (AVWCs). We apply two alternative strong secrecy criteria, which both lead to the same multi-letter formula. The difference of these criteria lies in the treatment of correlated randomness; they coincide in the case of uncorrelated codes. On the basis of the derived formula, we show that the correlated random coding secrecy capacity is continuous as a function of the AVWC, in contrast to the discontinuous uncorrelated coding secrecy capacity. In the proof of the secrecy capacity formula for correlated random codes, we apply an auxiliary channel, which is compound from the sender to the intended receiver and arbitrarily varying from the sender to the eavesdropper.

Connected through hyperedge HE-1 (induced by source paper "semantic security and the second largest eigenvalue of biregular graphs"):
  with members:
    - "the mac resolvability region semantic security and its operational implications"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "ramanujan graphs in polynomial time"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"
    - "universal hashing for information theoretic security"
    - "renyi divergence and kullback leibler divergence"

Connected through hyperedge HE-2 (induced by source paper "quadratically constrained myopic adversarial channels"):
  with members:
    - "list decoding random euclidean codes and infinite constellations"
    - "the arbitrarily varying gaussian relay channel with sender frequency division"
    - "covert communication over adversarially jammed channels"
    - "quadratically constrained channels with causal adversaries"
    - "sufficiently myopic adversaries are blind"
    - "the benefit of a 1 bit jump start and the necessity of stochastic encoding in jamming channels"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"

Connected through hyperedge HE-3 (induced by source paper "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver"):
  with members:
    - "arbitrarily varying wiretap channels with type constrained states"
    - "finite state markov wiretap channel with delayed feedback"
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy results for compound wiretap channels"
    - "capacity results for arbitrarily varying wiretap channels"

Connected through hyperedge HE-4 (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"
    - "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-5 (induced by source paper "arbitrarily varying wiretap channels with type constrained states"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "strong secrecy for cooperative broadcast channels"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "secrecy results for compound wiretap channels"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-6 (induced by source paper "sufficiently myopic adversaries are blind"):
  with members:
    - "on the capacity of the binary adversarial wiretap channel"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "coding against a limited view adversary the effect of causality and feedback"
    - "semantic security capacity for wiretap channels of type ii"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "a characterization of the capacity of online causal binary channels"
    - "secrecy results for compound wiretap channels"

Connected through hyperedge HE-7 (induced by source paper "secret key generation over noisy channels with correlated sources"):
  with members:
    - "secret key generation from correlated sources and secure link"
    - "wiretap channels with random states non causally available at the encoder"
    - "secret key generation over noisy channels with common randomness"
    - "semantic security capacity for wiretap channels of type ii"
    - "the wiretap channel with generalized feedback secure communication and key generation"
    - "secret key agreement general capacity and second order asymptotics"
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "coded cooperative data exchange for a secret key"

Connected through hyperedge HE-8 (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"
    - "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)