# 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/for-each-arrangement-of-points-in-which-the-rectilinear-crossing-number-is-minimized-is-the-number-of-halving-lines-maxi/source/statement.tex\n# Statement token: [[WE_SOLVE_STATEMENT_a5be9dbb85e289cd83f901e4cfc8aab72da2d1865c9077532eebff33e1aff491]]\n",
    2,
    "\n\n# we-solve research prompt: Math-5668, For each arrangement of points in which the rectilinear crossing number is minimized, is the number of halving lines maximized\n\nWork on the problem below and prepare a contribution for we-solve (https://we-solve.github.io/problems/for-each-arrangement-of-points-in-which-the-rectilinear-crossing-number-is-minimized-is-the-number-of-halving-lines-maxi/).\n\n",
    0,
    "[[WE_SOLVE_STATEMENT_a5be9dbb85e289cd83f901e4cfc8aab72da2d1865c9077532eebff33e1aff491]]\n>>>\n",
    5,
    "- None yet.\n",
    4,
    "prb_7dd6a3e271ce4e30a8eeaced1d205cfb",
    1,
    ""
  ]
}