arXiv Computation and Language

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.

arXiv AI
Sep 17

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 AI
Sep 25

Learning to Ideate for Scientific Impact

The paper "Learning to Ideate for Scientific Impact" explores using delayed signals of scientific uptake—specifically citation-normalized impact—as feedback to steer large language models toward generating high‑impact research ideas. The authors build a dataset of over 100,000 computer science papers, train a reward model to predict citation impact from goal‑idea pairs, and align an idea generator via supervised fine‑tuning and reinforcement learning. Evaluation with a reference‑grounded protocol shows that the RL‑tuned model consistently produces ideas with higher estimated impact than baseline models.

By Shubham Kale, Aniketh Garikaparthi, Manasi Patwardhan