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: "dependent session types"
  Abstract: Session types offer a type-based discipline for enforcing communication protocols in distributed programming. We have previously formalized simple session types in the setting of multi-threaded $\lambda$-calculus with linear types. In this work, we build upon our earlier work by presenting a form of dependent session types (of DML-style). The type system we formulate provides linearity and duality guarantees with no need for any runtime checks or special encodings. Our formulation of dependent session types is the first of its kind, and it is particularly suitable for practical implementation. As an example, we describe one implementation written in ATS that compiles to an Erlang/Elixir back-end.

Connected through hyperedge HE-1 (induced by source paper "session types with arithmetic refinements and their application to work analysis"):
  with members:
    - "resource guided program synthesis"
    - "resource aware session types for digital contracts"
    - "a message passing interpretation of adjoint logic"
    - "circular proofs as session typed processes a local validity condition"
    - "label dependent session types"
    - "relational cost analysis for functional imperative programs"
    - "parallel complexity analysis with temporal session types"
    - "work analysis with resource aware session types"

Connected through hyperedge HE-2 (induced by source paper "label dependent session types"):
  with members:
    - "depending on session typed processes"
    - "recalling a witness foundations and applications of monotonic state"
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "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-3 (induced by source paper "multiparty dependent session types extended abstract"):
  with members:
    - "session types in a linearly typed multi threaded lambda calculus"
    - "parameterised multiparty session types"

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)