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 "higher order segmentation via multicuts"):
  Abstract: Multicuts enable to conveniently represent discrete graphical models for unsupervised and supervised image segmentation, in the case of local energy functions that exhibit symmetries. The basic Potts model and natural extensions thereof to higher-order models provide a prominent class of such objectives, that cover a broad range of segmentation problems relevant to image analysis and computer vision. We exhibit a way to systematically take into account such higher-order terms for computational inference. Furthermore, we present results of a comprehensive and competitive numerical evaluation of a variety of dedicated cutting-plane algorithms. Our approach enables the globally optimal evaluation of a significant subset of these models, without compromising runtime. Polynomially solvable relaxations are studied as well, along with advanced rounding schemes for post-processing.

Includes members:
  Member "a comparative study of modern inference techniques for structured discrete energy minimization problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "worst case polynomial time exact map inference on discrete models with global dependencies")
  Member "fast planar correlation clustering for image segmentation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a generalized framework for agglomerative clustering of signed graphs applied to instance segmentation")
  Member "tightening lp relaxations for map using message passing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph structured prediction energy networks")
  Member "efficiently searching for frustrated cycles in map inference":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph structured prediction energy networks")
  Member "submodular decomposition framework for inference in associative markov networks with global constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "submodular relaxation for inference in markov random fields")
  Member "objective criteria for the evaluation of clustering methods":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interpretable and fair comparison of link prediction or entity alignment methods with adjusted mean rank")

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)