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: "weighted electoral control"
  Abstract: Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important natural settings. In this paper, we study the complexity of controlling the outcome of weighted elections through adding and deleting voters. We obtain polynomial-time algorithms, NP-completeness results, and for many NP-complete cases, approximation algorithms. In particular, for scoring rules we completely characterize the complexity of weighted voter control. Our work shows that for quite a few important cases, either polynomial-time exact algorithms or polynomial-time approximation algorithms exist.

Connected through hyperedge HE-1 (induced by source paper "selecting voting locations for fun and profit"):
  with members:
    - "a partisan districting protocol with provably nonpartisan outcomes"
    - "network based vertex dissolution"
    - "on voting and facility location"
    - "more natural models of electoral control by partition"
    - "combinatorial voter control in elections"
    - "how hard is bribery in elections"
    - "anyone but him the complexity of precluding an alternative"

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 "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-4 (induced by source paper "approval voting with intransitive preferences"):
  with members:
    - "algorithms for destructive shift bribery"
    - "complexity of shift bribery in committee elections"
    - "frugal bribery in voting"
    - "properties of multiwinner voting rules"
    - "how credible is the prediction of a party based election"
    - "justified representation in approval based committee voting"
    - "the control complexity of r approval from the single peaked case to the general case"
    - "the complexity of manipulating k approval elections"

Connected through hyperedge HE-5 (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"
    - "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 "weighted voting via no regret learning"):
  with members:
    - "online ranking with top 1 feedback"
    - "common voting rules as maximum likelihood estimators"
    - "how hard is bribery in elections"

Connected through hyperedge HE-7 (induced by source paper "high multiplicity election problems"):
  with members:
    - "the complexity of succinct elections"
    - "complexity dichotomies for unweighted scoring rules"
    - "a control dichotomy for pure scoring rules"
    - "polynomiality for bin packing with a constant number of item types"
    - "the complexity of online manipulation of sequential elections"
    - "complexity of and algorithms for borda manipulation"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"

Connected through hyperedge HE-8 (induced by source paper "complexity dichotomies for unweighted scoring rules"):
  with members:
    - "a control dichotomy for pure scoring rules"
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules"
    - "complexity of and algorithms for borda manipulation"
    - "where are the hard manipulation problems"
    - "towards a dichotomy of finding possible winners in elections based on scoring rules"
    - "how hard is bribery in elections"

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)