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: "proving termination of probabilistic programs using patterns"
  Abstract: Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with probability one ("almost-sure termination"), is an equally important property for randomized algorithms and probabilistic protocols. We suggest a novel algorithm for proving almost-sure termination of probabilistic programs. Our algorithm exploits the power of state-of-the-art model checkers and termination provers for nonprobabilistic programs: it calls such tools within a refinement loop and thereby iteratively constructs a "terminating pattern", which is a set of terminating runs with probability one. We report on various case studies illustrating the effectiveness of our algorithm. As a further application, our algorithm can improve lower bounds on reachability probabilities.

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

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

Connected through hyperedge HE-3 (induced by source paper "new approaches for almost sure termination of probabilistic programs"):
  with members:
    - "bounded expectations resource analysis for probabilistic programs"
    - "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"
    - "a new rule for almost certain termination of probabilistic and demonic programs"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"

Connected through hyperedge HE-4 (induced by source paper "on the termination problem for probabilistic higher order recursive programs"):
  with members:
    - "branching processes for quickcheck generators"
    - "on probabilistic term rewriting"
    - "a convenient category for higher order probability theory"
    - "a new proof rule for almost sure termination"
    - "relational semantics of linear logic and higher order model checking"
    - "on the hardness of almost sure termination"
    - "complexity of model checking recursion schemes for fragments of the modal mu calculus"
    - "church a language for generative models"

Connected through hyperedge HE-5 (induced by source paper "almost sure productivity"):
  with members:
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "on the hardness of almost sure termination"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "data oblivious stream productivity"

Connected through hyperedge HE-6 (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"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "reasoning about recursive probabilistic programs"
    - "t2 temporal property verification"

Connected through hyperedge HE-7 (induced by source paper "a new proof rule for almost sure termination"):
  with members:
    - "termination of nondeterministic recursive probabilistic programs"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "a new rule for almost certain termination of probabilistic and demonic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"

Connected through hyperedge HE-8 (induced by source paper "probabilistic termination by monadic affine sized typing long version"):
  with members:
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "church a language for generative models"
    - "linear dependent types and relative completeness"
    - "probabilistic operational semantics for the lambda calculus"

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.LO(Logic in Computer Science)