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: "metric dimension for gabriel unit disk graphs is np complete"
  Abstract: We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete even if the networks are unit disk graphs that contain only Gabriel edges. This problem is equivalent to Metric Dimension for Gabriel unit disk graphs. The Gabriel edges of a unit disc graph induce a planar O(\sqrt{n}) distance and an optimal energy spanner. This is one of the most interesting restrictions of Metric Dimension in the context of wireless multi-hop networks.

Connected through hyperedge HE-1 (induced by source paper "the fault tolerant metric dimension of cographs"):
  with members:
    - "computing the metric dimension by decomposing graphs into extended biconnected components"
    - "identification location domination and metric dimension on interval and permutation graphs i bounds"
    - "metric dimension of bounded tree length graphs"
    - "on the parameterized and approximation hardness of metric dimension"
    - "on the complexity of metric dimension"

Connected through hyperedge HE-2 (induced by source paper "metric dimension parameterized by treewidth"):
  with members:
    - "identification location domination and metric dimension on interval and permutation graphs i bounds"
    - "metric dimension of bounded tree length graphs"
    - "metric dimension parameterized by max leaf number"
    - "on the parameterized and approximation hardness of metric dimension"
    - "complexity of metric dimension on planar graphs"

Connected through hyperedge HE-3 (induced by source paper "alternative parameterizations of metric dimension"):
  with members:
    - "identification location domination and metric dimension on interval and permutation graphs ii algorithms and complexity"
    - "a polynomial turing kernel for weighted independent set in bull free graphs"
    - "metric dimension of bounded tree length graphs"
    - "metric dimension parameterized by max leaf number"
    - "characterizing the easy to find subgraphs from the viewpoint of polynomial time algorithms kernels and turing kernels"
    - "kernelization lower bounds by cross composition"
    - "non existence of polynomial kernels for the test cover problem"
    - "parameterized study of the test cover problem"

Connected through hyperedge HE-4 (induced by source paper "computing the metric dimension by decomposing graphs into extended biconnected components"):
  with members:
    - "identification location domination and metric dimension on interval and permutation graphs i bounds"
    - "metric dimension of bounded tree length graphs"
    - "on the parameterized and approximation hardness of metric dimension"
    - "on the complexity of metric dimension"

Connected through hyperedge HE-5 (induced by source paper "on the distance identifying set meta problem and applications to the complexity of identifying problems on graphs"):
  with members:
    - "identification location domination and metric dimension on interval and permutation graphs ii algorithms and complexity"
    - "metric dimension of bounded tree length graphs"
    - "on the parameterized and approximation hardness of metric dimension"
    - "on the complexity of metric dimension"

Connected through hyperedge HE-6 (induced by source paper "identification location domination and metric dimension on interval and permutation graphs ii algorithms and complexity"):
  with members:
    - "identification location domination and metric dimension on interval and permutation graphs i bounds"
    - "identifying codes in hereditary classes of graphs and vc dimension"
    - "metric dimension parameterized by max leaf number"
    - "on the parameterized and approximation hardness of metric dimension"
    - "on the complexity of metric dimension"

Connected through hyperedge HE-7 (induced by source paper "complexity of metric dimension on planar graphs"):
  with members:
    - "identification location domination and metric dimension on interval and permutation graphs ii algorithms and complexity"
    - "metric dimension of bounded tree length graphs"
    - "on the parameterized and approximation hardness of metric dimension"
    - "bidimensionality and eptas"

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.CC(Computational Complexity)