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 "around finite second order coherence spaces"):
  Abstract: Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear language: more precisely, we show that in Girard's semantics of second-order linear logic using coherence spaces and normal functors, the denotations of multiplicative-additive formulas are finite. #R##N#This model is also effective, in the sense that the denotations of formulas and proofs are computable, as we show. We also establish analogous results for a second-order extension of Ehrhard's hypercoherences; while finiteness holds for the same reason as in coherence spaces, effectivity presents additional difficulties. #R##N#Finally, we discuss the applications our our work to implicit computational complexity in linear (or affine) logic. In view of these applications, we study cardinality and complexity bounds in our finite semantics.

Includes members:
  Member "an introduction to differential linear logic proof nets models and antiderivatives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "backpropagation in the simply typed lambda calculus with linear negation")
  Member "relational semantics of linear logic and higher order model checking":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "intersection types for unboundedness problems")
  Member "using models to model check recursive schemes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "recursion schemes the mso logic and the u quantifier")
  Member "least and greatest fixed points in linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "back to futures")
  Member "a finite semantics of simply typed lambda terms for infinite runs of automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "typing weak msol properties")

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)