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 "a probabilistic separation logic"):
  Abstract: Probabilistic independence is a fundamental tool for reasoning about randomized programs. Independence describes the result of drawing a fresh random sample---a basic operation in all probabilistic languages---and greatly simplifies formal reasoning about collections of random samples. Nevertheless, existing verification methods handle independence poorly, if at all. #R##N#In this paper, we propose a probabilistic separation logic where separation models probabilistic independence. We first give a new, probabilistic model of the logic of bunched implications (BI), the logic of assertions in separation logic. Then, we introduce a program logic based on these assertions and prove soundness of the proof system. We demonstrate our logic by verifying security properties of several cryptographic constructions, including simple ORAM, secure multi-party addition, oblivious transfer, and private information retrieval. Our logic is able to state and verify two different forms of the standard cryptographic security property, while proofs work in terms of high-level properties like independence and uniformity.

Includes members:
  Member "quantitative separation logic a logic for reasoning about probabilistic pointer programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "modular verification for almost sure termination of probabilistic programs")
  Member "more is less perfectly secure oblivious algorithms in the multi server setting":
    also connected through other hyperedges:
      (none)
  Member "an assertion based program logic for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative separation logic a logic for reasoning about probabilistic pointer programs")
  Member "a separation logic for concurrent randomized programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quantitative separation logic a logic for reasoning about probabilistic pointer programs")
  Member "the beta bernoulli process and algebraic effects":
    also connected through other hyperedges:
      (none)
  Member "a domain theory for statistical probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the linear structure of cones")
  Member "measurable cones and stable measurable functions a model for probabilistic higher order programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the linear structure of cones")
  Member "proving uniformity and independence by self composition and coupling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relational proofs for quantum programs")

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)