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: "mechanism design in social networks"
  Abstract: This paper studies an auction design problem for a seller to sell a commodity in a social network, where each individual (the seller or a buyer) can only communicate with her neighbors. The challenge to the seller is to design a mechanism to incentivize the buyers, who are aware of the auction, to further propagate the information to their neighbors so that more buyers will participate in the auction and hence, the seller will be able to make a higher revenue. We propose a novel auction mechanism, called information diffusion mechanism (IDM), which incentivizes the buyers to not only truthfully report their valuations on the commodity to the seller, but also further propagate the auction information to all their neighbors. In comparison, the direct extension of the well-known Vickrey-Clarke-Groves (VCG) mechanism in social networks can also incentivize the information diffusion, but it will decrease the seller's revenue or even lead to a deficit sometimes. The formalization of the problem has not yet been addressed in the literature of mechanism design and our solution is very significant in the presence of large-scale online social networks.

Connected through hyperedge HE-1 (induced by source paper "collaborative data acquisition"):
  with members:
    - "selling multiple items via social networks"
    - "multi winner contests for strategic diffusion in social networks"
    - "regularized minimax conditional entropy for crowdsourcing"
    - "time critical social mobilization"
    - "optimal crowdsourcing contests"

Connected through hyperedge HE-2 (induced by source paper "redistribution mechanism on networks"):
  with members:
    - "selling multiple items via social networks"
    - "diffusion and auction on graphs"
    - "undominated groves mechanisms"
    - "redistribution mechanisms for assignment of heterogeneous objects"

Connected through hyperedge HE-3 (induced by source paper "incentive compatible diffusion auctions"):
  with members:
    - "selling multiple items via social networks"
    - "strategy proof and non wasteful multi unit auction via social network"

Connected through hyperedge HE-4 (induced by source paper "incentivize diffusion with fair rewards"):
  with members:
    - "selling multiple items via social networks"
    - "diffusion and auction on graphs"

Connected through hyperedge HE-5 (induced by source paper "maximal information propagation with budgets"):
  with members:
    - "selling multiple items via social networks"
    - "multi winner contests for strategic diffusion in social networks"
    - "time critical social mobilization"

Connected through hyperedge HE-6 (induced by source paper "selling multiple items via social networks"):
  with members:
    - "customer sharing in economic networks with costs"
    - "time critical social mobilization"

Connected through hyperedge HE-7 (induced by source paper "redistribution mechanism design on networks"):
  with members:
    - "selling multiple items via social networks"
    - "undominated groves mechanisms"

Connected through hyperedge HE-8 (induced by source paper "fixed price diffusion mechanism design"):
  with members:
    - "selling multiple items via social networks"
    - "time critical social mobilization"

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)