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: "synthesizing probabilistic invariants via doob s decomposition"
  Abstract: When analyzing probabilistic computations, a powerful approach is to first find a martingale—an expression on the program variables whose expectation remains invariant—and then apply the optional stopping theorem in order to infer properties at termination time. One of the main challenges, then, is to systematically find martingales.

Connected through hyperedge HE-1 (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"
    - "bounded expectations resource analysis for probabilistic 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"

Connected through hyperedge HE-2 (induced by source paper "automatic generation of moment based invariants for prob solvable loops"):
  with members:
    - "polynomial invariant generation for non deterministic recursive programs"
    - "tail probabilities for randomized program runtimes via martingales for higher moments"
    - "aligator jl a julia package for loop invariant generation"
    - "finding polynomial loop invariants for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "a storm is coming a modern probabilistic model checker"
    - "bounded model checking for probabilistic programs"
    - "counterexample guided polynomial loop invariant generation by lagrange interpolation"

Connected through hyperedge HE-3 (induced by source paper "polynomial probabilistic invariants and the optional stopping theorem"):
  with members:
    - "polynomial invariant generation for non deterministic recursive programs"
    - "compositional analysis for almost sure termination of probabilistic programs"
    - "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"
    - "tail probabilities for randomized program runtimes via martingales for higher moments"
    - "finding polynomial loop invariants for probabilistic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "counterexample guided polynomial loop invariant generation by lagrange interpolation"

Connected through hyperedge HE-4 (induced by source paper "partial and conditional expectations in markov decision processes with integer weights"):
  with members:
    - "conditional value at risk for reachability and mean payoff in markov decision processes"
    - "stochastic shortest paths and weight bounded properties in markov decision processes"
    - "maximizing the conditional expected reward for reaching the goal"
    - "termination analysis of probabilistic programs through positivstellensatz s"

Connected through hyperedge HE-5 (induced by source paper "trace abstraction modulo probability"):
  with members:
    - "an assertion based program logic for probabilistic programs"
    - "constraint based synthesis of coupling proofs"
    - "efficient interpolation for the theory of arrays"
    - "synthesizing coupling proofs of differential privacy"
    - "a new proof rule for almost sure termination"
    - "towards practical differential privacy for sql queries"
    - "a storm is coming a modern probabilistic model checker"
    - "a program logic for union bounds"

Connected through hyperedge HE-6 (induced by source paper "an assertion based program logic for probabilistic programs"):
  with members:
    - "a new proof rule for almost sure termination"
    - "inferring covariances for probabilistic programs"
    - "a new rule for almost certain termination of probabilistic and demonic programs"
    - "a program logic for union bounds"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"
    - "step indexed logical relations for probability"
    - "on probabilistic applicative bisimulation and call by value λ calculi long version"

Connected through hyperedge HE-7 (induced by source paper "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"):
  with members:
    - "termination of nondeterministic recursive probabilistic programs"
    - "a new rule for almost certain termination of probabilistic and demonic programs"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "proving differential privacy via probabilistic couplings"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"
    - "t2 temporal property verification"
    - "complexity of bradley manna sipma lexicographic ranking functions"

Connected through hyperedge HE-8 (induced by source paper "maximizing the conditional expected reward for reaching the goal"):
  with members:
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "markov decision processes with multiple long run averageobjectives"
    - "quantitative analysis of information leakage in probabilistic and nondeterministic systems"
    - "decisive markov chains"

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)