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: "a one round key agreement protocol with information theoretic security"
  Abstract: Information-theoretic secure key agreement protocols do not use computational assumptions and will stay secure with future advances in computing technologies. We consider a setting where Alice and Bob have access to correlated variables, and use a public channel to interact and obtain a shared secret key. Efficiency of protocols in this setting is measured by the secret key rate which is asymptotically upper bounded by the secret key capacity of the setting. Recently a tight bound for key rate in finite length regime was derived and an optimal protocol that achieves the asymptotic and finite length bounds was proposed. The protocol, however, requires many rounds of interactions. In this paper, we propose a noninteractive protocol with optimal asymptotic and near-optimal finite length performance. We prove security and efficiency of the protocol and give a modified version of the protocol that significantly improves computation cost of the parties by sacrificing some of the key rate. We show how this trade-off is achievable by controlling the parameters of the system.

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.CR(Cryptography and Security)