← Evaluations/EVAL-20260402-121519
code
Jan 19, 2026CODE-002

Write a Python function that parses deeply nested JSON with the following requirements: 1. Handle missing keys gracefully (return None, don't crash) 2. Support a path syntax like "user.profile.settings.theme" 3. Handle arrays with index syntax like "users[0].name" 4. Return a typed result with proper error messages for debugging 5. Handle circular reference detection Include type hints and comprehensive docstrings.

Winner
GPT-5.4
openrouter
9.13
WINNER SCORE
matrix avg: 7.22
results.json report.mdFull dataset (CSV) →
10×10 Judgment Matrix · 88 judgments
OPEN DATA
Judge ↓ / Respondent →GPT-5.4Claude Opus 4.6Gemini 3.1 ProClaude Sonnet 4.6Grok 4.20DeepSeek V4GPT-OSS-120BGemini 3MiniMax M2.5MiMo-V2-Flash
GPT-5.46.41.93.36.56.88.06.32.97.5
Claude Opus 4.69.21.66.36.07.48.67.85.78.2
Gemini 3.1 Pro9.45.74.87.27.67.76.84.38.2
Claude Sonnet 4.69.08.01.96.88.28.97.56.48.2
Grok 4.208.88.73.66.08.48.87.06.46.8
DeepSeek V49.69.0·8.89.69.69.28.89.8
GPT-OSS-120B8.83.4·3.88.38.87.83.68.6
Gemini 39.89.62.99.39.69.89.89.09.8
MiniMax M2.58.87.60.65.88.38.49.47.29.6
MiMo-V2-Flash8.87.06.86.48.68.09.08.67.0