# we-solve referenced research prompt v2
{
  "schema": "we-solve.research-prompt-codec.v2",
  "instructions": "The template contains all rules and the output form. Join parts in order: strings are literal context; integers select template fragments. Then read the quoted source URL in that text. The copy button assembles the full prompt.",
  "template_url": "https://we-solve.github.io/prompts/templates/5035f52faf49f145e05ba8a2aa4eb22369997f2d88c875bc307955da41f0ffea.txt",
  "parts": [
    "",
    3,
    "https://we-solve.github.io/problems/complexity-of-maximum-tutte-sets-and-d-graph-recognition/source/statement.tex\n# Statement token: [[WE_SOLVE_STATEMENT_6b827cf531b3b9e5afd5236bda0508e36b9b20e80d24a18657aa2b624823e4bc]]\n",
    2,
    "\n\n# we-solve research prompt: Math-6567, Complexity of Maximum Tutte Sets and D-Graph Recognition\n\nWork on the problem below and prepare a contribution for we-solve (https://we-solve.github.io/problems/complexity-of-maximum-tutte-sets-and-d-graph-recognition/).\n\n",
    0,
    "[[WE_SOLVE_STATEMENT_6b827cf531b3b9e5afd5236bda0508e36b9b20e80d24a18657aa2b624823e4bc]]\n>>>\n",
    5,
    "- None yet.\n",
    4,
    "prb_1f53aaabeddc456897071a00032484f6",
    1,
    ""
  ]
}