# 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/a-graph-g-is-said-to-be-uniquely-colorable-it-has-only-one-optimal-coloring-up-to-permutation-of-the-colors/source/statement.tex\n# Statement token: [[WE_SOLVE_STATEMENT_5a11498f89177154a71ff2f384747b3992b19eb3a33ffb6b3a20cfd2e9fd8e2c]]\n",
    2,
    "\n\n# we-solve research prompt: Math-5573, A graph G is said to be uniquely colorable it has only one optimal coloring up to permutation of the colors\n\nWork on the problem below and prepare a contribution for we-solve (https://we-solve.github.io/problems/a-graph-g-is-said-to-be-uniquely-colorable-it-has-only-one-optimal-coloring-up-to-permutation-of-the-colors/).\n\n",
    0,
    "[[WE_SOLVE_STATEMENT_5a11498f89177154a71ff2f384747b3992b19eb3a33ffb6b3a20cfd2e9fd8e2c]]\n>>>\n",
    5,
    "- None yet.\n",
    4,
    "prb_ee4034e51045455aa1749361e95f1725",
    1,
    ""
  ]
}