{
  "url": "https://appliedfrontier.nl/en/research/signal-68b3edb11a906d24/",
  "title": "FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving",
  "published": "2026-08-25",
  "excerpt": "Mixed-Integer Linear Programming (MILP) is a fundamental tool for combinatorial optimization with extensive real-world applications. A central challenge is designing computationally efficient MILP formulations. Large",
  "content_sha256": "4900dc42493ee50fe0bfae98d9de179c9bf41005eadf4a9c4dfdd6dd11e01fe8",
  "extracted_chars": 1493,
  "artifact_links": [
    "https://arxiv.org/abs/2608.25220"
  ],
  "arxiv_id": "2608.25220",
  "id": "signal-68b3edb11a906d24",
  "org": "Research community",
  "topic": "Formal verification",
  "source_kind": "preprint",
  "status": "unreviewed-source-report",
  "analysis_method": "deterministic_metadata_triage_v1",
  "novelty_verified": false,
  "proof_checked": false,
  "peer_review_verified": false,
  "matched_terms": [
    "theorem"
  ],
  "checked_at": "2026-10-29T22:08:08+00:00",
  "first_seen": "2026-10-29T21:52:00+00:00",
  "source_hash": "f5dc00fa7e73bc45f10d09c3bcf72ef1eaaa09e38c50dae0a8d5581a810867ef",
  "source_url": "https://arxiv.org/abs/2608.25220",
  "language": "en",
  "indexing": "noindex_until_editorially_enriched"
}