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 usage of state"
  Abstract: We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value language to a new linear type theory: the enriched call-by-value calculus. The results are not specic to store, but can be applied to any computational eect expressible using

Connected through hyperedge HE-1 (induced by source paper "interaction laws of monads and comonads"):
  with members:
    - "runners in action"
    - "notions of computation as monoids"
    - "free applicative functors"
    - "handling algebraic effects"
    - "games and full completeness for multiplicative linear logic"
    - "programming interfaces and basic topology"

Connected through hyperedge HE-2 (induced by source paper "runners in action"):
  with members:
    - "synthesizing symmetric lenses"
    - "programming with algebraic effects and handlers"
    - "an effect system for algebraic effects and handlers"
    - "handling algebraic effects"
    - "functor is to lens as applicative is to biplate introducing multiplate"

Connected through hyperedge HE-3 (induced by source paper "classical control quantum circuits and linear logic in enriched category theory"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "a recipe for state and effect triangles"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "operator algebras in quantum computation"
    - "monads need not be endofunctors"
    - "semantics for a quantum programming language by operator algebras"
    - "quipper a scalable quantum programming language"

Connected through hyperedge HE-4 (induced by source paper "a monad for full ground reference cells"):
  with members:
    - "abstract effects and proof relevant logical relations"

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)