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 computational impact of partial votes on strategic voting"
  Abstract: In many real world elections, agents are not required to rank all candidates. We study three of the most common methods used to modify voting rules to deal with such partial votes. These methods modify scoring rules (like the Borda count), elimination style rules (like single transferable vote) and rules based on the tournament graph (like Copeland) respectively. We argue that with an elimination style voting rule like single transferable vote, partial voting does not change the situations where strategic voting is possible. However, with scoring rules and rules based on the tournament graph, partial voting can increase the situations where strategic voting is possible. As a consequence, the computational complexity of computing a strategic vote can change. For example, with Borda count, the complexity of computing a strategic vote can decrease or stay the same depending on how we score partial votes.

Connected through hyperedge HE-1 (induced by source paper "approximating voting rules from truncated ballots"):
  with members:
    - "comparing election methods where each voter ranks only few candidates"
    - "a cost effective framework for preference elicitation and aggregation"

Connected through hyperedge HE-2 (induced by source paper "lie on the fly strategic voting in an iterative preference elicitation process"):
  with members:
    - "cognitive hierarchy and voting manipulation"
    - "online prediction with selfish experts"
    - "a local dominance theory of voting equilibria"
    - "crowdsourced judgement elicitation with endogenous proficiency"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "dominating manipulations in voting with partial information"
    - "equilibria of plurality voting with abstentions"
    - "where are the hard manipulation problems"

Connected through hyperedge HE-3 (induced by source paper "towards computing victory margins in stv elections"):
  with members:
    - "algorithms for destructive shift bribery"
    - "auditing australian senate ballots"
    - "how hard is bribery in elections"
    - "how many candidates are needed to make elections hard to manipulate"

Connected through hyperedge HE-4 (induced by source paper "complexity of manipulation with partial information in voting"):
  with members:
    - "manipulative elicitation a new attack on elections with incomplete preferences"
    - "on the exact amount of missing information that makes finding possible winners hard"
    - "complexity of manipulation in elections with partial votes"
    - "frugal bribery in voting"
    - "detecting possible manipulators in elections"
    - "kernelization complexity of possible winner and coalitional manipulation problems in voting"
    - "possible and necessary winner problem in social polls"
    - "asymptotic collusion proofness of voting rules the case of large number of candidates"

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 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-6 (induced by source paper "single peaked consistency for weak orders is easy"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "testing top monotonicity"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "clone structures in voters preferences"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-7 (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 manipulative actions when voting with ties"
    - "complexity of manipulation in elections with top truncated ballots"
    - "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"

Connected through hyperedge HE-8 (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"
    - "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"
    - "dichotomy for voting systems"
    - "anyone but him the complexity of precluding an alternative"

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)