JSON parsing when the explanation has curly braces

[rajasbansal]

Parsing the following response fails when using the regex specified

ontext: But bounding the computation time above by some concrete function f(n) often yields complexity classes that depend on the cho
sen machine model. For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machin
e, but necessarily requires quadratic time in the model of single-tape Turing machines. If we allow polynomial variations in running t
ime, Cobham-Edmonds thesis states that "the time complexities in any two reasonable and general models of computation are polynomially
 related" (Goldreich 2008, Chapter 1.2). This forms the basis for the complexity class P, which is the set of decision problems solvab
le by a deterministic Turing machine within polynomial time. The corresponding set of function problems is FP.
Question: What thesis specifies that a polynomial relationship exists within time complexities in a computational model?

Answer: {"label": "Cobham-Edmonds thesis"}

This is because the current regular expression just finds the first expression with enclosing curly braces while we need the last possible match