arXiv (All)
open access
Scaling Graph Reasoning in Language Models with Learnable Graph Positional Encodings
Solving reasoning tasks supported on graphs typically requires providing a Language Reasoning Model (LRM) with a serialized description of the graph. This approach results in the input length growing with the number of edges, which limits the size of the problems that can be solved. Furthermore, eve
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- COMPASS: Finding Where Reasoning Lives in Language Models#1216844
- GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs#1000225
- microsoft/rStar-Coder#786726
- DARE: Dialectical Agentic Reasoning for Structured Knowledge Fact Checking#1083306
- Solving Every Step Is Not Enough: Milestone Oracles Reveal a Composition Gap in LLM Math Reasoning#1116566
Record · ID 1402827
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive