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: "miniagda integrating sized and dependent types"
  Abstract: Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descent and guardedness in the type system to make termination checking robust and suitable for strong abstractions like higher-order functions and polymorphism. To study the application of sized types to proof assistants and programming languages based on dependent type theory, we have implemented a core language, MiniAgda, with explicit handling of sizes. New considerations were necessary to soundly integrate sized types with dependencies and pattern matching, which was made possible by modern concepts such as inaccessible patterns and parametric function spaces. This paper provides an

Connected through hyperedge HE-1 (induced by source paper "a type and scope safe universe of syntaxes with binding their semantics and proofs"):
  with members:
    - "generic description of well scoped well typed syntaxes"
    - "monads need not be endofunctors"

Connected through hyperedge HE-2 (induced by source paper "elaborating inductive definitions and course of values induction in cedille"):
  with members:
    - "course of value induction in cedille"
    - "generic zero cost reuse for dependent types"
    - "transporting functions across ornaments"
    - "elaborating inductive definitions"
    - "inductive types in the calculus of algebraic constructions"

Connected through hyperedge HE-3 (induced by source paper "the size change principle for mixed inductive and coinductive types"):
  with members:
    - "a generalized modality for recursion"
    - "programming and reasoning with guarded recursion for coinductive types"
    - "the size change termination principle for constructor based languages"
    - "type based termination inflationary fixed points and mixed inductive coinductive types"

Connected through hyperedge HE-4 (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"
    - "semi continuous sized types and termination"

Connected through hyperedge HE-5 (induced by source paper "elaborating inductive datatypes and course of values pattern matching to cedille"):
  with members:
    - "generic zero cost reuse for dependent types"

Connected through hyperedge HE-6 (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-7 (induced by source paper "course of value induction in cedille"):
  with members:
    - "syntax and semantics of cedille"
    - "efficient mendler style lambda encodings in cedille"

Connected through hyperedge HE-8 (induced by source paper "flag based big step semantics"):
  with members:
    - "normalization by evaluation in the delay monad a case study for coinduction via copatterns and sized types"
    - "coinductive big step semantics for concurrency"
    - "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction"
    - "coinductive big step operational semantics"

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)