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: "set monotonicity implies kelly strategyproofness"
  Abstract: This paper studies the strategic manipulation of set-valued social choice functions according to Kelly's preference extension, which prescribes that one set of alternatives is preferred to another if and only if all elements of the former are preferred to all elements of the latter. It is shown that set-monotonicity---a new variant of Maskin-monotonicity---implies Kelly-strategyproofness in comprehensive subdomains of the linear domain. Interestingly, there are a handful of appealing Condorcet extensions---such as the top cycle, the minimal covering set, and the bipartisan set---that satisfy set-monotonicity even in the unrestricted linear domain, thereby answering questions raised independently by Barber\`a (1977) and Kelly (1977).

Connected through hyperedge HE-1 (induced by source paper "optimal bounds for the no show paradox via sat solving"):
  with members:
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "welfare maximization entices participation"
    - "a sat attack on the erdos discrepancy conjecture"
    - "automated reasoning in social choice theory some remarks"
    - "complexity of mechanism design"
    - "automated search for impossibility theorems in social choice theory ranking sets of objects"
    - "equilibria of plurality voting with abstentions"

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.MA(Multiagent Systems)