Openai Codex

Openai Codex에 대해 3개 실제 데이터 소스에서 20개 공개 신호를 찾았습니다. GitHub 10건, Hacker News 0건, arXiv 10건을 원문 링크와 함께 보여줍니다.

검색 결과 보기

토픽 정보

이름
Openai Codex
Slug
openai-codex
관련 키워드
the, and, codex, openai, agent, for, that, code
최근 7일 변화
MVP에서는 실시간 검색 결과 기반 점수만 계산합니다. DB snapshot 저장 후 추세가 표시됩니다.
마지막 업데이트
2026-09-21T09:49:24.289Z

출처별 최신 반응

TrialAtlas: Multi-Agent Research Organization for Clinical Trial Design and Optimization

Nearly 90% of drugs entering clinical development ultimately fail, despite billions of dollars in investment. Pharmaceutical companies therefore rely on clinical development planning (CDP) and probability of technical and regulatory success assessment to anticipate development risks, yet these decisions remain labor-intensive and subjective, requiring experts across clinical science, statistics, regulatory affairs, and competitive intelligence to jointly acquire, synthesize, and reason over heterogeneous evidence....

arxiv · 원본 ID http://arxiv.org/abs/2609.21859v1

Loopjacking: Hijacking Human-in-the-Loop Approval

Human approval is often treated as the last security boundary before an agent executes a consequential operation. That boundary is only meaningful if the operation presented for review is the operation later authorized or released. We call failures of this binding Loopjacking: a human approves what they understand as operation A, while the implementation uses that decision for a materially different operation B. We distinguish two variants. In a representation-based attack, B is already encoded but omitted or misr...

arxiv · 원본 ID http://arxiv.org/abs/2609.21081v1

Regularity of asymptotically axisymmetric solutions to the 3D Navier-Stokes equations with analytic forcing

OpenAI~\cite{OpenAIManuscript} has recently announced a proof of finite time singularity formation for the 3D Navier-Stokes equations, in the presence of a $C^\infty$-smooth body force. The construction in~\cite{OpenAIManuscript} has a few key features, among which we single out: (i) the angular mean of the solution satisfies specific Type II bounds which are anisotropic; (ii) the solution is exactly axisymmetric in a collapsing core region. In this paper we consider solutions of the 3D Navier-Stokes equations in...

arxiv · 원본 ID http://arxiv.org/abs/2609.20803v1

Harm Laundering in GPT Models: Evidence That Gender Discrimination Is Transformed Rather Than Reduced Across Safety-Trained Generations

Safety evaluations for large language models rely on surface-form classifiers that report declining harm scores across model generations. We provide evidence that this methodology is systematically incomplete: explicit discriminatory content is transformed rather than removed. We call this \emph{harm laundering}. Analysing 450,000 gender-directed completions across 15 models spanning GPT-2 through to GPT-5 (OpenAI GPT lineage; three demographic conditions), we show that sexual violence clusters prevalent in GPT-2...

arxiv · 원본 ID http://arxiv.org/abs/2609.20779v1

Inference-Engine Fingerprinting Attacks are Practical: Exploring Model-Driven Environmental Discovery, Exploitation, and Escape

Frontier AI models are rapidly gaining the ability to exploit vulnerabilities in complex pieces of software. The risk is not theoretical, as evidenced by recent sandbox escapes performed by frontier models at OpenAI and Anthropic. Discussions of how to sandbox inference stack components often focus on components other than the inference engine itself (e.g., network proxies or code execution environments). However, the inference engine is an attractive target for a misaligned model. For example, if a model can trig...

arxiv · 원본 ID http://arxiv.org/abs/2609.20614v1

SoL-Pi: Recursively Scaling Auto-Research Loops for Efficient Agent Harness

As coding agents move from supervised code completion to unattended, around-the-clock exploration, their work expands from isolated predictions into long trajectories of reasoning, tool use, and feedback. Token efficiency therefore becomes important for scaling recursive self-improvement. We take an RSI-inspired approach at the harness layer, scaling auto-research loops across increasingly numerous and diverse environments for harness rollouts. At this scale, the process yields reusable improvements that transfer...

arxiv · 원본 ID http://arxiv.org/abs/2609.20519v1

Four Special Directions in AG(2,13): The 52-Point Obstruction and the Sharp Minimum

We prove that no $52$-point subset of the affine plane $\mathbb F_{13}^{2}$ has exactly four special directions, where a direction is special when its thirteen parallel affine lines do not all meet the set in the same number of points. A universal incidence identity reduces the four exceptional line-count functions to a polynomial identity over $\mathbb F_{13}$. Linear independence of the associated binary forms of degree at least three then forces those functions to have degree at most two. Classification of the...

arxiv · 원본 ID http://arxiv.org/abs/2609.20495v1

ClashBench: Conflicts Leading Agents to Seize and Harm

As agent systems become more widely used, multiple agent sessions increasingly run alongside pre-existing user tasks in the same environment, sharing resources with limited capacity or mutually exclusive states. This creates a safety risk: when granted sufficient privileges, an agent may resolve a resource conflict by terminating or otherwise disrupting an existing task rather than reporting it. In this work, we identify and formalize this failure mode, which we term destructive resource preemption: obtaining the...

arxiv · 원본 ID http://arxiv.org/abs/2609.19892v1

Paths maximize the expected range of graph-indexed random walks

We prove that a path maximizes the expected range of a uniformly chosen graph homomorphism into the integers, with one vertex pinned at zero, among all connected bipartite graphs of the same order. This establishes the expectation form of the Benjamini--Häggström--Mossel conjecture. The proof restricts and rescales a homomorphism on each bipartition class, then contracts the edges on which the resulting height function is constant. A quantitative estimate for the rank of these zero edges compensates for a parity t...

arxiv · 원본 ID http://arxiv.org/abs/2609.19728v1

Red-Teaming Auto Mode: Improving Blocking Classifiers Against Malign Coding Agents

To keep coding agents from going off the rails, production systems now review each proposed action with a blocking monitor that can reject it before it runs (Auto Mode in Claude Code, Guardian in OpenAI's Codex). Prior evaluations of such monitors largely measure robustness to accidental harm or prompt injections from untrusted sources looking to hijack the agent. Less understood is how they hold up when the agent they monitor is persistently misaligned. To understand this risk, we task an adversarial agent with e...

arxiv · 원본 ID http://arxiv.org/abs/2609.19587v1

openai/codex-plugin-cc

Use Codex from Claude Code to review code or delegate tasks.

github · 원본 ID 1196321162

diegosouzapw/OmniRoute

Never stop coding. Free MIT AI gateway: one endpoint, 352 providers (150+ free), 1200+ models Kimi, Claude, GPT, Gemini, GLM, DeepSeek, MiniMax. Works with Claude Code, Codex, Cursor, OpenCode, Cline & Copilot. Quota-aware auto-fallback, RTK+Caveman compression saves 15-95% tokens, MCP/A2A, Desktop/PWA. Built by 550+ contributors

github · 원본 ID 1157102282