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: "abstracting path conditions"
  Abstract: We present a symbolic-execution-based algorithm that for a given program and a given program location produces a nontrivial necessary condition on input values to drive the program execution to the given location. We also propose an application of necessary conditions in contemporary bug-finding and test-generation tools. Experimental results show that the presented technique can significantly improve performance of the tools.

Connected through hyperedge HE-1 (induced by source paper "a calculus for modular loop acceleration"):
  with members:
    - "on the decidability of termination for polynomial loops"
    - "proving non termination via loop acceleration"
    - "inferring lower runtime bounds for integer programs"
    - "underapproximation of procedure summaries for integer programs"
    - "on termination of integer linear loops"
    - "deciding conditional termination"
    - "abstract acceleration of general linear loops"
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-2 (induced by source paper "inferring lower runtime bounds for integer programs"):
  with members:
    - "computing expected runtimes for constant probability programs"
    - "termination of triangular integer loops is decidable"
    - "proving non termination via loop acceleration"
    - "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"
    - "towards automatic resource bound analysis for ocaml"
    - "abstract acceleration of general linear loops"
    - "ranking functions for linear constraint loops"
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

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.SC(Symbolic Computation)