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 "a symbolic algebra for the computation of expected utilities in multiplicative influence diagrams"):
  Abstract: Influence diagrams provide a compact graphical representation of decision problems. Several algorithms for the quick computation of their associated expected utilities are available in the literature. However, often they rely on a full quantification of both probabilistic uncertainties and utility values. For problems where all random variables and decision spaces are finite and discrete, here we develop a symbolic way to calculate the expected utilities of influence diagrams that does not require a full numerical representation. Within this approach expected utilities correspond to families of polynomials. After characterizing their polynomial structure, we develop an efficient symbolic algorithm for the propagation of expected utilities through the diagram and provide an implementation of this algorithm using a computer algebra system. We then characterize many of the standard manipulations of influence diagrams as transformations of polynomials. We also generalize the decision analytic framework of these diagrams by defining asymmetries as operations over the expected utility polynomials.

Includes members:
  Member "sensitivity analysis multilinearity and beyond":
    also connected through other hyperedges:
      (none)
  Member "from influence diagrams to junction trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "directed expected utility networks")
  Member "a differential approach to inference in bayesian networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interventions and counterfactuals in tractable probabilistic models limitations of contemporary transformations")
  Member "sensitivity analysis in bayesian networks from single to multiple parameters":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sensitivity analysis multilinearity and beyond")
  Member "sensitivity analysis in decision circuits":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "three new sensitivity analysis methods for influence diagrams")
  Member "strategy selection in influence diagrams using imprecise probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "solving limited memory influence diagrams using branch and bound search")
  Member "three new sensitivity analysis methods for influence diagrams":
    also connected through other hyperedges:
      (none)
  Member "when do numbers really matter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient and robust machine learning for real world systems")

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)