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: "social learning with endogenous network formation"
  Abstract: I study the problem of social learning in a model where agents move sequentially. Each agent receives a private signal about the underlying state of the world, observes the past actions in a neighborhood of individuals, and chooses her action attempting to match the true state. Earlier research in this field emphasizes that herding behavior occurs with a positive probability in certain special cases; recent studies show that asymptotic learning is achievable under a more general observation structure. In particular, with unbounded private beliefs, asymptotic learning occurs if and only if agents observe a close predecessor, i.e., the action of a close predecessor reveals the true state in the limit. However, a prevailing assumption in these studies is that the observation structure in the society is exogenous. In contrast to most of the previous literature, I assume in this paper that observation is endogenous and costly. More specifically, each agent must pay a specific cost to make any observation and can strategically choose the set of actions to observe privately. I introduce the notion of maximal learning (relative to cost) as a natural extension of asymptotic learning: society achieves maximal learning when agents can learn the true state with probability 1 in the limit after paying the cost of observation. I show that observing only a close predecessor is no longer sufficient for learning the true s with unbounded private beliefs and positive costs. Instead, maximal learning occurs if and only if the size of the observations extends to infinity. I provide interesting comparative statics as to how various settings in the model affect the learning probability. For instance, the probability to learn the true state may be higher under positive costs than under zero cost; in addition, the probability to learn the true state may be higher under weaker private signals.

Connected through hyperedge HE-1 (induced by source paper "social learning with questions"):
  with members:
    - "informational braess paradox the effect of information on traffic congestion"
    - "when is a network epidemic hard to eliminate"
    - "hypothesis testing in feedforward networks with broadcast failures"
    - "on learning with finite memory"
    - "strategic learning and the topology of social networks"

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.SI(Social and Information Networks)