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: "many to one boundary labeling with backbones"
  Abstract: In this paper we study \emph{many-to-one boundary labeling with backbone leaders}. In this new many-to-one model, a horizontal backbone reaches out of each label into the feature-enclosing rectangle. Feature points that need to be connected to this label are linked via vertical line segments to the backbone. We present dynamic programming algorithms for label number and total leader length minimization of crossing-free backbone labelings. When crossings are allowed, we aim to obtain solutions with the minimum number of crossings. This can be achieved efficiently in the case of fixed label order, however, in the case of flexible label order we show that minimizing the number of leader crossings is NP-hard.

Connected through hyperedge HE-1 (induced by source paper "external labeling techniques a taxonomy and survey"):
  with members:
    - "boundary labeling for rectangular diagrams"
    - "radial contour labeling with straight leaders"
    - "many to many geographically embedded flow visualisation an evaluation"
    - "multi sided boundary labeling"
    - "mixed map labeling"

Connected through hyperedge HE-2 (induced by source paper "planar drawings of fixed mobile bigraphs"):
  with members:
    - "multi sided boundary labeling"
    - "on the readability of boundary labeling"
    - "drawing graphs in the plane with a prescribed outer face and polynomial area"
    - "untangling a planar graph"
    - "planar drawings of higher genus graphs"

Connected through hyperedge HE-3 (induced by source paper "on embeddability of buses in point sets"):
  with members:
    - "2 stack pushall sortable permutations"
    - "on bus graph realizability"
    - "confluent drawings visualizing non planar diagrams in a planar way"

Connected through hyperedge HE-4 (induced by source paper "on the readability of boundary labeling"):
  with members:
    - "mixed map labeling"

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)