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: "computational aspects of nearly single peaked electorates"
  Abstract: Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting rules are, in the general case, computationally resistant to some of these manipulative actions. However when restricted to single-peaked electorates, these rules suddenly become easy to manipulate. Recently, Faliszewski, Hemaspaandra, and Hemaspaandra studied the computational complexity of strategic behavior in nearly single-peaked electorates. These are electorates that are not single-peaked but close to it according to some distance measure.#N##N#In this paper we introduce several new distance measures regarding single-peakedness. We prove that determining whether a given profile is nearly single-peaked is NP-complete in many cases. For one case we present a polynomial-time algorithm. In case the single-peaked axis is given, we show that determining the distance is always possible in polynomial time. Furthermore, we  explore the relations between the new notions introduced in this paper and existing notions from the literature.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences"):
  with members:
    - "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates"
    - "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"
    - "multimode control attacks on elections"
    - "the complexity of manipulating k approval elections"

Connected through hyperedge HE-2 (induced by source paper "incomplete preferences in single peaked electorates"):
  with members:
    - "on the likelihood of single peaked preferences"
    - "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"
    - "are there any nicely structured preference profiles nearby"

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

Connected through hyperedge HE-4 (induced by source paper "on the likelihood of single peaked preferences"):
  with members:
    - "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"
    - "clone structures in voters preferences"
    - "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-5 (induced by source paper "modeling single peakedness for votes with ties"):
  with members:
    - "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 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"

Connected through hyperedge HE-6 (induced by source paper "recognizing and eliciting weakly single crossing profiles on trees"):
  with members:
    - "elicitation for preferences single peaked on trees"
    - "preference elicitation for single crossing domain"
    - "structure in dichotomous preferences"
    - "the single crossing property on a tree"
    - "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"
    - "eliciting single peaked preferences using comparison queries"

Connected through hyperedge HE-7 (induced by source paper "single peaked consistency for weak orders is easy"):
  with members:
    - "testing top monotonicity"
    - "the computational impact of partial votes on strategic voting"
    - "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-8 (induced by source paper "campaign management under approval driven voting rules"):
  with members:
    - "prices matter for the parameterized complexity of shift bribery"
    - "are there any nicely structured preference profiles nearby"
    - "on the computation of fully proportional representation"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "weighted electoral control"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "normalized range voting broadly resists control"

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.CC(Computational Complexity)