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 "label dependent session types"):
  Abstract: Session types have emerged as a typing discipline for communication protocols. Existing calculi with session types come equipped with many different primitives that combine communication with the introduction or elimination of the transmitted value. #R##N#We present a foundational session type calculus with a lightweight operational semantics. It fully decouples communication from the introduction and elimination of data and thus features a single communication reduction, which acts as a rendezvous between senders and receivers. We achieve this decoupling by introducing label-dependent session types, a minimalist value-dependent session type system with subtyping. The system is sufficiently powerful to simulate existing functional session type systems. Compared to such systems, label-dependent session types place fewer restrictions on the code. We further introduce primitive recursion over natural numbers at the type level, thus allowing to describe protocols whose behaviour depends on numbers exchanged in messages. An algorithmic type checking system is introduced and proved equivalent to its declarative counterpart. The new calculus showcases a novel lightweight integration of dependent types and linear typing, with has uses beyond session type systems.

Includes members:
  Member "depending on session typed processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "intrinsically typed mechanized semantics for session types")
  Member "dependent session types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "recalling a witness foundations and applications of monotonic state":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "meta f proof automation with smt tactics and metaprograms")
  Member "linear haskell practical linearity in a higher order polymorphic language":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows")
  Member "set theoretic types for polymorphic variants":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fast and precise type checking for javascript")
  Member "sessions as propositions":
    also connected through other hyperedges:
      (none)
  Member "complete and easy bidirectional typechecking for higher rank polymorphism":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "signature restriction for polymorphic algebraic effects")
  Member "irrelevance heterogeneous equality and call by value dependent type systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximate normalization for gradual dependent types")

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.PL(Programming Languages)