human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "an introduction to effectus theory"
  Abstract: Effectus theory is a new branch of categorical logic that aims to capture the essentials of quantum logic, with probabilistic and Boolean logic as special cases. Predicates in effectus theory are not subobjects having a Heyting algebra structure, like in topos theory, but `characteristic' functions, forming effect algebras. Such effect algebras are algebraic models of quantitative logic, in which double negation holds. Effects in quantum theory and fuzzy predicates in probability theory form examples of effect algebras. #R##N#This text is an account of the basics of effectus theory. It includes the fundamental duality between states and effects, with the associated Born rule for validity of an effect (predicate) in a particular state. A basic result says that effectuses can be described equivalently in both `total' and `partial' form. So-called `commutative' and `Boolean' effectuses are distinguished, for probabilistic and classical models. It is shown how these Boolean effectuses are essentially extensive categories. A large part of the theory is devoted to the logical notions of comprehension and quotient, which are described abstractly as right adjoint to truth, and as left adjoint to falisity, respectively. It is illustrated how comprehension and quotients are closely related to measurement. The paper closes with a section on `non-commutative' effectus theory, where the appropriate formalisation is not entirely clear yet.

Connected through hyperedge HE-1 (induced by source paper "lower and upper conditioning in quantum bayesian theory"):
  with members:
    - "the logical essentials of bayesian reasoning"
    - "disintegration and bayesian inversion both abstractly and concretely"

Connected through hyperedge HE-2 (induced by source paper "a complete language for faceted dataflow programs"):
  with members:
    - "normalization for planar string diagrams and a quadratic equivalence algorithm"

Connected through hyperedge HE-3 (induced by source paper "quantum channels as a categorical completion"):
  with members:
    - "on the axiomatizability of quantitative algebras"

Connected through hyperedge HE-4 (induced by source paper "condition decision duality and the internal logic of extensive restriction categories"):
  with members:
    - "a categorical foundation for structured reversible flowchart languages soundness and adequacy"

Connected through hyperedge HE-5 (induced by source paper "distances between states and between predicates"):
  with members:
    - "abstract hidden markov models a monadic account of quantitative information flow"
    - "mixed powerdomains for probability and nondeterminism"
    - "disintegration and bayesian inversion both abstractly and concretely"
    - "a recipe for state and effect triangles"
    - "behavioral metrics via functor lifting"

Connected through hyperedge HE-6 (induced by source paper "healthiness from duality"):
  with members:
    - "a recipe for state and effect triangles"
    - "total and partial computation in categorical quantum foundations"

Question: Please tell me which class the center node 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)