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: "tighter hard instances for ppsz"
  Abstract: We construct uniquely satisfiable $k$-CNF formulas that are hard for the algorithm PPSZ. Firstly, we construct graph-instances on which "weak PPSZ" has savings of at most $(2 + \epsilon) / k$; the saving of an algorithm on an input formula with $n$ variables is the largest $\gamma$ such that the algorithm succeeds (i.e. finds a satisfying assignment) with probability at least $2^{ - (1 - \gamma) n}$. Since PPSZ (both weak and strong) is known to have savings of at least $\frac{\pi^2 + o(1)}{6k}$, this is optimal up to the constant factor. In particular, for $k=3$, our upper bound is $2^{0.333\dots n}$, which is fairly close to the lower bound $2^{0.386\dots n}$ of Hertli [SIAM J. Comput.'14]. We also construct instances based on linear systems over $\mathbb{F}_2$ for which strong PPSZ has savings of at most $O\left(\frac{\log(k)}{k}\right)$. This is only a $\log(k)$ factor away from the optimal bound. Our constructions improve previous savings upper bound of $O\left(\frac{\log^2(k)}{k}\right)$ due to Chen et al. [SODA'13].

Connected through hyperedge HE-1 (induced by source paper "faster random k cnf satisfiability"):
  with members:
    - "super strong eth is false for random k sat"
    - "on the complexity of random satisfiability problems with planted solutions"

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)