# 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/problem-2a-what-is-the-minimal-number-of-open-sets-u-i-covering-r-6-such-that-for-any-u-i/source/statement.tex\n# Statement token: [[WE_SOLVE_STATEMENT_546efae9941acd51df314db0df744fcf80ac0f25aecb47424b740a0203aada6d]]\n",
    2,
    "\n\n# we-solve research prompt: Math-13260, Problem 2A — What is the minimal number of open sets $U_{i}$ covering ${\\mathbb{R}}^{6}$ such that for any $U_{i}$…\n\nWork on the problem below and prepare a contribution for we-solve (https://we-solve.github.io/problems/problem-2a-what-is-the-minimal-number-of-open-sets-u-i-covering-r-6-such-that-for-any-u-i/).\n\n",
    0,
    "[[WE_SOLVE_STATEMENT_546efae9941acd51df314db0df744fcf80ac0f25aecb47424b740a0203aada6d]]\n>>>\n",
    5,
    "- None yet.\n",
    4,
    "prb_b28dd2e9def54903bf347472a58f3c1d",
    1,
    ""
  ]
}