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: "domain theory for modeling oop a summary"
  Abstract: Domain theory is `a mathematical theory that serves as a foundation for the semantics of programming languages'. Domains form the basis of a theory of partial information, which extends the familiar notion of partial function to encompass a whole spectrum of "degrees of definedness", so as to model incremental higher-order computation (i.e., computing with infinite data values, such as functions defined over an infinite domain like the domain of integers, infinite trees, and such as objects of object-oriented programming). General considerations from recursion theory dictate that partial functions are unavoidable in any discussion of computability. Domain theory provides an appropriately abstract setting in which the notion of a partial function can be lifted and used to give meaning to higher types, recursive types, etc. NOOP is a domain-theoretic model of nominally-typed OOP. NOOP was used to prove the identification of inheritance and subtyping in mainstream nominally-typed OO programming languages and the validity of this identification. In this report we first present the definitions of basic domain theoretic notions and domain constructors used in the construction of NOOP, then we present the construction of a simple structural model of OOP called COOP as a step towards the construction of NOOP. Like the construction of NOOP, the construction of COOP uses earlier presented domain constructors.

Connected through hyperedge HE-1 (induced by source paper "noop a domain theoretic model of nominally typed oop"):
  with members:
    - "an overview of nominal typing versus structural typing in object oriented programming with code examples"

Connected through hyperedge HE-2 (induced by source paper "novel uses of category theory in modeling oop"):
  with members:
    - "towards a java subtyping operad extended version"
    - "why nominal typing matters in oop"
    - "towards an accurate mathematical model of generic nominally typed oop"
    - "towards understanding generics in mainstream oop"
    - "an overview of nominal typing versus structural typing in object oriented programming with code examples"

Connected through hyperedge HE-3 (induced by source paper "category theory for modeling oop"):
  with members:
    - "towards a java subtyping operad extended version"
    - "why nominal typing matters in oop"
    - "an overview of nominal typing versus structural typing in object oriented programming with code examples"

Connected through hyperedge HE-4 (induced by source paper "a comparison of noop to structural domain theoretic models of oop"):
  with members:
    - "why nominal typing matters in oop"
    - "an overview of nominal typing versus structural typing in object oriented programming with code examples"

Connected through hyperedge HE-5 (induced by source paper "a comparison of noop to structural domain theoretic models of object oriented programming"):
  with members:
    - "an overview of nominal typing versus structural typing in object oriented programming with code examples"

Connected through hyperedge HE-6 (induced by source paper "towards understanding generics in mainstream oop"):
  with members:
    - "a comparison of noop to structural domain theoretic models of object oriented programming"

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)