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: "linear haskell practical linearity in a higher order polymorphic language"
  Abstract: Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards-compatibility and code reuse across linear and non-linear users of a library. Only then can the benefits of linear types permeate conventional functional programming. Rather than bifurcate types into linear and non-linear counterparts, we instead attach linearity to function arrows. Linear functions can receive inputs from linearly-bound values, but can also operate over unrestricted, regular values.    To demonstrate the efficacy of our linear type system — both how easy it can be integrated in an existing language implementation and how streamlined it makes it to write programs with linear types — we implemented our type system in ghc, the leading Haskell compiler, and demonstrate two kinds of applications of linear types: mutable data with pure interfaces; and enforcing protocols in I/O-performing functions.

Connected through hyperedge HE-1 (induced by source paper "label dependent session types"):
  with members:
    - "depending on session typed processes"
    - "dependent session types"
    - "recalling a witness foundations and applications of monotonic state"
    - "set theoretic types for polymorphic variants"
    - "sessions as propositions"
    - "complete and easy bidirectional typechecking for higher rank polymorphism"
    - "irrelevance heterogeneous equality and call by value dependent type systems"
    - "linear dependent types and relative completeness"

Connected through hyperedge HE-2 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows"):
  with members:
    - "the best of both worlds linear functional programming without compromise"
    - "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-3 (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"
    - "the best of both worlds linear functional programming without compromise"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-4 (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"
    - "the best of both worlds linear functional programming without compromise"

Connected through hyperedge HE-5 (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"
    - "the best of both worlds linear functional programming without compromise"

Connected through hyperedge HE-6 (induced by source paper "concurrent typestate oriented programming in java"):
  with members:
    - "deadlock free typestate oriented programming"

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)