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: "elections with few voters candidate control can be easy"
  Abstract: We study the computational complexity of candidate control in elections with few voters (that is, we take the number of voters as a parameter). We consider both the standard scenario of adding and deleting candidates, where one asks if a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding/deleting some candidates, and a combinatorial scenario where adding/deleting a candidate automatically means adding/deleting a whole group of candidates. Our results show that the parameterized complexity of candidate control (with the number of voters as the parameter) is much more varied than in the setting with many voters.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting"):
  with members:
    - "monotonicity axioms in approval based multi winner voting rules"
    - "complexity of shift bribery in committee elections"
    - "structure in dichotomous preferences"
    - "election attacks with few candidates"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-2 (induced by source paper "a parameterized perspective on protecting elections"):
  with members:
    - "optimal bribery in voting"
    - "manipulative elicitation a new attack on elections with incomplete preferences"
    - "on the exact amount of missing information that makes finding possible winners hard"
    - "complexity of manipulation with partial information in voting"
    - "frugal bribery in voting"
    - "detecting possible manipulators in elections"
    - "kernelization complexity of possible winner and coalitional manipulation problems in voting"
    - "more natural models of electoral control by partition"

Connected through hyperedge HE-3 (induced by source paper "persuading voters it s easy to whisper it s hard to speak loud"):
  with members:
    - "on the tractability of public persuasion with no externalities"
    - "defending elections against malicious spread of misinformation"
    - "controlling elections through social influence"
    - "algorithmic persuasion with no externalities"
    - "computational aspects of private bayesian persuasion"
    - "algorithmic bayesian persuasion"
    - "hardness results for signaling in bayesian zero sum and network routing games"
    - "honest signaling in zero sum games is hard and lying is even harder"

Connected through hyperedge HE-4 (induced by source paper "defending elections against malicious spread of misinformation"):
  with members:
    - "introduction to online convex optimization"
    - "stochastic submodular maximization the case of coverage functions"
    - "equilibrium computation and robust optimization in zero sum games with submodular structure"
    - "gradient methods for submodular maximization"
    - "robust budget allocation via continuous submodular functions"
    - "multimode control attacks on elections"

Connected through hyperedge HE-5 (induced by source paper "on the computational complexity of variants of combinatorial voter control in elections"):
  with members:
    - "parameterized algorithmics for computational social choice nine research challenges"
    - "combinatorial voter control in elections"
    - "weighted electoral control"
    - "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"
    - "multimode control attacks on elections"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-6 (induced by source paper "k majority digraphs and the hardness of voting with a constant number of voters"):
  with members:
    - "a tournament of order 24 with two disjoint teq retentive sets"
    - "practical graph isomorphism ii"
    - "automated search for impossibility theorems in social choice theory ranking sets of objects"
    - "a richer understanding of the complexity of election systems"

Connected through hyperedge HE-7 (induced by source paper "the complexity of multiwinner voting rules with variable number of winners"):
  with members:
    - "properties of multiwinner voting rules"
    - "computational aspects of multi winner approval voting"
    - "on the computation of fully proportional representation"
    - "the complexity of probabilistic lobbying"

Connected through hyperedge HE-8 (induced by source paper "controlling elections through social influence"):
  with members:
    - "robust influence maximization"
    - "sketch based influence maximization and computation scaling up with guarantees"
    - "influence maximization in continuous time diffusion networks"

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)