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: "exploring the boundaries of monad tensorability on set"
  Abstract: We study a composition operation on monads, equivalently presented as large#N#equational theories. Specifically, we discuss the existence of tensors, which#N#are combinations of theories that impose mutual commutation of the operations#N#from the component theories. As such, they extend the sum of two theories,#N#which is just their unrestrained combination. Tensors of theories arise in#N#several contexts; in particular, in the semantics of programming languages, the#N#monad transformer for global state is given by a tensor. We present two main#N#results: we show that the tensor of two monads need not in general exist by#N#presenting two counterexamples, one of them involving finite powerset (i.e. the#N#theory of join semilattices); this solves a somewhat long-standing open#N#problem, and contrasts with recent results that had ruled out previously#N#expected counterexamples. On the other hand, we show that tensors with bounded#N#powerset monads do exist from countable powerset upwards.

Connected through hyperedge HE-1 (induced by source paper "dijkstra monads for all"):
  with members:
    - "signatures and induction principles for higher inductive inductive types"
    - "quantitative logics for equivalence of effectful programs"
    - "behavioural equivalence via modalities for algebraic effects"
    - "dijkstra monads for free"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"
    - "handling algebraic effects"

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.LO(Logic in Computer Science)