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: "how hard is bribery in elections"
  Abstract: We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voters a specified candidate can be made the election's winner? We study this problem for election systems as varied as scoring protocols and Dodgson voting, and in a variety of settings regarding homogeneous-vs.-nonhomogeneous electorate bribability, bounded-size-vs.-arbitrary-sized candidate sets, weighted-vs.-unweighted voters, and succinct-vs.-nonsuccinct input specification. We obtain both polynomial-time bribery algorithms and proofs of the intractability of bribery, and indeed our results show that the complexity of bribery is extremely sensitive to the setting. For example, we find settings in which bribery is NP-complete but manipulation (by voters) is in P, and we find settings in which bribing weighted voters is NP-complete but bribing voters with individual bribe thresholds is in P. For the broad class of elections (including plurality, Borda, k-approval, and veto) known as scoring protocols, we prove a dichotomy result for bribery of weighted voters: We find a simple-to-evaluate condition that classifies every case as either NP-complete or in P.

Connected through hyperedge HE-1 (induced by source paper "selecting voting locations for fun and profit"):
  with members:
    - "a partisan districting protocol with provably nonpartisan outcomes"
    - "network based vertex dissolution"
    - "on voting and facility location"
    - "more natural models of electoral control by partition"
    - "combinatorial voter control in elections"
    - "weighted electoral control"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-2 (induced by source paper "aggregating votes with local differential privacy usefulness soundness vs indistinguishability"):
  with members:
    - "collecting and analyzing multidimensional data with local differential privacy"
    - "tight lower bounds for locally differentially private selection"
    - "privacy loss in apple s implementation of differential privacy on macos 10 12"
    - "tight lower bounds for differentially private selection"
    - "marginal release under local differential privacy"
    - "heavy hitters and the structure of local privacy"
    - "collecting telemetry data privately"
    - "collecting and analyzing data from smart device users with local differential privacy"

Connected through hyperedge HE-3 (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-4 (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-5 (induced by source paper "the complexity of online bribery in sequential elections extended abstract"):
  with members:
    - "the complexity of online bribery in sequential elections"
    - "computational social choice and computational complexity bffs"
    - "high multiplicity election problems"
    - "prices matter for the parameterized complexity of shift bribery"
    - "the complexity of controlling candidate sequential elections"
    - "the complexity of online manipulation of sequential elections"
    - "the complexity of online voter control in sequential elections"
    - "new candidates welcome possible winners with respect to the addition of new candidates"

Connected through hyperedge HE-6 (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"
    - "the complexity of probabilistic lobbying"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-7 (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"
    - "the complexity of probabilistic lobbying"

Connected through hyperedge HE-8 (induced by source paper "bribery in rating system a game theoretic perspective"):
  with members:
    - "a network based rating system and its resistance to bribery"
    - "serf and turf crowdturfing for fun and profit"

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)