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: "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.

Connected through hyperedge HE-1 (induced by source paper "system fr as foundations for stainless"):
  with members:
    - "refinement reflection complete verification with smt"
    - "type based termination inflationary fixed points and mixed inductive coinductive types"
    - "miniagda integrating sized and dependent types"

Connected through hyperedge HE-2 (induced by source paper "pml 2 integrated program verification in ml"):
  with members:
    - "a classical realizability model for a semantical value restriction"

Connected through hyperedge HE-3 (induced by source paper "size based termination of higher order rewriting"):
  with members:
    - "higher order dependency pairs"
    - "termination of rewrite relations on λ terms based on girard s notion of reducibility"
    - "the computability path ordering"
    - "revisiting trace and testing equivalences for nondeterministic and probabilistic processes"
    - "derivation lengths classification of godel s t extending howard s assignment"
    - "polynomial interpretations for higher order rewriting"
    - "type based termination inflationary fixed points and mixed inductive coinductive types"
    - "static dependency pair method based on strong computability for higher order rewrite systems"

Connected through hyperedge HE-4 (induced by source paper "practical subtyping for system f with sized co induction"):
  with members:
    - "a classical realizability model for a semantical value restriction"
    - "the size change termination principle for constructor based languages"
    - "on the relation between size based termination and semantic labelling"
    - "decidability of type checking in the calculus of algebraic constructions with size annotations"

Connected through hyperedge HE-5 (induced by source paper "tracking data flow with open closure types"):
  with members:
    - "a logical foundation for environment classifiers"

Connected through hyperedge HE-6 (induced by source paper "type based termination inflationary fixed points and mixed inductive coinductive types"):
  with members:
    - "miniagda integrating sized and dependent types"
    - "representations of stream processors using nested fixed points"
    - "a type based termination criterion for dependently typed higher order rewrite systems"

Connected through hyperedge HE-7 (induced by source paper "refinement types as higher order dependency pairs"):
  with members:
    - "static dependency pair method based on strong computability for higher order rewrite systems"
    - "on the relation between size based termination and semantic labelling"
    - "a type based termination criterion for dependently typed higher order rewrite systems"

Connected through hyperedge HE-8 (induced by source paper "miniagda integrating sized and dependent types"):
  with members:
    - "beating the productivity checker using embedded languages"
    - "using structural recursion for corecursion"
    - "a type based termination criterion for dependently typed higher order rewrite systems"
    - "decidability of type checking in the calculus of algebraic constructions with size annotations"

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)