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: "linear logic without units"
  Abstract: We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed very thoroughly, at least in the published literature, we need to develop it here. The most natural way to do this - and the simplest, once the (substantial) groundwork has been laid - is to consider promonoidal categories as an instance of the general theory of pseudomonoids in a monoidal bicategory. Accordingly, we describe and explain the notions of monoidal bicategory and pseudomonoid therein. #R##N#The higher-dimensional nature of monoidal bicategories presents serious notational difficulties, since to use the natural analogue of the commutative diagrams used in ordinary category theory would require the use of three-dimensional diagrams. We therefore introduce a novel technical device, which we dub the calculus of components, that simplifies the business of reasoning about a certain class of algebraic structure internal to a monoidal bicategory. When viewed through this simplifying lens, the theory of pseudomonoids turns out to be essentially formally identical to the ordinary theory of monoidal categories. We indicate how the calculus of components may be extended to cover structures that make use of the braiding in a braided monoidal bicategory, and use this to study braided pseudomonoids. #R##N#A higher-dimensional analogue of Cayley's theorem is proved, and used to deduce a novel characterisation of the unit of a promonoidal category. This, and the other preceding work, is then used to give two characterisations of the categories that model the unitless fragment of intuitionistic multiplicative linear logic. Finally we consider the non-intuitionistic case, where the second characterisation in particular takes a surprisingly simple form.

Connected through hyperedge HE-1 (induced by source paper "coherence for frobenius pseudomonoids and the geometry of linear proofs"):
  with members:
    - "globular an online proof assistant for higher dimensional rewriting"
    - "towards 3 dimensional rewriting theory"
    - "from proof nets to the free autonomous category"

Connected through hyperedge HE-2 (induced by source paper "surface proofs for linear logic"):
  with members:
    - "towards 3 dimensional rewriting theory"

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)