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 "computing haar measures"):
  Abstract: According to Haar's Theorem, every compact group $G$ admits a unique left-invariant Borel probability measure $\mu_G$. Let the Haar integral (of $G$) denote the functional $\int_G:\mathcal{C}(G)\ni f\mapsto \int f\,d\mu_G$ integrating any continuous function $f:G\to\mathbb{R}$ with respect to $\mu_G$. This generalizes, and recovers for the additive group $G=[0;1)\mod 1$, the usual Riemann integral: computable (cmp. Weihrauch 2000, Theorem~6.4.1), and of computational cost characterizing complexity class #P$_1$ (cmp. Ko 1991, Theorem~5.32). We establish that in fact every computably compact computable metric group renders the Haar integral computable: once using an elegant synthetic argument; and once presenting and analyzing an explicit, imperative algorithm. Regarding computational complexity, for the groups $\mathcal{SO}(3)$ and $\mathcal{SU}(2)$ we reduce the Haar integral to and from Euclidean/Riemann integration. In particular both also characterize #P$_1$.

Includes members:
  Member "effective local compactness and the hyperspace of located sets":
    also connected through other hyperedges:
      (none)
  Member "t omega representations of compact sets":
    also connected through other hyperedges:
      (none)
  Member "semantics logic and verification of exact real computation":
    also connected through other hyperedges:
      (none)
  Member "how constructive is constructing measures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weihrauch degrees of finding equilibria in sequential games")

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)