{
 "schema_version": 1,
 "generated": "2026-10-20",
 "id": "morluto-jacobian--agent-finds-solver-operation-for-graph-or-sat-question",
 "repo": "morluto/jacobian",
 "repo_url": "https://github.com/morluto/jacobian",
 "repo_slug": "morluto-jacobian",
 "title": "Let an agent find and run a graph or SAT operation",
 "page_title": "How to let an agent find and run a graph or SAT operation with Jacobian",
 "summary": "Use math.find to match a graph or SAT question to a bounded operation, then run it once.",
 "who": "A researcher or engineer whose agent needs a bounded graph, coloring, or SAT or SMT answer and should not guess it from text.",
 "problem": "Agents tend to reason informally about graph colorings or satisfiability, and the reasoning is hard to verify.",
 "outcome": "The agent selects a matching typed operation, confirms its contract, and returns the solver result for your problem.",
 "steps": [
  "Run `uvx --python 3.12 --from jacobian jacobian-mcp` or add the same command to your MCP host configuration.",
  "Ask the agent to describe your problem and use math.find to search for a matching operation.",
  "Ask the agent to use math.find in inspection mode on the most promising operation.",
  "Ask the agent to call math.run once with your input and report the typed result."
 ],
 "agent_prompt": "Using the Jacobian MCP server from morluto/jacobian, use math.find to match this need: <problem description>. Inspect the best operation, call math.run once with <input>, and return the typed result. Verify that the result states whether it is exact, approximate, or incomplete.",
 "agents": [
  "any"
 ],
 "difficulty": "Advanced",
 "time": "30 minutes",
 "basis": "readme",
 "caveat": "Operations use the bundled Python backends, but some operations require the optional Singular or QEPCAD runtimes that the Python package does not provision.",
 "category": "Research",
 "tags": [
  "Research"
 ],
 "lang": "python",
 "requirements": [
  "Python 3.12 or 3.13 on glibc Linux x86-64 for the tested binary install, or another supported Python environment",
  "uv with uvx on PATH for the canonical MCP command",
  "Node.js 20.17+, 22.13+, or 23.5+ if you use the npm setup command",
  "An MCP-capable agent host or a terminal for the CLI"
 ],
 "risk": "none",
 "seen_in_the_wild": false,
 "mentioned_publicly": false,
 "risks": [],
 "best": false,
 "score": 0.8,
 "evidence": [],
 "url": "https://dedupedai.com/use-cases/morluto-jacobian/agent-finds-solver-operation-for-graph-or-sat-question/",
 "md": "https://dedupedai.com/use-cases/morluto-jacobian/agent-finds-solver-operation-for-graph-or-sat-question/index.md",
 "disclaimer": "Deduped lists open-source repositories that belong to other people. We do not own, maintain, audit, or vouch for any of them, and a repo appearing here is not an endorsement or a safety check. The use cases, steps, and prompts are written by AI and may be incomplete, outdated, or just wrong. Where a use case is marked \"Seen in the wild\", we link to public posts where someone described something similar, but we have not verified those posts and the use case itself is still our AI's own write-up. Use all of this at your own risk. Only run code, commands, or agents on systems and accounts you are authorized to use, and read the code and every command before you run it, especially anything that touches credentials, files, or the network. Nothing here is professional, security, legal, or financial advice. All trademarks and project names belong to their respective owners, and their use here does not imply affiliation. Content is provided as is, without warranties of any kind. Found a mistake, a safety problem, or something you want removed? Email hello@dedupedai.com and we will look at it promptly.",
 "api": "https://dedupedai.com/api/v1/usecases/morluto-jacobian--agent-finds-solver-operation-for-graph-or-sat-question.json",
 "api_version": "v1"
}