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: "campaign management under approval driven voting rules"
  Abstract: Approval-like voting rules, such as Sincere-Strategy Preference-Based Approval voting (SP-AV), the Bucklin rule (an adaptive variant of $k$-Approval voting), and the Fallback rule (an adaptive variant of SP-AV) have many desirable properties: for example, they are easy to understand and encourage the candidates to choose electoral platforms that have a broad appeal. In this paper, we investigate both classic and parameterized computational complexity of electoral campaign management under such rules. We focus on two methods that can be used to promote a given candidate: asking voters to move this candidate upwards in their preference order or asking them to change the number of candidates they approve of. We show that finding an optimal campaign management strategy of the first type is easy for both Bucklin and Fallback. In contrast, the second method is computationally hard even if the degree to which we need to affect the votes is small. Nevertheless, we identify a large class of scenarios that admit fixed-parameter tractable algorithms.

Connected through hyperedge HE-1 (induced by source paper "approximation and hardness of shift bribery"):
  with members:
    - "from gap eth to fpt inapproximability clique dominating set and more"
    - "almost polynomial ratio eth hardness of approximating densest k subgraph"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "prices matter for the parameterized complexity of shift bribery"
    - "the constant inapproximability of the parameterized dominating set problem"
    - "the complexity of probabilistic lobbying"
    - "how hard is bribery in elections"

Connected through hyperedge HE-2 (induced by source paper "committee selection with attribute level preferences"):
  with members:
    - "proportional approval method using squared loads approval removal and coin flip approval transformation pamsac a new system of proportional representation using approval voting"
    - "multi attribute proportional representation"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-3 (induced by source paper "the complexity of online bribery in sequential elections"):
  with members:
    - "equilibria of plurality voting with abstentions"
    - "dichotomy for voting systems"

Connected through hyperedge HE-4 (induced by source paper "algorithms for destructive shift bribery"):
  with members:
    - "robustness among multiwinner voting rules"
    - "voting and bribing in single exponential time"
    - "on the hardness of bribery variants in voting with cp nets"
    - "prices matter for the parameterized complexity of shift bribery"
    - "estimating the margin of victory of an election using sampling"
    - "properties of multiwinner voting rules"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "approximation algorithms for campaign management"

Connected through hyperedge HE-5 (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-6 (induced by source paper "complexity of shift bribery in committee elections"):
  with members:
    - "algorithms for destructive shift bribery"
    - "the condorcet principle for multiwinner elections from shortlisting to proportionality"
    - "robustness among multiwinner voting rules"
    - "prices matter for the parameterized complexity of shift bribery"
    - "properties of multiwinner voting rules"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-7 (induced by source paper "on the hardness of bribery variants in voting with cp nets"):
  with members:
    - "k best enumeration"
    - "how hard is it to control an election by breaking ties"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"
    - "approximation algorithms for campaign management"
    - "multivariate complexity analysis of swap bribery"
    - "how hard is bribery in elections"
    - "a richer understanding of the complexity of election systems"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

Connected through hyperedge HE-8 (induced by source paper "prices matter for the parameterized complexity of shift bribery"):
  with members:
    - "complexity of shift bribery in committee elections"
    - "parliamentary voting procedures agenda control manipulation and uncertainty"
    - "elections with few voters candidate control can be easy"
    - "parameterized algorithmics for computational social choice nine research challenges"
    - "combinatorial voter control in elections"
    - "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"
    - "multimode control attacks on 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)