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 language for probabilistically oblivious computation"):
  Abstract: An oblivious computation is one that is free of direct and indirect information leaks, e.g., due to observable differences in timing and memory access patterns. This paper presents Lobliv, a core language whose type system enforces obliviousness. Prior work on type-enforced oblivious computation has focused on deterministic programs. Lobliv is new in its consideration of programs that implement probabilistic algorithms, such as those involved in cryptography. Lobliv employs a substructural type system and a novel notion of probability region to ensure that information is not leaked via the distribution of visible events. The use of regions was motivated by a source of unsoundness that we discovered in the type system of ObliVM, a language for implementing state of the art oblivious algorithms and data structures. We prove that Lobliv's type system enforces obliviousness and show that it is nevertheless powerful enough to check state-of-the-art, efficient oblivious data structures, such as stacks and queues, and even tree-based oblivious RAMs.

Includes members:
  Member "trace abstraction modulo probability":
    also connected through other hyperedges:
      (none)
  Member "proving uniformity and independence by self composition and coupling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relational proofs for quantum programs")
  Member "coupling proofs are probabilistic product programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proving expected sensitivity of probabilistic programs with randomized variable dependent termination time")
  Member "lightdp towards automating differential privacy proofs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "probabilistic couplings for probabilistic reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "relational proofs for quantum programs")
  Member "higher order approximate relational refinement types for mechanism design and differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "privacy preserving data oblivious geometric algorithms for geographic data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exploring differential obliviousness")

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)