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

Includes members:
  Member "on approximating optimal weighted lobbying and frequency of correctness versus average case polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of probabilistic lobbying")
  Member "average case complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constructing concrete hard instances of the maximum independent set problem")
  Member "a richer understanding of the complexity of election systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computational social choice and computational complexity bffs")
  Member "guarantees for the success frequency of an algorithm for finding dodgson election winners":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achieving fully proportional representation approximability results")
  Member "exact complexity of the winner problem for young elections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "incomplete preferences in single peaked electorates")
  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-6 (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.CC(Computational Complexity)