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 "bounded expectations resource analysis for probabilistic programs"):
  Abstract: This paper presents a new static analysis for deriving upper bounds on the expected resource consumption of probabilistic programs. The analysis is fully automatic and derives symbolic bounds that are multivariate polynomials of the inputs. The new technique combines manual state-of-the-art reasoning techniques for probabilistic programs with an effective method for automatic resource-bound analysis of deterministic programs. It can be seen as both, an extension of automatic amortized resource analysis (AARA) to probabilistic programs and an automation of manual reasoning for probabilistic programs that is based on weakest preconditions. As a result, bound inference can be reduced to off-the-shelf LP solving in many cases and automatically-derived bounds can be interactively extended with standard program logics if the automation fails. Building on existing work, the soundness of the analysis is proved with respect to an operational semantics that is based on Markov decision processes. The effectiveness of the technique is demonstrated with a prototype implementation that is used to automatically analyze 39 challenging probabilistic programs and randomized algorithms. Experimental results indicate that the derived constant factors in the bounds are very precise and even optimal for many programs.

Includes members:
  Member "verifying and synthesizing constant resource implementations with types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponential automatic amortized resource analysis")
  Member "how long o bayesian network will i sample thee a program analysis perspective on expected sampling times":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tail probabilities for randomized program runtimes via martingales for higher moments")
  Member "automated recurrence analysis for almost linear expected runtime bounds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "non polynomial worst case analysis of recursive programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exponential automatic amortized resource analysis")
  Member "a program logic for union bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "unifying graded and parameterised monads")
  Member "termination analysis of probabilistic programs through positivstellensatz s":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "weakest precondition reasoning for expected run times of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "exponential automatic amortized resource analysis")
  Member "towards automatic resource bound analysis for ocaml":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "session types with arithmetic refinements and their application to work analysis")

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.PL(Programming Languages)