# 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/hitting-maximum-independent-sets-in-bounded-chromatic-graphs/source/statement.tex\n# Statement token: [[WE_SOLVE_STATEMENT_9c341acd86a002771eb07b3c18f2b1f50325166117fcdeafc31c14434fc0708a]]\n",
    2,
    "\n\n# we-solve research prompt: Math-5032, Hitting Maximum Independent Sets in Bounded-Chromatic Graphs\n\nWork on the problem below and prepare a contribution for we-solve (https://we-solve.github.io/problems/hitting-maximum-independent-sets-in-bounded-chromatic-graphs/).\n\n",
    0,
    "[[WE_SOLVE_STATEMENT_9c341acd86a002771eb07b3c18f2b1f50325166117fcdeafc31c14434fc0708a]]\n>>>\n",
    5,
    "- None yet.\n",
    4,
    "prb_ae323138e0d74f6a98cddfa43d909a6e",
    1,
    ""
  ]
}