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 "local non bayesian social learning with stubborn agents"):
  Abstract: In recent years, people have increasingly turned to social networks like Twitter and Facebook for news. In contrast to traditional news sources, these platforms allow users to simultaneously read news articles and share opinions with other users. Among other effects, this has led to the rise of fake news, sometimes spread via bots (automated social media accounts masquerading as real users). #R##N#In this work, we devise and analyze a mathematical model describing such platforms. The model includes a large number of agents attempting to learn an underlying true state of the world in an iterative fashion. At each iteration, these agents update their beliefs about the true state based on noisy observations of the true state and the beliefs of a subset of other agents. These subsets may include a special type of agent we call bots, who attempt to convince others of an erroneous true state rather than learn (modeling users spreading fake news). This process continues for a finite number of iterations we call the learning horizon. #R##N#Our analysis details three cases for the outcome of this process: agents may learn the true state, mistake the erroneous state promoted by the bots as true, or believe the state falls between the true and erroneous states. Which outcome occurs depends on the relationship between the number of bots and the learning horizon. This leads to several interesting consequences; for example, we show that agents can initially learn the true state but later forget it and believe the erroneous state to be true instead. In short, we argue that varying the learning horizon can lead to dramatically different outcomes. This is in contrast to existing works studying models like ours, which typically fix a finite horizon or only consider an infinite horizon.

Includes members:
  Member "naive bayesian learning in social networks":
    also connected through other hyperedges:
      (none)
  Member "the spread of low credibility content by social bots":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "topology comparison of twitter diffusion networks effectively reveals misleading information")
  Member "learning without recall by random walks on directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bayesian heuristics for group decisions")
  Member "pagerank beyond the web":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nonlinearity networks a 2020 vision")

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