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 "semi continuous sized types and termination"):
  Abstract: Some type-based approaches to termination use sized types: an ordinal bound#N#for the size of a data structure is stored in its type. A recursive function#N#over a sized type is accepted if it is visible in the type system that#N#recursive calls occur just at a smaller size. This approach is only sound if#N#the type of the recursive function is admissible, i.e., depends on the size#N#index in a certain way. To explore the space of admissible functions in the#N#presence of higher-kinded data types and impredicative polymorphism, a#N#semantics is developed where sized types are interpreted as functions from#N#ordinals into sets of strongly normalizing terms. It is shown that upper#N#semi-continuity of such functions is a sufficient semantic criterion for#N#admissibility. To provide a syntactical criterion, a calculus for#N#semi-continuous functions is developed.

Includes members:
  Member "a type based termination criterion for dependently typed higher order rewrite systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "size based termination of higher order rewriting")
  Member "decidability of type checking in the calculus of algebraic constructions with size annotations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "size based termination of higher order rewriting")

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)