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 "short circuit logic"):
  Abstract: Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. A short-circuit logic is a variant of propositional logic (PL) that can be defined by short-circuit evaluation and implies the set of consequences defined by a module SCL. The module SCL is defined using Hoare's conditional, a ternary connective comparable to if-then-else, and implies all identities that follow from four basic axioms for the conditional and can be expressed in PL (e.g., axioms for associativity of conjunction and double negation shift.) In the absence of side-effects, short-circuit evaluation characterizes PL. However, short-circuit logic admits the possibility to model side-effects. We use sequential conjunction as a primitive connective because it immediately relates to short-circuit evaluation. Sequential conjunction gives rise to many different short-circuit logics. The first extreme case is FSCL (free short-circuit logic), which characterizes the setting in which evaluation of each atom (propositional variable) can yield a side-effect. The other extreme case is MSCL (memorizing short-circuit logic), the strongest (most identifying) variant we distinguish below PL. In MSCL, only static side-effects can be modelled, while sequential conjunction is non-commutative. We provide sets of equations for FSCL and MSCL, and for MSCL we have a completeness result. Extending MSCL with one simple axiom yields SSCL (static short-circuit logic, or sequential PL), for which we also provide a completeness result. We briefly discuss two variants in between FSCL and MSCL, among which a logic that admits the contraction of atoms and of their negations (i.e., x^x contracts to x and ¬x ^ ¬x contracts to ¬x if x is a propositional variable).

Includes members:
  Member "side effects in steering fragments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "evaluation trees for proposition algebra")
  Member "proposition algebra":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "propositional logic with short circuit evaluation a non commutative and a commutative variant")
  Member "steering fragments of instruction sequences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decision taking for selling thread startup")
  Member "on hoare mccarthy algebras":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "evaluation trees for proposition algebra")
  Member "thread extraction for polyadic instruction sequences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bitcoin a money like informational commodity")

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)