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: "the efficient frontier in randomized social choice"
  Abstract: Since the celebrated Gibbard-Satterthwaite impossibility results and Gibbard’s 1977 extension for randomized rules, it is known that strategyproofness imposes severe restrictions on the design of social choice rules. In this paper, we employ approximate strategyproofness and the notion of score deficit to study the possible and necessary trade-offs between strategyproofness and efficiency in the randomized social choice domain. In particular, we analyze which social choice rules make optimal trade-offs, i.e., we analyze the efficient frontier. Our main result is that the efficient frontier consists of two building blocks: (1) we identify a finite set of ‘‘manipulability bounds’’ B and the rules that are optimal at each of them; (2) for all other bounds not in B, we show that the optimal rules at those bounds are mixtures of two rules that are optimal at the two nearest manipulability bounds from B. We provide algorithms that exploit this structure to identify the entire efficient frontier for any given scoring function. Finally, we provide applications of our results to illustrate the structure of the efficient frontier for the scoring functions v 1; 0; 0 and v 1; 1; 0 .

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.GT(Computer Science and Game Theory)