human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on the distance identifying set meta problem and applications to the complexity of identifying problems on graphs"):
  Abstract: Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a promising solution named Distance Identifying Set. The model contains Identifying Code (IC), Locating Dominating Set (LD) and their generalizations $r$-IC and $r$-LD where the closed neighborhood is considered up to distance $r$. It also contains Metric Dimension (MD) and its refinement $r$-MD in which the distance between two vertices is considered as infinite if the real distance exceeds $r$. Note that while IC = 1-IC and LD = 1-LD, we have MD = $\infty$-MD; we say that MD is not local #R##N#In this article, we prove computational lower bounds for several problems included in Distance Identifying Set by providing generic reductions from (Planar) Hitting Set to the meta-problem. We mainly focus on two families of problem from the meta-problem: the first one, called bipartite gifted local, contains $r$-IC, $r$-LD and $r$-MD for each positive integer $r$ while the second one, called 1-layered, contains LD, MD and $r$-MD for each positive integer $r$. We have: #R##N#- the 1-layered problems are NP-hard even in bipartite apex graphs, #R##N#- the bipartite gifted local problems are NP-hard even in bipartite planar graphs, #R##N#- assuming ETH, all these problems cannot be solved in $2^{o(\sqrt{n})}$ when restricted to bipartite planar or apex graph, respectively, and they cannot be solved in $2^{o(n)}$ on bipartite graphs, #R##N#- even restricted to bipartite graphs, they do not admit parameterized algorithms in $2^{O(k)}.n^{O(1)}$ except if W[0] = W[2]. Here $k$ is the solution size of a relevant identifying set. #R##N#In particular, Metric Dimension cannot be solved in $2^{o(n)}$ under ETH, answering a question of Hartung in 2013.

Includes members:
  Member "identification location domination and metric dimension on interval and permutation graphs ii algorithms and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "alternative parameterizations of metric dimension")
  Member "metric dimension of bounded tree length graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the fault tolerant metric dimension of cographs")
  Member "metric dimension for gabriel unit disk graphs is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the fault tolerant metric dimension of cographs")
  Member "on the parameterized and approximation hardness of metric dimension":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the fault tolerant metric dimension of cographs")
  Member "on the complexity of metric dimension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the fault tolerant metric dimension of cographs")

Question: Please tell me which class the source paper 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)