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 "presenting finite posets"):
  Abstract: We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of generators and relations, we construct a presentation of our category, which corresponds to a variant of the notion of bialgebra.

Includes members:
  Member "towards 3 dimensional rewriting theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "directed homotopy in non positively curved spaces")
  Member "the structure of first order causality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interacting frobenius algebras are hopf")
  Member "a non standard semantics for kahn networks in continuous time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "abstract interpretation with infinitesimals towards scalability in nonstandard static analysis extended version")
  Member "the structure of first order causality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interacting frobenius algebras are hopf")
  Member "asynchronous games innocence without alternation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "what s in a game a theory of game models")

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