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: "when is a container a comonad"
  Abstract: Abbott, Altenkirch, Ghani and others have taught us that many parameterized#N#datatypes (set functors) can be usefully analyzed via container representations#N#in terms of a set of shapes and a set of positions in each shape. This paper#N#builds on the observation that datatypes often carry additional structure that#N#containers alone do not account for. We introduce directed containers to#N#capture the common situation where every position in a data-structure#N#determines another data-structure, informally, the sub-data-structure rooted by#N#that position. Some natural examples are non-empty lists and node-labelled#N#trees, and data-structures with a designated position (zippers). While#N#containers denote set functors via a fully-faithful functor, directed#N#containers interpret fully-faithfully into comonads. But more is true: every#N#comonad whose underlying functor is a container is represented by a directed#N#container. In fact, directed containers are the same as containers that are#N#comonads. We also describe some constructions of directed containers. We have#N#formalized our development in the dependently typed programming language Agda.

Connected through hyperedge HE-1 (induced by source paper "quotients in monadic programming projective algebras are equivalent to coalgebras"):
  with members:
    - "monads need not be endofunctors"
    - "bicompletions of distance matrices"
    - "bases as coalgebras"
    - "quantitative concept analysis"

Connected through hyperedge HE-2 (induced by source paper "directed containers as categories"):
  with members:
    - "monads need not be endofunctors"

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)