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 manipulation bribery and campaign management in bucklin and fallback voting"
  Abstract: A central theme in computational social choice is to study the extent to which voting systems computationally resist manipulative attacks seeking to influence the outcome of elections, such as manipulation (i.e., strategic voting), control, and bribery. Bucklin and fallback voting are among the voting systems with the broadest resistance (i.e., NP-hardness) to control attacks. However, only little is known about their behavior regarding manipulation and bribery attacks. We comprehensively investigate the computational resistance of Bucklin and fallback voting for many of the common manipulation and bribery scenarios; we also complement our discussion by considering several campaign management problems for Bucklin and fallback.

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"
    - "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"
    - "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"
    - "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 "secure voting protocols with perfect ballot secrecy"):
  with members:
    - "protecting privacy through distributed computation in multi agent decision making"
    - "equilibria of plurality voting with abstentions"
    - "rational secret sharing and multiparty computation extended abstract"
    - "universal voting protocol tweaks to make manipulation hard"

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"
    - "campaign management under approval driven voting rules"
    - "properties of multiwinner voting rules"
    - "approximation algorithms for campaign management"

Connected through hyperedge HE-5 (induced by source paper "election with bribed voter uncertainty hardness and approximation algorithm"):
  with members:
    - "when the cookie meets the blockchain privacy risks of web payments via cryptocurrencies"
    - "possible winners in noisy 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"
    - "the complexity of manipulating k approval elections"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"
    - "how hard is bribery in elections"

Connected through hyperedge HE-6 (induced by source paper "manipulative elicitation a new attack on elections with incomplete preferences"):
  with members:
    - "on the exact amount of missing information that makes finding possible winners hard"
    - "elicitation for preferences single peaked on trees"
    - "preference elicitation for single crossing domain"
    - "query complexity of tournament solutions"
    - "complexity of manipulation with partial information in voting"
    - "estimating the margin of victory of an election using sampling"
    - "frugal bribery in voting"
    - "detecting possible manipulators in elections"

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 "campaign management under approval driven voting rules"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "prices matter for the parameterized complexity of shift bribery"
    - "are there any nicely structured preference profiles nearby"
    - "on the computation of fully proportional representation"
    - "weighted electoral control"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "normalized range voting broadly resists control"

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)