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 "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.

Includes members:
  Member "modular runtime complexity analysis of probabilistic while programs":
    also connected through other hyperedges:
      (none)
  Member "bounded expectations resource analysis for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponential automatic amortized resource analysis")
  Member "a new proof rule for almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "termination analysis of probabilistic programs through positivstellensatz s":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "on the hardness of almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification")
  Member "nagoya termination tool":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tools in term rewriting for education")
  Member "church a language for generative models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "semiring programming a declarative framework for generalized sum product problems")
  Member "on constructor rewrite systems and the lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "combinatorics of explicit substitutions")

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