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 "counting edge injective homomorphisms and matchings on restricted graph classes"):
  Abstract: We consider the $\#\mathsf{W}[1]$-hard problem of counting all matchings with exactly $k$ edges in a given input graph $G$; we prove that it remains $\#\mathsf{W}[1]$-hard on graphs $G$ that are line graphs or bipartite graphs with degree $2$ on one side. In our proofs, we use that $k$-matchings in line graphs can be equivalently viewed as edge-injective homomorphisms from the disjoint union of $k$ length-$2$ paths into (arbitrary) host graphs. Here, a homomorphism from $H$ to $G$ is edge-injective if it maps any two distinct edges of $H$ to distinct edges in $G$. We show that edge-injective homomorphisms from a pattern graph $H$ can be counted in polynomial time if $H$ has bounded vertex-cover number after removing isolated edges. For hereditary classes $\mathcal{H}$ of pattern graphs, we complement this result: If the graphs in $\mathcal{H}$ have unbounded vertex-cover number even after deleting isolated edges, then counting edge-injective homomorphisms with patterns from $\mathcal{H}$ is $\#\mathsf{W}[1]$-hard. Our proofs rely on an edge-colored variant of Holant problems and a delicate interpolation argument; both may be of independent interest.

Includes members:
  Member "homomorphisms are a good basis for counting small subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "local wl invariance and hidden shades of regularity")
  Member "holographic algorithm with matchgates is universal for planar csp over boolean domain":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity of counting weighted eulerian orientations with ars")
  Member "parameterizing the permanent genus apices minors evaluation mod 2 k":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")
  Member "exponential time complexity of the permanent and the tutte polynomial":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the fine grained complexity of computing the tutte polynomial of a linear matroid")
  Member "complexity of counting subgraphs only the boundedness of the vertex cover number counts":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")
  Member "the parameterized complexity of k biclique":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameterized inapproximability for steiner orientation by gap amplification")
  Member "the challenges of unbounded treewidth in parameterised subgraph counting problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximately counting and sampling small witnesses using a colourful decision oracle")
  Member "holographic algorithms with matchgates capture precisely tractable planar csp":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "holographic algorithms beyond matchgates")

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)