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 "tighter linear program relaxations for high order graphical models"):
  Abstract: Graphical models with High Order Potentials (HOPs) have received considerable interest in recent years. While there are a variety of approaches to inference in these models, nearly all of them amount to solving a linear program (LP) relaxation with unary consistency constraints between the HOP and the individual variables. In many cases, the resulting relaxations are loose, and in these cases the results of inference can be poor. It is thus desirable to look for more accurate ways of performing inference in these models. In this work, we study the LP relaxations that result from enforcing additional consistency constraints between the HOP and the rest of the model. We address theoretical questions about the strength of the resulting relaxations compared to the relaxations that arise in standard approaches, and we develop practical and efficient message passing algorithms for optimizing the LPs. Empirically, we show that the LPs with additional consistency constraints lead to more accurate inference on some challenging problems that include a combination of low order and high order terms.

Includes members:
  Member "a tractable inference algorithm for diagnosing multiple diseases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "evaluate the malignancy of pulmonary nodules using the 3 d deep leaky noisy or network")
  Member "on the generation of alternative explanations with implications for belief revision":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an efficient approach for finding the mpe in belief networks")
  Member "context specific independence in bayesian networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "abstracting probabilistic models a logical perspective")
  Member "fast exact inference for recursive cardinality models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the limited multi label projection layer")
  Member "map estimation linear programming and belief propagation with convex free energies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "convergence rates of smooth message passing with rounding in entropy regularized map inference")
  Member "tightening lp relaxations for map using message passing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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.AI(Artificial Intelligence)