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: "arbitrarily varying wiretap channels with type constrained states"
  Abstract: An arbitrarily varying wiretap channel (AVWTC) with a type constraint on the allowed state sequences is considered, and a single-letter characterization of its correlated-random (CR) assisted semantic-security (SS) capacity is derived. The allowed state sequences are the ones in a typical set around a single constraining type. SS is established by showing that the mutual information between the message and the eavesdropper's observations is negligible even when maximized over all message distributions, choices of state sequences and realizations of the CR-code. Both the achievability and the converse proofs of the type constrained coding theorem rely on stronger claims than actually required. The direct part establishes a novel single-letter lower bound on the CR-assisted SS-capacity of an AVWTC with state sequences constrained by any convex and closed set of state probability mass functions. This bound achieves the best known single-letter secrecy rates for a corresponding compound wiretap channel over the same constraint set. In contrast to other single-letter results in the AVWTC literature, this work does not assume the existence of a best channel to the eavesdropper. Instead, SS follows by leveraging the heterogeneous version of the stronger soft-covering lemma and a CR-code reduction argument. Optimality is a consequence of an max-inf upper bound on the CR-assisted SS-capacity of an AVWTC with state sequences constrained to any collection of type-classes. When adjusted to the aforementioned compound WTC, the upper bound simplifies to a max-min structure, thus strengthening the previously best known single-letter upper bound by Liang et al. that has a min-max form. The proof of the upper bound uses a novel distribution coupling argument.

Connected through hyperedge HE-1 (induced by source paper "the arbitrarily varying channel with colored gaussian noise"):
  with members:
    - "the capacity region of the arbitrarily varying mac with and without constraints"
    - "the arbitrarily varying relay channel"
    - "minimax theorems for finite blocklength lossy joint source channel coding over an avc"
    - "the arbitrarily varying gaussian relay channel with sender frequency division"
    - "communication over an arbitrarily varying channel under a state myopic encoder"
    - "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver"
    - "semi robust communications over a broadcast channel"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"

Connected through hyperedge HE-2 (induced by source paper "key and message semantic security over state dependent channels"):
  with members:
    - "exact soft covering exponent"
    - "wiretap channels with causal state information strong secrecy"
    - "semantically secured message key trade off over wiretap channels with random parameters"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "the likelihood encoder for lossy compression"
    - "secret key generation over noisy channels with common randomness"
    - "semantic security capacity for wiretap channels of type ii"
    - "informational divergence approximations to product distributions"

Connected through hyperedge HE-3 (induced by source paper "the arbitrarily varying relay channel"):
  with members:
    - "the capacity of the relay channel solution to cover s problem in the gaussian case"
    - "cut set bound is loose for gaussian relay networks"
    - "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"
    - "capacity approximations for gaussian relay networks"
    - "the arbitrarily varying multiple access channel with conferencing encoders"
    - "secure communication over parallel relay channel"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"

Connected through hyperedge HE-4 (induced by source paper "learning an adversary s actions for secret communication"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"
    - "a new wiretap channel model and its strong secrecy capacity"
    - "semantic security capacity for wiretap channels of type ii"
    - "list decoding random coding exponents and expurgated exponents"
    - "capacity results for arbitrarily varying wiretap channels"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"
    - "universal communication over arbitrarily varying channels"

Connected through hyperedge HE-5 (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"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "ramanujan graphs in polynomial time"
    - "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-6 (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"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "the benefit of a 1 bit jump start and the necessity of stochastic encoding in jamming channels"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"

Connected through hyperedge HE-7 (induced by source paper "active secure coding based on eavesdropper behavior learning"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "polar coding for the general wiretap channel"
    - "imperfect secrecy in wiretap channel ii"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "the arbitrarily varying gaussian relay channel with sender frequency division"):
  with members:
    - "the arbitrarily varying relay channel"
    - "a new coding paradigm for the primitive relay channel"
    - "cut set bound is loose for gaussian relay networks"
    - "capacity approximations for gaussian relay networks"

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)