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 generation for a pairwise independent network model"
  Abstract: We consider secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then allowed to communicate publicly with all such communication being observed by all the terminals. The objective is to generate a secret key shared by a given subset of terminals at the largest rate possible, with the cooperation of any remaining terminals. Secrecy is required from an eavesdropper that has access to the public interterminal communication. A (single-letter) formula for secret key capacity brings out a natural connection between the problem of secret key generation and a combinatorial problem of maximal packing of Steiner trees in an associated multigraph. An explicit algorithm is proposed for secret key generation based on a maximal packing of Steiner trees in a multigraph; the corresponding maximum rate of Steiner tree packing is thus a lower bound for the secret key capacity. When only two of the terminals or when all the terminals seek to share a secret key, the mentioned algorithm achieves secret key capacity in which case the bound is tight.

Connected through hyperedge HE-1 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion"):
  with members:
    - "multiterminal secret key agreement with nearly no discussion"
    - "one shot perfect secret key agreement for finite linear sources"
    - "secrecy capacity under limited discussion rate for minimally connected hypergraphical sources"
    - "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources"
    - "multiterminal secret key agreement at asymptotically zero discussion rate"
    - "secret key agreement under discussion rate constraints"
    - "compressed secret key agreement maximizing multivariate mutual information per bit"
    - "on the optimality of secret key agreement via omniscience"

Connected through hyperedge HE-2 (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-3 (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"
    - "group secret key generation algorithms"

Connected through hyperedge HE-4 (induced by source paper "secret key generation for minimally connected hypergraphical sources"):
  with members:
    - "secrecy capacity under limited discussion rate for minimally connected hypergraphical sources"
    - "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources"
    - "secret key agreement under discussion rate constraints"
    - "on the optimality of secret key agreement via omniscience"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
    - "secret key generation with limited interaction"
    - "info clustering a mathematical theory for data clustering"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"

Connected through hyperedge HE-5 (induced by source paper "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources"):
  with members:
    - "multiterminal secret key agreement at asymptotically zero discussion rate"
    - "secret key agreement under discussion rate constraints"
    - "on the optimality of secret key agreement via omniscience"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
    - "secret key generation with limited interaction"
    - "incremental and decremental secret key agreement"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "coded cooperative data exchange for a secret key"

Connected through hyperedge HE-6 (induced by source paper "multiterminal secret key agreement at asymptotically zero discussion rate"):
  with members:
    - "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources"
    - "secret key agreement under discussion rate constraints"
    - "common randomness and key generation with limited interaction"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "coded cooperative data exchange for a secret key"
    - "common information and secret key capacity"
    - "perfect omniscience perfect secrecy and steiner tree packing"
    - "secret key agreement from correlated gaussian sources by rate limited public communication"

Connected through hyperedge HE-7 (induced by source paper "secrecy capacity under limited discussion rate for minimally connected hypergraphical sources"):
  with members:
    - "secret key agreement under discussion rate constraints"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
    - "secret key generation with limited interaction"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "coded cooperative data exchange for a secret key"
    - "common information and secret key capacity"
    - "perfect omniscience perfect secrecy and steiner tree packing"

Connected through hyperedge HE-8 (induced by source paper "compressed secret key agreement maximizing multivariate mutual information per bit"):
  with members:
    - "secret key agreement under discussion rate constraints"
    - "opening the black box of deep neural networks via information"
    - "on the optimality of secret key agreement via omniscience"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
    - "duality between feature selection and data clustering"
    - "a lattice coding scheme for secret key generation from gaussian markov tree sources"
    - "common randomness and key generation with limited interaction"
    - "info clustering a mathematical theory for data clustering"

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)