human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "incomplete preferences in single peaked electorates"):
  Abstract: Incomplete preferences are likely to arise in real-world preference aggregation scenarios. This paper deals with determining whether an incomplete preference profile is single-peaked. This is valuable information since many intractable voting problems become tractable given single-peaked preferences. We prove that the problem of recognizing single-peakedness is NP-complete for incomplete profiles consisting of partial orders. Despite this intractability result, we find several polynomial-time algorithms for reasonably restricted settings. In particular, we give polynomial-time recognition algorithms for weak orders, which can be viewed as preferences with indifference.

Includes members:
  Member "on the likelihood of single peaked preferences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "individual based stability in hedonic diversity games")
  Member "computational aspects of nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "recognising multidimensional euclidean preferences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal curve straightening is exists mathbb r complete")
  Member "modeling single peakedness for votes with ties":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "single peaked consistency for weak orders is easy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stable roommates with narcissistic single peaked and single crossing preferences")
  Member "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "the one dimensional euclidean domain finitely many obstructions are not enough":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stable marriage with multi modal preferences")
  Member "complexity of manipulative actions when voting with ties":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "election score can be harder than winner")

Question: Please tell me which class the source paper 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)