<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>correction dissemination barriers &#8211; Science</title>
	<atom:link href="https://scienmag.com/tag/correction-dissemination-barriers/feed/" rel="self" type="application/rss+xml" />
	<link>https://scienmag.com</link>
	<description></description>
	<lastBuildDate>Mon, 26 Oct 2026 23:29:23 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.3</generator>

<image>
	<url>https://scienmag.com/wp-content/uploads/2024/07/cropped-scienmag_ico-32x32.jpg</url>
	<title>correction dissemination barriers &#8211; Science</title>
	<link>https://scienmag.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">73899611</site>	<item>
		<title>Corrections Can Outrun Misinformation Only If They Start Early, Model Finds</title>
		<link>https://scienmag.com/corrections-can-outrun-misinformation-only-if-they-start-early-model-finds/</link>
		
		<dc:creator><![CDATA[Alan Morgan]]></dc:creator>
		<pubDate>Mon, 26 Oct 2026 23:29:23 +0000</pubDate>
				<category><![CDATA[Science News]]></category>
		<category><![CDATA[agent-based modeling]]></category>
		<category><![CDATA[complex networks]]></category>
		<category><![CDATA[correction dissemination barriers]]></category>
		<category><![CDATA[correction timing]]></category>
		<category><![CDATA[correction-sharing willingness]]></category>
		<category><![CDATA[early intervention in misinformation]]></category>
		<category><![CDATA[fact-checking]]></category>
		<category><![CDATA[fact-checking effectiveness]]></category>
		<category><![CDATA[forwarding intentions]]></category>
		<category><![CDATA[health-related misinformation correction]]></category>
		<category><![CDATA[influence of correction timing on misinformation]]></category>
		<category><![CDATA[information diffusion]]></category>
		<category><![CDATA[misinformation]]></category>
		<category><![CDATA[misinformation correction challenges]]></category>
		<category><![CDATA[misinformation correction timing]]></category>
		<category><![CDATA[misinformation first-mover advantage]]></category>
		<category><![CDATA[propensity]]></category>
		<category><![CDATA[seed placement]]></category>
		<category><![CDATA[sharing]]></category>
		<category><![CDATA[simulation of information spread]]></category>
		<category><![CDATA[social media misinformation dynamics]]></category>
		<category><![CDATA[social network information spread]]></category>
		<category><![CDATA[social physics]]></category>
		<category><![CDATA[temporal catch-up cost]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=347657</guid>

					<description><![CDATA[A survey of 266 participants combined with agent-based simulations on three network types shows that corrections can carry a higher stated forwarding likelihood than misinformation yet still fail when their entry is delayed, with catch-up costs rising steeply and sometimes becoming unattainable.]]></description>
										<content:encoded><![CDATA[<p>Why do fact-checks so often lose to falsehoods on social networks? A new study published in Frontiers in Physics argues that the answer may lie less in what people are willing to share and more in when corrections arrive. The research, conducted by Wuyao Ding of Wenzhou Medical University, Zhangyu Cheng of East China Normal University, and Yan Ge of Shanghai Jiao Tong University, separates two distinct handicaps that corrections face: a correction-sharing disadvantage, meaning a lower willingness to transmit corrections, and a correction-timing disadvantage, meaning that corrections typically enter a network only after misinformation has already secured a first-mover advantage. By measuring each disadvantage separately and then feeding the results into a simulation of information spread, the team shows that even a correction people say they would gladly forward can fail to contain a rumor if it launches too late.</p>
<p>The first study focused on stated forwarding intentions. A total of 266 Chinese participants read three pairs of health-related messages, each pair consisting of a piece of misinformation and a matched detailed correction. In one condition, participants rated how likely they would be to forward the correction directly. In another, they were instructed to assume that the misinformation had already been forwarded before they saw the correction, and then rated their willingness to forward the corrective message. Under the conditions used, in which labels disclosing veracity were not identical across message types, direct corrections actually elicited a higher stated forwarding likelihood than misinformation, with a mean difference of 1.24 on the rating scale, a 95 percent confidence interval of 0.52 to 1.96, and an effect size of Hedges&#8217; g equal to 0.63. Telling participants that the misinformation had already spread did not significantly reduce their stated willingness to forward the correction; the mean difference was 0.35, with a confidence interval spanning from minus 0.37 to 1.07. The authors are careful to note, however, that these are hypothetical intentions, vulnerable to social desirability bias and to the well-documented gap between what people say they will do and what they actually do. Because the labeling of messages differed across conditions, the design also cannot fully isolate the effect of correction content itself from the effects of disclosed veracity or corrective framing.</p>
<p>The second study translated these measured propensities into a competitive agent-based model of diffusion. The researchers used the survey ratings as a relative propensity profile rather than as calibrated probabilities for any real platform, and ran simulated contests between misinformation and corrections across three classic network structures: Barabási–Albert scale-free networks, Erdős–Rényi random networks, and Watts–Strogatz small-world networks. They systematically varied four factors: transmission intensity, the onset delay before corrections entered, the supply of correction seeds, and the placement of those seeds in the network. The central quantity was the temporal catch-up cost, abbreviated TCC, defined as the smallest tested ratio of correction seeds to misinformation seeds that restores the cumulative-coverage reduction achieved when both message types start seeding simultaneously in equal numbers, minus one. In plain terms, it measures how many extra corrective seeds are needed to make up for a delayed start.</p>
<p>The simulation results were unambiguous about the price of delay. Across three transmission regimes, all 18 equal-seeding delay penalties were positive, and each penalty grew larger as the delay lengthened and as transmission intensity increased. When corrections were allowed to enter after only one generation of misinformation spread, all nine combinations of regime and network topology managed to recover the benchmark coverage within the tested parameter grid, with temporal catch-up costs ranging from 0.80 to 7.60. After two generations of delay, however, outcomes diverged sharply: some combinations still recovered within the grid, while others failed to do so entirely. Most strikingly, for Barabási–Albert networks under the reference regime, the model implied that no tested seed ratio could restore the benchmark at all, a condition the authors describe as model-implied unattainability.</p>
<p>The one encouraging result involved placement strategy: targeting high-degree nodes in the reference regime especially reduced the catch-up requirements on Barabási–Albert networks, indicating that in the model, where corrections are seeded changed how many were needed.</p>
<p>The authors frame their conclusions with deliberate caution. The thresholds they report are conditional comparisons within their model, not estimates of the resources or clock time that any specific platform would need to contain a real rumor outbreak. The survey findings rest on self-reported intentions rather than observed sharing behavior, and the labeling asymmetry across conditions limits what the first study can prove about correction content alone. What the combined approach does establish is a conceptual point: a correction-sharing disadvantage is not necessary for corrections to lose at the network level. Even when people report being more willing to forward corrections than misinformation, the timing of a correction&#8217;s entry can generate catch-up costs that grow steeply with delay, and in some simulated regimes become impossible to overcome regardless of how many corrective seeds are committed.</p>
<p><strong>Subject of Research:</strong> The timing disadvantage of misinformation corrections in network diffusion, studied through forwarding-intention surveys and agent-based modeling</p>
<p><strong>Article Title:</strong> From sharing propensity to diffusion control: temporal catch-up costs of delayed misinformation correction</p>
<p><strong>Article References:</strong> Ding, W., Cheng, Z., &amp; Ge, Y. (2026). From sharing propensity to diffusion control: temporal catch-up costs of delayed misinformation correction. <em>Frontiers in Physics, 14</em>, Article 1953841. <a href="https://doi.org/10.3389/fphy.2026.1953841" rel="noopener noreferrer">https://doi.org/10.3389/fphy.2026.1953841</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.3389/fphy.2026.1953841" rel="noopener noreferrer">10.3389/fphy.2026.1953841</a></p>
<p><strong>Keywords:</strong> misinformation, fact-checking, information diffusion, agent-based modeling, complex networks, social physics, correction timing, temporal catch-up cost, seed placement, forwarding intentions, sharing, propensity</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">347657</post-id>	</item>
	</channel>
</rss>
