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: "the best of both worlds linear functional programming without compromise"
  Abstract: We present a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming. Unlike previous combinations of linear typing and functional programming, we compromise neither the linear side (for example, our linear values are first-class citizens of the language) nor the functional side (for example, we do not require duplicate definitions of compositions for linear and unrestricted functions). To do so, we must generalize abstraction and application to encompass both linear and unrestricted functions. We capture the typing of the generalized constructs with a novel use of qualified types. Our system maintains the metatheoretic properties of the theory of qualified types, including principal types and decidable type inference. Finally, we give a formal basis for our claims of expressiveness, by showing that evaluation respects linearity, and that our language is a conservative extension of existing functional calculi.

Connected through hyperedge HE-1 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows"):
  with members:
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "type classes for lightweight substructural types"
    - "a lambda calculus for quantum computation with classical control"
    - "a feasible algorithm for typing in elementary affine logic"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-2 (induced by source paper "mixed linear and non linear recursive types"):
  with members:
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-3 (induced by source paper "kindly bent to free us"):
  with members:
    - "a modular inference of linear types for multiplicity annotated arrows"
    - "oxide the essence of rust"
    - "linear haskell practical linearity in a higher order polymorphic language"

Connected through hyperedge HE-4 (induced by source paper "lnl fpc the linear non linear fixpoint calculus"):
  with members:
    - "mixed linear and non linear recursive types"
    - "enriching a linear non linear lambda calculus a programming language for string diagrams"
    - "linear haskell practical linearity in a higher order polymorphic language"

Connected through hyperedge HE-5 (induced by source paper "linear haskell practical linearity in a higher order polymorphic language"):
  with members:
    - "monads need not be endofunctors"

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)