Hugging Face Trending Papers

Towards Automatic Evolution Tree Generation from Citation Graphs

arXiv Computation and Language
Sep 10

Towards Automatic Evolution Tree Generation from Citation Graphs

The paper introduces EvoTree, a staged framework for automatically generating evolution trees from citation graphs. It separates backbone learning from temporal refinement, using a graph-aware encoder and hierarchical clustering to build a stable taxonomy, then fine-tunes temporally to attach marginal papers under monotonic-path constraints, and finally labels concepts with an LLM without changing the topology. The authors release an annotated benchmark across 11 AI subfields and report that EvoTree outperforms baselines in NMI, citation-direction accuracy, concept purity, and marginal-paper detection.

By Zexing Zhao, Yuntong Hu, Liang Zhao
arXiv AI
1d ago

Time-Aligned Evolving Concept Graphs for Scientific Relation Forecasting

The paper introduces a time‑aligned evolving concept graph framework that jointly models semantic and structural changes in scientific literature. By treating dated papers as shared update events, it reconstructs both semantic and structural states from the same publication history for each prediction time, and fuses these states at the pair level to forecast co‑occurrence, relation formation, and conditional relation type. Experiments on a large graph of 187,848 papers and 270,687 concepts show that refreshing context with graph updates boosts mean relation AUPRC by 16.6% and raises mean relation AUROC from 0.9290 to 0.9722.

By Fred Sun, Jingze Wang, Minkun Xu, Shangqi Guo
arXiv Machine Learning
Sep 2

Hidden relationships in a document-derived property graph: top-k chunk embeddings and inverse-distance weighting over a dynamically evolving ontology

The paper introduces a second-pass method for uncovering hidden relationships in knowledge graphs extracted from text, without altering the original facts. By chunking documents and embedding each chunk once, the approach uses top‑k nearest‑neighbor queries and Shepard inverse‑distance weighting to score candidate node pairs, avoiding threshold issues inherent in cosine scoring. The technique is order‑independent, scalable, and has been implemented across multiple graph databases, demonstrating high edge fidelity with lower‑dimensional embeddings and a 25× speedup in top‑k computation.

By Bilge Kaan Karamete, Hunter Casten
arXiv Computation and Language
Sep 2

The Scientific Contribution Graph: Automated Literature-based Technological Roadmapping at Scale

The paper introduces the Scientific Contribution Graph, a large-scale resource that extracts 6 million scientific contributions from 655 k open-access papers across multiple disciplines and links them with 36 million prerequisite edges. It frames automated technological roadmapping as the task of identifying contributions and their prerequisites, and presents a new scientific prerequisite prediction task where models forecast which existing technologies enable future discoveries. The authors report that current models achieve a 0.48 MAP score on temporally-filtered backtesting, indicating rapid progress in this area.

By Peter A. Jansen
arXiv Machine Learning
Jun 11

GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs

arXiv:2606. 11898v1 Announce Type: cross Abstract: Research on Text-Attributed Graphs (TAGs) has gained significant attention recently due to its broad applications across various real-world data scenarios, such as citation networks, e-commerce platforms, social media, and web pages.

By Hengyi Feng, Zeang Sheng, Meiyi Qiang, Meiyi Qiang, Wentao Zhang