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 "java generics an order theoretic approach abridged outline"):
  Abstract: The mathematical modeling of generics in Java and other similar nominally-typed object-oriented programming languages is a challenge. In this short paper we present the outline of a novel order-theoretic approach to modeling generics, in which we also elementarily use some concepts and tools from category theory. We believe a combined order-theoretic and category-theoretic approach to modeling generics holds the keys to overcoming much of the adversity found when analyzing features of generic OO type systems.

Includes members:
  Member "induction coinduction and fixed points intuitions and tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mutual coinduction")
  Member "java generics an order theoretic approach detailed outline":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using category theory in modeling generics in oop outline")
  Member "induction coinduction and fixed points in pl type theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mutual coinduction")
  Member "towards taming java wildcards and extending java with interval types":
    also connected through other hyperedges:
      (none)
  Member "java subtyping as an infinite self similar partial graph product":
    also connected through other hyperedges:
      (none)
  Member "doubly f bounded generics":
    also connected through other hyperedges:
      (none)
  Member "towards understanding generics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "partial cartesian graph product")

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)