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: "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
  Abstract: In the multiterminal source model of Csiszar and Narayan, the communication complexity, R SK , for secret key (SK) generation is the minimum rate of communication required to achieve SK capacity. An obvious upper bound to R SK  is given by R CO , which is the minimum rate of communication required for omniscience. In this paper we derive a better upper bound to R SK  for the hypergraphical source model, which is a special instance of the multiterminal source model. The upper bound is based on the idea of fractional removal of hyperedges. It is further shown that this upper bound can be computed in polynomial time. We conjecture that our upper bound is tight. For the special case of a graphical source model, we also give an explicit lower bound on R SK . This bound, however, is not tight, as demonstrated by a counterexample.

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 "multiterminal secret key agreement with nearly no discussion"):
  with members:
    - "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"
    - "secret key generation with limited interaction"
    - "info clustering a mathematical theory for data clustering"
    - "incremental and decremental secret key agreement"

Connected through hyperedge HE-3 (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"
    - "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"
    - "coded cooperative data exchange for a secret key"

Connected through hyperedge HE-4 (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"
    - "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"
    - "common information and secret key capacity"

Connected through hyperedge HE-5 (induced by source paper "secrecy capacity under limited discussion rate for minimally connected hypergraphical sources"):
  with members:
    - "secret key agreement under discussion rate constraints"
    - "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"
    - "secret key generation for a pairwise independent network model"

Connected through hyperedge HE-6 (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"
    - "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"
    - "incremental and decremental secret key agreement"

Connected through hyperedge HE-7 (induced by source paper "on the optimality of secret key agreement via omniscience"):
  with members:
    - "secret key agreement under discussion rate constraints"
    - "compressed secret key agreement maximizing multivariate mutual information per bit"
    - "duality between feature selection and data clustering"
    - "info clustering a mathematical theory for data clustering"
    - "incremental and decremental secret key agreement"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "the communication complexity of achieving sk capacity in a class of pin models"
    - "achieving sk capacity in the source model when must all terminals talk"

Connected through hyperedge HE-8 (induced by source paper "secret key agreement under discussion rate constraints"):
  with members:
    - "common randomness and 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"
    - "achieving sk capacity in the source model when must all terminals talk"
    - "common information and secret key capacity"
    - "perfect omniscience perfect secrecy and steiner tree packing"
    - "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)