Tag
The author redesigned the IONS protocol from brute-force graph traversal to a Cognitive Attention Architecture that progressively routes queries through relevant slices of the network, separating path confidence, relevance, and utility.
A user reports that Gemma4_31b in FP8 matches or keeps up with Sonnet_4.6_medium in a custom harness across tasks like Cypher query generation, entity extraction, agentic tool calling, code writing, and multi-vector retrieval synthesis.
This paper introduces Bounded Path Context (BPC), a method for LLM-based knowledge graph question answering that limits the visible path history in prompts, showing that bounded histories can match or exceed full-history prompting while reducing token usage.
pgGraph is a high-performance, open-source graph traversal extension for PostgreSQL, written in Rust, designed to give AI agents fast relationship queries without migrating data to a separate graph database.
This paper introduces GATHER, a convergence-centric retrieval method for zero-shot cell-type annotation using knowledge graphs, which improves accuracy and reduces LLM costs compared to existing KG-RAG baselines.