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 "single peaked consistency for weak orders is easy"):
  Abstract: In economics and social choice single-peakedness is one of the most important and commonly studied models for preferences. It is well known that single-peaked consistency for total orders is in P. However in practice a preference profile is not always comprised of total orders. Often voters have indifference between some of the candidates. In a weak preference order indifference must be transitive. We show that single-peaked consistency for weak orders is in P for three different variants of single-peakedness for weak orders. Specifically, we consider Black's original definition of single-peakedness for weak orders, Black's definition of single-plateaued preferences, and the existential model recently introduced by Lackner. We accomplish our results by transforming each of these single-peaked consistency problems to the problem of determining if a 0-1 matrix has the consecutive ones property.

Includes members:
  Member "computational aspects of nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "testing top monotonicity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "the computational impact of partial votes on strategic voting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximating voting rules from truncated ballots")
  Member "the complexity of manipulative attacks in nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "clone structures in voters preferences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "the shield that never was societies with single peaked preferences are more open to manipulation and control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "incomplete preferences in single peaked electorates")

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)