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 system f accounting for scalars"):
  Abstract: The algebraic �-calculus (40) and the linear-algebraic �-calculus (3) extend the �-calculus with the possibility of making arbitrary linear combinations of �-calculus terms (preserving Pi:ti). In this paper we provide a fine-grained, System F -like type system for the linear-algebraic �-calculus (Lineal). We show that this scalar type system enjoys both the subject-reduction property and the strong-normalisation property, which constitute our main technical results. The latter yields a significant simplification of the linear-algebraic �-calculus itself, by removing the need for some restrictions in its reduction rules - and thus leaving it more intuitive. But the more important, original feature of this scalar type system is that it keeps track of 'the amount of a type' that this present in each term. As an example, we show how to use this type system in order to guarantee the well-definiteness of probabilistic functions ( Pi = 1) - thereby specializing Lineal into a probabilistic, higher-order �-calculus. Finally we begin to investigate the logic induced by the scalar type system, and prove a no-cloning theorem expressed solely in terms of the possible proof methods in this logic. We discuss the potential connections with Linear Logic and Quantum Computation.

Includes members:
  Member "semantics of a typed algebraic lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "confluence via strong normalisation in an algebraic lambda calculus with rewriting")
  Member "a finiteness structure on resource terms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an application of parallel cut elimination in multiplicative linear logic to the taylor expansion of proof nets")
  Member "a type system for the vectorial aspect of the linear algebraic lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the vectorial λ calculus")
  Member "a computational definition of the notion of vectorial space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "change actions from incremental computation to discrete derivatives")
  Member "algebraic totality towards completeness":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the vectorial λ calculus")
  Member "reasoning about entanglement and separability in quantum higher order functions":
    also connected through other hyperedges:
      (none)
  Member "quantum entanglement analysis based on abstract interpretation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "completeness of algebraic cps simulations")
  Member "a lambda calculus for quantum computation with classical control":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "toward certified quantum programming")

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)