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: "on the hardness of bribery variants in voting with cp nets"
  Abstract: We continue previous work by Mattei et al. (Ann. Math. Artif. Intell. 1042 68(1---3), 135---160 2013) in which they study the computational complexity of bribery schemes when voters have conditional preferences modeled as CP-nets. For most of the cases they considered, they showed that the bribery problem is solvable in polynomial time. Some cases remained open--we solve several of them and extend the previous results to the case that voters are weighted. Additionally, we consider negative (weighted) bribery in CP-nets, when the briber is not allowed to pay voters to vote for his preferred candidate.

Connected through hyperedge HE-1 (induced by source paper "optimal bribery in voting"):
  with members:
    - "a unifying framework for manipulation problems"
    - "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"
    - "multivariate complexity analysis of swap bribery"

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"
    - "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-3 (induced by source paper "algorithms for destructive shift bribery"):
  with members:
    - "robustness among multiwinner voting rules"
    - "voting and bribing in single exponential time"
    - "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"
    - "approximation algorithms for campaign management"

Connected through hyperedge HE-4 (induced by source paper "frugal bribery in voting"):
  with members:
    - "complexity of manipulation with partial information in voting"
    - "prices matter for the parameterized complexity of shift bribery"
    - "campaign management under approval driven voting rules"
    - "kernelization complexity of possible winner and coalitional manipulation problems in voting"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "dominating manipulations in voting with partial information"
    - "complexity of and algorithms for borda manipulation"
    - "multimode control attacks on elections"

Connected through hyperedge HE-5 (induced by source paper "often harder than in the constructive case destructive bribery in cp nets"):
  with members:
    - "how hard is bribery in elections"
    - "a richer understanding of the complexity of election systems"
    - "anyone but him the complexity of precluding an alternative"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"
    - "how many candidates are needed to make elections hard to manipulate"
    - "complexity of manipulating elections with few candidates"

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)