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 "space proof complexity for random 3 cnfs"):
  Abstract: We investigate the space complexity of refuting $3$-CNFs in Resolution and algebraic systems. We prove that every Polynomial Calculus with Resolution refutation of a random $3$-CNF $\phi$ in $n$ variables requires, with high probability, $\Omega(n)$ distinct monomials to be kept simultaneously in memory. The same construction also proves that every Resolution refutation $\phi$ requires, with high probability, $\Omega(n)$ clauses each of width $\Omega(n)$ to be kept at the same time in memory. This gives a $\Omega(n^2)$ lower bound for the total space needed in Resolution to refute $\phi$. These results are best possible (up to a constant factor). #R##N#The main technical innovation is a variant of Hall's Lemma. We show that in bipartite graphs $G$ with bipartition $(L,R)$ and left-degree at most 3, $L$ can be covered by certain families of disjoint paths, called VW-matchings, provided that $L$ expands in $R$ by a factor of $(2-\epsilon)$, for $\epsilon < 1/23$.

Includes members:
  Member "space proof complexity for random 3 cnfs via a 2 epsilon hall s theorem":
    also connected through other hyperedges:
      (none)
  Member "pebble games proof complexity and time space trade offs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nullstellensatz size degree trade offs from reversible pebbling")
  Member "understanding space in proof complexity separations and trade offs via substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "near optimal lower bounds on quantifier depth and weisfeiler leman refinement steps")

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)