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: "rate regions of secret key sharing in a new source model"
  Abstract: A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via a public channel where three users can observe i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2 (the backward key strategy). In both situations, the goal is sharing a secret key between user 1 and user 3 while leaking no effective information about that key to user 2, and simultaneously, sharing another secret key between user 2 and user 3 while leaking no effective information about the latter key to user 1. This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. In this paper, for both the forward and backward key strategies, inner and outer bounds of secret key capacity regions are derived. In special situations where one of users 1 and 2 is only interested in wiretapping and not key sharing, our results agree with that of Ahlswede and Csiszar. Also, we investigate some special cases in which the inner bound coincides with the outer bound and secret key capacity region is deduced.

Connected through hyperedge HE-1 (induced by source paper "secret key generation through a relay"):
  with members:
    - "common randomness and key generation with limited interaction"
    - "secure communication via an untrusted non regenerative relay in fading channels"
    - "on secure source coding with side information at the encoder"
    - "common information and secret key capacity"
    - "strongly secure communications over the two way wiretap channel"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "secret key agreement from correlated gaussian sources by rate limited public communication"
    - "multiterminal source coding with complementary delivery"

Connected through hyperedge HE-2 (induced by source paper "strong secrecy in pairwise key agreement over a generalized multiple access channel"):
  with members:
    - "achievability proof via output statistics of random binning"
    - "strongly secure communications over the two way wiretap channel"
    - "strong secrecy from channel resolvability"
    - "secret key generation for a pairwise independent network model"
    - "the secret key private key capacity region for three terminals"

Connected through hyperedge HE-3 (induced by source paper "pairwise secret key agreement based on location derived common randomness"):
  with members:
    - "secret key generation for a pairwise independent network model"
    - "the secret key private key capacity region for three terminals"

Connected through hyperedge HE-4 (induced by source paper "a new secret key agreement scheme in a four terminal network"):
  with members:
    - "the secrecy rate region of the broadcast channel"
    - "group secret key generation algorithms"
    - "the secret key private key capacity region for three terminals"

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)