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: "locality and bounding box quality of two dimensional space filling curves"
  Abstract: Space-filling curves can be used to organise points in the plane into bounding-box hierarchies (such as R-trees). We develop measures of the bounding-box quality of space-filling curves that express how effective different space-filling curves are for this purpose. We give general lower bounds on the bounding-box quality measures and on locality according to Gotsman and Lindenbaum for a large class of space-filling curves. We describe a generic algorithm to approximate these and similar quality measures for any given curve. Using our algorithm we find good approximations of the locality and the bounding-box quality of several known and new space-filling curves. Surprisingly, some curves with relatively bad locality by Gotsman and Lindenbaum's measure, have good bounding-box quality, while the curve with the best-known locality has relatively bad bounding-box quality.

Connected through hyperedge HE-1 (induced by source paper "a scalable parallel finite element framework for growing geometries application to metal additive manufacturing"):
  with members:
    - "a generic finite element framework on parallel tree based adaptive meshes"
    - "numerical modelling of heat transfer and experimental validation in powder bed fusion with the virtual domain approximation"
    - "the aggregated unfitted finite element method for elliptic problems"
    - "fempar an object oriented parallel finite element framework"
    - "space time balancing domain decomposition"
    - "morton curve segments produce no more than two distinct face connected subdomains"
    - "recursive algorithms for distributed forests of octrees"

Connected through hyperedge HE-2 (induced by source paper "how many three dimensional hilbert curves are there"):
  with members:
    - "hyperorthogonal well folded hilbert curves"
    - "recurrence for multidimensional space filling functions"
    - "recursive tilings and space filling curves with little fragmentation"

Connected through hyperedge HE-3 (induced by source paper "hyperorthogonal well folded hilbert curves"):
  with members:
    - "harmonious hilbert curves and other extradimensional space filling curves"
    - "an inventory of three dimensional hilbert space filling curves"

Connected through hyperedge HE-4 (induced by source paper "reordering columns for smaller indexes"):
  with members:
    - "sorting improves word aligned bitmap indexes"
    - "teaching an old elephant new tricks"
    - "pruning attribute values from data cubes with diamond dicing"
    - "a comparison of five probabilistic view size estimation techniques in olap"
    - "attribute value reordering for efficient hybrid olap"

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)