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 "probabilistic rewriting on normalization termination and unique normal forms"):
  Abstract: While a mature body of work supports the study of rewriting systems, even infinitary ones, abstract tools for Probabilistic Rewriting are still limited. Here, we investigate questions such as uniqueness of the result (unique limit distribution) and normalizing strategies (is there a strategy to find a result with *greatest probability* ?). The goal is to have tools to analyze the operational properties of probabilistic calculi such as probabilistic lambda-calculi, whose evaluation is also non-deterministic, where non-determinism arises from a choice between several redexes. #R##N#We investigate how the asymptotic behavior of different rewrite sequences starting from the same term compare w.r.t. normal forms, propose a robust analogue of the notion of "unique normal form", and we develop methods to study and compare strategies. Our approach is that of Abstract Rewrite Systems, i.e. we search for general properties of probabilistic rewriting, which hold independently of the specific nature of the objects.

Includes members:
  Member "lambda calculus and probabilistic computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decomposing probabilistic lambda calculi")
  Member "confluence in probabilistic rewriting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lambda calculus and probabilistic computation")
  Member "on probabilistic term rewriting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lambda calculus and probabilistic computation")
  Member "a new proof rule for almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "the geometry of parallelism classical probabilistic and quantum effects":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the abstract machinery of interaction long version")
  Member "probabilistic operational semantics for the lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "decomposing probabilistic lambda calculi")
  Member "confluence results for a quantum lambda calculus with measurements":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lambda calculus and probabilistic computation")

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