Urgent.News

What's breaking now, across thousands of outlets.

AI

(LEAD) Ruling party leader says will push for 10-year exam ban for AI-assisted cheating

SEOUL, Nov. 17 (Yonhap) -- The leader of the ruling Democratic Party (DP) said T...

(LEAD) Ruling party leader says will push for 10-year exam ban for AI-assisted cheating

Seoul, Nov. 17 - The leader of South Korea's ruling Democratic Party has announced plans to introduce legislation prohibiting individuals found using artificial intelligence devices to cheat on national exams from retaking the tests for a period of up to ten years. Party representative Kim Min-seok made this statement in an official YouTube video.

He elaborated that while current penalties for exam cheating in South Korea include a five-year ban, extending this ban to ten years would serve as a more effective deterrent against cheating. The DP called for comprehensive measures to be put in place before the upcoming college entrance exam, emphasizing the need for clear guidelines in addressing suspected AI-assisted cheating incidents.

The ruling party's move comes amid growing concerns over the increasing instances of AI-assisted cheating in South Korea, including recent cases involving the use of AI glasses in university entrance exams and middle and high school tests.

Written by urgent.news from Yonhap News's reporting — not their text. Machine-written — may contain errors; check the original before relying on it.

Other reports of this story

Every outlet that reported this, and when →

Read the original at en.yna.co.kr →

More in AI

An N+1 query looks like a staircase

I've been building AspNetDebugDashboard on and off for a while. It's my take on Laravel Telescope for ASP.NET Core: you add one NuGet package, and in Development you get a page at /_debug with every…

  • An N+1 query resembles a staircase pattern in ASP.NET Core applications.
  • The AspNetDebugDashboard visualizes queries and performance issues as a timeline.
  • Batching queries reduces the number from 21 to 1, improving request time significantly.

LLM agents lose confidence under noisy retrieval

Even open‑weight retrieval agents keep shouting answers while the evidence they cite falls apart, exposing a systematic over‑confidence that survives obvious credibility warnings.

  • Retrieval agents remain confident despite corrupted or untrustworthy sources.
  • Standard benchmarks assume correct or plausible retrieved passages.
  • Performance stable across trust levels, with no change in abstention rate.

More from Tuesday 17 November →