The Flow has not summarised this story yet — read it at arXiv Computation and Language.
Graph-augmented large language models often assume that graph evidence produced by external computation and placed in the input can be used by the native decoder. We test this assumption with HopQA, a...
arXiv:2602. 11745v2 Announce Type: replace Abstract: Graph models are fundamental to data analysis in domains rich with complex relationships.
arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.
The paper investigates whether natural language inference (NLI) can be performed using only interpretable, graph-based representations of evidence. It introduces a pipeline that decomposes sentences into atomic propositions, maps them to ConceptNet triples, and feeds three graphs—premise, hypothesis, and a retrieved ConceptNet subgraph—into a fine‑tuned 0.8‑billion‑parameter language model. On the SNLI dataset the graph‑only model reaches 89.7% accuracy, close to a text‑based baseline, while on ANLI it matches RoBERTa‑large on rounds R2 and R3 but lags on R1, illustrating a trade‑off between interpretability and performance.
arXiv:2608. 12391v1 Announce Type: cross Abstract: Graph reasoning provides a promising testbed for evaluating the reasoning ability of large language models (LLMs), as graph instances can be programmatically generated, structurally controlled, and naturally scaled to long-input settings.
arXiv:2606. 00328v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly used for knowledge base question answering (KBQA), where answering requires selecting entities from a question-specific knowledge-graph subgraph.