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: "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.

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"
    - "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"
    - "are there any nicely structured preference profiles nearby"

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"
    - "clone structures in voters preferences"

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"
    - "clone structures in voters preferences"

Connected through hyperedge HE-4 (induced by source paper "modeling single peakedness for votes with ties"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "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 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"

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)