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 "pomset logic a logical and grammatical alternative to the lambek calculus"):
  Abstract: Thirty years ago, I introduced a non commutative variant of classical linear logic, called pomset logic, issued from a particular denotational se- mantics or categorical interpretation of linear logic known as coherence spaces. In addition to the multiplicative connectives of linear logic, pomset logic includes a non-commutative connective, ”<” called before, which is associative and self-dual: (A < B)⊥ = A⊥ < B⊥ (observe that there is no swapping), and pomset logic handles Partially Ordered Multisets of for- mulas. This classical calculus enjoys a proof net calculus, cut-elimination, denotational semantics, but had no sequent calculus, despite my many attempts and the study of closely related deductive systems like the cal- culus of structures. At the same period, Alain Lecomte introduced me to Lambek calculus and grammars. We defined a grammatical formalism based on pomset logic, with partial proof nets as the deductive systems for parsing-as-deduction, with a lexicon mapping words to partial proof nets. The study of pomset logic and of its grammatical applications has been out of the limelight for several years, in part because computational lin- guists were not too keen on proof nets. However, recently Sergey Slavnov found a sequent calculus for pomset logic, and reopened the study of pomset logic. In this paper we shall present pomset logic including both published and unpublished material. Just as for Lambek calculus, Pomset logic also is a non commutative variant of linear logic — although Lam- bek calculus appeared 30 years before linear logic ! — and as in Lambek calculus it may be used as a grammar. Apart from this the two calculi are quite different, but perhaps the algebraic presentation we give here, with terms and the semantic correctness criterion, is closer to Lambek’s view.

Includes members:
  Member "proof nets through the lens of graph theory a compilation of remarks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constrained path finding and structure from acyclicity")
  Member "on noncommutative extensions of linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proof nets through the lens of graph theory a compilation of remarks")

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)