# Graphs

A graph data structure consists of vertices connected by edges.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## LINEAGE: A Benchmark for Empirical Lineage Retrieval in AI Scientific Literature

DevFeed: [LINEAGE: A Benchmark for Empirical Lineage Retrieval in AI Scientific Literature](<https://devfeed.tech/articles/lineage-a-benchmark-for-empirical-lineage-retrieval-in-ai-scientific-literature-145594.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25845>)

Author: Pangjing Wu, Xu Yuan, Wenqi Fan, Qing Li

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [search-engines](<https://devfeed.tech/topics/search-engines.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [17](<https://devfeed.tech/tags/17.md>), [2018](<https://devfeed.tech/tags/2018.md>), [2025](<https://devfeed.tech/tags/2025.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [academic](<https://devfeed.tech/tags/academic.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [components](<https://devfeed.tech/tags/components.md>), [constructor](<https://devfeed.tech/tags/constructor.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [experiment](<https://devfeed.tech/tags/experiment.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [literature](<https://devfeed.tech/tags/literature.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>)

### AI overview

Lineage benchmarks retrieval of prior AI research methods explicitly used as empirical comparison baselines, a relation that topical relevance and citation links alone do not capture. Its lineage graphs provide multi-hop retrieval ground truth, and Lineage-Constructor builds calibrated graphs from heterogeneous paper records and full-paper baseline evidence. The benchmark covers 67,502 papers, 164,948 lineage edges, and 80,000 multi-facet queries, drawn from 121,048 papers across 17 AI venues from 2018-2025. Tests of 19 retrieval systems found that performance drops sharply with lineage distance, and isolated hits often fail to recover closely connected comparison neighborhoods.

### Source excerpt

arXiv:2611.25845v1 Announce Type: cross Abstract: Current research agents are moving beyond academic search toward literature synthesis and experiment planning. These workflows increasingly rely on literature retrieval systems, which serve as standalone systems or as components of research agents. However, existing scientific literature retrieval benchmarks mainly evaluate these methods using topical relevance or citation links as supervision, which cannot capture which prior methods are used for empirical comparison. To address this gap, we introduce Lineage, a benchmark for empirical lineage retrieval in AI scientific literature. An empirical lineage relation links a prior paper to a source paper that explicitly uses its method as an empirical comparison baseline. These relations form lineage graphs whose multi-hop neighborhoods provide retrieval ground truth for structural evaluation. To construct these graphs at scale, we develop Lineage-Constructor, which converts heterogeneous paper records and full-paper empirical baseline evidence into calibrated lineage graphs. Built from 121,048 papers across 17 top AI venues from 2018 to 2025, Lineage contains 3,950 graph components, 67,502 paper nodes, 164,948 lineage edges, and 80,000 multi-facet retrieval queries. Experiments with 19 representative retrieval systems show that empirical lineage retrieval remains challenging. Performance drops sharply with lineage distance, while structural metrics reveal that isolated retrieval hits often fail to recover closely connected empirical comparison neighborhoods.

## Learning Networked Dynamical Systems via Neural ODE-based Graph Structure Inference

DevFeed: [Learning Networked Dynamical Systems via Neural ODE-based Graph Structure Inference](<https://devfeed.tech/articles/learning-networked-dynamical-systems-via-neural-ode-based-graph-structure-inference-145544.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25586>)

Author: Peiyan Sun, Jinming Yang, Gujia Gao, Yaohui Jin, Yanyan Xu

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Complex Systems](<https://devfeed.tech/topics/complex-systems.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [biology](<https://devfeed.tech/tags/biology.md>), [complex](<https://devfeed.tech/tags/complex.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [dependencies](<https://devfeed.tech/tags/dependencies.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [graph](<https://devfeed.tech/tags/graph.md>), [inference](<https://devfeed.tech/tags/inference.md>), [interaction](<https://devfeed.tech/tags/interaction.md>), [irregular](<https://devfeed.tech/tags/irregular.md>), [learner](<https://devfeed.tech/tags/learner.md>), [learning](<https://devfeed.tech/tags/learning.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [modules](<https://devfeed.tech/tags/modules.md>), [netsim](<https://devfeed.tech/tags/netsim.md>), [neural](<https://devfeed.tech/tags/neural.md>), [ode](<https://devfeed.tech/tags/ode.md>), [structure](<https://devfeed.tech/tags/structure.md>), [systems](<https://devfeed.tech/tags/systems.md>)

### AI overview

NOGI infers latent interaction graphs from multivariate time series by coupling a deterministic graph learner with an MPNN-based Neural ODE. Its continuous-time formulation integrates learning signals between observations, avoiding dependence on a fixed observation schedule; the modules are trained end to end with the adjoint method. In tests on four simulated systems at two scales, it achieved the best structure recovery in 30 of 32 cases, with competitive forecasting and robustness to degraded observations. On the Netsim fMRI benchmark, it reported average AUPRC 0.90 and AUROC 0.96. These findings support the approach under the evaluated observation conditions.

### Source excerpt

arXiv:2611.25586v1 Announce Type: new Abstract: Inferring the latent interaction graph from multivariate time series is fundamental to understanding complex dynamical systems in neuroscience, biology, and physics. Despite recent progress in neural relational inference, most methods rely on discrete-time modeling, which degrades under sparse and irregular observations and tends to entangle multi-hop dependencies into spurious direct edges. We show that a continuous-time formulation naturally decouples inference from any fixed observation schedule, allowing gradient signals to be integrated continuously between observations for both dynamics and structure learning. We propose NOGI (Neural ODE-based Graph Inference), a framework that couples a deterministic graph learner with an MPNN-based Neural ODE. The two modules are trained end-to-end via the adjoint method. Across four simulated dynamical systems at two scales, NOGI achieves the best structure recovery in 30 out of 32 evaluated cases with highly competitive forecasting performance, remaining robust under observation degradation. On the realistic Netsim fMRI benchmark, it attains an average AUPRC of 0.90 (AUROC 0.96). These results suggest that explicitly decoupling relational interactions from self-dynamics within a continuous-time vector field provides a powerful mechanism for graph structure learning under realistic observation conditions.

## Fast Computation of Lowest Common Ancestor in Version Control Commit Graph

DevFeed: [Fast Computation of Lowest Common Ancestor in Version Control Commit Graph](<https://devfeed.tech/articles/fast-computation-of-lowest-common-ancestor-in-version-control-commit-graph-145782.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25912>)

Author: Stepan Polokhin, Ruslan Savchenko, Yuriy Chernyshov

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [Graphs](<https://devfeed.tech/topics/graphs.md>), [version-control](<https://devfeed.tech/topics/version-control.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [branch](<https://devfeed.tech/tags/branch.md>), [commit](<https://devfeed.tech/tags/commit.md>), [cs-ds](<https://devfeed.tech/tags/cs-ds.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [data-structures-and-algorithms](<https://devfeed.tech/tags/data-structures-and-algorithms.md>), [fast](<https://devfeed.tech/tags/fast.md>), [version-control](<https://devfeed.tech/tags/version-control.md>)

### AI overview

Finding a merge base in a version control commit graph is difficult because the graph is an arbitrary acyclic graph, and searches can traverse millions of commits when no common ancestor exists. The proposed method identifies "supporting branches," preprocesses the graph around them, and uses this structure to accelerate lowest-common-ancestor queries. When removing those branches leaves connected components of bounded size, a query can take time comparable to searching within one component. The stated running time is O(δ_G m_c + n_s log² n_s + m_s log n_s), with O(d) preprocessed data per vertex; the abstract defines these parameters in terms of component size, supporting-branch reachability, and branch adjacency. The supplied text gives no benchmark results.

### Source excerpt

arXiv:2611.25912v1 Announce Type: cross Abstract: The problem of finding the lowest common ancestor in the commit graph arises when a user wants to merge two (or more) development branches: for example, to add their own development into a common branch. At that moment, the version control system must determine the merge base - the common ancestor of the latest commits of the branches, in order to show the mutual difference between the branches. The problem is complicated by the fact that the commit graph is not a tree but an arbitrary acyclic graph. Moreover, if there is no common ancestor, searching for one may require traversing the entire graph. Traversing a graph with several million vertices takes tens of seconds, which becomes noticeable to users. We show that the commit graph has additional structure - supporting branches - and that this can be used to speed up the algorithm. By extracting supporting branches, the graph can be preprocessed and the search for the lowest common ancestor can be significantly accelerated. Moreover, if removing the supporting branches decomposes the graph into connected components of bounded size, the lowest common ancestor query can be answered in time comparable to searching for a common ancestor within a single component only. We present an algorithm running in time $O(\delta_Gm_c + n_s\log^2 n_s + m_s\log n_s)$ and requiring $O(d)$ preprocessed data per vertex, where $\delta_G$ is the maximum out-degree of a vertex in $G$, $n_c$ and $m_c$ are the maximum numbers of vertices and edges in a connected component formed after removing the supporting branches, $n_s$ is the number of supporting branches, $m_s$ is the number of edges in the reachability graph between the supporting branches, and $d$ is the maximum number of supporting branches adjacent to any single component.

## Task-Oriented Network Ranging via Joint Graph and Schedule Design

DevFeed: [Task-Oriented Network Ranging via Joint Graph and Schedule Design](<https://devfeed.tech/articles/task-oriented-network-ranging-via-joint-graph-and-schedule-design-143002.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24702>)

Author: Zijian Zhang, Yuan Shen

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [communications](<https://devfeed.tech/topics/communications.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Network design](<https://devfeed.tech/topics/network-design.md>)

Tags: [connectivity](<https://devfeed.tech/tags/connectivity.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-it](<https://devfeed.tech/tags/cs-it.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [design](<https://devfeed.tech/tags/design.md>), [eess-sp](<https://devfeed.tech/tags/eess-sp.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [graph](<https://devfeed.tech/tags/graph.md>), [localization](<https://devfeed.tech/tags/localization.md>), [math-it](<https://devfeed.tech/tags/math-it.md>), [multiplexing](<https://devfeed.tech/tags/multiplexing.md>), [network](<https://devfeed.tech/tags/network.md>), [schedule](<https://devfeed.tech/tags/schedule.md>), [simulations](<https://devfeed.tech/tags/simulations.md>)

### AI overview

Sparse signal-multiplexing network ranging (S-SM-NR) adapts which node pairs exchange signals and when they transmit or listen to the ranging needed for network localization, avoiding the requirement to measure every pair. The paper jointly designs a sparse task graph and a balanced schedule, analyzes the minimum number of rounds and a connectivity condition, and gives a closed-form design that reaches the minimum round count when physical connectivity is complete. Simulations report fewer occupied rounds and improved localization accuracy through a shorter ranging cycle.

### Source excerpt

arXiv:2611.24702v1 Announce Type: cross Abstract: Measuring inter-node distances is the basis for network localization, whereas acquiring node positions does not require a fully connected graph of distances. Existing complete-ranging protocols for network localization require every node pair to exchange signals, which prolongs the ranging cycle. In this paper, we propose sparse signal-multiplexing network ranging (S-SM-NR), a task-oriented framework that adapts the transmit-listen schedule to the ranging task required by network localization. First, we establish the S-SM-NR framework by formulating the joint design of the task graph and the transmit-listen schedule. Then, we analyze the minimum round count required by S-SM-NR and establish a connectivity condition for network localization. Subsequently, we develop a closed-form joint design that constructs the sparse task graph and the balanced transmit-listen schedule. In particular, the joint design can achieve the minimum round count under the complete physical connectivity. Finally, simulations show that the proposed S-SM-NR scheme reduces the occupied-round count and improves the localization accuracy by shortening the ranging cycle.

## NOTREKS: Marginal Independence in Score-based Structure Learning

DevFeed: [NOTREKS: Marginal Independence in Score-based Structure Learning](<https://devfeed.tech/articles/notreks-marginal-independence-in-score-based-structure-learning-143471.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24015>)

Author: Fabian Bleile, Sarah Lumpp, Mathias Drton

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [causality](<https://devfeed.tech/topics/causality.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [adjustment](<https://devfeed.tech/tags/adjustment.md>), [constraint](<https://devfeed.tech/tags/constraint.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [effect](<https://devfeed.tech/tags/effect.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [independent](<https://devfeed.tech/tags/independent.md>), [information](<https://devfeed.tech/tags/information.md>), [learning](<https://devfeed.tech/tags/learning.md>), [models](<https://devfeed.tech/tags/models.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [optimizing](<https://devfeed.tech/tags/optimizing.md>), [oracle](<https://devfeed.tech/tags/oracle.md>), [order](<https://devfeed.tech/tags/order.md>), [pairs](<https://devfeed.tech/tags/pairs.md>), [power](<https://devfeed.tech/tags/power.md>), [score](<https://devfeed.tech/tags/score.md>), [stat-me](<https://devfeed.tech/tags/stat-me.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [structure](<https://devfeed.tech/tags/structure.md>)

### AI overview

Under faithfulness, known marginal independence between selected variable pairs implies a no-trek constraint on the causal graph. The paper calls this NOTREKS information and incorporates it into score-based structure learning in two ways: a power-series trek (PSTrek) penalty for gradient-based optimization and a trek constraint for order-based search. The authors analyze how the information can help in finite samples and restrict the search space. Synthetic benchmarks using oracle NOTREKS information show improved structural recovery and adjustment-based effect identification; the supplied abstract does not quantify the gains.

### Source excerpt

arXiv:2611.24015v1 Announce Type: cross Abstract: Score-based structure learning estimates causal graphs by optimizing a data-dependent objective over structural equation models. We study how prior knowledge that selected pairs of variables are marginally independent can be incorporated into such causal discovery methods. Under faithfulness, marginally independent pairs cannot be connected by a trek, so the knowledge becomes a graphical no-trek constraint, which we call NOTREKS information. We introduce a power-series trek (PSTrek) penalty for gradient-based optimization and a trek constraint for order-based search, and we analyze why such information helps in finite samples and how it restricts the search space. Our numerical experiments illustrate to what extent NOTREKS information helps in causal discovery. In particular, using synthetic benchmarks with oracle NOTREKS information, we show that these constraints can improve both structural recovery and adjustment-based effect identification.

## Evaluating invariance training with certified answer-changing controls in neural graph algorithms

DevFeed: [Evaluating invariance training with certified answer-changing controls in neural graph algorithms](<https://devfeed.tech/articles/evaluating-invariance-training-with-certified-answer-changing-controls-in-neural-graph-algorithms-142721.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23907>)

Author: Zhe Dong, Fang Qin

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [controls](<https://devfeed.tech/tags/controls.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-algorithms](<https://devfeed.tech/tags/graph-algorithms.md>), [invariance](<https://devfeed.tech/tags/invariance.md>), [neural](<https://devfeed.tech/tags/neural.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

On synthetic minimum-spanning-tree tasks, invariance training reduced a graph transformer's errors on answer-preserving bridge attachments but also weakened its response to answer-changing two-edge attachments. The study certifies both kinds of edits: a one-bridge attachment preserves original labels, while two oracle-selected edges can change a label; lowering an internal edge weight provides another changing control. On 16-vertex graphs, three invariance objectives cut bridge-attachment violations from 2.91% to 0.52-2.02% of pairs with essentially unchanged accuracy, while two-edge response fell from 97.6% to 66.0-79.0%; response to internal weight edits stayed near 99.5%. At 64 vertices, accuracy also declined. A message-passing network showed some loss of attachment response at low penalty weights but little invariance gain. Applying the conventionally trained transformer separately to each biconnected block eliminated observed violations while retaining accuracy and both control responses, suggesting the trade-off was avoidable in this setup. The excerpt recommends testing invariance with certified answer-changing edits that attach material in the same way as training edits.

### Source excerpt

arXiv:2611.23907v1 Announce Type: new Abstract: Invariance training aims to make neural algorithmic reasoners robust to answer-preserving input changes and is judged by accuracy and by how rarely such edits change predictions. We ask whether this evaluation detects lost sensitivity to answer-changing edits on minimum spanning trees of synthetic graphs, where both directions can be certified. Attaching a subgraph through one bridge provably preserves every original label. Attaching it through two edges, oracle-selected to change a label, and lowering one weight inside the graph serve as answer-changing controls; a response is a changed prediction on an edge whose label changes. A reproduced graph transformer (GDT) within its published accuracy range changes a provably fixed label on 53.3-65.9% of the 64-vertex graphs it solves exactly after a 64-vertex bridge attachment; removing the connecting edge changes little. With 16-vertex graphs and attachments, three invariance objectives lower GDT violations from 2.91% to 0.52-2.02% of pairs at essentially unchanged accuracy. Training also lowers the response to two-edge attachments from 97.6% to 66.0-79.0%, while the response to in-base weight edits stays near 99.5%. At 64 vertices accuracy also falls, but on 16-vertex bases only the attachment control reveals the loss. A message-passing network loses some attachment response at small penalty weights but gains little invariance. Running the conventionally trained GDT on each biconnected block separately removes all observed violations and keeps accuracy and both responses, so the task does not force the trade-off. Sensitivity checks for trained invariance should include certified answer-changing edits that attach material as the training edits do.

## TUSI: A Citation-Grounded Graph-Based Benchmark

DevFeed: [TUSI: A Citation-Grounded Graph-Based Benchmark](<https://devfeed.tech/articles/tusi-a-citation-grounded-graph-based-benchmark-139913.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21823>)

Author: Marzieh Karimi, Mehran Safayani, Alireza Basiri

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Retrieval Augmented Generation (RAG)](<https://devfeed.tech/topics/retrieval-augmented-generation-rag.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [graph](<https://devfeed.tech/tags/graph.md>), [grounded](<https://devfeed.tech/tags/grounded.md>), [law](<https://devfeed.tech/tags/law.md>), [legal](<https://devfeed.tech/tags/legal.md>), [rag](<https://devfeed.tech/tags/rag.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>)

### AI overview

TUSI-Bench evaluates retrieval-augmented generation for Persian legal reasoning using a framework of 7,261 legal articles drawn from statutes, commentaries, doctrinal writings, and Supreme Court unification rulings. Its legal knowledge graph links articles and concepts to support structure-aware retrieval. The benchmark includes TUSI-QA, with 1,999 open-ended questions requiring explicit legal citations, and TUSI-Bar, with about 500 four-option questions derived from Iranian Bar exams. A graph-based retrieval baseline improved recall by up to 8 percentage points over standard baselines. The abstract presents the benchmark as addressing gaps in realism, grounding, and legal-reasoning coverage in earlier resources.

### Source excerpt

arXiv:2611.21823v1 Announce Type: cross Abstract: Evaluating retrieval-augmented generation (RAG) systems in Persian law remains challenging because benchmarks lack realism, grounding, and coverage of legal reasoning. Existing resources are either synthetically generated from statutory texts, lacking natural information needs, or derived from informal legal question--answer sources without explicit linkage to authoritative legal documents, making them unsuitable for rigorous evaluation of grounded legal reasoning. To address this gap, we introduce TUSI-Bench, a structured Persian legal benchmark designed for the evaluation of RAG-based systems. TUSI-Bench is built upon a multi-layered legal knowledge framework containing 7,261 legal articles and integrating codified statutes, legal commentaries, doctrinal writings, and Supreme Court unification rulings. We also construct a legal knowledge graph linking articles and concepts for structure-aware retrieval. Based on this foundation, TUSI-Bench provides two complementary evaluation tasks: (i) TUSI-QA, an open-ended question answering benchmark containing 1,999 questions that requires grounded responses with explicit legal citations, and (ii) TUSI-Bar, a multiple-choice benchmark containing approximately 500 four-option questions derived from Iranian Bar examination questions. Furthermore, we propose a graph-based retrieval baseline that leverages relational structure within the legal knowledge graph. Experimental results demonstrate that incorporating graph-based relations improves retrieval recall by up to 8 percentage points compared to standard baselines, highlighting the importance of structured legal representations for RAG systems. The proposed benchmark provides a standardized resource for evaluating grounded legal reasoning in Persian and enables future research on structured legal intelligence.

## Pelorus: Warped-Product Graph Indexing for Hyperbolic Vector Search

DevFeed: [Pelorus: Warped-Product Graph Indexing for Hyperbolic Vector Search](<https://devfeed.tech/articles/pelorus-warped-product-graph-indexing-for-hyperbolic-vector-search-140628.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22159>)

Author: Wenxuan Xiao, Xu Cao

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [ann](<https://devfeed.tech/topics/ann.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [quantization](<https://devfeed.tech/topics/quantization.md>)

Tags: [amd-epyc](<https://devfeed.tech/tags/amd-epyc.md>), [approximate-nearest-neighbor-search](<https://devfeed.tech/tags/approximate-nearest-neighbor-search.md>), [avx2](<https://devfeed.tech/tags/avx2.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [graph](<https://devfeed.tech/tags/graph.md>), [indexing](<https://devfeed.tech/tags/indexing.md>), [memory](<https://devfeed.tech/tags/memory.md>), [recall](<https://devfeed.tech/tags/recall.md>), [reranking](<https://devfeed.tech/tags/reranking.md>), [search](<https://devfeed.tech/tags/search.md>), [throughput](<https://devfeed.tech/tags/throughput.md>), [traversal](<https://devfeed.tech/tags/traversal.md>), [vector](<https://devfeed.tech/tags/vector.md>), [vector-search](<https://devfeed.tech/tags/vector-search.md>)

### AI overview

Pelorus is a hyperbolic vector search graph index designed to reduce navigation memory and traversal cost while retaining geodesic ordering. It stores FP32 radial and conformal scalars separately from 2-bit spherical direction codes, then uses FP64 full-vector evaluation only in a compact reranking tail. Its distortion corrections include orthogonal-projection debiasing, purity-gated tangent-cone residuals, and Conformal Jacobian gating; QuadriPrune distributes edges across geodesic fibers, same-shell rings, and radial elevators. Across eight benchmarks on AMD EPYC 9654, it builds Cohere-1M indices 5.44x faster than full-precision polar graphs using 32 threads, with 517 MB of hot navigation memory. At 99% Recall@10, Cohere-1M throughput is reported as 4.30x higher on one thread and 6.31x higher on 24 threads; MERU-1M reaches 53,483 QPS. Tangent-cone residuals lift recall from 34.22% to 99.385% on clustered narrow shells, but isotropic narrow-shell tests still reveal recall limits.

### Source excerpt

arXiv:2611.22159v1 Announce Type: new Abstract: Hyperbolic embeddings capture hierarchical relations, but million-scale approximate nearest neighbor search must reconcile geodesic fidelity with memory efficiency. Flat inner-product indices distort order across radial shells, while native hyperbolic graphs repeatedly access full-precision vectors or quantize coordinates with singular conformal scales. We present Pelorus, a warped-product proximity-graph index for hyperbolic vector search. Pelorus separates unquantized FP32 radial and conformal scalars from scale-invariant 2-bit spherical directional codes and defers full-vector FP64 evaluation to a compact reranking tail. A conformal distortion analysis motivates orthogonal-projection debiasing, purity-gated tangent-cone residuals, and Conformal Jacobian gating. QuadriPrune allocates edges across geodesic fibers, same-shell rings, and radial elevators, with spanning-tree chord swaps restoring entry reachability. A single-page record layout and carry-save AVX2 kernel accelerate traversal. Across eight real and synthetic benchmarks on AMD EPYC 9654, Pelorus builds Cohere-1M indices 5.44x faster than full-precision polar graphs on 32 threads, reducing hot navigation memory to 517.0 MB. At 99% Recall@10, it improves Cohere-1M throughput by 4.30x on one thread and 6.31x on 24 threads, and delivers 53,483 QPS on MERU-1M. On clustered narrow shells, tangent-cone residuals raise recall from 34.22% to 99.385%, while isotropic narrow-shell stress tests expose remaining recall limits.

## Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning

DevFeed: [Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning](<https://devfeed.tech/articles/graph-cascades-contagion-based-mesoscopic-rewiring-for-structure-aware-graph-machine-learning-141576.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2606.05046>)

Author: Meher Chaitanya, My Le, Luana Ruiz

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Graphs](<https://devfeed.tech/topics/graphs.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [bottlenecks](<https://devfeed.tech/tags/bottlenecks.md>), [classification](<https://devfeed.tech/tags/classification.md>), [connectivity](<https://devfeed.tech/tags/connectivity.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [effective](<https://devfeed.tech/tags/effective.md>), [gnn](<https://devfeed.tech/tags/gnn.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-neural-networks](<https://devfeed.tech/tags/graph-neural-networks.md>), [learning](<https://devfeed.tech/tags/learning.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [regular](<https://devfeed.tech/tags/regular.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [structure](<https://devfeed.tech/tags/structure.md>), [theoretical](<https://devfeed.tech/tags/theoretical.md>), [time](<https://devfeed.tech/tags/time.md>), [transformers](<https://devfeed.tech/tags/transformers.md>)

### AI overview

Graph Cascades rewires graphs by using contagion-based diffusion to identify node pairs reinforced across multiple hops, then adds those pairs as neighbors in a sparse auxiliary graph. The method runs in O(|V|+|E|) time with fixed cascade parameters, aiming to capture mesoscopic structure between local edges and global attention. The authors provide theoretical conditions for when reinforcement may improve label alignment, including a stochastic block model case where two-hop reinforcement is perfectly homophilic, and connect mesoscopic connectivity to effective resistance. Across node-classification benchmarks, they report improvements for multiple GNN and sparse Graph Transformer backbones, most reliably on heterophilic and moderate- to high-degree homophilic graphs. Gains are less likely on low-degree regular graphs and graphs with structural bottlenecks, where observed results matched the theory's predicted failures.

### Source excerpt

arXiv:2606.05046v2 Announce Type: replace Abstract: We introduce Graph Cascades, a mesoscopic rewiring strategy for Graph Neural Networks (GNNs) and Graph Transformers (GTs) that captures intermediate-scale graph structure beyond purely local edges or fully global attention. Using contagion-based diffusion with fixed cascade parameters, Graph Cascades constructs, in O(|V|+|E|) time, a sparse auxiliary graph where node pairs supported by repeated multi-hop reinforcement are promoted to direct neighbors. We theoretically characterize when reinforcement-based rewiring helps: sufficient conditions under which reinforcement-based edge selection is more label-aligned than direct adjacency, a stochastic block model (SBM) witness in which two-hop reinforcement is perfectly homophilic, and a formalization of mesoscopic connectivity via graph effective resistance. Empirically, across node-classification benchmarks, Graph Cascades improves multiple GNN and sparse-GT backbones, with the most reliable gains observed on heterophilic and moderate- to high-degree homophilic graphs. The theoretical conditions also identify regimes where mesoscopic rewiring is unlikely to be beneficial---low-degree regular graphs and graphs with structural bottlenecks---and these predictions match the observed failures. We additionally observe tight correlations between performance and structural properties in the rewired graphs, suggesting that rewired graphs carry predictive signals.

## JointGV: Structure-Aware Correction of Visual World Models with Parallel Graph Dynamics for Long-Horizon Modeling

DevFeed: [JointGV: Structure-Aware Correction of Visual World Models with Parallel Graph Dynamics for Long-Horizon Modeling](<https://devfeed.tech/articles/jointgv-structure-aware-correction-of-visual-world-models-with-parallel-graph-dynamics-for-long-horizon-modeling-140048.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22543>)

Author: Tian Lyu, Yichen Jiang, Ziyuan Cheng, Yunda Yan, Xiangyu Pan, Junjie Jiang, Jialin Yu, Boyu Ning, Pietro Li\\\`o, Fan Mo

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [World models](<https://devfeed.tech/topics/world-models.md>), [Robot Manipulation](<https://devfeed.tech/topics/robot-manipulation.md>), [contact-rich manipulation](<https://devfeed.tech/topics/contact-rich-manipulation.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [actions](<https://devfeed.tech/tags/actions.md>), [actor](<https://devfeed.tech/tags/actor.md>), [contact-rich-manipulation](<https://devfeed.tech/tags/contact-rich-manipulation.md>), [control](<https://devfeed.tech/tags/control.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-ro](<https://devfeed.tech/tags/cs-ro.md>), [graph](<https://devfeed.tech/tags/graph.md>), [horizon](<https://devfeed.tech/tags/horizon.md>), [structure](<https://devfeed.tech/tags/structure.md>), [world-models](<https://devfeed.tech/tags/world-models.md>)

### AI overview

JointGV is a plug-in that uses a task-conditioned scene graph to correct long-horizon drift in visual world models without sending graph-learning or correction gradients into the original visual dynamics. It rolls out graph and visual predictions in parallel, couples their predicted changes, and uses graph-motion context and predicted node positions to compute a bounded correction. On DINO-WM and DreamerV3, 32-step evaluations report 11-28% lower joint-position error. For DINO-WM spatial tokens, learned graph-visual change coupling outperforms giving every token the same mean graph-motion context, especially when distinct parts look close together. On real-robot inverted-pendulum sequences, DINO-WM's pole-angle error falls from 12.56° to 6.69°; DreamerV3 and LeWorldModel also improve. In simulated pendulum control, an actor using corrected rollouts completes 46 of 50 episodes, versus none with original rollouts. The supplied excerpt does not provide further methodological or evaluation details.

### Source excerpt

arXiv:2611.22543v1 Announce Type: cross Abstract: Visual world models predict future visual states conditioned on actions, but recursive errors in entity poses and spatial relations limit their long-horizon prediction for robot planning and control. We ask whether a separately predicted relational state can correct this drift without restructuring the visual model. This is challenging because graph nodes and visual states share neither elements nor a feature space. We propose Joint Graph--Visual Dynamics Correction (JointGV), a plug-in based on a cross-granularity dynamics hypothesis: despite their different representations, graph-node and visual-state changes describe the same physical transition. JointGV rolls out a task-conditioned scene graph alongside the visual world model, couples their predicted changes, and combines the resulting graph-motion context with graph-predicted node positions to compute a bounded residual. Graph-learning and correction gradients do not propagate into the original visual dynamics. We attach JointGV to DINO-WM (spatial tokens) and DreamerV3 (a global latent state), evaluating both on DMC Cheetah Run and Walker Walk across three seeds and extending the evaluation to contact-rich manipulation with DMC Finger Turn Hard. Across 32-step rollouts, JointGV improves structural and visual-prediction accuracy, reducing joint-position error by 11--28\%. For spatial tokens, learned graph--visual change coupling gives lower error than broadcasting the same mean graph-motion context to every token, particularly when non-adjacent parts appear close together in the image. On real-robot inverted-pendulum sequences, JointGV reduces DINO-WM's 32-step pole-angle error from $12.56^\circ$ to $6.69^\circ$ and improves DreamerV3 and LeWorldModel as well. In simulated inverted-pendulum control, an actor trained with JointGV-corrected rollouts completes 46 of 50 episodes, compared with none using the original rollouts.

## HorizANN: Elastically Scaling Vector Search with Ghost Edges

DevFeed: [HorizANN: Elastically Scaling Vector Search with Ghost Edges](<https://devfeed.tech/articles/horizann-elastically-scaling-vector-search-with-ghost-edges-138291.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19077>)

Author: Talika Gupta, Yunqi Li, Aditya Kunte, Claire Lin, Supawit Chockchowwat, Daniel Waddington, Hubertus Franke, Yongjoo Park

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [ann](<https://devfeed.tech/topics/ann.md>), [Deployment & Scaling](<https://devfeed.tech/topics/deployment-scaling.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-applications](<https://devfeed.tech/tags/ai-applications.md>), [approximate-nearest-neighbor](<https://devfeed.tech/tags/approximate-nearest-neighbor.md>), [approximate-nearest-neighbor-search](<https://devfeed.tech/tags/approximate-nearest-neighbor-search.md>), [connectivity](<https://devfeed.tech/tags/connectivity.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [graph](<https://devfeed.tech/tags/graph.md>), [index](<https://devfeed.tech/tags/index.md>), [indexes](<https://devfeed.tech/tags/indexes.md>), [indexing](<https://devfeed.tech/tags/indexing.md>), [nearest-neighbor](<https://devfeed.tech/tags/nearest-neighbor.md>), [partition](<https://devfeed.tech/tags/partition.md>), [partitioning](<https://devfeed.tech/tags/partitioning.md>), [queries](<https://devfeed.tech/tags/queries.md>), [recall](<https://devfeed.tech/tags/recall.md>), [scaling](<https://devfeed.tech/tags/scaling.md>), [search](<https://devfeed.tech/tags/search.md>), [throughput](<https://devfeed.tech/tags/throughput.md>), [vector](<https://devfeed.tech/tags/vector.md>), [vector-search](<https://devfeed.tech/tags/vector-search.md>)

### AI overview

HorizANN scales distributed graph-based approximate nearest neighbor search without rebuilding the full index when machines are added or removed. Its "ghost edges" preserve cross-partition connectivity during repartitioning by reusing structural information that would otherwise be discarded. The abstract reports growth from 100 million vectors on one worker to 1 billion on ten workers, inserting each additional 100 million within 2.5 hours while sustaining 3.4-3.5K queries per second at 0.998 Recall@10.

### Source excerpt

arXiv:2611.19077v1 Announce Type: new Abstract: Approximate nearest neighbor search (ANNS) is fundamental to modern data-intensive AI applications such as retrieval-augmented generation, recommendation systems, and semantic search. Among existing indexing methods, graph-based indexes emerge as the state of the art due to their superior recall-throughput tradeoffs. Scaling these indexes to multiple machines requires partitioning the data and building indexes on each. However, when new machines are added or removed, the data must be repartitioned and the indexes reconstructed from scratch, making horizontal scaling costly at billion scale. In this work, we present HorizANN, a distributed graph-based ANNS system that scales horizontally without requiring full index reconstruction. To achieve this, we introduce ghost edges, a mechanism for preserving cross-partition connectivity as partition boundaries change during repartitioning. By reusing the structural information that would otherwise be discarded during repartitioning, HorizANN avoids costly full index reconstruction. As the index grows from 100M vectors on one worker to 1B vectors on ten workers, HorizANN inserts each 100M vectors within 2.5 hours and sustains 3.4--3.5K queries per second at 0.998 Recall@10.

## Markov-Equivalent Conditional Independence Graphs on Path Spaces

DevFeed: [Markov-Equivalent Conditional Independence Graphs on Path Spaces](<https://devfeed.tech/articles/markov-equivalent-conditional-independence-graphs-on-path-spaces-139104.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20877>)

Author: Simon Kempf, Niki Kilbertus, Georg Manten

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [about](<https://devfeed.tech/tags/about.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [added](<https://devfeed.tech/tags/added.md>), [addition](<https://devfeed.tech/tags/addition.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [allows](<https://devfeed.tech/tags/allows.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [but](<https://devfeed.tech/tags/but.md>), [can](<https://devfeed.tech/tags/can.md>), [canonical](<https://devfeed.tech/tags/canonical.md>), [central](<https://devfeed.tech/tags/central.md>), [characterization](<https://devfeed.tech/tags/characterization.md>), [class](<https://devfeed.tech/tags/class.md>), [classes](<https://devfeed.tech/tags/classes.md>), [components](<https://devfeed.tech/tags/components.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [markov](<https://devfeed.tech/tags/markov.md>), [spaces](<https://devfeed.tech/tags/spaces.md>)

### AI overview

The paper introduces W-separation, an asymmetric criterion for directed mixed graphs that conditions separately on past and future components. For a broad class of stochastic differential equations with latent confounding, it satisfies a global Markov property, connecting graph relations to conditional independences among coordinate processes that are testable from data. The paper also characterizes W-Markov equivalence classes: each has a unique greatest graph as a canonical representative and potential learning target. It gives necessary and sufficient conditions for adding directed or bidirected edges without changing the implied independence model.

### Source excerpt

arXiv:2611.20877v1 Announce Type: new Abstract: Causal discovery for continuous-time stochastic processes with latent confounding typically faces a trade-off between (i) approaches that are highly informative about the causal structure but are difficult to test statistically, and (ii) approaches that admit practical tests from data but yield more coarse-grained conclusions, potentially not leveraging the direction of time. We introduce W-separation, an asymmetric graphical criterion for directed mixed graphs defined as a quaternary relation that allows distinct conditioning on past and future components. This added flexibility yields a highly informative graphical independence model while preserving testability. W-separation satisfies a global Markov property for a broad class of stochastic differential equations with latent confounding, linking it to conditional independence relations among coordinate processes that are testable from data. A central result of this work is the full characterization of W-Markov equivalence classes: we show that every equivalence class admits a unique greatest element that serves as a canonical representative and a principled target for learning algorithms. In addition, we provide necessary and sufficient conditions under which directed or bidirected edges can be added without altering the induced independence model.

## Beyond Similarity: Heterogeneous Graph Learning for Multi-Objective Food Substitution in Charitable Food Agencies

DevFeed: [Beyond Similarity: Heterogeneous Graph Learning for Multi-Objective Food Substitution in Charitable Food Agencies](<https://devfeed.tech/articles/beyond-similarity-heterogeneous-graph-learning-for-multi-objective-food-substitution-in-charitable-food-agencies-137274.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.21979>)

Author: Naimur Rahman Chowdhury, Limon Bin Hossain

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [affinity](<https://devfeed.tech/tags/affinity.md>), [behavior](<https://devfeed.tech/tags/behavior.md>), [cold-start](<https://devfeed.tech/tags/cold-start.md>), [correlation](<https://devfeed.tech/tags/correlation.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [data](<https://devfeed.tech/tags/data.md>), [decision](<https://devfeed.tech/tags/decision.md>), [features](<https://devfeed.tech/tags/features.md>), [food](<https://devfeed.tech/tags/food.md>), [framework](<https://devfeed.tech/tags/framework.md>), [graph](<https://devfeed.tech/tags/graph.md>), [health](<https://devfeed.tech/tags/health.md>), [learning](<https://devfeed.tech/tags/learning.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [network](<https://devfeed.tech/tags/network.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [node](<https://devfeed.tech/tags/node.md>), [objectives](<https://devfeed.tech/tags/objectives.md>), [ranking](<https://devfeed.tech/tags/ranking.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [robust](<https://devfeed.tech/tags/robust.md>)

### AI overview

The proposed HeteroGNN ranks food substitutes for charitable food agencies across three separate objectives: household behavior affinity, health suitability, and item similarity. It builds a unified relational graph from large-scale U.S. public data on food consumption behavior and nutrients, addressing agencies' limited direct consumption records. In tests that remove graph relationships to simulate standard and adverse cold-start settings, the model uses relational information beyond node features to predict consumption and remains robust when behavior or nutrient information is sparse. The objectives are weakly correlated, supporting separate rankings instead of one aggregated score. The authors present the framework as support for agency decision-makers making context-specific recommendations with limited information.

### Source excerpt

arXiv:2608.21979v2 Announce Type: replace Abstract: Charitable food agencies play an important role in alleviating food insecurity by distributing donated food to people in need. However, they rely on ad hoc in-kind donations and often face shortages of specific foods, so they offer substitutes. A good food substitution requires matching household preferences, nutritional needs, and item similarity. Agencies have limited direct records of consumption behavior due to resource constraints, making it challenging to make an appropriate substitution decision that meets multiple criteria. In this study, we propose a heterogeneous graph neural network (HeteroGNN), a source-grounded recommendation framework for food substitution in charitable food agencies. We first build a unified relational graph from large-scale public data sources, combining household behavior on food consumption and food nutrient information in the United States (US) context. We treat the substitution recommendation as a multi-objective ranking problem with three targets, including behavior affinity, health suitability, and substitution similarity. We train and validate the proposed framework under standard graph relationship and adverse cold-start settings by removing relational edges from the graph. Our results show that the proposed framework leverages relational information beyond node features in predicting consumption behavior. Additionally, the proposed framework remains robust with sparsity when the model receives incomplete information about behavior and nutrient features. Finally, we show the weak correlation among different objectives, thereby justifying the multi-objective framing as a replacement for an aggregated decision. The proposed framework can help downstream charitable agency decision-makers make contextspecific substitution recommendations with limited information available.

## Externalized CPDAG Summaries Improve LLM Causal Deduction

DevFeed: [Externalized CPDAG Summaries Improve LLM Causal Deduction](<https://devfeed.tech/articles/externalized-cpdag-summaries-improve-llm-causal-deduction-137283.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.31071>)

Author: Wentao Sun, Jo\\~ao Paulo Nogueira, Dominique Verchere, Mathieu Acher, Alonso Silva

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Structured-data](<https://devfeed.tech/topics/structured-data.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [llms](<https://devfeed.tech/tags/llms.md>), [structured](<https://devfeed.tech/tags/structured.md>), [summary](<https://devfeed.tech/tags/summary.md>)

### AI overview

On the Corr2Cause benchmark, a two-turn "Structured Thinking" method improves Qwen3.5-27B's mean F1 from 77.5 to 86.5 across three seeds: the model first records a CPDAG in a constrained schema, then checks the causal claim against it. A second turn of free-text analysis performs worse than the baseline with explicit PC-algorithm instructions. The reported gain also holds with renamed variables, paraphrased hypotheses, and other models. Tests suggest most remaining errors on a fixed subset come from constructing the graph, while reliable deduction depends on the intermediate CPDAG being trustworthy.

### Source excerpt

arXiv:2609.31071v2 Announce Type: replace Abstract: Observational data rarely identify a single causal structure. Such structures are typically modeled as directed acyclic graphs (DAGs) whose arrows point from direct causes to their effects, and observed correlations and conditional independencies usually leave a whole family of DAGs that fit the data equally well. A causal claim follows from the data only if it holds in every one of them. Classical causal discovery methods such as the Peter--Clark (PC) algorithm summarize this family as a completed partially directed acyclic graph (CPDAG): an edge is directed when every compatible graph orients it the same way, and undirected when the data leave its direction open. On the Corr2Cause benchmark, large language models (LLMs) that reason in free text often lose track of this family and decide from a few local edges. We propose \emph{Structured Thinking}, a two-turn method in which the model first summarizes the CPDAG in a constrained schema and then checks the claim against that summary. Without fine-tuning or an external solver, it raises Qwen3.5-27B from $77.5$ to $86.5$ F$_1$ (mean of three seeds) over a baseline that receives explicit PC-algorithm instructions, whereas a second turn of free-text analysis does worse than that baseline. The gain holds on test splits with renamed variables or paraphrased hypotheses and on other models. Given only the graph and the claim, the model's answer flips when the graph is replaced by a valid CPDAG under which the claim has the opposite truth value. Moreover, replacing the model's graphs with reference CPDAGs on a fixed subset shows that most remaining errors arise in building the graph rather than in reading it. Making causal structure explicit can help LLMs reason more reliably, provided the intermediate representation is itself trustworthy.

## Physiology-Aware Graph Attention for Early Ventricular Reentry Prediction

DevFeed: [Physiology-Aware Graph Attention for Early Ventricular Reentry Prediction](<https://devfeed.tech/articles/physiology-aware-graph-attention-for-early-ventricular-reentry-prediction-137296.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.26430>)

Author: Ma{\\"e}lis Morier (EPIONE), Jairo Rodr{\\'i}guez Padilla (IHU-LIRYC), Mihaela Pop (ISIR, MLIA), Patrick Gallinari (ISIR, MLIA), Maxime Sermesant (EPIONE)

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Graphs](<https://devfeed.tech/topics/graphs.md>), [Mercury](<https://devfeed.tech/topics/mercury-lang.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Transformer](<https://devfeed.tech/topics/transformer.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [amplitude](<https://devfeed.tech/tags/amplitude.md>), [attention](<https://devfeed.tech/tags/attention.md>), [border](<https://devfeed.tech/tags/border.md>), [classifier](<https://devfeed.tech/tags/classifier.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [edge](<https://devfeed.tech/tags/edge.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [fast](<https://devfeed.tech/tags/fast.md>), [focus](<https://devfeed.tech/tags/focus.md>), [graph](<https://devfeed.tech/tags/graph.md>), [imaging](<https://devfeed.tech/tags/imaging.md>), [independent](<https://devfeed.tech/tags/independent.md>), [induction](<https://devfeed.tech/tags/induction.md>), [inspection](<https://devfeed.tech/tags/inspection.md>), [location](<https://devfeed.tech/tags/location.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [results](<https://devfeed.tech/tags/results.md>), [risk](<https://devfeed.tech/tags/risk.md>), [roc-auc](<https://devfeed.tech/tags/roc-auc.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

A graph attention classifier predicts sustained ventricular reentry from only the first two paced activations in simulated cardiac electrophysiology, before reentry is observed. Each simulation is represented with early nodal voltage samples and edge attributes for geometry, stimulation frequency, tissue labels, amplitude, and diastolic interval. On a balanced independent test set of 1,000 simulations, it achieved 94.6% accuracy, 95.4% sensitivity, 93.8% specificity, 0.987 ROC-AUC, and 0.985 PR-AUC. Ablations identified diastolic interval as the most critical descriptor; qualitative inspection suggested attention heads focus on the border zone, stimulation location, and early propagation path. The results support faster screening in large-scale in silico studies, though the supplied excerpt reports simulation performance rather than clinical validation.

### Source excerpt

arXiv:2610.26430v2 Announce Type: replace Abstract: Sudden cardiac death mostly originates from post-infarct ventricular tachycardia. This reentry is sustained by propagation around scar tissue, but its risk remains difficult to predict from infarct imaging alone. While in silico induction studies can reveal these mechanisms, exploring many substrates and pacing locations remains computationally expensive. We propose a graph attention classifier for early prediction of sustained ventricular reentry from simulated cardiac electrophysiology. Each simulation is represented as a graph with early nodal voltage samples and edge attributes encoding geometry, stimulation frequency, tissue labels, amplitude, and diastolic interval. These descriptors are computed only from the first two paced activations, before sustained reentry is observed. On a balanced independent test set of 1000 simulations, the classifier achieves 94.6% accuracy, 95.4% sensitivity, 93.8% specificity, 94.6% F1-score, 0.987 ROC-AUC, and 0.985 PR-AUC. Ablation experiments show that diastolic interval is the most critical descriptor. Qualitative attention inspection suggests that different heads focus on border-zone, stimulation location, and early propagation path. These results support graph attention as a fast early-prediction approach for large-scale in silico ventricular reentry studies.

## Minimum cores in lattice graphs: zonotope structure and quartic growth

DevFeed: [Minimum cores in lattice graphs: zonotope structure and quartic growth](<https://devfeed.tech/articles/minimum-cores-in-lattice-graphs-zonotope-structure-and-quartic-growth-137310.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18633>)

Author: Navid Mehrdad

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [certificates](<https://devfeed.tech/tags/certificates.md>), [condition](<https://devfeed.tech/tags/condition.md>), [constraint](<https://devfeed.tech/tags/constraint.md>), [convex](<https://devfeed.tech/tags/convex.md>), [core](<https://devfeed.tech/tags/core.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-si](<https://devfeed.tech/tags/cs-si.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [growth](<https://devfeed.tech/tags/growth.md>), [lattice](<https://devfeed.tech/tags/lattice.md>), [math-co](<https://devfeed.tech/tags/math-co.md>), [neighbours](<https://devfeed.tech/tags/neighbours.md>), [packing](<https://devfeed.tech/tags/packing.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [structure](<https://devfeed.tech/tags/structure.md>), [translation](<https://devfeed.tech/tags/translation.md>), [vertex](<https://devfeed.tech/tags/vertex.md>)

### AI overview

For the graph on integer lattice points joined when their sup-norm distance is at most n, every finite core has a convex hull constrained by an explicit lattice zonotope. In the plane, the zonotope's width grows as 6ζ(3)n³/π²; its lattice points form a core, and a shell construction plus packing bounds establish minimum core size Θ(n⁴) and coordinate widths Θ(n³). The paper determines minima 12 and 96 for n=1 and n=2, with uniqueness up to translation, and gives certificates for further minima restricted to the prescribed zonotope hull, distinguishing these from global optimality. It also proves NP-completeness on general finite graphs by reduction from Clique.

### Source excerpt

arXiv:2611.18633v1 Announce Type: cross Abstract: A core of a graph is a nonempty vertex set in which every member has at least as many neighbours inside the set as outside. We study the minimum size $c_{m,n}$ of a finite core in the graph on $\Z^m$ joining points at sup-norm distance at most $n$. The local majority condition imposes a global geometric constraint: the convex hull of every core has an explicit lattice zonotope $H_n^{(m)}$ as a Minkowski summand. In the plane, this zonotope has width asymptotic to $6\zeta(3)n^3/\pi^2$. We prove that all its lattice points form a core and construct a shell with $O(n^4)$ points. Together with a packing argument, this gives $c_{2,n}=\Theta(n^4)$ and coordinate widths $\Theta(n^3)$ for every minimum core. We determine $c_{2,1}=12$ and $c_{2,2}=96$ by analytic arguments and prove uniqueness up to translation in both cases. Explicit forced-set and deficit certificates determine further minima within the prescribed zonotope hull. We distinguish these restricted results from global optimality and state the remaining geometric conjectures. We also give a direct reduction from \textsc{Clique} showing that the core problem is NP-complete on general finite graphs, which settles a conjecture of Hassanpour in the terms in which it was posed.

## Improving fine-grained expressivity of graph neural networks

DevFeed: [Improving fine-grained expressivity of graph neural networks](<https://devfeed.tech/articles/improving-fine-grained-expressivity-of-graph-neural-networks-137526.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20020>)

Author: Yonatan Sverdlov

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [model architecture](<https://devfeed.tech/topics/model-architecture.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-neural-networks](<https://devfeed.tech/tags/graph-neural-networks.md>), [message](<https://devfeed.tech/tags/message.md>), [metric](<https://devfeed.tech/tags/metric.md>), [neural-networks](<https://devfeed.tech/tags/neural-networks.md>), [performance](<https://devfeed.tech/tags/performance.md>), [range](<https://devfeed.tech/tags/range.md>), [set](<https://devfeed.tech/tags/set.md>), [structured-data](<https://devfeed.tech/tags/structured-data.md>), [symmetry](<https://devfeed.tech/tags/symmetry.md>), [theory](<https://devfeed.tech/tags/theory.md>)

### AI overview

The thesis presents four contributions to expressive, symmetry-aware neural networks for structured data: it characterizes generic expressivity for geometric message-passing networks on sparse graphs and introduces EGenNet to achieve those guarantees; uses representation theory to characterize linear layers equivariant to multiple permutations, including wreath-product symmetries; establishes dimensional bounds and impossibility results for permutation-invariant set representations that preserve containment, and introduces MASNet; and proposes FSW-GNN, combining expressivity and bi-Lipschitz stability guarantees with reported strong performance on long-range graph-learning tasks.

### Source excerpt

arXiv:2611.20020v1 Announce Type: cross Abstract: This thesis investigates the expressive power of neural networks for structured data, focusing on graph neural networks and symmetry-aware architectures. We present four main contributions. First, we characterize the generic expressive power of geometric message-passing neural networks on sparse graphs and introduce EGenNet, an architecture achieving the corresponding guarantees. Second, we use representation theory to characterize linear layers equivariant to multiple permutations, including wreath-product symmetries. Third, we study permutation-invariant set representations that preserve containment, establish dimensional bounds and impossibility results, and introduce MASNet. Finally, we propose FSW-GNN, a message-passing architecture combining strong expressivity and bi-Lipschitz stability guarantees with strong empirical performance on long-range graph-learning tasks. Together, these results provide a broader understanding of how neural architectures can preserve the geometric, algebraic, order-theoretic, and metric structure of their inputs.

## Learning Graph-Conditioned Predictors in Weight Space

DevFeed: [Learning Graph-Conditioned Predictors in Weight Space](<https://devfeed.tech/articles/learning-graph-conditioned-predictors-in-weight-space-138847.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19250>)

Author: Zhewei Chen, Hao Zhu, Ahad N. Zehmakan

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [model architecture](<https://devfeed.tech/topics/model-architecture.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [lora](<https://devfeed.tech/topics/lora.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [classification](<https://devfeed.tech/tags/classification.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distillation](<https://devfeed.tech/tags/distillation.md>), [generator](<https://devfeed.tech/tags/generator.md>), [global](<https://devfeed.tech/tags/global.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [inference](<https://devfeed.tech/tags/inference.md>), [learning](<https://devfeed.tech/tags/learning.md>), [matrix](<https://devfeed.tech/tags/matrix.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [message](<https://devfeed.tech/tags/message.md>), [models](<https://devfeed.tech/tags/models.md>), [node](<https://devfeed.tech/tags/node.md>), [nodes](<https://devfeed.tech/tags/nodes.md>), [structure](<https://devfeed.tech/tags/structure.md>), [weight](<https://devfeed.tech/tags/weight.md>)

### AI overview

SCOPE adapts how node attributes are processed to each node's structural context. A small generator maps cached structural fingerprints to coefficients over a shared low-rank basis, yielding context-specific updates to a global weight matrix while the predictor, basis, and generator remain shared. After fingerprints are cached, inference needs only a forward pass and no online message passing. On two large OGB node-classification graphs, conditioning weights with raw positional signals yielded clear gains over concatenating those same signals to the inputs. Results with structure-transductive held-out nodes and teacher-free graph classification suggest the mechanism extends beyond one distillation setting.

### Source excerpt

arXiv:2611.19250v1 Announce Type: new Abstract: The same node attributes can imply different labels in different structural contexts. Yet fast graphless models typically treat topology as additional evidence supplied to a globally shared predictor. This assumes that structure augments the available information, rather than determining how node attributes should be interpreted. We introduce SCOPE (Structure-COnditioned PrEdictor), in which a small generator maps each node's cached structural fingerprint to coefficients over a shared low-rank basis, producing a context-specific update to a global weight matrix. The base predictor, basis, and generator remain shared across all nodes, while the resulting transformation adapts how attributes are processed in each relational environment. Once fingerprints are cached, inference requires only a forward pass and no online message passing. This design combines context-specific specialization with global parameter sharing, compact low-rank adaptation, and message-passing-free inference. On two large OGB node-classification graphs, conditioning the weights with raw positional signals yields clear gains over supplying the same signals through input concatenation. Further results under a structure-transductive held-out-node protocol and in teacher-free graph classification show that the mechanism extends beyond a particular distillation setting. These findings establish graph structure not only as predictive evidence, but as context that determines the predictor used to interpret that evidence.

## Diagnosis as Percolation on an Evidence Graph: Root-Cause Recoverability in Network Fault Diagnosis

DevFeed: [Diagnosis as Percolation on an Evidence Graph: Root-Cause Recoverability in Network Fault Diagnosis](<https://devfeed.tech/articles/diagnosis-as-percolation-on-an-evidence-graph-root-cause-recoverability-in-network-fault-diagnosis-137028.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19584>)

Author: Jerome Henry, Swadhin Pradhan, Amine Choukir

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Wi-Fi](<https://devfeed.tech/topics/wi-fi.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [after](<https://devfeed.tech/tags/after.md>), [alarm](<https://devfeed.tech/tags/alarm.md>), [alternatives](<https://devfeed.tech/tags/alternatives.md>), [analyze](<https://devfeed.tech/tags/analyze.md>), [apply](<https://devfeed.tech/tags/apply.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [association](<https://devfeed.tech/tags/association.md>), [availability](<https://devfeed.tech/tags/availability.md>), [better](<https://devfeed.tech/tags/better.md>), [but](<https://devfeed.tech/tags/but.md>), [can](<https://devfeed.tech/tags/can.md>), [capture](<https://devfeed.tech/tags/capture.md>), [cause](<https://devfeed.tech/tags/cause.md>), [challenges](<https://devfeed.tech/tags/challenges.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [diagnosis](<https://devfeed.tech/tags/diagnosis.md>), [graph](<https://devfeed.tech/tags/graph.md>), [network](<https://devfeed.tech/tags/network.md>), [percolation](<https://devfeed.tech/tags/percolation.md>), [root](<https://devfeed.tech/tags/root.md>)

### AI overview

The evidence-graph framework separates whether evidence links a possible cause to a symptom, whether that cause can be distinguished from alternatives, and whether the resulting diagnosis is trustworthy. In simulations with average degree four, a giant component appears at about 25% evidence retention, while a particular cause-alarm pair reaches 50% connectivity only above half retention. For multi-LLM diagnosis of IEEE 802.11 packet captures, a reconciliation pass raises evidence-grounding weighted F1 from 0.912 to 0.964, mainly by removing isolated citations. Connectivity alone does not reliably indicate diagnostic quality after statistical controls; directed and weighted edges help in some cases, while simpler overlap measures or domain-specific methods sometimes do better. The supplied text is an abstract, so it does not provide full methodological detail.

### Source excerpt

arXiv:2611.19584v1 Announce Type: new Abstract: Diagnosing failures from incomplete observations presents three challenges: determining whether sufficient evidence connects a possible cause to a symptom, distinguishing the true cause from plausible alternatives, and assessing when a diagnosis can be trusted. We introduce an evidence-graph framework that separates these challenges and uses percolation theory to analyze how missing information affects cause-symptom connectivity. In controlled simulations with an average degree of four, a giant connected component emerges when approximately 25% of evidence is retained, but a specific cause-alarm pair reaches 50% connectivity only after slightly more than half is retained. Even connectivity does not guarantee correct cause identification. We apply this framework to multi-LLM diagnosis of IEEE 802.11 packet captures. A final reconciliation pass improves evidence-grounding weighted F1 from 0.912 to 0.964, primarily by removing isolated citations rather than connecting previously separate evidence chains, consistently across three graph constructions. However, connectivity is not a reliable confidence measure: its association with diagnostic quality becomes statistically insignificant after controlling for capture length, citation count, within-capture dependence, and multiple comparisons. Further experiments show that directed and weighted edges help selectively, while simpler overlap measures or domain-specific methods sometimes perform better. These findings establish evidence graphs as a framework for separating evidence availability, causal distinguishability, and confidence reliability, while demonstrating that connected evidence alone cannot certify diagnostic correctness.

## ST-GAT: A Leakage-Free Spatio-Temporal Graph Attention Framework for Robust Network Intrusion Detection

DevFeed: [ST-GAT: A Leakage-Free Spatio-Temporal Graph Attention Framework for Robust Network Intrusion Detection](<https://devfeed.tech/articles/st-gat-a-leakage-free-spatio-temporal-graph-attention-framework-for-robust-network-intrusion-detection-137394.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19109>)

Author: Nikhil Parkar, Sanskar Pandey, Siddhi Prajapati, Suganeshwari G, Syed Ibrahim

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Endpoint Security & XDR](<https://devfeed.tech/topics/endpoint-security-xdr.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [few-shot](<https://devfeed.tech/topics/few-shot.md>)

Tags: [attention](<https://devfeed.tech/tags/attention.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [detection](<https://devfeed.tech/tags/detection.md>), [framework](<https://devfeed.tech/tags/framework.md>), [graph](<https://devfeed.tech/tags/graph.md>), [intrusion-detection](<https://devfeed.tech/tags/intrusion-detection.md>), [network](<https://devfeed.tech/tags/network.md>), [network-intrusion](<https://devfeed.tech/tags/network-intrusion.md>), [robust](<https://devfeed.tech/tags/robust.md>), [temporal](<https://devfeed.tech/tags/temporal.md>)

### AI overview

ST-GAT represents network traffic as graph snapshots, using k-NN edges and multi-head graph attention for spatial aggregation, then a BiLSTM with temporal attention to model sequences. Its evaluation addresses two leakage risks by using non-overlapping temporal windows and fitting preprocessing only on the training split. Across three random seeds, inverse class-frequency weighting achieved 96.65% Macro-F1 (±0.87) and 99.14% accuracy, with Macro-F1 14.3 points above the per-flow Random Forest baseline. Dynamic balanced sampling scored 94.37% Macro-F1, 2.3 points below weighting; the authors suggest aggressive resampling may hurt on small, noisy minority classes. The abstract also names few-shot metric prototyping as a compared strategy but gives no result for it.

### Source excerpt

arXiv:2611.19109v1 Announce Type: cross Abstract: Intrusion detection systems are a central defence in modern networks. Deep learning models report strong anomaly-detection results, but evaluations on standard benchmarks such as CSE-CIC-IDS-2018 are often inflated by two methodological problems: temporal leakage from overlapping sliding windows, and contamination from preprocessing fitted before the train/test split. Per-flow classifiers also ignore the spatio-temporal dependencies across sequences of network flows. We propose a Spatio-Temporal Graph Attention Network (ST-GAT) that represents traffic as a sequence of graph snapshots. It builds k-Nearest Neighbour (k-NN) edges within each window, applies multi-head Graph Attention Network (GAT) layers for spatial aggregation, and uses a Bidirectional Long Short-Term Memory (BiLSTM) network with temporal attention for sequence modelling. To prevent leakage, we use non-overlapping temporal windows (stride equal to window length) and fit all preprocessing on the training split only. We compare three class-imbalance strategies: inverse class-frequency weighting, dynamic balanced sampling, and few-shot metric prototyping. Across three random seeds, ST-GAT with inverse class weighting reached a Macro-F1 of 96.65% (+/- 0.87) and an accuracy of 99.14%. This is 14.3 percentage points higher in Macro-F1 than a per-flow Random Forest baseline (82.34%). Balanced sampling reduced Macro-F1 by 2.3 points (to 94.37%) relative to loss weighting. This suggests that aggressive resampling of small, noisy minority classes can hurt detection in heavily imbalanced traffic.

## GraphPass: A Study of Graph Neural Networks for Compiler Pass Selection

DevFeed: [GraphPass: A Study of Graph Neural Networks for Compiler Pass Selection](<https://devfeed.tech/articles/graphpass-a-study-of-graph-neural-networks-for-compiler-pass-selection-137498.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19821>)

Author: Mohammed Saqlain

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>)

Tags: [compiler](<https://devfeed.tech/tags/compiler.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-pl](<https://devfeed.tech/tags/cs-pl.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-neural-networks](<https://devfeed.tech/tags/graph-neural-networks.md>), [selection](<https://devfeed.tech/tags/selection.md>)

### AI overview

GraphPass tests whether a GNN can choose among five compiler-pass sequences from a program's control-flow graph in one forward pass. On 5,000 synthetic CFGs spanning five program families, GAT and GCN encoders matched the benchmark's reference labels on about 92% of held-out programs, compared with 85% for a flat MLP and 68.4% for a rule-based heuristic. Removing CFG edges raised GCN accuracy to 95.0% from 92.2% with true edges, suggesting the benchmark gains came from processing basic-block features rather than graph connectivity. Since labels were determined by program family, this amounts to family recognition; real-compiler speedups were not measured. Inference is reported as O(|V| + |E|), at 1.7 ms for a typical program and about 0.8 seconds for a 100,000-block graph on one CPU core.

### Source excerpt

arXiv:2611.19821v1 Announce Type: cross Abstract: Compiler pass selection is usually governed by fixed pipelines (-O2, -O3) or hand-written heuristics. We study whether a graph neural network (GNN) over a program's control-flow graph (CFG) can select among a fixed menu of five pass sequences in a single forward pass. GraphPass encodes each CFG with a graph attention (GAT) or graph convolutional (GCN) encoder and classifies it into one of the five sequences. On a synthetic benchmark of 5,000 generated CFGs in five program families, both encoders agree with the benchmark's reference label on about 92% of held-out programs, versus 68.4% for a hand-written rule-based heuristic and 85% for a flat MLP. An edge ablation indicates that this gain comes from per-block processing rather than from CFG edges: a GCN given the same basic-block features with all edges removed scores 95.0%, versus 92.2% with the true CFG. In this benchmark the label is determined by the program family, so the task amounts to family recognition. Real-compiler speedup is not measured. Inference costs O(|V| + |E|) per CFG, measured at 1.7 ms for a typical program and about 0.8 s for a 100,000-block graph on one CPU core.

## Explaining Cross-Label Decision Structure in Multi-Output Tree Ensembles

DevFeed: [Explaining Cross-Label Decision Structure in Multi-Output Tree Ensembles](<https://devfeed.tech/articles/explaining-cross-label-decision-structure-in-multi-output-tree-ensembles-137643.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20996>)

Author: Sylvio Barbon Junior, Hiago F. F. Oliveira, Rafael Figueira Gon\\c{c}alves, Jessica Fernandes Lopes, Ricardo Cerri

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [TensorFlow Decision Forests](<https://devfeed.tech/topics/tensorflow-decision-forests.md>), [model architecture](<https://devfeed.tech/topics/model-architecture.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [attribution](<https://devfeed.tech/tags/attribution.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [condition](<https://devfeed.tech/tags/condition.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [decision](<https://devfeed.tech/tags/decision.md>), [explain](<https://devfeed.tech/tags/explain.md>), [flow](<https://devfeed.tech/tags/flow.md>), [graph](<https://devfeed.tech/tags/graph.md>), [information](<https://devfeed.tech/tags/information.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [predicate](<https://devfeed.tech/tags/predicate.md>), [probability](<https://devfeed.tech/tags/probability.md>), [rankings](<https://devfeed.tech/tags/rankings.md>), [share](<https://devfeed.tech/tags/share.md>), [show](<https://devfeed.tech/tags/show.md>), [signal](<https://devfeed.tech/tags/signal.md>), [structure](<https://devfeed.tech/tags/structure.md>)

### AI overview

The proposed multi-sink Decision Predicate Graphs (ms-DPGs) and Shared Predicate Flow (SPF) explain how multi-output tree ensembles reuse decision conditions across labels. SPF measures how much of a label's decision mass passes through conditions active for both labels; a contracted graph view uses label-specific lifts to show whether shared conditions raise both labels' probabilities or favor one over the other. Controlled experiments indicate SPF captures shared decision conditions, not just feature overlap. Across nine benchmarks, native multi-output forests shared more decision structure than Binary Relevance on eight, including five of six cases at predictive parity; per-label TreeSHAP rankings showed architectural changes but not the degree of sharing. A key limitation: SPF describes the fitted model, and rose when feature-label signal was removed on eight benchmarks, so high SPF does not establish shared predictive information.

### Source excerpt

arXiv:2611.20996v1 Announce Type: cross Abstract: A multi-output tree ensemble predicts several binary labels through decision paths that it largely shares across those labels, yet the attribution methods commonly used to explain such models treat each output in isolation. We propose multi-sink Decision Predicate Graphs (ms-DPGs), which extend decision predicate graphs with one sink per label: each leaf contributes to the sink of every label its in-bag positive count for that label. On this representation we define Shared Predicate Flow (SPF), the share of a label's decision mass that passes through conditions active for both labels of a pair, and a contracted view of the graph in which label-specific lifts indicate whether a shared condition raises the probability of both labels or of one at the expense of the other. Controlled experiments show that SPF captures shared decision conditions rather than mere feature overlap. On nine multi-label benchmarks, native multi-output forests share substantially more decision structure than Binary Relevance on eight, including five of the six on which the two are at predictive parity, even at equal hyperparameters, whereas per-label TreeSHAP rankings register the change of architecture without showing whether more is shared. Because a native forest routes every label through the same splits, SPF describes the fitted model rather than the data, and on eight of the nine benchmarks it rises when the feature-label signal is removed; a high SPF is therefore not evidence of shared predictive information. ms-DPG offers a global, predicate-level account of how a multi-output ensemble reuses decision conditions across its labels.

## GAAMA: Graph Augmented Associative Memory for Agents

DevFeed: [GAAMA: Graph Augmented Associative Memory for Agents](<https://devfeed.tech/articles/gaama-graph-augmented-associative-memory-for-agents-137243.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.27910>)

Author: Swarna Kamal Paul, Shubhendu Sharma, Nitin Sareen

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [AI Context Management](<https://devfeed.tech/topics/ai-context-management.md>), [Retrieval Augmented Generation (RAG)](<https://devfeed.tech/topics/retrieval-augmented-generation-rag.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [cosine similarity search](<https://devfeed.tech/topics/cosine-similarity-search.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-ma](<https://devfeed.tech/tags/cs-ma.md>), [graph](<https://devfeed.tech/tags/graph.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [llm](<https://devfeed.tech/tags/llm.md>), [memory](<https://devfeed.tech/tags/memory.md>), [nearest-neighbor](<https://devfeed.tech/tags/nearest-neighbor.md>), [offline](<https://devfeed.tech/tags/offline.md>), [rag](<https://devfeed.tech/tags/rag.md>), [react](<https://devfeed.tech/tags/react.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [similarity-search](<https://devfeed.tech/tags/similarity-search.md>)

### AI overview

GAAMA organizes conversational memory around topics to preserve context and avoid speaker hubs that can make graph propagation uninformative. It stores verbatim episodes, uses an LLM to derive atomic facts and topic concepts, and synthesizes higher-order reflections; four node types are joined by five structural edge types. Retrieval combines nearest-neighbor similarity with edge-type-dependent Personalized PageRank. Its offline GRAFT step uses a bounded ReAct agent to search again when retrieved evidence falls short, then stores a grounded answer as a fact for later queries without added query-time cost. The abstract reports the best average among compared methods on LoCoMo10 (79.1%) and the best average across three MemoryArena datasets; GRAFT adds a small gain. Replacing concept-linked facts with entity-relation triples lowered reward by 3.0 percentage points in a controlled comparison.

### Source excerpt

arXiv:2603.27910v3 Announce Type: replace Abstract: AI agents that talk with users across many sessions need long-term memory to stay coherent and personalized. Existing approaches use either flat retrieval-augmented generation (RAG) that ignores how memories connect, or entity-centric knowledge graphs. Entity-centric graphs split each message into separate triples, which loses its context, and in conversations the speakers become hubs linked to almost every message, so propagation through them tells retrieval little. We present GAAMA, a graph-augmented associative memory that organizes conversations around topics. It keeps verbatim episodes, uses an LLM to distill them into atomic facts and topic concepts, and then synthesizes higher-order reflections. These four node types are linked by five kinds of structural edges, and topic concepts supply the cross-cutting paths, so mega-hubs do not form. Retrieval blends nearest-neighbor similarity search with Personalized PageRank whose transitions depend on edge type. We also introduce GRAFT (Graph Repair by Augmenting Facts & Topology), an offline repair step: for questions whose retrieved evidence fell short, a bounded ReAct agent searches memory again and records the grounded answer as a fresh fact, so later questions find it directly without extra query-time cost. On LoCoMo10, GAAMA achieves the highest average score of all compared methods (79.1%) and is competitive in every question category; GRAFT adds a small further gain. In a controlled comparison, replacing GAAMA's concept-linked facts with entityrelation triples lowers reward by 3.0 pp. On MemoryArena, GAAMA also has the best average across the three datasets.

## ResGraph: Cross-Model Graph-based Index Migration via Residual Reachability in ANN Search

DevFeed: [ResGraph: Cross-Model Graph-based Index Migration via Residual Reachability in ANN Search](<https://devfeed.tech/articles/resgraph-cross-model-graph-based-index-migration-via-residual-reachability-in-ann-search-135438.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.23036>)

Author: Baoyuan Gu, Xiaoyao Zhong, Jiabao Jin, Peng Cheng, Wangze Ni, Haoyang Li, Haotian Li, Jingkuan Song, Heng Tao Shen

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [ann](<https://devfeed.tech/topics/ann.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>)

Tags: [ann](<https://devfeed.tech/tags/ann.md>), [approximate-nearest-neighbor](<https://devfeed.tech/tags/approximate-nearest-neighbor.md>), [approximate-nearest-neighbor-search](<https://devfeed.tech/tags/approximate-nearest-neighbor-search.md>), [beam](<https://devfeed.tech/tags/beam.md>), [bounded](<https://devfeed.tech/tags/bounded.md>), [construction](<https://devfeed.tech/tags/construction.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [embedding-model](<https://devfeed.tech/tags/embedding-model.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [exploits](<https://devfeed.tech/tags/exploits.md>), [explore](<https://devfeed.tech/tags/explore.md>), [faster](<https://devfeed.tech/tags/faster.md>), [framework](<https://devfeed.tech/tags/framework.md>), [graph](<https://devfeed.tech/tags/graph.md>), [index](<https://devfeed.tech/tags/index.md>), [migration](<https://devfeed.tech/tags/migration.md>), [model](<https://devfeed.tech/tags/model.md>), [search](<https://devfeed.tech/tags/search.md>)

### AI overview

ResGraph speeds up graph-index migration when a corpus is re-encoded with a new embedding model by reusing connectivity in the old index: many exact neighbors under the new model remain reachable within a few hops. Res-Local expands shallowly in parallel and screens second-hop candidates with packed position sign codes before exact evaluation; Res-Search uses hop-bounded beam traversal to explore farther. Across eight text and image migrations, the abstract reports up to 17.43x faster construction than the fastest degree-matched reconstruction method, with competitive recall.

### Source excerpt

arXiv:2609.23036v2 Announce Type: replace Abstract: Approximate nearest neighbor search (ANNS) underpins large-scale vector retrieval in search, recommendation, and retrieval-augmented generation. Graph-based indexes have demonstrated state-of-the-art search performance for ANNS: they connect each corpus vector to a small set of nearby or navigationally useful vertices and answer queries by traversing the resulting graph. Because these edges are selected using construction-time distances, the graph index is tied to the embedding model; re-encoding a corpus with a new model may change distances and neighborhoods of the vectors, and reconstructing the graph for the new embedding vectors incurs substantial construction cost and delays deployment. When the embedding model changes, we observe a phenomenon in the old graph index that we call residual reachability: although derived from different models, the vectors describe the same underlying objects and often retain part of their similarity structure, which the old graph reflects as connectivity, leaving many exact new-model neighbors reachable within a few hops. Motivated by this observation, we develop ResGraph, an index-migration framework that exploits the residual reachability of the old graph index to construct the new graph index faster. ResGraph provides two migration paths. Res-Local performs parallel shallow expansion over the inherited graph index and screens second-hop candidates with packed position sign codes before exact evaluation. Res-Search uses hop-bounded beam traversal to explore beyond shallow expansion. Across eight text and image migrations, ResGraph attains up to 17.43 times speedup on constructing the new graph index than the fastest degree-matched reconstruction method while keeping competitive recalls.

[Next page](<https://devfeed.tech/topics/graphs.md?cursor=WyIyMDI2LTExLTE2VDA1OjAwOjAwKzAwOjAwIiwgImExMDM4NzQ4LTRmMmQtNDllZS05MjdjLWU3YjcyYTFmOTg5YSJd>)