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: "coded cooperative data exchange for a secret key"
  Abstract: We consider a coded cooperative data exchange problem with the goal of generating a secret key. Specifically, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one, subject to the constraint that it remains private from an eavesdropper. #R##N#Although the problems are closely related, we prove that secret key generation with fewest number of linear transmissions is NP-hard, while it is known that the analogous problem in traditional cooperative data exchange can be solved in polynomial time. In doing this, we completely characterize the best possible performance of linear coding schemes, and also prove that linear codes can be strictly suboptimal. Finally, we extend the single-key results to characterize the minimum number of public transmissions required to generate a desired integer number of statistically independent secret keys.

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"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "one shot perfect secret key agreement for finite linear sources"):
  with members:
    - "multiterminal secret key agreement with nearly no discussion"
    - "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"
    - "on the optimality of secret key agreement via omniscience"
    - "secret key generation with limited interaction"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "efficient algorithms for the data exchange problem"

Connected through hyperedge HE-4 (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"
    - "perfect omniscience perfect secrecy and steiner tree packing"
    - "secret key generation for a pairwise independent network model"
    - "group secret key generation algorithms"

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

Connected through hyperedge HE-7 (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"
    - "common information and secret key capacity"
    - "perfect omniscience perfect secrecy and steiner tree packing"
    - "secret key generation for a pairwise independent network model"
    - "secret key agreement from correlated gaussian sources by rate limited public communication"

Connected through hyperedge HE-8 (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"
    - "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)