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: "resolution over linear equations and multilinear proofs"
  Abstract: Abstract   We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead of clauses. We demonstrate polynomial-size refutations for hard tautologies like the pigeonhole principle, Tseitin graph tautologies and the clique-coloring tautologies in these proof systems. Using (monotone) interpolation we establish an exponential-size lower bound on refutations in a certain, considerably strong, fragment of resolution over linear equations, as well as a general polynomial upper bound on (non-monotone) interpolants in this fragment.  We then apply these results to extend and improve previous results on multilinear proofs (over fields of characteristic 0), as studied in [Ran Raz, Iddo Tzameret, The strength of multilinear proofs. Comput. Complexity (in press)]. Specifically, we show the following:   •   Proofs operating with depth-3 multilinear formulas polynomially simulate a certain, considerably strong, fragment of resolution over linear equations.   •   Proofs operating with depth-3 multilinear formulas admit polynomial-size refutations of the pigeonhole principle and Tseitin graph tautologies. The former improve over a previous result that established small multilinear proofs only for the functional pigeonhole principle. The latter are different from previous proofs, and apply to multilinear proofs of Tseitin mod    p    graph tautologies over any field of characteristic 0.    We conclude by connecting resolution over linear equations with extensions of the cutting planes proof system.

Connected through hyperedge HE-1 (induced by source paper "proof complexity lower bounds from algebraic circuit complexity"):
  with members:
    - "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity"
    - "an exponential lower bound for homogeneous depth 5 circuits over finite fields"
    - "identity testing and lower bounds for read k oblivious algebraic branching programs"
    - "circuit complexity proof complexity and polynomial identity testing"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "deterministic identity testing for sum of read once oblivious arithmetic branching programs"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"

Connected through hyperedge HE-2 (induced by source paper "algebraic proof complexity progress frontiers and challenges"):
  with members:
    - "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity"
    - "proof complexity lower bounds from algebraic circuit complexity"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "generating matrix identities and proof complexity"
    - "circuit complexity proof complexity and polynomial identity testing"
    - "short proofs for the determinant identities"
    - "algebraic proofs over noncommutative formulas"

Connected through hyperedge HE-3 (induced by source paper "sparser random 3sat refutation algorithms and the interpolation problem"):
  with members:
    - "short propositional refutations for dense random 3cnf formulas"

Connected through hyperedge HE-4 (induced by source paper "algebraic proofs over noncommutative formulas"):
  with members:
    - "deterministic black box identity testing pi ordered algebraic branching programs"
    - "nearly exponential size lower bounds for symbolic quantifier elimination algorithms and obdd based proofs of unsatisfiability"

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)