Join 📚 Kevin's Highlights

A batch of the best highlights from what Kevin's read, .

“If I want to launch a disinformation campaign, I can fail 99 percent of the time. You fail all the time, but it doesn’t matter,” Farid says. “Every once in a while, the QAnon gets through. Most of your campaigns can fail, but the ones that don’t can wreak havoc.”

How AI May Be Used to Create Custom Disinformation Ahead of 2024

Thor Benson

![](https://www.cdotrends.com/sites/default/files/Pasted%20image%2020230207185706.png)

Simplifying Data and AI With a Data Lakehouse

CDOTrends | Digital & Data Insights for Business Leaders

If you’re mathematically inclined, then you could use the [pigeonhole principle](https://en.wikipedia.org/wiki/Pigeonhole_principle) to describe hash collisions more formally: > Given *m* items and *n* containers, > if *m* > *n*, > then there’s at least one container > with more than one item. In this context, items are a potentially infinite number of values that you feed into the hash function, while containers are their hash values assigned from a finite pool.

Build a Hash Table in Python With TDD

Bartosz Zaczyński

...catch up on these, and many more highlights