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 manipulative actions when voting with ties"
  Abstract: Most of the computational study of election problems has assumed that each voter's preferences are, or should be extended to, a total order. However in practice voters may have preferences with ties. We study the complexity of manipulative actions on elections where voters can have ties, extending the definitions of the election systems (when necessary) to handle voters with ties. We show that for natural election systems allowing ties can both increase and decrease the complexity of manipulation and bribery, and we state a general result on the effect of voters with ties on the complexity of control.

Connected through hyperedge HE-1 (induced by source paper "incomplete preferences in single peaked electorates"):
  with members:
    - "on the likelihood of single peaked preferences"
    - "computational aspects of nearly single peaked electorates"
    - "recognising multidimensional euclidean preferences"
    - "modeling single peakedness for votes with ties"
    - "single peaked consistency for weak orders is easy"
    - "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates"
    - "the one dimensional euclidean domain finitely many obstructions are not enough"
    - "are there any nicely structured preference profiles nearby"

Connected through hyperedge HE-2 (induced by source paper "election score can be harder than winner"):
  with members:
    - "very hard electoral control problems"
    - "cycles and intractability in a large class of aggregation rules"
    - "clone structures in voters preferences"
    - "exact complexity of the winner problem for young elections"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-3 (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 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"
    - "dichotomy for voting systems"

Connected through hyperedge HE-4 (induced by source paper "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "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"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"
    - "eliciting single peaked preferences using comparison queries"
    - "how hard is bribery in 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.GT(Computer Science and Game Theory)