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: "a compositional approach to economic game theory"
  Abstract: This paper aims to significantly impact the way we conceive of, reason about, and construct software for economic game theory. We achieve this by building an new and original model of economic games based upon the computer science idea of compositionality: concretely we i) give a number of operators for building up complex and irregular games from smaller and simpler games; and ii) show how the equilibria of these complex games can be defined recursively from the equilibria of their simpler components. We apply compositional reasoning to sophisticated games where agents must reason about how their actions affect future games and how those future games effect the utility they receive. This requires further originality --- we augment the usual lexicon of games with a new concept of coutility. This dual notion to utility arises because, in order for games to accept utility, this utility must be generated by other games. A third source of originality is the representation of our games as string diagrams so as to give a clear visual interface to manipulate them. Our fourth, and final, source of originality is a categorical formalisation of these intuitive string diagrams which guarantees our model is mathematically rigourous.

Connected through hyperedge HE-1 (induced by source paper "compositional deep learning"):
  with members:
    - "characterizing the invariances of learning algorithms using category theory"
    - "augmented cyclegan learning many to many mappings from unpaired data"
    - "towards functorial language games"
    - "a style based generator architecture for generative adversarial networks"
    - "translating and evolving towards a model of language change in discocat"
    - "morphisms of open games"
    - "unpaired image to image translation using cycle consistent adversarial networks"
    - "improved training of wasserstein gans"

Connected through hyperedge HE-2 (induced by source paper "normalization for planar string diagrams and a quadratic equivalence algorithm"):
  with members:
    - "diagrammatic semantics for digital circuits"
    - "globular an online proof assistant for higher dimensional rewriting"
    - "towards 3 dimensional rewriting theory"
    - "testing graph isotopy on surfaces"

Connected through hyperedge HE-3 (induced by source paper "compositionality and string diagrams for game theory"):
  with members:
    - "higher order game theory"
    - "higher order decision theory"
    - "monoidal computer i basic computability by string diagrams"

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)