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

Connected through hyperedge HE-1 (induced by source paper "exponential automatic amortized resource analysis"):
  with members:
    - "analysis of logarithmic amortised complexity"
    - "verifying and synthesizing constant resource implementations with types"
    - "work analysis with resource aware session types"
    - "non polynomial worst case analysis of recursive programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "towards automatic resource bound analysis for ocaml"
    - "denotational cost semantics for functional languages with inductive types"
    - "a combination framework for complexity"

Connected through hyperedge HE-2 (induced by source paper "tail bound analysis for probabilistic programs via central moments"):
  with members:
    - "cost analysis of nondeterministic probabilistic programs"
    - "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"
    - "termination of nondeterministic recursive probabilistic programs"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"
    - "a lambda calculus foundation for universal probabilistic programming"

Connected through hyperedge HE-3 (induced by source paper "cost analysis of nondeterministic probabilistic programs"):
  with members:
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "effective divergence analysis for linear recurrence sequences"
    - "ergodic mean payoff games for the analysis of attacks in crypto currencies"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "termination of nondeterministic recursive probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "non polynomial worst case analysis of recursive programs"

Connected through hyperedge HE-4 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism"):
  with members:
    - "reachability in vector addition systems is primitive recursive in fixed dimension"
    - "the reachability problem for petri nets is not elementary"
    - "efficient algorithms for asymptotic bounds on termination time in vass"
    - "perfect half space games"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "non polynomial worst case analysis of recursive programs"
    - "complexity hierarchies beyond elementary"
    - "proving differential privacy via probabilistic couplings"

Connected through hyperedge HE-5 (induced by source paper "modular verification for almost sure termination of probabilistic programs"):
  with members:
    - "cost analysis of nondeterministic probabilistic programs"
    - "quantitative separation logic a logic for reasoning about probabilistic pointer programs"
    - "new approaches for almost sure termination of probabilistic programs"
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "termination of nondeterministic recursive probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "cantor meets scott semantic foundations for probabilistic networks"

Connected through hyperedge HE-6 (induced by source paper "proving expected sensitivity of probabilistic programs with randomized variable dependent termination time"):
  with members:
    - "kantorovich continuity of probabilistic programs"
    - "new approaches for almost sure termination of probabilistic programs"
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "proving expected sensitivity of probabilistic programs"
    - "finding polynomial loop invariants for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "a semantic account of metric preservation"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"

Connected through hyperedge HE-7 (induced by source paper "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"):
  with members:
    - "quantitative separation logic a logic for reasoning about probabilistic pointer programs"
    - "on the termination problem for probabilistic higher order recursive programs"
    - "termination of nondeterministic recursive probabilistic programs"
    - "finding polynomial loop invariants for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "a weakest pre expectation semantics for mixed sign expectations"
    - "healthiness from duality"
    - "weakest precondition reasoning for expected run times of probabilistic programs"

Connected through hyperedge HE-8 (induced by source paper "computing expected runtimes for constant probability programs"):
  with members:
    - "termination of triangular integer loops is decidable"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "on the hardness of almost sure termination"
    - "on termination of integer linear loops"
    - "minimizing expected termination time in one counter markov decision processes"

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