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 and private key constructions for simple multiterminal source models"
  Abstract: We propose an approach for constructing secret and private keys based on the long-known Slepian-Wolf code, due to Wyner, for correlated sources connected by a virtual additive noise channel. Our work is motivated by results of Csisz\'ar and Narayan which highlight innate connections between secrecy generation by multiple terminals that observe correlated source signals and Slepian-Wolf near-lossless data compression. Explicit procedures for such constructions and their substantiation are provided. The performance of low density parity check channel codes in devising a new class of secret keys is examined.

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"
    - "shannon meets nash on the interference channel"
    - "secret key generation for a pairwise independent network model"

Connected through hyperedge HE-2 (induced by source paper "universal hashing for information theoretic security"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "semantically secure coding scheme achieving the capacity of a gaussian wiretap channel"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "the complexity of estimating r enyi entropy"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap channel"

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:
    - "the secret key private key capacity region for three terminals"

Connected through hyperedge HE-5 (induced by source paper "on the simulatability condition in key generation over a non authenticated public channel"):
  with members:
    - "secret key generation for a pairwise independent network model"

Connected through hyperedge HE-6 (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-7 (induced by source paper "coded cooperative data exchange in multihop networks"):
  with members:
    - "coded cooperative data exchange problem for general topologies"
    - "on coding for cooperative data exchange"
    - "broadcasting with side information"

Connected through hyperedge HE-8 (induced by source paper "perfect omniscience perfect secrecy and steiner tree packing"):
  with members:
    - "secret key generation for a pairwise independent network model"
    - "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)