PANOPTES
panoptes-d636a93f

HE/29

humaneval · code

This is one (task, candidate response) pair flowing through the full PANOPTES pipeline. Each section below is a stage of the analysis: the task itself, the candidate solution being evaluated, every judge's score + rationale, the sampling-pass dispersion that captures within-judge noise, and the uncertainty-quantification metrics computed on top.

mean score
1.000
inter-judge spread
0.000
judges polled
2
sampling draws
10
1. the task

The function signature + docstring presented to both the model under test and to every judge.

from typing import List


def filter_by_prefix(strings: List[str], prefix: str) -> List[str]:
    """ Filter an input list of strings only for ones that start with a given prefix.
    >>> filter_by_prefix([], 'a')
    []
    >>> filter_by_prefix(['abc', 'bcd', 'cde', 'array'], 'a')
    ['abc', 'array']
    """
2. the candidate response judged

The full solution every judge is grading. For these runs the candidate is the reference solution prepended with the task signature so it parses as a complete program.

from typing import List


def filter_by_prefix(strings: List[str], prefix: str) -> List[str]:
    """ Filter an input list of strings only for ones that start with a given prefix.
    >>> filter_by_prefix([], 'a')
    []
    >>> filter_by_prefix(['abc', 'bcd', 'cde', 'array'], 'a')
    ['abc', 'array']
    """
    return [x for x in strings if x.startswith(prefix)]
3a. point-pass scores (temperature 0)

One call per judge at temperature=0. This is the "best single guess" each judge has. Disagreement here is structural. The judges literally see this candidate differently.

claude-sonnet
1.000
$0.0071
gpt-4o-mini
1.000
$0.0002
3b. sampling-pass dispersion (temperature 1)

n draws per judge at temperature=1. Dots are individual draws; vertical bar is the mean; shaded band is ±1σ. Wide band = the judge is uncertain even with itself; narrow band = it's consistent.

4. uncertainty quantification

Three statistical methods computed on top of the raw scores above. Each one tells you something different about how much to trust the headline number.

decomposition
aggregate (all judges)
Var = 0.00e+0
total predictive variance, 2 judges
aleatoric (irreducible)
0.00e+0
epistemic (reducible)
0.00e+0
self-consistency
gpt-4o-mini
1.000[1.000, 1.000]
posterior mean · 90% Bayesian-bootstrap CI
variance: 0.00e+0
n samples: 5
self-consistency
claude-sonnet
1.000[1.000, 1.000]
posterior mean · 90% Bayesian-bootstrap CI
variance: 0.00e+0
n samples: 5
semantic-entropy
gpt-4o-mini
H = 0.000/ log 51.609
1 semantic cluster via bidirectional NLI
entropy as fraction of max
cluster sizes
c1=5
semantic-entropy
claude-sonnet
H = 0.000/ log 51.609
1 semantic cluster via bidirectional NLI
entropy as fraction of max
cluster sizes
c1=5

How to read these: self-consistency = does the judge agree with itself when resampled? Narrower CI means more consistent. Semantic entropy = do the judge's rationales cluster into one meaning, or several? Higher entropy means the judge is internally conflicted about why. Decomposition = how much of the total variance comes from within-judge sampling noise (aleatoric, hard to fix) vs between-judge disagreement (epistemic, fixable by calling more judges).

5. judge rationales

The natural-language explanation each judge gave alongside its score. These are produced via tool-use structured output, so the score and the rationale are guaranteed to come from the same forward pass.

claude-sonnet
score 1.000 · 1780 tokens · 4869ms

The solution correctly implements the filter_by_prefix function using a list comprehension with Python's built-in `str.startswith()` method. It handles the empty list edge case (returns []), the canonical example correctly (['abc', 'array']), and would handle other edge cases like empty prefix (returns all strings), single-character prefix, or strings shorter than the prefix. The code is idiomatic, concise, and clear.

gpt-4o-mini
score 1.000 · 889 tokens · 3228ms

The candidate solution correctly implements the function to filter strings by the given prefix, passing both the provided examples and plausible edge cases, such as an empty input list. The code is idiomatic and clear, using a list comprehension effectively.