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: "on probabilistic term rewriting"
  Abstract: We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems are considered. Two instances of the interpretation method - polynomial and matrix interpretations - are analyzed and shown to capture interesting and nontrivial examples when automated. We capture probabilistic computation in a novel way by way of multidistribution reduction sequences, this way accounting for both the nondeterminism in the choice of the redex and the probabilism intrinsic in firing each rule.

Connected through hyperedge HE-1 (induced by source paper "lambda calculus and probabilistic computation"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "confluence in probabilistic rewriting"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "toward general analysis of recursive probability models"
    - "church a language for generative models"
    - "probabilistic operational semantics for the lambda calculus"
    - "confluence results for a quantum lambda calculus with measurements"

Connected through hyperedge HE-2 (induced by source paper "on the termination problem for probabilistic higher order recursive programs"):
  with members:
    - "branching processes for quickcheck generators"
    - "a convenient category for higher order probability theory"
    - "a new proof rule for almost sure termination"
    - "relational semantics of linear logic and higher order model checking"
    - "on the hardness of almost sure termination"
    - "complexity of model checking recursion schemes for fragments of the modal mu calculus"
    - "church a language for generative models"
    - "proving termination of probabilistic programs using patterns"

Connected through hyperedge HE-3 (induced by source paper "probabilistic rewriting on normalization termination and unique normal forms"):
  with members:
    - "lambda calculus and probabilistic computation"
    - "confluence in probabilistic rewriting"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "probabilistic operational semantics for the lambda calculus"
    - "confluence results for a quantum lambda calculus with measurements"

Connected through hyperedge HE-4 (induced by source paper "ranking and repulsing supermartingales for reachability in probabilistic programs"):
  with members:
    - "termination of nondeterministic recursive probabilistic programs"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "categorical liveness checking by corecursive algebras"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"

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)