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 "fourier spectra of measures associated with algorithmically random brownian motion"):
  Abstract: In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion. We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff dimensions of these sets, optimal asymptotic decay at infinity. The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the prefix-free Kolmogorov complexity of finite binary sequences. The study also necessitates a closer look at the potential theory over fractals from a computable point of view.

Includes members:
  Member "kolmogorov complexity and the geometry of brownian motion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algorithmic randomness in continuous time markov chains")
  Member "diophantine properties of brownian motion recursive aspects":
    also connected through other hyperedges:
      (none)
  Member "the rapid points of a complex oscillation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "kolmogorov complexity and the geometry of brownian motion")
  Member "some theorems on the algorithmic approach to probability theory and information theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "kolmogorov complexity in the ussr 1975 1982 isolation and its end")
  Member "computability of probability measures and martin lof randomness over metric spaces":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an application of computable distributions to the semantics of probabilistic programs")
  Member "uniform test of algorithmic randomness over a general space":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "kolmogorov complexity and the geometry of brownian motion")

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.CC(Computational Complexity)