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 maximum persistency and comparison theorems"):
  Abstract: We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1 polynomial programming). For polyhedral relaxations of such problems it is generally not true that variables integer in the relaxed solution will retain the same values in the optimal discrete solution. Those which do are called persistent. Such persistent variables define a part of a globally optimal solution. Once identified, they can be excluded from the problem, reducing its size. #R##N#To any polyhedral relaxation we associate a sufficient condition proving persistency of a subset of variables. We set up a specially constructed linear program which determines the set of persistent variables maximal with respect to the relaxation. The condition improves as the relaxation is tightened and possesses all its invariances. The proposed framework explains a variety of existing methods originating from different areas of research and based on different principles. A theoretical comparison is established that relates these methods to the standard linear relaxation and proves that the proposed technique identifies same or larger set of persistent variables.

Includes members:
  Member "a new look at reweighted message passing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "map inference via block coordinate frank wolfe algorithm")
  Member "maximum persistency via iterative relaxed inference with graphical models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a discriminative view of mrf pre processing algorithms")
  Member "maximum persistency in energy minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a discriminative view of mrf pre processing algorithms")
  Member "partial optimality by pruning for map inference with general graphical models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a discriminative view of mrf pre processing algorithms")
  Member "potts model parametric maxflow and k submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient optimization for hierarchically structured interacting segments hints")
  Member "generalized sequential tree reweighted message passing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient graph cut optimization for full crfs with quantized edges")
  Member "the power of linear programming for valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "piecewise linear valued csps solvable by linear programming relaxation")
  Member "efficiently searching for frustrated cycles in map inference":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "graph structured prediction energy networks")

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)