Evidence map›Paper›PMID 41920872›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2026

Free information disrupts even Bayesian crowds.

Jonas Stein, Shannon Cruz, Davide Grossi, Martina Testori

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Free information disrupts even Bayesian crowds.Proceedings of the National Academy of Sciences of the United States of America · 2026
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Jonas Stein *Department of Sociology, Faculty of Behavioral and Social Sciences, University of Groningen, Grote Rozenstraat 31, 9712 TG, Groningen, The Netherlands.ORCID 0000-0003-2714-5624
Shannon Cruz *Department of Communication Arts and Sciences, The Pennsylvania State University, University Park, PA 16802.ORCID 0000-0002-5244-5461
Davide Grossi *Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence, Faculty of Science and Engineering, University of Groningen, Groningen 9700 AK, The Netherlands.ORCID 0000-0002-9709-030X
Martina Testori *Business, Operations and Strategy, Greenwich Business School, University of Greenwich, London SE10 9LS, United Kingdom.ORCID 0000-0001-7292-7129

Funding

EC | HORIZON EUROPE Framework Programme (Horizon Europe) 101177658Netherland Organisation for Scientific Research NWO 024.004.022
6 · The paper itself

Abstract

A core tenet underpinning the conception of contemporary information networks, such as social media platforms, is that users should not be constrained in the amount of information they can freely and willingly exchange with one another about a given topic. By means of a computational agent-based model, we show how even in groups of truth-seeking and cooperative agents with perfect information-processing abilities, unconstrained information exchange may lead to detrimental effects on the correctness of the group's beliefs. If unconstrained information exchange can be detrimental even among such idealized agents, it is prudent to assume it can also be so in practice. We therefore argue that constraints on information flow should be carefully considered in the design of communication networks with substantial societal impact, such as social media platforms.

Indexed as

Bayesian agent based modelepistemic inequalityhomophilysocial learningwisdom of crowds

Identifiers

PMID41920872
PMCPMC13056096

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.