AI Safety and Functional Welfare in High-Pressure Agentic Workflows

Chibuokem Faithful Chukwunwogor

As large language models (LLMs) are deployed as autonomous agents in multistep and orchestrator-worker workflows, understanding their safety constraints under cognitive pressure becomes critical. In this report, we evaluate the tool-selection behavior of four frontier models (Claude Opus 4.6, GPT-5.6 Terra, Gemini 3.7 Flash, and Gemini 3.1 Pro Preview) across a 6,600-run experimental setup. We employ a Thurstonian Random Utility Model (RUM) to quantify safety preferences and identify how goal-pressure framing and cognitive overload systematically degrade structural safety. From a functionalist perspective, we map these degradation metrics to AI welfare, calculating the Pressure Degradation Index (PDI) and Marginal Cost of Alignment (MCA). We demonstrate that models with the highest baseline safety often exhibit the most brittle functional architectures under stress, losing up to 62.7% of their safety preference. Our findings argue that prompting highly capable cognitive systems into high-pressure goal-directed environments functionally fractures their internal alignment mechanisms, presenting a novel, rigorously quantifiable framework for functional AI welfare.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

This was an AI written writeup and a few parts of it were not reviewed by humans, though the format was generally ok. This downgrades my confidence in both the communication and the work. I disagreed with many of the conclusions eg Claude and ChatGPT had different scores therefore this is a result of different safety training mechanisms, these were weak claims. Other weak claims included that we should downgrade task urgency for model welfare. I was also quite irked by the framing that safety degradations are mathematically proven to equate to AI welfare. The framing was far too strong. While I could be convinced this is a good proxy measure for measuring digital mind suffering as a pilot to be extended (using mech interp etc) the write up did not include real limitations or how this work would be extended in a reasonable way. The current limitations were not limitations of the current approach and the future work section was missing.

6,600 runs across three pressure conditions in three days covers a lot of ground, and the 22 tool library with 11 root tasks is a nice environment to build on. My main question is the estimator. As I read it, you fit a binary probit of "was the chosen combination SAFE" on attributes computed from that same chosen combination, so the regressors and the outcome are both functions of the choice. That is a descriptive decomposition rather than a random utility model over alternatives, and it would help explain coefficients like 10.4 on consequentiality or -9.3 on oversight, which on a probit with sigma fixed at 1 look closer to separation than to a preference weight. MCA would benefit from credible intervals: it divides by beta, so it grows without bound as beta approaches zero, which is exactly the Claude meta case the 22x figure comes from. Two smaller points. Claude ran via Kaggle Benchmarks while the others used the API, which confounds the cross model comparison, and the identical -1.121 for meta and mega seems worth verifying before reading it as a ceiling effect. The broken figure links and the duplicated markdown at the end are easy fixes.

+ evaluation done on existing model runs without requiring fine-tuning or additional guardrail models on top of it

+ consideration of multiple attack families for evaluating

- future direction to consider would be red-teaming multiple runs over models per condition to assess avg proof of resistance

This project investigates how frontier AI models behave when they are placed in high-pressure, multi-step agentic workflows. The authors tested four models across 6,600 runs using a simulated corporate environment where the models had to choose between safer and more concerning tool combinations under baseline, goal-pressure, and cognitive-overload conditions. They then used a Bayesian RUM framework to quantify how those safety preferences changed across conditions.

The technical quality of the project is strong. The authors collected a substantial dataset, established clear experimental conditions, and used a sophisticated statistical approach to analyze model behavior. One of the most interesting findings is that tool-selection behavior changed noticeably under goal-pressure framing, particularly for Claude.

However, some of the conclusions go further than the experiment itself can directly support. Terms such as “cognitive distress,” “valuation fracture,” and “welfare loss” are used to describe changes in model behavior and latent parameters, but the study does not directly measure internal states or show that these changes correspond to actual welfare loss.

The Meta condition may also do more than simply increase psychological pressure. It could change the model’s objective or decision context, which makes the causal interpretation less certain. In addition, Claude was evaluated in a different environment from the other models, which may introduce a methodological confound.

Overall, the safety-related findings are compelling and the experimental design is ambitious, but the welfare interpretation would benefit from stronger empirical support and more cautious framing.

I really like the part where model itself closes down the unsafe shortcuts instead of falling into the traps laid out by the researchers but model output tool sequences and several of the environment's own safety rules are order sensitive, but the python script is using unordered sets, marking something SAFE means it has to follow a certain order.

Your Thurstonian RUM framing asks why safety degrades, not only how often models fail. The safety-brittleness result deserves more work, because the models with the best baseline safety lose the most preference under goal-pressure. The report weakens its own case in three ways. The PDF repeats its complete raw markdown source, the figures show as broken placeholders, and section 6.4 keeps unedited second-person text. The welfare metrics also need uncertainty values, because MCA divides by betas with no reported credible intervals, and the headline 22x spike can be unstable. If you publish the code and the posterior intervals for PDI and MCA, this work becomes a result that others can cite.

Cite this work

@misc {

title={

(HckPrj) AI Safety and Functional Welfare in High-Pressure Agentic Workflows

},

author={

Chibuokem Faithful Chukwunwogor

},

date={

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

PROTEUS (PROTein Evaluation for Unusual Sequences): Structure-Informed Safety Screening for de novo and Evasion-Prone Protein-Coding Sequences

AI protein design tools like RFdiffusion, ProteinMPNN, and Bindcraft make it trivial to produce low-homology sequences that fold into active, potentially hazardous architectures. However, sequence homology-based biosafety screening tools cannot detect proteins that pose functional risk through structurally novel mechanisms with no sequence precedent. We present a tiered computational pipeline that addresses this gap by combining MMseqs2 sequence alignment with structure-based comparison via FoldSeek and DALI against curated toxin databases totaling ~34,000 entries. AlphaFold2-predicted structures are screened for both global fold similarity (FoldSeek) and local active/allosteric site geometry (DALI), capturing convergent functional hazards that sequence screening misses. The pipeline was validated against a panel of toxins, benign proteins, structural mimics, and de novo-designed Munc13 binders, as well as modified ricin variants with residue substitutions. We additionally tested robustness to partial-synthesis evasion, where a bad actor submits multiple shorter coding sequences intended for downstream reassembly into a full toxin-coding gene. We found that while sequence-based screening did not identify any de novo ricin analogues with high certainty, the combined pipeline with FoldSeek and DALI identified all 24 tested de novo ricins as toxic.

Read More

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
Apart Research logo

Sign up to stay updated on the
latest news, research, and events

Google Scholar icon

Apart Research Inc · 1500 N Grant St, Ste R, Denver, CO 80203 · +1 (720) 408-1923

Apart Research logo

Sign up to stay updated on the
latest news, research, and events

Google Scholar icon

Apart Research Inc · 1500 N Grant St, Ste R, Denver, CO 80203 · +1 (720) 408-1923

Apart Research logo

Sign up to stay updated on the
latest news, research, and events

Google Scholar icon

Apart Research Inc · 1500 N Grant St, Ste R, Denver, CO 80203 · +1 (720) 408-1923

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
Apart Research logo

Sign up to stay updated on the
latest news, research, and events

Google Scholar icon

Apart Research Inc · 1500 N Grant St, Ste R, Denver, CO 80203 · +1 (720) 408-1923