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: "compressed secret key agreement maximizing multivariate mutual information per bit"
  Abstract: The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out strongly correlated components in order to generate a common secret key. The objective is to maximize the achievable key rate as a function of the joint entropy of the compressed sources. Since the maximum achievable key rate captures the total amount of information mutual to the compressed sources, an optimal compression scheme essentially maximizes the multivariate mutual information per bit of randomness of the private sources, and can therefore be viewed more generally as a dimension reduction technique. Single-letter lower and upper bounds on the maximum achievable key rate are derived for the general source model, and an explicit polynomial-time computable formula is obtained for the pairwise independent network model. In particular, the converse results and the upper bounds are obtained from those of the related secret key agreement problem with rate-limited discussion. A precise duality is shown for the two-user case with one-way discussion, and such duality is extended to obtain the desired converse results in the multi-user case. In addition to posing new challenges in information processing and dimension reduction, the compressed secret key agreement problem helps shed new light on resolving the difficult problem of secret key agreement with rate-limited discussion by offering a more structured achieving scheme and some simpler conjectures to prove.

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"
    - "on the optimality of secret key agreement via omniscience"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"

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"
    - "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"
    - "incremental and decremental secret key agreement"

Connected through hyperedge HE-3 (induced by source paper "on the optimality of secret key agreement via omniscience"):
  with members:
    - "secret key agreement under discussion rate constraints"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
    - "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"

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)