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: "cantor meets scott semantic foundations for probabilistic networks"
  Abstract: ProbNetKAT is a probabilistic extension of NetKAT with a denotational semantics based on Markov kernels. The language is expressive enough to generate continuous distributions, which raises the question of how to compute effectively in the language. This paper gives an new characterization of ProbNetKAT’s semantics using domain theory, which provides the foundation needed to build a practical implementation. We show how to use the semantics to approximate the behavior of arbitrary ProbNetKAT programs using distributions with finite support. We develop a prototype implementation and show how to use it to solve a variety of problems including characterizing the expected congestion induced by different routing schemes and reasoning probabilistically about reachability in a network.

Connected through hyperedge HE-1 (induced by source paper "towards verified stochastic variational inference for probabilistic programs"):
  with members:
    - "pyro deep universal probabilistic programming"
    - "discrete continuous mixtures in probabilistic programming generalized semantics and inference algorithms"
    - "a domain theory for statistical probabilistic programming"
    - "existence and continuity of differential entropy for a class of distributions"
    - "a convenient category for higher order probability theory"
    - "denotational validation of higher order bayesian inference"
    - "deriving probability density functions from probabilistic functional programs"
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"

Connected through hyperedge HE-2 (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-3 (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-4 (induced by source paper "probabilistic smart contracts secure randomness on the blockchain"):
  with members:
    - "quantitative analysis of smart contracts"
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "when can a distributed ledger replace a trusted third party"
    - "securify practical security analysis of smart contracts"
    - "ergodic mean payoff games for the analysis of attacks in crypto currencies"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "reasoning about recursive probabilistic programs"

Connected through hyperedge HE-5 (induced by source paper "scalable verification of probabilistic networks"):
  with members:
    - "a fast compiler for netkat"
    - "revisiting the equivalence problem for finite multitape automata"

Connected through hyperedge HE-6 (induced by source paper "layer by layer combining monads"):
  with members:
    - "the power of convex algebras"
    - "coalgebraic trace semantics via forgetful logics"
    - "presenting distributive laws"
    - "generic trace semantics via coinduction"

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)