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: "automated search for impossibility theorems in social choice theory ranking sets of objects"
  Abstract: We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of objects. The key question in this area, which has important applications in social choice theory and decision making under uncertainty, is how to extend an agent's preferences over a number of objects to a preference relation over nonempty sets of such objects. Certain combinations of seemingly natural principles for this kind of preference extension can result in logical inconsistencies, which has led to a number of important impossibility theorems. We first prove a general result that shows that for a wide range of such principles, characterised by their syntactic form when expressed in a many-sorted first-order logic, any impossibility exhibited at a fixed (small) domain size will necessarily extend to the general case. We then show how to formulate candidates for impossibility theorems at a fixed domain size in propositional logic, which in turn enables us to automatically search for (general) impossibility theorems using a SAT solver. When applied to a space of 20 principles for preference extension familiar from the literature, this method yields a total of 84 impossibility theorems, including both known and nontrivial new results.

Connected through hyperedge HE-1 (induced by source paper "k majority digraphs and the hardness of voting with a constant number of voters"):
  with members:
    - "elections with few voters candidate control can be easy"
    - "a tournament of order 24 with two disjoint teq retentive sets"
    - "practical graph isomorphism ii"
    - "a richer understanding of the complexity of election systems"

Connected through hyperedge HE-2 (induced by source paper "condorcet s principle and the preference reversal paradox"):
  with members:
    - "optimal bounds for the no show paradox via sat solving"
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"

Connected through hyperedge HE-3 (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"
    - "set monotonicity implies kelly strategyproofness"
    - "equilibria of plurality voting with abstentions"

Connected through hyperedge HE-4 (induced by source paper "proving the incompatibility of efficiency and strategyproofness via smt solving"):
  with members:
    - "the impossibility of extending random dictatorship to weak preferences"
    - "optimal bounds for the no show paradox via sat solving"
    - "the computational complexity of random serial dictatorship"

Connected through hyperedge HE-5 (induced by source paper "an introduction to mechanized reasoning"):
  with members:
    - "automated reasoning in social choice theory some remarks"
    - "enabling automatic certification of online auctions"
    - "a qualitative comparison of the suitability of four theorem provers for basic auction theory"

Connected through hyperedge HE-6 (induced by source paper "a qualitative comparison of the suitability of four theorem provers for basic auction theory"):
  with members:
    - "the formare project formal mathematical reasoning in economics"
    - "isabelle jedit a prover ide within the pide framework"
    - "theorema 2 0 a graphical user interface for a mathematical assistant system"

Connected through hyperedge HE-7 (induced by source paper "the formare project formal mathematical reasoning in economics"):
  with members:
    - "a qualitative comparison of the suitability of four theorem provers for basic auction theory"
    - "the planetary project towards emath3 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.AI(Artificial Intelligence)