{
  "url": "https://appliedfrontier.nl/en/research/signal-dc34b894ca7efc23/",
  "title": "Reward-Oracle MCTS for Formal Theorem Proving: Sample-Efficient Search and the Need for Kernel-Level Proof Auditing",
  "published": "2026-08-11",
  "excerpt": "Formal theorem proving with large language models remains challenging due to the difficulty of navigating large proof search spaces efficiently. Existing tree search approaches either",
  "content_sha256": "26d57f2e1843bf75752d3259a8b711a75ba19b6d122b53f768bbca986463b282",
  "extracted_chars": 1761,
  "artifact_links": [
    "https://arxiv.org/abs/2608.28639"
  ],
  "arxiv_id": "2608.28639",
  "id": "signal-dc34b894ca7efc23",
  "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": [
    "proof",
    "theorem"
  ],
  "checked_at": "2026-10-29T22:08:08+00:00",
  "first_seen": "2026-10-29T21:52:00+00:00",
  "source_hash": "03402b8c806e876c8c963d8fcf450feff58a396810493418cef5ed66b0b0d767",
  "source_url": "https://arxiv.org/abs/2608.28639",
  "language": "en",
  "indexing": "noindex_until_editorially_enriched"
}