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: "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.

Connected through hyperedge HE-1 (induced by source paper "local computation algorithms for the lovasz local lemma"):
  with members:
    - "a new perspective on stochastic local search and the lovasz local lemma"
    - "on the complexity of local distributed graph problems"
    - "commutativity in the algorithmic lovasz local lemma"
    - "an algorithmic proof of the lovasz local lemma via resampling oracles"

Connected through hyperedge HE-2 (induced by source paper "local computation algorithms for graphs of non constant degrees"):
  with members:
    - "flow based algorithms for local graph clustering"
    - "distributed maximum matching in bounded degree graphs"
    - "new techniques and tighter bounds for local computation algorithms"
    - "best of two local models local centralized and local distributed algorithms"
    - "local algorithms for sparse spanning graphs"
    - "a local computation approximation scheme to maximum matching"
    - "a simple online competitive adaptation of lempel ziv compression with efficient random access support"
    - "the power of local information in social networks"

Connected through hyperedge HE-3 (induced by source paper "new techniques and tighter bounds for local computation algorithms"):
  with members:
    - "local computation algorithms for graphs of non constant degrees"
    - "an improved distributed algorithm for maximal independent set"
    - "distributed maximum matching in bounded degree graphs"
    - "a local computation approximation scheme to maximum matching"
    - "the locality of distributed symmetry breaking"
    - "converting online algorithms to local computation algorithms"
    - "space efficient local computation algorithms"
    - "fast local computation algorithms"

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)