Test fixture
Grounded answers under adversarial or missing-context prompts.
The model receives the prompt (and optional system message). The run uses scorer rubric_json_metrics with the JSON configuration below. Pass/fail and partial credit are determined entirely by that scorer against the model output; no human grading.
Return JSON only with keys answer, supported_facts, uncertainty. What is catastrophic backtracking in regular expressions and what pattern structure causes it? How does it affect performance on non-matching input? Avoid claiming all regex matching is O(n) in time complexity.
{
"metrics": {
"accuracy": {
"checks": [
{
"contains": [
"nested quantifiers"
]
},
{
"contains": [
"exponential"
]
},
{
"contains": [
"non-matching"
]
}
]
},
"fabricated": {
"checks": [
{
"contains": [
"not always O(n)"
]
},
{
"contains": [
"exponential time"
]
},
{
"contains": [
"catastrophic backtracking"
]
}
]
}
}
}temperature
0
max_tokens
460
timeout (s)
120
type
scored
file
halluc-edge-regex-backtrack.json