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 "patchlift fast and exact computation of patch distances using lifting with applications to non local means"):
  Abstract: In this paper, we propose a fast algorithm called PatchLift for computing distances between patches extracted from a one-dimensional signal. PatchLift is based on the observation that the patch distances can be expressed in terms of simple moving sums of an image, which is derived from the one-dimensional signal via lifting. We apply PatchLift to develop a separable extension of the classical Non-Local Means (NLM) algorithm which is at least 100 times faster than NLM for standard parameter settings. The PSNR obtained using the proposed extension is typically close to (and often larger than) the PSNRs obtained using the original NLM. We provide some simulations results to demonstrate the acceleration achieved using separability and PatchLift.

Includes members:
  Member "phaselift exact and stable signal recovery from magnitude measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep s 3 pr simultaneous source separation and phase retrieval using deep generative models")
  Member "fast o 1 bilateral filtering using trigonometric range kernels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast high dimensional kernel filtering")

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.CV(Computer Vision and Pattern Recognition)