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 "designing social networks for efficient learning"):
  Abstract: We study structural properties for information aggregation in settings where self-interested agents take actions sequentially and partially observe each other. Agents optimize their choice of action based on some local information (or `private signal') as well as conclusions they draw from observing actions taken by others. The literature so far typically studies the case where all agents observe each other. In such a setting it has been shown that information need not be aggregated and agents run a risk of herding on an inferior action. The other extreme, where agents do not observe each other at all clearly will not allow for social learning. In this paper we study the interim case where agents partly observe each other. We model partial observability by overlaying a graph structure over the agents. We consider the challenge of designing such a network structure that guarantees social learning. We introduce the `celebrity graph' and prove that it induces social learning and an optimal outcome with overwhelming probability. We study variations of this setting which depend on our assumption over the order or arrival of the agents (Bayesian and adversarial).

Includes members:
  Member "strategic learning and the topology of social networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "social learning with questions")
  Member "equilibria of plurality voting with abstentions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sybil resilient social choice with partial participation")

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)