[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-a-new-way-to-catch-ai-policy-violations-in-peer-review":10,"sections":35},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":30,"feedback":34,"feedback_at":22,"cost_usd":34,"total_tokens":34},9016,"a-new-way-to-catch-ai-policy-violations-in-peer-review","A New Way to Catch AI Policy Violations in Peer Review","A new peer-review framework audits AI policy compliance, not authorship, after showing plain detectors flag more compliant writers than violators.","A new research paper says the AI detectors conferences rely on are measuring the wrong thing.\n\nThe paper, posted to arXiv, argues that AI-use detection tools estimate whether a model wrote a given passage, not whether an author followed a venue's actual AI policy. Those policies vary by role, task, and disclosure requirement, but current detectors ignore all of that context. The authors propose what they call policy-conditioned AI-use detection: a framework that treats the venue's rule as an explicit input and outputs hypotheses, evidence, and a calibrated error rate instead of a flat \"AI detected\" verdict. They test the idea against peer review, building benchmarks from pipelines that generate both compliant and non-compliant writing workflows.\n\nApplied to realistic violation rates, the paper finds that even a detector running at a strong operating point still flags more compliant authors than actual rule-breakers. That is a different problem than a detector simply missing cases, it is a detector whose false positives routinely outnumber its true positives. The framework's fix is procedural: structured disclosure, tool routing that does not break reviewer anonymity, and a formal way to contest a flag.\n\nIt is the same lesson plagiarism-detection software learned the hard way, catching the technology was always easier than defining the offense.","[\"ai-detection\",\"peer-review\",\"academic-publishing\",\"research-policy\"]","2026-10-01T04:00:00.000Z","2026-10-01T15:50:50.883Z","2026-10-01T15:50:56.392Z","published",null,[],"ai",[26,27,28,29],"ai-detection","peer-review","academic-publishing","research-policy",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2609.38427",0,{"sections":36},[37,40,44,49,54,59,63,68,73,77,82,87,92,97],{"name":38,"slug":24,"count":39,"latest_published_at":18},"AI",5488,{"name":41,"slug":42,"count":43,"latest_published_at":18},"Security","security",809,{"name":45,"slug":46,"count":47,"latest_published_at":48},"Policy","policy",429,"2026-10-01T02:26:17.000Z",{"name":50,"slug":51,"count":52,"latest_published_at":53},"Deals","deals",298,"2026-09-30T21:00:26.000Z",{"name":55,"slug":56,"count":57,"latest_published_at":58},"Hardware","hardware",196,"2026-09-30T13:00:00.000Z",{"name":60,"slug":61,"count":62,"latest_published_at":18},"Science","science",162,{"name":64,"slug":65,"count":66,"latest_published_at":67},"Consumer Tech","consumer-tech",149,"2026-09-30T22:57:11.000Z",{"name":69,"slug":70,"count":71,"latest_published_at":72},"Dev Tools","dev-tools",93,"2026-10-01T02:30:48.000Z",{"name":74,"slug":75,"count":71,"latest_published_at":76},"Software","software","2026-09-30T21:41:11.000Z",{"name":78,"slug":79,"count":80,"latest_published_at":81},"Startups","startups",84,"2026-09-30T20:39:09.000Z",{"name":83,"slug":84,"count":85,"latest_published_at":86},"Gaming","gaming",51,"2026-09-30T16:24:30.000Z",{"name":88,"slug":89,"count":90,"latest_published_at":91},"General","general",50,"2026-09-30T21:37:54.000Z",{"name":93,"slug":94,"count":95,"latest_published_at":96},"Reviews","reviews",31,"2026-09-28T14:31:34.000Z",{"name":98,"slug":99,"count":100,"latest_published_at":101},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]