用张量流形统一图与向量表示,实现智能文献检索的高效精准。
Tensor Manifold-Based Graph-Vector Fusion for AI-Native Academic Literature Retrieval
- 基于张量流形理论,打破传统图向量融合对矩阵的依赖。
- 核心算法时间空间复杂度均为线性,支持大规模动态文献图。
- 支持时间感知和AI Agent编程,适合智能科研助手场景。
大语言模型与AI代理的快速发展推动学术文献检索进入新范式,对细粒度、时序感知和可编程检索提出新要求。现有图-向量融合方法仍受限于矩阵依赖、存储爆炸、语义稀释及缺乏AI原生支持等问题。本文提出一种基于张量流形理论的几何统一图-向量融合框架,首次形式化证明学术文献图是张量流形的离散投影,实现了图拓扑与向量几何嵌入的原生统一。基于此理论,设计四个核心模块:无矩阵依赖的时序扩散签名更新、分层时序流形编码、时序黎曼流形索引与AI-Agent可编程检索。理论分析与复杂度证明表明,所有核心算法均具线性时间与空间复杂度,可适应大规模动态学术文献图。本研究为AI原生学术文献检索提供了新理论框架与工程解决方案,推动图-向量融合技术在学术领域的产业化应用。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。