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 "from formulas to cirquents in computability logic"):
  Abstract: Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a#N#recently introduced semantical platform and ambitious program for redeveloping#N#logic as a formal theory of computability, as opposed to the formal theory of#N#truth that logic has more traditionally been. Its expressions represent#N#interactive computational tasks seen as games played by a machine against the#N#environment, and "truth" is understood as existence of an algorithmic winning#N#strategy. With logical operators standing for operations on games, the#N#formalism of CoL is open-ended, and has already undergone series of extensions.#N#This article extends the expressive power of CoL in a qualitatively new way,#N#generalizing formulas (to which the earlier languages of CoL were limited) to#N#circuit-style structures termed cirquents. The latter, unlike formulas, are#N#able to account for subgame/subtask sharing between different parts of the#N#overall game/task. Among the many advantages offered by this ability is that it#N#allows us to capture, refine and generalize the well known#N#independence-friendly logic which, after the present leap forward, naturally#N#becomes a conservative fragment of CoL, just as classical logic had been known#N#to be a conservative fragment of the formula-based version of CoL. Technically,#N#this paper is self-contained, and can be read without any prior familiarity#N#with CoL.

Includes members:
  Member "introduction to clarithmetic ii":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamentals of computability logic")
  Member "games and full completeness for multiplicative linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interaction laws of monads and comonads")
  Member "a logical basis for constructive systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamentals of computability logic")
  Member "toggling operators in computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamentals of computability logic")
  Member "towards applied theories based on computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamentals of computability logic")
  Member "many concepts and two logics of algorithmic reduction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "introduction to clarithmetic ii")
  Member "in the beginning was game semantics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamentals of computability logic")
  Member "sequential operators in computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamentals of computability logic")

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)