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: "average case complexity"
  Abstract: We survey the average-case complexity of problems in NP. #R##N#We discuss various notions of good-on-average algorithms, and present completeness results due to Impagliazzo and Levin. Such completeness results establish the fact that if a certain specific (but somewhat artificial) NP problem is easy-on-average with respect to the uniform distribution, then all problems in NP are easy-on-average with respect to all samplable distributions. Applying the theory to natural distributional problems remain an outstanding open question. We review some natural distributional problems whose average-case complexity is of particular interest and that do not yet fit into this theory. #R##N#A major open question whether the existence of hard-on-average problems in NP can be based on the P$\neq$NP assumption or on related worst-case assumptions. We review negative results showing that certain proof techniques cannot prove such a result. While the relation between worst-case and average-case complexity for general NP problems remains open, there has been progress in understanding the relation between different ``degrees'' of average-case complexity. We discuss some of these ``hardness amplification'' results.

Connected through hyperedge HE-1 (induced by source paper "constructing concrete hard instances of the maximum independent set problem"):
  with members:
    - "the backtracking survey propagation algorithm for solving random k sat problems"
    - "on independent sets in random graphs"
    - "from average case complexity to improper learning complexity"
    - "generating hard satisfiable formulas by hiding solutions deceptively"

Connected through hyperedge HE-2 (induced by source paper "plausibility and probability in deductive reasoning"):
  with members:
    - "a nearly tight sum of squares lower bound for the planted clique problem"
    - "optimal polynomial time estimators a bayesian notion of approximation algorithm"
    - "toward idealized decision theory"
    - "algorithmic rationality game theory with costly computation"
    - "bounding rationality by discounting time"
    - "dealing with logical omniscience expressiveness and pragmatics"

Connected through hyperedge HE-3 (induced by source paper "a new view on worst case to average case reductions for np problems"):
  with members:
    - "classical hardness of learning with errors"

Connected through hyperedge HE-4 (induced by source paper "smoothed complexity theory"):
  with members:
    - "smoothed analysis of belief propagation for minimum cost flow and matching"
    - "improved smoothed analysis of multiobjective optimization"
    - "pareto optimal solutions for smoothed analysts"
    - "on smoothed analysis of quicksort and hoare s find"
    - "settling the complexity of computing two player nash equilibria"
    - "beyond hirsch conjecture walks on random polytopes and smoothed complexity of the simplex method"
    - "smoothed analysis of the condition numbers and growth factors of matrices"
    - "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time"

Connected through hyperedge HE-5 (induced by source paper "frequency of correctness versus average case polynomial time and generalized juntas"):
  with members:
    - "on approximating optimal weighted lobbying and frequency of correctness versus average case polynomial time"
    - "a richer understanding of the complexity of election systems"
    - "guarantees for the success frequency of an algorithm for finding dodgson election winners"
    - "exact complexity of the winner problem for young elections"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-6 (induced by source paper "report on generic case complexity"):
  with members:
    - "resource bounded immunity and simplicity"

Connected through hyperedge HE-7 (induced by source paper "tightness of lp via max product belief propagation"):
  with members:
    - "max product for maximum weight matching convergence correctness and lp duality"
    - "on the solution space geometry of random constraint satisfaction problems"

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)