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: "complexity of shift bribery in committee elections"
  Abstract: We study the (parameterized) complexity of SHIFT BRIBERY for multiwinner voting rules. We focus on SNTV, Bloc, k-Borda, and Chamberlin-Courant, as well as on approximate variants of Chamberlin-Courant, since the original rule is NP-hard to compute. We show that SHIFT BRIBERY tends to be significantly harder in the multiwinner setting than in the single-winner one by showing settings where SHIFT BRIBERY is easy in the single-winner cases, but is hard (and hard to approximate) in the multiwinner ones. Moreover, we show that the non-monotonicity of those rules which are based on approximation algorithms for the Chamberlin-Courant rule sometimes affects the complexity of SHIFT BRIBERY.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting"):
  with members:
    - "monotonicity axioms in approval based multi winner voting rules"
    - "structure in dichotomous preferences"
    - "elections with few voters candidate control can be easy"
    - "election attacks with few candidates"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-2 (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"
    - "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-3 (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"
    - "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-4 (induced by source paper "election control with voters uncertainty hardness and approximation results"):
  with members:
    - "vote for me election control via social influence in arbitrary scoring rule voting systems"
    - "election campaigning on social media politicians audiences and the mediation of political communication on facebook and twitter"
    - "election with bribed voter uncertainty hardness and approximation algorithm"
    - "disinformation and social bot operations in the run up to the 2017 french presidential election"
    - "controlling elections through social influence"
    - "almost polynomial ratio eth hardness of approximating densest k subgraph"
    - "minority becomes majority in social networks"
    - "determining possible and necessary winners under common voting rules given partial orders"

Connected through hyperedge HE-5 (induced by source paper "exploiting social influence to control elections based on scoring rules"):
  with members:
    - "defending elections against malicious spread of misinformation"
    - "disinformation and social bot operations in the run up to the 2017 french presidential election"
    - "controlling elections through social influence"
    - "influence maximization near optimal time complexity meets practical efficiency"
    - "minority becomes majority in social networks"
    - "anyone but him the complexity of precluding an alternative"

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 "approval voting with intransitive preferences"):
  with members:
    - "algorithms for destructive shift bribery"
    - "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"
    - "weighted electoral control"
    - "the complexity of manipulating k approval elections"

Connected through hyperedge HE-8 (induced by source paper "prices matter for the parameterized complexity of shift bribery"):
  with members:
    - "parliamentary voting procedures agenda control manipulation and uncertainty"
    - "campaign management under approval driven voting rules"
    - "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.AI(Artificial Intelligence)