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: "group secret key generation algorithms"
  Abstract: We consider a pair-wise independent network where every pair of terminals in the network observes a common pair-wise source that is independent of all the sources accessible to the other pairs. We propose a method for secret key agreement in such a network that is based on well-established point-to-point techniques and repeated application of the one-time pad. Three specific problems are investigated. 1) Each terminal's observations are correlated only with the observations of a central terminal. All these terminals wish to generate a common secret key. 2) In a pair-wise independent network, two designated terminals wish to generate a secret key with the help of other terminals. 3) All the terminals in a pair-wise independent network wish to generate a common secret key. A separate protocol for each of these problems is proposed. Furthermore, we show that the protocols for the first two problems are optimal and the protocol for the third problem is efficient, in terms of the resulting secret key rates.

Connected through hyperedge HE-1 (induced by source paper "part i improving computational efficiency of communication for omniscience"):
  with members:
    - "part ii a practical approach for successive omniscience"
    - "improving computational efficiency of communication for omniscience and successive omniscience"
    - "secret key agreement under discussion rate constraints"
    - "a faster algorithm for asymptotic communication for omniscience"
    - "info clustering a mathematical theory for data clustering"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "efficient algorithms for the data exchange problem"
    - "coded cooperative data exchange in multihop networks"

Connected through hyperedge HE-2 (induced by source paper "wiretap secret key capacity of tree pin"):
  with members:
    - "secrecy capacity under limited discussion rate for minimally connected hypergraphical sources"
    - "secret key agreement under discussion rate constraints"
    - "on the optimality of secret key agreement via omniscience"
    - "the private key capacity of a cooperative pairwise independent network"
    - "the communication complexity of achieving sk capacity in a class of pin models"
    - "coded cooperative data exchange for a secret key"
    - "perfect omniscience perfect secrecy and steiner tree packing"
    - "secret key generation for a pairwise independent network model"

Connected through hyperedge HE-3 (induced by source paper "group secret key generation using algebraic rings in wireless networks"):
  with members:
    - "insider attacks on physical layer group secret key generation in wireless networks"
    - "secret key generation from gaussian sources using lattice hashing"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "information theoretically secret key generation for fading wireless channels"

Connected through hyperedge HE-4 (induced by source paper "group secret key generation using algebraic rings in three user wireless networks"):
  with members:
    - "insider attacks on physical layer group secret key generation in wireless networks"
    - "the effect of eavesdropper s statistics in experimental wireless secret key generation"
    - "secret key generation from gaussian sources using lattice hashing"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "information theoretically secret key generation for fading wireless channels"
    - "two hop secure communication using an untrusted relay"

Connected through hyperedge HE-5 (induced by source paper "channel whispering a protocol for physical layer group key generation application to ir uwb through deconvolution"):
  with members:
    - "cooperative secret key generation from phase estimation in narrowband fading channels"

Connected through hyperedge HE-6 (induced by source paper "the private key capacity of a cooperative pairwise independent network"):
  with members:
    - "the capacity region of the source type model for secret key and private key generation"
    - "cooperative secret key generation from phase estimation in narrowband fading channels"
    - "secret key generation for a pairwise independent network model"
    - "information theoretically secret key generation for fading wireless channels"

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

Connected through hyperedge HE-8 (induced by source paper "perfect omniscience perfect secrecy and steiner tree packing"):
  with members:
    - "secret key and private key constructions for simple multiterminal source models"
    - "secret key generation for a pairwise independent network model"

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)