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 "points on computable curves"):
  Abstract: The ``analyst's traveling salesman theorem'' of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This result, proven for the plane by Jones (1990) and extended to higher-dimensional Euclidean spaces by Okikiolu (1991), says that a bounded set $K$ is contained in some curve of finite length if and only if a certain ``square beta sum'', involving the ``width of $K$'' in each element of an infinite system of overlapping ``tiles'' of descending size, is finite. #R##N#In this paper we characterize those {\it points} of Euclidean space that lie on {\it computable} curves of finite length by formulating and proving a computable extension of the analyst's traveling salesman theorem. Our extension says that a point in Euclidean space lies on some computable curve of finite length if and only if it is ``permitted'' by some computable ``Jones constriction''. A Jones constriction here is an explicit assignment of a rational cylinder to each of the above-mentioned tiles in such a way that, when the radius of the cylinder corresponding to a tile is used in place of the ``width of $K$'' in each tile, the square beta sum is finite. A point is permitted by a Jones constriction if it is contained in the cylinder assigned to each tile containing the point. The main part of our proof is the construction of a computable curve of finite length traversing all the points permitted by a given Jones constriction. Our construction uses the main ideas of Jones's ``farthest insertion'' construction, but our algorithm for computing the curve must work exclusively with the Jones constriction itself, because it has no direct access to the (typically uncomputable) points permitted by the Jones constriction.

Includes members:
  Member "on the complexity of real functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "round complexity of common randomness generation the amortized setting")
  Member "computing over the reals foundations for scientific computing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a theory of np completeness and ill conditioning for approximate real computations")
  Member "dimension in complexity classes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asymptotic divergences and strong dichotomy")
  Member "the dimensions of individual strings and sequences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who asked us how the theory of computing answers questions about analysis")

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)