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: "multimode control attacks on elections"
  Abstract: In 1992, Bartholdi, Tovey, and Trick opened the study of control attacks on elections---attempts to improve the election outcome by such actions as adding/deleting candidates or voters. That work has led to many results on how algorithms can be used to find attacks on elections and how complexity-theoretic hardness results can be used as shields against attacks. However, all the work in this line has assumed that the attacker employs just a single type of attack. In this paper, we model and study the case in which the attacker launches a multipronged (i.e., multimode) attack. We do so to more realistically capture the richness of real-life settings. For example, an attacker might simultaneously try to suppress some voters, attract new voters into the election, and introduce a spoiler candidate. Our model provides a unified framework for such varied attacks, and by constructing polynomial-time multiprong attack algorithms we prove that for various election systems even such concerted, flexible attacks can be perfectly planned in deterministic polynomial time.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates"
    - "structure in dichotomous preferences"
    - "the control complexity of r approval from the single peaked case to the general case"
    - "on the computation of fully proportional representation"
    - "the complexity of fully proportional representation for single crossing electorates"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "the complexity of manipulating k approval elections"

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"
    - "elections with few voters candidate control can be easy"
    - "detecting possible manipulators in elections"
    - "kernelization complexity of possible winner and coalitional manipulation problems in voting"

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 "attacking power indices by manipulating player reliability"):
  with members:
    - "h α an index to quantify an individual s scientific leadership"
    - "prestige drives epistemic inequality in the diffusion of scientific ideas"
    - "hiding individuals and communities in a social network"
    - "game theoretic network centrality a review"
    - "cooperative games with bounded dependency degree"
    - "efficient computation of the shapley value for game theoretic network centrality"
    - "solving cooperative reliability games"
    - "false name manipulations in weighted voting games"

Connected through hyperedge HE-5 (induced by source paper "election with bribed voter uncertainty hardness and approximation algorithm"):
  with members:
    - "when the cookie meets the blockchain privacy risks of web payments via cryptocurrencies"
    - "possible winners in noisy elections"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules"
    - "the complexity of manipulating k approval elections"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"
    - "how hard is bribery in elections"

Connected through hyperedge HE-6 (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"
    - "elections with few voters candidate control can be easy"

Connected through hyperedge HE-7 (induced by source paper "mixed integer programming with convex concave constraints fixed parameter tractability and applications to multicovering and voting"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "fair knapsack"
    - "scheduling meets n fold integer programming"
    - "evaluating and tuning n fold integer programming"
    - "combinatorial n fold integer programming and applications"
    - "integer programming in parameterized complexity three miniatures"
    - "solving integer linear programs with a small number of global variables and constraints"

Connected through hyperedge HE-8 (induced by source paper "on the computational complexity of variants of combinatorial voter control in elections"):
  with members:
    - "elections with few voters candidate control can be easy"
    - "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"
    - "anyone but him the complexity of precluding an alternative"

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)