İçeriğe geç
CANLI 03:21 OpenAI Performance Factory: Codex, ChatGPT’yi hızlı tutuyor 03:21 Çin çip kısıtlaması: Sevkiyat durdu, bulut kapısı kapandı 03:21 Nadella 60 bin çalışan için ayrılma teklifini açıkladı 03:21 Gemini Mac bilgisayar kullanımı özelliği tanıtıldı 03:20 Anthropic Nasdaq’ta ilk gün: Hisse 111,50 dolardan açıldı Zekâ endeksi lideri Claude Fable 5.2 (Max, Default Fallback) · 64,6 20.11.2026
Bülten

arXiv 2609.40324 cs.AI

Cogentic: Multi-Agent Orchestration for Automated Proof Discovery

  • Yang Cai
  • Vineet Gupta
  • Yanchen Jiang
  • Christopher Liaw
  • Aranyak Mehta
  • Grigoris Velegkas
  • Di Wang

02 Özet

Özetle: We present Cogentic, a multi-agent harness for automated proof discovery on open research problems.

Özet

We present Cogentic, a multi-agent harness for automated proof discovery on open research problems. While frontier language models can generate strong mathematical ideas in a single shot, single-shot generation is often insufficient for open problems that require exploring multiple competing conjectures, overcoming subtle technical obstructions, and retaining intermediate progress over a long horizon. Cogentic addresses these challenges through an iterative prove–verify loop in which an orchestrator allocates a population of independent provers across distinct proof directions, subjects their output to adversarial verification by several specialized components, and promotes confirmed intermediate results into a persistent verified ledger that later rounds build on. The harness is designed to be able to solve research-level math and theoretical computer science problems. Using Gemini as the base model, Cogentic produced novel results on five open problems across online learning, auction theory, and mechanism design. Each result was independently verified by domain experts and is developed in full in companion papers. We list these results, and new ones as they are verified, at https://sites.google.com/view/cogentic .

Orijinal Özet (İngilizce)

We present Cogentic, a multi-agent harness for automated proof discovery on open research problems. While frontier language models can generate strong mathematical ideas in a single shot, single-shot generation is often insufficient for open problems that require exploring multiple competing conjectures, overcoming subtle technical obstructions, and retaining intermediate progress over a long horizon. Cogentic addresses these challenges through an iterative prove–verify loop in which an orchestrator allocates a population of independent provers across distinct proof directions, subjects their output to adversarial verification by several specialized components, and promotes confirmed intermediate results into a persistent verified ledger that later rounds build on. The harness is designed to be able to solve research-level math and theoretical computer science problems. Using Gemini as the base model, Cogentic produced novel results on five open problems across online learning, auction theory, and mechanism design. Each result was independently verified by domain experts and is developed in full in companion papers. We list these results, and new ones as they are verified, at https://sites.google.com/view/cogentic .

Kaynak: arXiv:2609.40324 · PDF

We present Cogentic, a multi-agent harness for automated proof discovery on open research problems. While frontier language models can generate strong mathematical ideas in a single shot, single-shot generation is often insufficient for open problems that require exploring multiple competing conjectures, overcoming subtle technical obstructions, and retaining intermediate progress over a long horizon. Cogentic addresses these challenges through an iterative prove--verify loop in which an orchestrator allocates a population of independent provers across distinct proof directions, subjects their output to adversarial verification by several specialized components, and promotes confirmed intermediate results into a persistent verified ledger that later rounds build on. The harness is designed to be able to solve research-level math and theoretical computer science problems. Using Gemini as the base model, Cogentic produced novel results on five open problems across online learning, auction theory, and mechanism design. Each result was independently verified by domain experts and is developed in full in companion papers. We list these results, and new ones as they are verified, at https://sites.google.com/view/cogentic .

03 PDF

Bu PDF başka bir sitede (arxiv.org) barındırılıyor ve sayfa içinde gösterilemiyor. Yukarıdaki düğmelerle yeni sekmede açabilir ya da indirebilirsiniz.

04 Kaynak göster

BibTeX
@article{cai2026cogentic,
  title   = {Cogentic: Multi-Agent Orchestration for Automated Proof Discovery},
  author  = {Yang Cai and Vineet Gupta and Yanchen Jiang and Christopher Liaw and Aranyak Mehta and Grigoris Velegkas and Di Wang},
  journal = {arXiv preprint arXiv:2609.40324},
  year    = {2026},
  url     = {https://arxiv.org/abs/2609.40324}
}
APA
Cai, Y., Gupta, V., Jiang, Y., Liaw, C., Mehta, A., Velegkas, G., & Wang, D. (2026). Cogentic: Multi-Agent Orchestration for Automated Proof Discovery. arXiv. https://arxiv.org/abs/2609.40324
Paylaş
X LinkedIn WhatsApp Telegram Reddit Bluesky Threads E-posta

Yorumlar 0

Yorum yazın

Karakter: 0/1000

Henüz yorum yok. İlk yorumu siz yazın.