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: "frequency of correctness versus average case polynomial time and generalized juntas"
  Abstract: We prove that every distributional problem solvable in polynomial time on the average with respect to the uniform distribution has a frequently self-knowingly correct polynomial-time algorithm. We also study some features of probability weight of correctness with respect to generalizations of Procaccia and Rosenschein's junta distributions [PR07b].

Connected through hyperedge HE-1 (induced by source paper "the complexity of manipulative attacks in nearly single peaked electorates"):
  with members:
    - "are there any nicely structured preference profiles nearby"
    - "weighted electoral control"
    - "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"
    - "search versus decision for election manipulation problems"
    - "an atypical survey of typical case heuristic algorithms"
    - "clone structures in voters preferences"
    - "cloning in elections finding the possible winners"
    - "multimode control attacks on elections"

Connected through hyperedge HE-2 (induced by source paper "copeland voting fully resists constructive control"):
  with members:
    - "llull and copeland voting computationally resist bribery and control"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "anyone but him the complexity of precluding an alternative"
    - "guarantees for the success frequency of an algorithm for finding dodgson election winners"

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)