Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Tensor Manifold-Based Graph-Vector Fusion for AI-Native Academic Literature Retrieval

About

The rapid development of large language models and AI agents has triggered a paradigm shift in academic literature retrieval, putting forward new demands for fine-grained, time-aware, and programmable retrieval. Existing graph-vector fusion methods still face bottlenecks such as matrix dependence, storage explosion, semantic dilution, and lack of AI-native support. This paper proposes a geometry-unified graph-vector fusion framework based on tensor manifold theory, which formally proves that an academic literature graph is a discrete projection of a tensor manifold, realizing the native unification of graph topology and vector geometric embedding. Based on this theoretical conclusion, we design four core modules: matrix-independent temporal diffusion signature update, hierarchical temporal manifold encoding, temporal Riemannian manifold indexing, and AI-agent programmable retrieval. Theoretical analysis and complexity proof show that all core algorithms have linear time and space complexity, which can adapt to large-scale dynamic academic literature graphs. This research provides a new theoretical framework and engineering solution for AI-native academic literature retrieval, promoting the industrial application of graph-vector fusion technology in the academic field.

Xing Wei, Yang Yu• 2026

Related benchmarks

TaskDatasetResultRank
AI-Agent Compatibility EvaluationSelf-Constructed AI-Agent Compatibility Dataset
Result Structure Completeness96
5
Dynamic graph updatePMC
Average Update Time (µs/node)18
5
Dynamic graph updatearXiv
Average Update Time (µs/node)16
5
Dynamic graph updateSelf-Constructed
Avg Update Time (µs/node)21
5
Hierarchical temporal-aware retrievalAll Data Sets Average
MAP82
5
Hierarchical temporal-aware retrievalSelf-Constructed Data Set
Average Storage (KB/node)0.8
5
Showing 6 of 6 rows

Other info

Follow for update