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: "refinement types for logical frameworks and their interpretation as proof irrelevance"
  Abstract: Refinement types sharpen systems of simple and dependent types by offering#N#expressive means to more precisely classify well-typed terms. We present a#N#system of refinement types for LF in the style of recent formulations where#N#only canonical forms are well-typed. Both the usual LF rules and the rules for#N#type refinements are bidirectional, leading to a straightforward proof of#N#decidability of typechecking even in the presence of intersection types.#N#Because we insist on canonical forms, structural rules for subtyping can now be#N#derived rather than being assumed as primitive. We illustrate the expressive#N#power of our system with examples and validate its design by demonstrating a#N#precise correspondence with traditional presentations of subtyping. Proof#N#irrelevance provides a mechanism for selectively hiding the identities of terms#N#in type theories. We show that LF refinement types can be interpreted as#N#predicates using proof irrelevance, establishing a uniform relationship between#N#two previously studied concepts in type theory. The interpretation and its#N#correctness proof are surprisingly complex, lending support to the claim that#N#refinement types are a fundamental construct rather than just a convenient#N#surface syntax for certain uses of proof irrelevance.

Connected through hyperedge HE-1 (induced by source paper "a type checker for a logical framework with union and intersection types"):
  with members:
    - "non idempotent intersection types in logical form"
    - "the delta calculus syntax and types"
    - "the delta framework"
    - "a bi directional refinement algorithm for the calculus of co inductive constructions"

Connected through hyperedge HE-2 (induced by source paper "refining inductive types"):
  with members:
    - "transporting functions across ornaments"

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)