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: "clone structures in voters preferences"
  Abstract: In elections, a set of candidates ranked consecutively (though possibly in different order) by all voters is called a clone set, and its members are called clones. A clone structure is a family of all clone sets of a given election. In this paper we study properties of clone structures. In particular, we give an axiomatic characterization of clone structures, show their hierarchical structure, and analyze clone structures in single-peaked and single-crossing elections. We give a polynomial-time algorithm that finds a minimal collection of clones that need to be collapsed for an election to become single-peaked, and we show that this problem is NP-hard for single-crossing elections.

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"
    - "complexity of manipulative actions when voting with ties"

Connected through hyperedge HE-2 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences"):
  with members:
    - "matchings under preferences strength of stability and trade offs"
    - "stable marriage with multi modal preferences"
    - "stable marriage with groups of similar agents"
    - "how hard is it to satisfy almost all roommates"
    - "balanced stable marriage how close is close enough"
    - "stable marriage with covering constraints a complete computational trichotomy"
    - "modeling single peakedness for votes with ties"
    - "single peaked consistency for weak orders is easy"

Connected through hyperedge HE-3 (induced by source paper "testing preferential domains using sampling"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "preference elicitation for single crossing domain"
    - "recognising multidimensional euclidean preferences"
    - "single peaked consistency for weak orders is easy"

Connected through hyperedge HE-4 (induced by source paper "stable marriage with multi modal preferences"):
  with members:
    - "stable roommates with narcissistic single peaked and single crossing preferences"
    - "a polynomial time randomized reduction from tournament isomorphism to tournament asymmetry"
    - "stable matching with uncertain linear preferences"
    - "assessing the computational complexity of multi layer subgraph detection"
    - "the one dimensional euclidean domain finitely many obstructions are not enough"
    - "are there any nicely structured preference profiles nearby"
    - "parameterized algorithmics for computational social choice nine research challenges"
    - "stable marriage with general preferences"

Connected through hyperedge HE-5 (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"
    - "complexity of manipulative actions when voting with ties"
    - "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-6 (induced by source paper "computational aspects of nearly single peaked electorates"):
  with members:
    - "on the likelihood of single peaked preferences"
    - "are there any nicely structured preference profiles nearby"
    - "structure in dichotomous preferences"
    - "the control complexity of r approval from the single peaked case to the general case"
    - "on the computation of fully proportional representation"
    - "the complexity of fully proportional representation for single crossing electorates"
    - "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-7 (induced by source paper "on the likelihood of single peaked preferences"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "the one dimensional euclidean domain finitely many obstructions are not enough"
    - "are there any nicely structured preference profiles nearby"
    - "on the computation of fully proportional representation"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the hard manipulation problems"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"

Connected through hyperedge HE-8 (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 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"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

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)