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 "local computation mechanism design"):
  Abstract: We introduce the notion of Local Computation Mechanism Design - designing game theoretic mechanisms which run in polylogarithmic time and space. Local computation mechanisms reply to each query in polylogarithmic time and space, and the replies to different queries are consistent with the same global feasible solution. In addition, the computation of the payments is also done in polylogarithmic time and space. Furthermore, the mechanisms need to maintain incentive compatibility with respect to the allocation and payments. #R##N#We present local computation mechanisms for a variety of classical game-theoretical problems: 1. stable matching, 2. job scheduling, 3. combinatorial auctions for unit-demand and k-minded bidders, and 4. the housing allocation problem. #R##N#For stable matching, some of our techniques may have general implications. Specifically, we show that when the men's preference lists are bounded, we can achieve an arbitrarily good approximation to the stable matching within a fixed number of iterations of the Gale-Shapley algorithm.

Includes members:
  Member "new techniques and tighter bounds for local computation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems")
  Member "on the communication complexity of finding an approximate stable marriage":
    also connected through other hyperedges:
      (none)
  Member "a local computation approximation scheme to maximum matching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed maximum matching verification in congest")
  Member "converting online algorithms to local computation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems")
  Member "approaching utopia strong truthfulness and externality resistant mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "general truthfulness characterizations via convex analysis")
  Member "space efficient local computation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "seeing far vs seeing wide volume complexity of local graph problems")
  Member "fast local computation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "local access to huge random objects through partial sampling")
  Member "an impossibility result for truthful combinatorial auctions with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")

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.GT(Computer Science and Game Theory)