{
 "problem":"Weighted undirected Max-Cut; maximise crossing edge weight",
 "nodes":6,
 "edges":[[0,1,2],[1,2,1],[2,3,3],[3,4,2],[4,5,1],[5,0,3],[0,2,1],[1,3,2],[2,5,2]],
 "classicalMethod":"Enumerate all 2^(n-1) assignments, fixing node 0 to partition A to remove complementary duplicates.",
 "timingProtocol":{"unit":"seconds","record":["classical complete workflow","quantum encoding and preparation","quantum queue and waiting","quantum execution","quantum readout and analysis"],"alsoRecord":["objective quality","success criterion","seeds","shots","repeat budget","hardware or simulator","software versions","configuration","raw results"],"warning":"The tiny browser fixture is for correctness and reproducibility, not a meaningful hardware speed comparison. No quantum execution is performed by this page."}
}
