human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "expected utility networks"
  Abstract: We introduce a new class of graphical representations, expected utility networks (EUNs), and discuss some of its properties and potential applications to artificial intelligence and economic theory. In EUNs not only probabilities, but also utilities enjoy a modular representation. EUNs are undirected graphs with two types of arc, representing probability and utility dependencies respectively. The representation of utilities is based on a novel notion of conditional utility independence, which we introduce and discuss in the context of other existing proposals. Just as probabilistic inference involves the computation of conditional probabilities, strategic inference involves the computation of conditional expected utilities for alternative plans of action. We define a new notion of conditional expected utility (EU) independence, and show that in EUNs node separation with respect to the probability and utility subgraphs implies conditional EU independence.

Connected through hyperedge HE-1 (induced by source paper "directed expected utility networks"):
  with members:
    - "from influence diagrams to junction trees"
    - "local utility elicitation in gai models"

Connected through hyperedge HE-2 (induced by source paper "ucp networks a directed graphical representation of conditional utilities"):
  with members:
    - "graphical models for preference and utility"
    - "exploiting causal independence in bayesian network inference"

Connected through hyperedge HE-3 (induced by source paper "unstructuring user preferences efficient non parametric utility revelation"):
  with members:
    - "graphical models for preference and utility"
    - "ucp networks a directed graphical representation of conditional utilities"
    - "a hybrid approach to reasoning with partially elicited preference models"
    - "compact value function representations for qualitative preferences"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

Connected through hyperedge HE-4 (induced by source paper "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"):
  with members:
    - "graphical models for preference and utility"
    - "utility elicitation as a classification problem"
    - "ucp networks a directed graphical representation of conditional utilities"
    - "conditional utility utility independence and utility networks"
    - "reasoning about soft constraints and conditional preferences complexity results and approximation techniques"
    - "structure and complexity in planning with unary operators"

Question: Please tell me which class the center node 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.GT(Computer Science and Game Theory)