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: "the secret key private key capacity region for three terminals"
  Abstract: We consider a model for secrecy generation, with three terminals, by means of public interterminal communication, and examine the problem of characterizing all the rates at which all three terminals can generate a ``secret key,'' and -- simultaneously -- two designated terminals can generate a ``private key'' which is effectively concealed from the remaining terminal; both keys are also concealed from an eavesdropper that observes the public communication. Inner and outer bounds for the ``secret key--private key capacity region'' are derived. Under a certain special condition, these bounds coincide to yield the (exact) secret key--private key capacity region.

Connected through hyperedge HE-1 (induced by source paper "secret key generation in many to one networks an integrated game theoretic and information theoretic approach"):
  with members:
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "the capacity region of the source type model for secret key and private key generation"
    - "polar coding for secret key generation"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "a game theoretic view of the interference channel impact of coordination and bargaining"
    - "a constrained evolutionary gaussian multiple access channel game"
    - "secret key and private key constructions for simple multiterminal source models"
    - "shannon meets nash on the interference channel"

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"
    - "rate regions of secret key sharing in a new source model"
    - "secret key generation for a pairwise independent network model"

Connected through hyperedge HE-3 (induced by source paper "pairwise secret key agreement based on location derived common randomness"):
  with members:
    - "rate regions of secret key sharing in a new source model"
    - "secret key generation for a pairwise independent network model"

Connected through hyperedge HE-4 (induced by source paper "the capacity region of the source type model for secret key and private key generation"):
  with members:
    - "secret key and private key constructions for simple multiterminal source models"

Connected through hyperedge HE-5 (induced by source paper "polar coding for secret key generation"):
  with members:
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "universal source polarization and an application to a multi user problem"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "secure biometrics concepts authentication architectures and challenges"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "strong coordination with polar codes"
    - "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"

Connected through hyperedge HE-6 (induced by source paper "separation of reliability and secrecy in rate limited secret key generation"):
  with members:
    - "polar coding for secret key generation"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "non asymptotic analysis of privacy amplification via renyi entropy and inf spectral entropy"
    - "rate compatible protocol for information reconciliation an application to qkd"
    - "efficient reconciliation protocol for discrete variable quantum key distribution"
    - "reconciliation of a quantum distributed gaussian key"

Connected through hyperedge HE-7 (induced by source paper "a new secret key agreement scheme in a four terminal network"):
  with members:
    - "rate regions of secret key sharing in a new source model"
    - "the secrecy rate region of the broadcast channel"
    - "group secret key generation algorithms"

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)