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: "multivariate complexity analysis of swap bribery"
  Abstract: We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swapping the positions of two consecutive candidates in his preference ranking. The question is whether it is possible, without exceeding a given budget, to bribe the voters in a way that the preferred candidate wins in the election.

Connected through hyperedge HE-1 (induced by source paper "optimal bribery in voting"):
  with members:
    - "a unifying framework for manipulation problems"
    - "on the hardness of bribery variants in voting with cp nets"
    - "complexity of shift bribery in committee elections"
    - "prices matter for the parameterized complexity of shift bribery"
    - "frugal bribery in voting"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "approximation algorithms for campaign management"

Connected through hyperedge HE-2 (induced by source paper "local distance restricted bribery in voting"):
  with members:
    - "a unifying framework for manipulation problems"
    - "algorithms for destructive shift bribery"
    - "on the hardness of bribery variants in voting with cp nets"
    - "complexity of shift bribery in committee elections"
    - "prices matter for the parameterized complexity of shift bribery"
    - "frugal bribery in voting"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "determining possible and necessary winners under common voting rules given partial orders"

Connected through hyperedge HE-3 (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"
    - "campaign management under approval driven voting rules"
    - "properties of multiwinner voting rules"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"

Connected through hyperedge HE-4 (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-5 (induced by source paper "combinatorial n fold integer programming and applications"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "on integer programming and convolution"
    - "scheduling meets n fold integer programming"
    - "the complexity landscape of decompositional parameters for ilp"
    - "proximity results and faster algorithms for integer programming using the steinitz lemma"
    - "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity"
    - "voting and bribing in single exponential time"
    - "about the structure of the integer cone and its application to bin packing"

Connected through hyperedge HE-6 (induced by source paper "robustness among multiwinner voting rules"):
  with members:
    - "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain"
    - "very hard electoral control problems"
    - "distributed monitoring of election winners"
    - "committee scoring rules axiomatic characterization and hierarchy"
    - "algorithms for destructive shift bribery"
    - "the condorcet principle for multiwinner elections from shortlisting to proportionality"
    - "towards computing victory margins in stv elections"
    - "voting and bribing in single exponential time"

Connected through hyperedge HE-7 (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"
    - "campaign management under approval driven voting rules"
    - "properties of multiwinner voting rules"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "justified representation in approval based committee voting"

Connected through hyperedge HE-8 (induced by source paper "parameterized resiliency problems via integer linear programming"):
  with members:
    - "combinatorial n fold integer programming and applications"
    - "a multivariate approach for checking resiliency in access control"
    - "an approach to parameterized resiliency problems using integer linear programming"
    - "the online disjoint set cover problem and its applications"
    - "parameterized integer quadratic programming variables and coefficients"
    - "polynomial kernels for weighted problems"
    - "a structural approach to kernels for ilps treewidth and total unimodularity"
    - "the parameterized complexity of reasoning problems beyond np"

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.CC(Computational Complexity)