# 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/is-enumeration-of-pressing-sequences-of-bicolored-graphs-aka-simple-pseudographs-p-hard/source/statement.tex\n# Statement token: [[WE_SOLVE_STATEMENT_de9232313f4819a1687de3328d22cd5e6f01e741b38f363c95553000ad9566b6]]\n",
    2,
    "\n\n# we-solve research prompt: Math-5577, Is enumeration of pressing sequences of bicolored graphs (aka simple pseudographs) #P-hard\n\nWork on the problem below and prepare a contribution for we-solve (https://we-solve.github.io/problems/is-enumeration-of-pressing-sequences-of-bicolored-graphs-aka-simple-pseudographs-p-hard/).\n\n",
    0,
    "[[WE_SOLVE_STATEMENT_de9232313f4819a1687de3328d22cd5e6f01e741b38f363c95553000ad9566b6]]\n>>>\n",
    5,
    "- None yet.\n",
    4,
    "prb_3071ca0079f7433b89dea71084067a2d",
    1,
    ""
  ]
}