Last week, Anthropic, the AI company behind the Claude chatbot, settled a landmark class-action lawsuit for $1.5 billion. The amount is very large in the context of copyright legal cases, yet it represents just a fraction of Anthropic’s estimated $183 billion valuation.
Authors and publishers, led by figures like Andrea Bartz and Charles Graeber, accused Anthropic of illegally downloading millions of pirated books from shadow libraries like Library Genesis to train Claude, violating copyright law. The settlement will compensate roughly 500,000 authors and publishers at about $3,000 per affected work. While Anthropic didn’t admit liability, it agreed to destroy the illicit files and pay authors, avoiding a trial. The Authors Guild hailed the outcome as a precedent for licensing content in AI development.
This case raises questions about property rights in the age of Large Language Models (LLMs). Courts have ruled that recombining existing texts into new outputs qualifies as fair use, but the Anthropic lawsuit hinged on the piracy itself, not the training process. What should the law say about compensating authors whose works indirectly fuel AI innovation? The answer could shape not just fairness but the future quality of AI.
The term “AI slop” increasingly describes low-quality, machine-generated text produced with minimal human oversight. If human writing ceases to be a viable career due to inadequate compensation, will LLMs lose access to fresh, high-quality training data? Could this create a feedback loop where AI models, trained on degraded outputs, stagnate? This dilemma mirrors the classic “access versus incentives” debate in intellectual property law: Access to a rich corpus of human-written text today enables entrepreneurs to build powerful, affordable LLMs. But without incentives for human authors to keep producing, the well of quality training data could run dry.
This case also blurs the traditional divide between copyright and patents. Copyrighted material, once seen as static, now drives “follow-on” innovation derived from the original work. That is, the copyright protection in this case affects AI-content influenced by the copyrighted material in a way that previously applied to new technology that built on patented technical inventions. Thus, “access versus incentives” theory applies to copyright as much as it used to apply to patents. The Anthropic settlement signals that intellectual property law, lagging behind AI’s rapid evolution, must adapt. Authors might need compensation, but halting AI progress to resolve legal disputes risks stifling innovation.
At $1.5 billion, the settlement’s size sends a clear message: bypassing legal channels could be costly. This could deter smaller AI firms from entering the market, especially as similar lawsuits loom against other companies. The precedent may push developers toward licensing deals or public domain data, raising costs and potentially concentrating the AI industry among deep-pocketed players like Anthropic, backed by billions in funding. Smaller startups, unable to afford licensing or litigation, may struggle. This would become a case of regulatory barriers favoring incumbents. Could Anthropic’s willingness to pay such a hefty sum reflect a strategic move to fortify a moat around well-capitalized AI firms, discouraging upstarts?
In a 2024 post, I speculated that AI companies, flush with cash, might strategically hire writers to replenish the commons of high-quality text. In that post, I wrote:
The Anthropic settlement partly validates this idea. For an AI arms race in which Mark Zuckerberg spends millions luring engineers from OpenAI, $1.5 billion seems like a modest price for a chance of establishing AI dominance.
For now, the Anthropic case marks a pivotal moment. It underscores the need for a balanced approach and sets the stage for how AI and intellectual property law will coexist in an era of unprecedented technological change.
Although, at a certain point, the LLMs might reach a take-off point where they are so intelligent and agentic that they do not need new input from humans anymore. That is a horizon beyond which I cannot see.
Joy Buchanan is an Associate Professor of economics at Samford University. She blogs at Economist Writing Every Day.

READER COMMENTS
Monte
Sep 16 2025 at 11:15am
An autonomous LLM so advanced it surpasses our ability to control it and begins to operate without human input is a very real and frightening possibility. Imagine a scenario where each improvement builds on itself, potentially leading to exponential growth in intelligence. An agentic misalignment to human values at this stage could render us obsolete.
Given what happened in a controlled experiment at Anthropic, we’re getting dangerously close:
Anthropic’s most powerful AI tried blackmailing engineers to avoid shutdown
Ashis Roy
Sep 18 2025 at 6:54am
All this doomsday prediction is fine, but what about the Apple debate that says that AI models can’t do any original thinking, and breaks down for doing simple tasks that need logical steps?
https://www.youtube.com/watch?v=hhTil3abdjM&t=213s
When I asked Deepseek to solve the Towers of Hanoi problem with 3 rings in my local machine, it went round and round in circles but couldn’t get the solution.
C:\ollama run deepseek-r1:1.5b
>>> What are the steps for transferring 3 rings in Towers of Hanoi?
<think>
Okay, so I need to figure out how to transfer three rings from Tower A to Tower C using the Towers of Hanoi
method. Hmm, I remember that the classic problem with two rings is straightforward because you just move each ring
one by one without disturbing the others. But with three rings, it’s more complicated.
First, I think I should start by moving the top two rings onto Tower B. That way, Tower A will have only the
largest ring left. How do I do that? For two rings, I can’t just move them separately because they’re interlocked,
right? So maybe I need to use Tower C as an auxiliary tower.
Let me outline what I know: for two rings on Tower A, you can’t move them directly without moving the largest ring
first. So to move two rings from A to B, I think it’s something like:
1. Move the smallest ring from A to B.
2. Then move the second ring from A to C.
3. Finally, move the first ring (now on top of B) back to C.
But wait, if I’m moving three rings, maybe that initial step is necessary. So for the three-ring problem:
1. Move two rings onto Tower B as described above.
2. Then take the largest ring from A and move it to C.
3. Now, move those two rings back on top of the largest ring.
Wait, but when I’m moving the two rings again, their positions relative to each other might change. If I moved
them in a certain order initially, after taking the largest ring off, their positions would be different now. So I
need to make sure that when I move them back, I place them correctly on top of the new topmost ring.
Let me think step by step:
– First, move the smallest ring from A to B.
– Then, move the second ring from A to C.
– Now, Tower A has only the largest ring left. Move it to C.
– Next, for moving the two rings back onto A, I should do something similar but in reverse.
Wait a minute, maybe I’m getting confused here. Let me try writing down each step more clearly:
1. Move Ring 3 from A to C (since it’s the largest and will be moved last).
2. Now, move Ring 1 from A to B.
3. Then, move Ring 2 from A to C, but now since Ring 1 is on top of B, I need to adjust because when moving Ring 2
to C, it should go over Ring 1.
– Wait, no, actually, maybe not. Because after step 2, when we have moved Ring 3 and Ring 1 to B, then the
order in which they were stacked matters. If Ring 1 is on top of Ring 2 on B, moving Ring 2 back onto A would mean
placing it on top of Ring 1, but that’s not possible without disturbing them.
Hmm, this is tricky. Maybe I should visualize each step more carefully. Alternatively, maybe there’s a pattern or
formula to follow for moving rings in Towers of Hanoi.
I recall that the number of moves required for n rings is 2^n – 1. For three rings, that’s 7 moves. Let me try to
list them out:
1. Move Ring 3 from A to C.
2. Move Ring 1 from A to B.
3. Move Ring 2 from A to C (but now it will be placed over Ring 1).
4. Move Ring 3 from C to A (but wait, no, because after step 2 and 3, Tower B has Ring 1 on top of Ring 2. So
moving Ring 2 back would mean placing it on top of Ring 1.
5. Move Ring 1 from B to C.
6. Move Ring 2 from C to A (but again, since Ring 3 is on top now in A, this might get confusing).
7. Finally, move Ring 3 from A to C.
…goes on and on
Wait, maybe I’m overcomplicating it. Let me try a different approach. Since moving three rings can be broken down
into smaller steps, perhaps using the two-ring method repeatedly.
On the other hand when I asked ChatGpt which is connected to the cloud it solved it in a few seconds:
https://chatgpt.com/share/68abe676-a088-8013-ad27-e89dfcc7ff6a
Comments are closed.