E28 · Scalabrio183

Full sample results

Scores

MethodScoreScaleDataset rank
(0–100)
GPT-6.1 Sol16.330–20; mean of three runs
42.5Δ 3.0
DeepSeek V4 Pro15.330–20; mean of three runs
66.6Δ 21.1
BTTF0.5320–1; higher is more readable
49.7Δ 4.3
Human3.561–5; original rating
45.5

Loading feature diagnosis…

Source code

GPT-6.1 Sol explanations

Run 1 · 16/20

Code Structure: Logically organized into initialization, logging, graph validation, and stack updates.

Nesting: Moderate two-level conditionals are manageable, though the nested else could become an else-if.

Clarity of intent: Descriptive variable names and explicit exception messages explain the expected graph invariants; the special treatment of any types requires domain knowledge.

Code length: Reasonably concise, but the repeated collection-persister role lookup adds verbosity.

Action granularity: Statements generally perform one action each, with multiline calls keeping long expressions readable.

Reading flow: Execution proceeds naturally from type inspection to validation and stack manipulation, although repeated method chains and multiline formatting slightly interrupt scanning.

Run 2 · 17/20

Code Structure: Logically organized into type retrieval, logging, graph retrieval, validation, and stack update.

Nesting: Moderate two-level conditionals are manageable, though an else-if could flatten the final branch.

Clarity of intent: Descriptive names and specific exception messages clarify expected graph behavior; domain-specific type rules and the cast require contextual knowledge.

Code length: Reasonably concise, but the repeated collection-role lookup adds verbosity.

Action granularity: Each statement performs a distinct action, with multiline calls formatted clearly.

Reading flow: Natural top-to-bottom progression and consistent spacing aid scanning, although repeated accessor chains and negative conditions slightly interrupt the flow.

Run 3 · 16/20

Code Structure: Logically organized into type retrieval, logging, graph retrieval, validation, and stack updates.

Nesting: Moderate nesting is manageable, though the else block could be flattened into an else-if.

Clarity of intent: Descriptive names and explicit exception messages explain expected graph behavior; domain-specific type checks and the cast require contextual knowledge.

Code length: Reasonably concise, but repeated collection-role lookup and similar exception construction add verbosity.

Action granularity: Each statement performs a distinct action, with multiline formatting keeping longer calls readable.

Reading flow: Follows a natural sequence from setup to conditional handling, although repeated method chains and nested checks slightly interrupt scanning.

BTTF feature contributions

Score 0.532 / 1