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 "algebraic proof complexity progress frontiers and challenges"):
  Abstract: We survey recent progress in the proof complexity of strong proof systems and its connection to algebraic circuit complexity, showing how the synergy between the two gives rise to new approaches to fundamental open questions, solutions to old problems, and new directions of research. In particular, we focus on tight connections between proof complexity lower bounds (namely, lower bounds on the size of proofs of certain tautologies), algebraic circuit lower bounds, and the Polynomial Identity Testing problem from derandomization theory.

Includes members:
  Member "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "symmetric arithmetic circuits")
  Member "proof complexity lower bounds from algebraic circuit complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semi algebraic proofs ips lower bounds and the tau conjecture can a natural number be negative")
  Member "a deterministic polynomial time algorithm for non commutative rational identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "generating matrix identities and proof complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "characterizing propositional proofs as non commutative formulas")
  Member "circuit complexity proof complexity and polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "search problems in algebraic complexity gct and hardness of generator for invariant rings")
  Member "short proofs for the determinant identities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on algebraic branching programs of small width")
  Member "algebraic proofs over noncommutative formulas":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "proof complexity lower bounds from algebraic circuit complexity")
  Member "resolution over linear equations and multilinear proofs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "proof complexity lower bounds from algebraic circuit complexity")

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)