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: "secrecy via sources and channels"
  Abstract: Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. This problem of secret communication and secret-key generation when two resources are available-correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve which is independent of the sources is studied. The goal is to characterize the fundamental tradeoff between the rates of the secret message and secret key. An achievable solution and proof of its optimality for the parallel channels and sources case when each subchannel and source component satisfies a degradation order (either in favor of the legitimate receiver or the eavesdropper) is presented. This includes the case of jointly Gaussian sources and an additive Gaussian channel, for which the secrecy region is evaluated.

Connected through hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication"):
  with members:
    - "private authentication with physical identifiers through broadcast channel measurements"
    - "controllable identifier measurements for private authentication with secret keys"
    - "secure and reliable key agreement with physical unclonable functions"
    - "coding for positive rate in the source model key agreement problem"
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "privacy secrecy and storage with multiple noisy measurements of identifiers"
    - "converses for secret key agreement and secure computing"
    - "polar coding for secret key generation"

Connected through hyperedge HE-2 (induced by source paper "wiretap channels with causal state information revisited"):
  with members:
    - "wiretap channels with causal state information strong secrecy"
    - "semantically secured message key trade off over wiretap channels with random parameters"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "a stronger soft covering lemma and applications"

Connected through hyperedge HE-3 (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-4 (induced by source paper "a simplified coding scheme for the broadcast channel with complementary receiver side information under individual secrecy constraints"):
  with members:
    - "individual secrecy for broadcast channels with receiver side information"
    - "individual secrecy for the broadcast channel"
    - "brute force searching the typical set and guesswork"
    - "secret key generation using correlated sources and channels"
    - "the wiretap channel with feedback encryption over the channel"
    - "secret communication with feedback"

Connected through hyperedge HE-5 (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-6 (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"
    - "secret key agreement with channel state information at the transmitter"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-7 (induced by source paper "secret key generation from correlated sources and secure link"):
  with members:
    - "secret key generation over noisy channels with common randomness"
    - "secret key agreement with channel state information at the transmitter"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-8 (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"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "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"

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)