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: "the complexity of probabilistic lobbying"
  Abstract: We propose models for lobbying in a probabilistic environment, in which an actor (called "The Lobby") seeks to influence voters' preferences of voting for or against multiple issues when the voters' preferences are represented in terms of probabilities. In particular, we provide two evaluation criteria and two bribery methods to formally describe these models, and we consider the resulting forms of lobbying with and without issue weighting. We provide a formal analysis for these problems of lobbying in a stochastic environment, and determine their classical and parameterized complexity depending on the given bribery/evaluation criteria and on various natural parameterizations. Specifically, we show that some of these problems can be solved in polynomial time, some are NP-complete but fixed-parameter tractable, and some are W[2]-complete. Finally, we provide approximability and inapproximability results for these problems and several variants.

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 "manipulating elections by selecting issues"):
  with members:
    - "hotelling downs model with limited attraction"
    - "randomized social choice functions under metric preferences"
    - "normalized range voting broadly resists control"
    - "control complexity in fallback voting"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"
    - "how hard is bribery in elections"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-3 (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"
    - "campaign management under approval driven voting rules"
    - "the constant inapproximability of the parameterized dominating set problem"
    - "how hard is bribery in elections"

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"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"

Connected through hyperedge HE-5 (induced by source paper "the complexity of multiwinner voting rules with variable number of winners"):
  with members:
    - "properties of multiwinner voting rules"
    - "elections with few voters candidate control can be easy"
    - "computational aspects of multi winner approval voting"
    - "on the computation of fully proportional representation"

Connected through hyperedge HE-6 (induced by source paper "frugal bribery in voting"):
  with members:
    - "complexity of manipulation with partial information in voting"
    - "on the hardness of bribery variants in voting with cp nets"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "cloning in elections finding the possible winners"):
  with members:
    - "campaign management under approval driven voting rules"
    - "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"
    - "clone structures in voters preferences"
    - "multimode control attacks on elections"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "determining possible and necessary winners under common voting rules given partial orders"):
  with members:
    - "common voting rules as maximum likelihood estimators"
    - "new candidates welcome possible winners with respect to the addition of new candidates"
    - "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"
    - "manipulating tournaments in cup and round robin competitions"
    - "eliciting single peaked preferences using comparison queries"
    - "dichotomy for voting systems"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

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)