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: "dichotomy for voting systems"
  Abstract: Scoring protocols are a broad class of voting systems. Each is defined by a vector $(\alpha_1,\alpha_2,...,\alpha_m)$, $\alpha_1 \geq \alpha_2 \geq >... \geq \alpha_m$, of integers such that each voter contributes $\alpha_1$ points to his/her first choice, $\alpha_2$ points to his/her second choice, and so on, and any candidate receiving the most points is a winner. #R##N#What is it about scoring-protocol election systems that makes some have the desirable property of being NP-complete to manipulate, while others can be manipulated in polynomial time? We find the complete, dichotomizing answer: Diversity of dislike. Every scoring-protocol election system having two or more point values assigned to candidates other than the favorite--i.e., having $||\{\alpha_i \condition 2 \leq i \leq m\}||\geq 2$--is NP-complete to manipulate. Every other scoring-protocol election system can be manipulated in polynomial time. In effect, we show that--other than trivial systems (where all candidates alway tie), plurality voting, and plurality voting's transparently disguised translations--\emph{every} scoring-protocol election system is NP-complete to manipulate.

Connected through hyperedge HE-1 (induced by source paper "the complexity of online bribery in sequential elections"):
  with members:
    - "campaign management under approval driven voting rules"
    - "equilibria of plurality voting with abstentions"

Connected through hyperedge HE-2 (induced by source paper "the complexity of the possible winner problem over partitioned preferences"):
  with members:
    - "on the exact amount of missing information that makes finding possible winners hard"
    - "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"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"

Connected through hyperedge HE-3 (induced by source paper "new approximations for coalitional manipulation in general scoring rules"):
  with members:
    - "complexity of and algorithms for borda manipulation"
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-4 (induced by source paper "high multiplicity election problems"):
  with members:
    - "the complexity of succinct elections"
    - "complexity dichotomies for unweighted scoring rules"
    - "a control dichotomy for pure scoring rules"
    - "polynomiality for bin packing with a constant number of item types"
    - "weighted electoral control"
    - "the complexity of online manipulation of sequential elections"
    - "complexity of and algorithms for borda manipulation"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"

Connected through hyperedge HE-5 (induced by source paper "modeling single peakedness for votes with ties"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "single peaked consistency for weak orders is easy"
    - "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates"
    - "complexity of manipulative actions when voting with ties"
    - "complexity of manipulation in elections with top truncated ballots"
    - "the computational impact of partial votes on strategic voting"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"

Connected through hyperedge HE-6 (induced by source paper "complexity of manipulative actions when voting with ties"):
  with members:
    - "complexity of manipulation in elections with partial votes"
    - "complexity of manipulation in elections with top truncated ballots"
    - "the computational impact of partial votes on strategic voting"
    - "weighted electoral control"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"
    - "how hard is bribery in elections"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-7 (induced by source paper "complexity of manipulation in elections with top truncated ballots"):
  with members:
    - "the computational impact of partial votes on strategic voting"
    - "determining possible and necessary winners under common voting rules given partial orders"

Connected through hyperedge HE-8 (induced by source paper "elections with few voters candidate control can be easy"):
  with members:
    - "prices matter for the parameterized complexity of shift bribery"
    - "more natural models of electoral control by partition"
    - "combinatorial voter control in elections"
    - "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"
    - "control complexity in bucklin and fallback voting"
    - "multimode control attacks on elections"
    - "normalized range voting broadly resists control"
    - "multivariate complexity analysis of swap bribery"

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)