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: "bounding the dimension of points on a line"
  Abstract: We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower bound on the (classical) Hausdorff dimension of generalized sets of Furstenberg type.

Connected through hyperedge HE-1 (induced by source paper "algorithmic randomness in continuous time markov chains"):
  with members:
    - "the reachability problem for petri nets is not elementary"
    - "fractal intersections and products via algorithmic dimension"
    - "demystifying reachability in vector addition systems"
    - "kolmogorov complexity and the geometry of brownian motion"
    - "predictive complexity and generalized entropy rate of stationary ergodic processes"
    - "a tutorial on conformal prediction"

Connected through hyperedge HE-2 (induced by source paper "dimension spectra of lines"):
  with members:
    - "algorithmic information plane kakeya sets and conditional dimension"
    - "the dimensions of individual strings and sequences"

Connected through hyperedge HE-3 (induced by source paper "fractal intersections and products via algorithmic dimension"):
  with members:
    - "algorithmic information plane kakeya sets and conditional dimension"
    - "the dimensions of individual strings and sequences"

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