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: "selling multiple items via social networks"
  Abstract: We consider a market where a seller sells multiple units of a commodity in a social network. Each node/buyer in the social network can only directly communicate with her neighbours, i.e. the seller can only sell the commodity to her neighbours if she could not find a way to inform other buyers. In this paper, we design a novel promotion mechanism that incentivizes all buyers, who are aware of the sale, to invite all their neighbours to join the sale, even though there is no guarantee that their efforts will be paid. While traditional sale promotions such as sponsored search auctions cannot guarantee a positive return for the advertiser (the seller), our mechanism guarantees that the seller's revenue is better than not using the advertising. More importantly, the seller does not need to pay if the advertising is not beneficial to her.

Connected through hyperedge HE-1 (induced by source paper "collaborative data acquisition"):
  with members:
    - "multi winner contests for strategic diffusion in social networks"
    - "mechanism design 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:
    - "diffusion and auction on graphs"
    - "mechanism design in social networks"
    - "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:
    - "strategy proof and non wasteful multi unit auction via social network"
    - "mechanism design in social networks"

Connected through hyperedge HE-4 (induced by source paper "incentivize diffusion with fair rewards"):
  with members:
    - "diffusion and auction on graphs"
    - "mechanism design in social networks"

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

Connected through hyperedge HE-6 (induced by source paper "redistribution mechanism design on networks"):
  with members:
    - "mechanism design in social networks"
    - "undominated groves mechanisms"

Connected through hyperedge HE-7 (induced by source paper "fixed price diffusion mechanism design"):
  with members:
    - "mechanism design in social networks"
    - "time critical social mobilization"

Connected through hyperedge HE-8 (induced by source paper "multi winner contests for strategic diffusion in social networks"):
  with members:
    - "information design in crowdfunding under thresholding policies"
    - "an online mechanism for ridesharing in autonomous mobility on demand systems"
    - "the rise of social bots"
    - "the simple rules of social contagion"
    - "social dynamics of digg"
    - "time critical social mobilization"
    - "a data based approach to social influence maximization"

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)