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 "parallel complexity analysis with temporal session types"):
  Abstract: We study the problem of parametric parallel complexity analysis of concurrent, message-passing programs. To make the analysis local and compositional, it is based on a conservative extension of binary session types, which structure the type and direction of communication between processes and stand in a Curry-Howard correspondence with intuitionistic linear logic. The main innovation is to enrich session types with the temporal modalities next ($\bigcirc A$), always ($\Box A$), and eventually ($\Diamond A$), to additionally prescribe the timing of the exchanged messages in a way that is precise yet flexible. The resulting temporal session types uniformly express properties such as the message rate of a stream, the latency of a pipeline, the response time of a concurrent queue, or the span of a fork/join parallel program. The analysis is parametric in the cost model and the presentation focuses on communication cost as a concrete example. The soundness of the analysis is established by proofs of progress and type preservation using a timed multiset rewriting semantics. Representative examples illustrate the scope and usability of the approach.

Includes members:
  Member "work analysis with resource aware session types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "non blocking concurrent imperative programming with session types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "work analysis with resource aware session types")
  Member "the complexity of interaction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "towards automatic resource bound analysis for ocaml":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "denotational cost semantics for functional languages with inductive types":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exponential automatic amortized resource analysis")
  Member "timed runtime monitoring for multiparty conversations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "verifying asynchronous interactions via communicating session automata")
  Member "linear dependent types and relative completeness":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "session types with arithmetic refinements and their application to work analysis")

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)