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 "session types with arithmetic refinements and their application to work analysis"):
  Abstract: Session types statically prescribe bidirectional communication protocols for message-passing processes and are in a Curry-Howard correspondence with linear logic propositions. However, simple session types cannot specify properties beyond the type of exchanged messages. In this paper we extend the type system by using index refinements from linear arithmetic capturing intrinsic attributes of data structures and algorithms so that we can express and verify amortized cost of programs using ergometric types. We show that, despite the decidability of Presburger arithmetic, type equality and therefore also type checking are now undecidable, which stands in contrast to analogous dependent refinement type systems from functional languages. We also present a practical incomplete algorithm for type equality and an algorithm for type checking which is complete relative to an oracle for type equality. Process expressions in this explicit language are rather verbose, so we also introduce an implicit form and a sound and complete algorithm for reconstructing explicit programs, borrowing ideas from the proof-theoretic technique of focusing. We conclude by illustrating our systems and algorithms with a variety of examples that have been verified in our implementation.

Includes members:
  Member "resource guided program synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "concise read only specifications for better synthesis of programs with pointers extended version")
  Member "resource aware session types for digital contracts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "renegotiation and recursion in bitcoin contracts")
  Member "a message passing interpretation of adjoint logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "back to futures")
  Member "circular proofs as session typed processes a local validity condition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "back to futures")
  Member "label dependent session types":
    also connected through other hyperedges:
      (none)
  Member "relational cost analysis for functional imperative programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the next 700 relational program logics")
  Member "parallel complexity analysis with temporal session types":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "types for parallel complexity in the pi calculus")
  Member "dependent session types":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "label dependent session 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)