Show HN: Benchmark: AI doesn't find bugs unless you tell it what's wrong
SWE-sweep How many bugs can LMs find & fix in large codebases? Given a real repository, an agent must discover & repair as many bugs as they can. Agents are not given any hint about the type of bug or its location.
- ▪SWE-sweep How many bugs can LMs find & fix in large codebases?
- ▪Given a real repository, an agent must discover & repair as many bugs as they can.
- ▪Agents are not given any hint about the type of bug or its location.
Hacker News (AI / LLM) files mainly under ai. We currently carry 7,181 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | SWE-sweep |
| Canonical URL | https://swesweep.com/ |
| Publication time | Thu, 01 Oct 2026 15:36:14 +0000 |
| Retrieval time | 2026-10-01T15:42:32.650Z |
| Last seen | 2026-10-01T15:42:32.650Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | qvxFBdkoVGQM · 1 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
SWE-sweep How many bugs can LMs find & fix in large codebases? Given a real repository, an agent must discover & repair as many bugs as they can. Agents are not given any hint about the type of bug or its location. Kilian Lieret1 · Jeffrey Jian Ma1,2 · Rahul Kindi1 · Yuxiang Wei1 Jeremy Ma1,3 · Sten Sootla1 · Parth Thakkar1 · Chao Beyond Zhou1 Pengcheng Yin1 · Rui Hou1 · Ofir Press1 · John Yang1,4 1 Meta Superintelligence Labs · 2 Harvard University · 3 University of Washington · 4 Stanford University 100 repositories · 4.1k bugs · Updated September 24, 2026 LeaderboardDetailsPareto RankModelAgent Bugs resolvedScore Total USDUSD USD / repo Turns / repo Tokens / repo 1 Sol 5.6 (xhigh)OpenAI mini-SWE-agent 4.7% $7,230 $72.30 233 104.8k 2 Luna 5.6 (xhigh)OpenAI mini-SWE-agent 2.5% $224 $2.24…
Excerpt limited to ~120 words for fair-use compliance. The full article is at SWE-sweep.
Discussion
0 commentsMore from SWE-sweep
