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 key agreement with channel state information at the transmitter"
  Abstract: We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter, the legitimate receiver, and the eavesdropper are connected by a discrete memoryless wiretap channel with a memoryless state sequence. The transmitter and the legitimate receiver generate a secret-key that must be concealed from the eavesdropper. We assume that the state sequence is known noncausally to the transmitter and no public discussion channel is available. We derive lower and upper bounds on the secret-key capacity. The lower bound involves a source-channel codebook for constructing a common reconstruction sequence at the legitimate terminals and then mapping this sequence to a secret-key using a secret-key codebook. For the special case of Gaussian channels with additive interference (secret-keys from dirty paper channel) our bounds differ by 0.5 bit/symbol and coincide in the high signal-to-noise-ratio and high interference-to-noise-ratio regimes. In another special case-symmetric channel state information (CSI)-when the legitimate receiver is also revealed the state sequence, we establish optimality of our lower bound. In addition, only causal side information at the transmitter and the receiver suffices to attain the secret-key capacity in the case of symmetric CSI.

Connected through hyperedge HE-1 (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"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"

Connected through hyperedge HE-2 (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"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "semantically secured message key trade off over wiretap channels with random parameters"):
  with members:
    - "wiretap channels with causal state information strong secrecy"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "informational divergence approximations to product distributions"
    - "secret key generation using correlated sources and channels"

Connected through hyperedge HE-4 (induced by source paper "wiretap channels with causal state information strong secrecy"):
  with members:
    - "semantically secured message key trade off over wiretap channels with random parameters"
    - "wiretap channels with random states non causally available at the encoder"
    - "secrecy via sources and channels"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-5 (induced by source paper "secret key generation from correlated sources and secure link"):
  with members:
    - "secret key generation over noisy channels with common randomness"
    - "secrecy via sources and channels"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-6 (induced by source paper "finite state multiple access wiretap channel with delayed feedback"):
  with members:
    - "finite state markov wiretap channel with delayed feedback"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-7 (induced by source paper "wiretap channels with random states non causally available at the encoder"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "strong secrecy for cooperative broadcast channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "renyi divergence and kullback leibler divergence"
    - "distributed channel synthesis"
    - "secret key generation using correlated sources and channels"
    - "a cryptographic treatment of the wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "group secret key agreement over state dependent wireless broadcast channels"):
  with members:
    - "secret communication over broadcast erasure channels with state feedback"
    - "wireless network information flow a deterministic approach"
    - "exchanging secrets without using cryptography"
    - "mapel achieving global optimality for a non convex wireless power control problem"

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)