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: "area universal rectangular layouts"
  Abstract: A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it might hence be desirable if one rectangular layout can represent several area assignments. A layout is area-universal if any assignment of areas to rectangles can be realized by a combinatorially equivalent rectangular layout. We identify a simple necessary and sufficient condition for a rectangular layout to be area-universal: a rectangular layout is area-universal if and only if it is one-sided. More generally, given any rectangular layout L and any assignment of areas to its regions, we show that there can be at most one layout (up to horizontal and vertical scaling) which is combinatorially equivalent to L and achieves a given area assignment. We also investigate similar questions for perimeter assignments. The adjacency requirements for the rectangles of a rectangular layout can be specified in various ways, most commonly via the dual graph of the layout. We show how to find an area-universal layout for a given set of adjacency requirements whenever such a layout exists.

Connected through hyperedge HE-1 (induced by source paper "computing stable demers cartograms"):
  with members:
    - "the state of the art in cartograms"
    - "recognizing weighted disk contact graphs"
    - "computing cartograms with optimal complexity"

Connected through hyperedge HE-2 (induced by source paper "adjacency preserving spatial treemaps"):
  with members:
    - "orientation constrained rectangular layouts"
    - "minimum weight triangulation is np hard"

Connected through hyperedge HE-3 (induced by source paper "steinitz theorems for simple orthogonal polyhedra"):
  with members:
    - "adjacency preserving spatial treemaps"
    - "the complexity of bendless three dimensional orthogonal graph drawing"
    - "orientation constrained rectangular layouts"
    - "isometric diamond subgraphs"
    - "the lattice dimension of a graph"
    - "nonorthogonal polyhedra built from rectangles"

Connected through hyperedge HE-4 (induced by source paper "morphing schnyder drawings of planar triangulations"):
  with members:
    - "how to morph planar graph drawings"
    - "morphing planar graph drawings with unidirectional moves"
    - "morphing planar graph drawings optimally"
    - "algorithms for sampling 3 orientations of planar triangulations"

Connected through hyperedge HE-5 (induced by source paper "computing cartograms with optimal complexity"):
  with members:
    - "optimal polygonal representation of planar graphs"
    - "rectangular layouts and contact graphs"
    - "compact floor planning via orderly spanning trees"

Connected through hyperedge HE-6 (induced by source paper "circular arc cartograms"):
  with members:
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"
    - "computing cartograms with optimal complexity"

Connected through hyperedge HE-7 (induced by source paper "regular labelings and geometric structures"):
  with members:
    - "steinitz theorems for simple orthogonal polyhedra"
    - "orientation constrained rectangular layouts"
    - "compact floor planning via orderly spanning trees"

Connected through hyperedge HE-8 (induced by source paper "graph theoretic solutions to computational geometry problems"):
  with members:
    - "orientation constrained rectangular layouts"
    - "optimal angular resolution for face symmetric drawings"
    - "testing bipartiteness of geometric intersection graphs"
    - "optimal embedding into star metrics"
    - "trees with convex faces and optimal angles"
    - "algorithms for drawing media"
    - "the traveling salesman problem for cubic graphs"

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)