Coherent Values, or the Frame That Asked? From Preference Transitivity to Identifiability

Alex Kwon

Reframing a question reverses up to 52% of a model's strongly-held pairwise preferences, and 29% under near-deterministic decoding, while transitivity, the coherence criterion behind claims of emergent value systems, registers nothing. Five models, a frozen 45-pair battery, eight frames, no LLM judge. We propose an identifiability gate separating coverage from coherence, validated on four agents whose mechanism we set: up to 40% of a preference graph is not attributable to the model at all.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

The rigor here really stands out! Preregistering before the first run, no LLM judges anywhere, and openly listing which claims you did not show.

Thoughts :

1. Only 2 of 5 models clear the noise floor, and "up to 52%" seems stronger than warranted.

2. 3 repeats is the binding constraint, your own validation shows sensitivity jumps from 0.67 to 1.00 at 5 repeats, so more repeats would help a lot?

3. Would love to see a second domain dataset beyond charity choices.

This project asks whether successful self-prediction by an LLM reflects privileged self-access, or whether an external observer can make the same inference from ordinary features of the model’s outputs. This is a useful distinction: above-chance self-prediction is not, by itself, evidence of introspection if the relevant information is cheaply recoverable from text.

The authors test this in two ways. First, they use a persona-prediction task with a crossed design across different open weight models, aiming to separate self-specific prediction from general classifier capability. Second, they test direct self-prediction, asking models which of two responses they themselves would produce. Hermes-3 succeeds above chance, but a simple “pick the longer response” rule performs even better on the same pairs.

The authors therefore conclude, appropriately, that self-prediction is demonstrated for Hermes-3, but privileged self-access is not.

Strengths

- Strong research question: directly targets a key methodological issue in behavioural introspection research.

- Good execution: distinguishes self-prediction from privileged self-access rather than conflating the two.

- Useful external baselines: the length-only heuristic is especially compelling because it is cheap, matched item-for-item, and outperforms Hermes.

- Good handling of response bias: the authors correctly identify near-constant A/B responding as an elicitation failure rather than a meaningful null.

- Excellent transparency: failed manipulations, post-hoc analyses, sample-size deviations, and changes from preregistration are all clearly disclosed.

- Useful methodological contribution: the surface-leakage and response-bias checks could be valuable beyond this specific experiment.

Limitations

- The style-equalization manipulation is confounded: it removes not only stylistic differences but also much of the underlying behavioural difference between personas, so the collapse to chance cannot establish that style caused the original effect.

- The capability-controlled interaction is not fully identifying: it removes additive competence differences but not predictor-by-target-distribution effects.

- The strongest comparator is post hoc: the length heuristic is compelling, but it should be replicated on fresh data with the rule fixed in advance.

- Limited scope currently, but reasonable for a weekend project: one model lineage, one hidden-property construction, and prompting-only evidence.

Overall assessment: I would rate this as a very strong sprint submission. Its main contribution is methodological: it shows how behavioural self-prediction can look more introspective than it is unless cheap external cues, response biases, and manipulation validity are explicitly tested.

Some suggestions for follow up work:

- Replicate the Hermes result on fresh data with the length rule and other cheap baselines preregistered.

- Develop a style-control manipulation that preserves the behavioural distinction being predicted.

- Test whether self-report adds predictive information beyond a strong external observer, rather than only comparing raw accuracies.

Cite this work

@misc {

title={

(HckPrj) Coherent Values, or the Frame That Asked? From Preference Transitivity to Identifiability

},

author={

Alex Kwon

},

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