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 "automatic generation of moment based invariants for prob solvable loops"):
  Abstract: One of the main challenges in the analysis of probabilistic programs is to compute invariant properties that summarise loop behaviours. Automation of invariant generation is still at its infancy and most of the times targets only expected values of the program variables, which is insufficient to recover the full probabilistic program behaviour. We present a method to automatically generate moment-based invariants of a subclass of probabilistic programs, called Prob-Solvable loops, with polynomial assignments over random variables and parametrised distributions. We combine methods from symbolic summation and statistics to derive invariants as valid properties over higher-order moments, such as expected values or variances, of program variables. We successfully evaluated our work on several examples where full automation for computing higher-order moments and invariants over program variables was not yet possible.

Includes members:
  Member "polynomial invariant generation for non deterministic recursive programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomial probabilistic invariants and the optional stopping theorem")
  Member "tail probabilities for randomized program runtimes via martingales for higher moments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polynomial probabilistic invariants and the optional stopping theorem")
  Member "aligator jl a julia package for loop invariant generation":
    also connected through other hyperedges:
      (none)
  Member "finding polynomial loop invariants for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proving expected sensitivity of probabilistic programs with randomized variable dependent termination time")
  Member "a new proof rule for almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "a storm is coming a modern probabilistic model checker":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the probabilistic model checker storm")
  Member "synthesizing probabilistic invariants via doob s decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification")
  Member "bounded model checking for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the probabilistic model checker storm extended abstract")

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)