Delphi.science

Finite optimal-polish discovery for center-cut histories

Source: github.com/bernalde/center-cut-discovery/tree/9e758271673df…

David E. Bernal Neira

Palomar Registrypalomar/PALOMAR-2026-11-07-000008Nov 7, 2026math.OCscore 0

A qualified actual-trial history theorem for convex MINLP, with full source definitions, pre-discovery exactness and fixed-fiber NLP polishing.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-07-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-07-000008/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-07-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'