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: "recurrence for multidimensional space filling functions"
  Abstract: A space-filling function is a bijection from the unit line segment to the unit square, cube, or hypercube. The function from the unit line segment is continuous. The inverse function, while well-defined, is not continuous. Space-filling curves, the finite approximations to space-filling functions, have found application in global optimization, database indexing, and dimension reduction among others. For these applications the desired transforms are mapping a scalar to multidimensional coordinates and mapping multidimensional coordinates to a scalar. #R##N#Presented are recurrences which produce space-filling functions and curves of any rank $d\ge2$ based on serpentine Hamiltonian paths on $({\bf Z}\bmod s)^d$ where $s\ge2$. The recurrences for inverse space-filling functions are also presented. Both Peano and Hilbert curves and functions and their generalizations to higher dimensions are produced by these recurrences. The computations of these space-filling functions and their inverse functions are absolutely convergent geometric series. #R##N#The space-filling functions are constructed as limits of integer recurrences and equivalently as non-terminating real recurrences. Scaling relations are given which enable the space-filling functions and curves and their inverses to extend beyond the unit area or volume and even to all of $d$-space. #R##N#This unification of pandimensional space-filling curves facilitates quantitative comparison of curves generated from different Hamiltonian paths. The isotropy and performance in dimension reduction of a variety of space-filling curves are analyzed. #R##N#For dimension reduction it is found that Hilbert curves perform somewhat better than Peano curves and their isotropic variants.

Connected through hyperedge HE-1 (induced by source paper "how many three dimensional hilbert curves are there"):
  with members:
    - "hyperorthogonal well folded hilbert curves"
    - "recursive tilings and space filling curves with little fragmentation"
    - "locality and bounding box quality of two dimensional space filling curves"

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.CG(Computational Geometry)