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: "approaching utopia strong truthfulness and externality resistant mechanisms"
  Abstract: We introduce and study strongly truthful mechanisms and their applications. We use strongly truthful mechanisms as a tool for implementation in undominated strategies for several problems,including the design of externality resistant auctions and a variant of multi-dimensional scheduling.

Connected through hyperedge HE-1 (induced by source paper "local computation mechanism design"):
  with members:
    - "new techniques and tighter bounds for local computation algorithms"
    - "on the communication complexity of finding an approximate stable marriage"
    - "a local computation approximation scheme to maximum matching"
    - "converting online algorithms to local computation algorithms"
    - "space efficient local computation algorithms"
    - "fast local computation algorithms"
    - "an impossibility result for truthful combinatorial auctions with submodular valuations"
    - "truthful mechanisms with implicit payment computation"

Connected through hyperedge HE-2 (induced by source paper "general truthfulness characterizations via convex analysis"):
  with members:
    - "the lovasz bregman divergence and connections to rank aggregation clustering and web ranking"
    - "designing markets for daily deals"
    - "efficiency revenue trade offs in auctions"
    - "eliciting forecasts from self interested experts scoring rules for decision makers"
    - "a new understanding of prediction markets via no regret learning"
    - "statistical exponential families a digest with flash cards"
    - "characterizing truthful multi armed bandit mechanisms"
    - "algorithmic methods for sponsored search advertising"

Connected through hyperedge HE-3 (induced by source paper "selfishness level of strategic games"):
  with members:
    - "approximate strong equilibrium in job scheduling games"
    - "on the value of correlation"
    - "the robust price of anarchy of altruistic games"
    - "mechanisms for making crowds truthful"
    - "altruism in atomic congestion games"

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)