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 "a cirquent calculus system with clustering and ranking"):
  Abstract: Cirquent calculus is a new proof-theoretic and semantic approach introduced by G.Japaridze for the needs of his theory of computability logic. The earlier article "From formulas to cirquents in computability logic" by Japaridze generalized the concept of cirquents to the version with what are termed clusterng and ranking, and showed that, through cirquents with clustering and ranking, one can capture, refine and generalize the so called extended IF logic. Japaridze's treatment of extended IF logic, however, was purely semantical, and no deductive system was proposed. The present paper syntactically constructs a cirquent calculus system with clustering and ranking, sound and complete w.r.t. the propositional fragment of cirquent-based semantics. Such a system can be considered not only a conservative extension of classical propositional logic but also, when limited to cirquents with no more than 2 ranks, an axiomatization of purely propositional extended IF logic in its full generality.

Includes members:
  Member "the computational complexity of propositional cirquent calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamentals of computability logic")
  Member "extracting verified decision procedures dpll and resolution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "up to techniques for branching bisimilarity")
  Member "a propositional system induced by japaridze s approach to if logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamentals of computability logic")
  Member "the taming of recurrences in computability logic through cirquent calculus part ii":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamentals of computability logic")
  Member "the parallel versus branching recurrences in computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamentals of computability logic")
  Member "from formulas to cirquents in computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamentals of computability logic")
  Member "the countable versus uncountable branching recurrences in computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamentals of computability logic")
  Member "soundness and completeness of the cirquent calculus system cl6 for 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)