The paper proposes a method for automated research‑idea generation that preserves the typed structure of scientific papers by modeling each paper as a small category with typed research entities as objects and asserted relations as morphisms. It introduces a three‑layer algorithm—categorical signature clustering, a functor‑preservation gate, and a six‑axis LLM plausibility judge—to identify cross‑domain analogies that maintain relation chains. Experiments on tens of thousands of papers show the categorical gate filters candidates at a 17:1 ratio while keeping a falsifier rate above 83%, and it logs rejected candidates with detailed rationale.
How does research evolve, and what substrate would let us forecast where it goes next? Scientific progress is not simply a uniform accumulation of facts: ideas extend prior methods, address known limitations, realize proposed future directions, and sometimes dispute earlier claims.
arXiv:2607.18360v2 Announce Type: replace-cross Abstract: GPTZero found 53 NeurIPS 2025 accepted papers with hallucinated citations, and venues now screen submissions with automated reference checker...
arXiv:2608.23370v1 Announce Type: new Abstract: Large Language Models (LLMs) recognise patterns but do not natively track the path of exclusions that a coherent discourse demands. When an input rests...
arXiv:2606.22342v2 Announce Type: replace Abstract: How does research evolve, and can we trace it at the level of individual claims? Scientific progress is not simply a uniform accumulation of facts....
The paper presents an automated framework for building ontology networks by discovering typed semantic links between concepts across domains. It uses domain‑adapted DistilBERT embeddings, clustering to prune candidates, and GPT‑4o for generating interpretable relationships, reducing 800k raw pairs to 95k high‑quality candidates. Human validation on 429 links shows an 80.19% precision and 0.890 F1, outperforming five similarity‑based baselines and demonstrating the need for LLM reasoning in ontology link construction.
HyGRAIL is a framework for discovering scientific hypotheses in incomplete knowledge graphs by combining a graph neural network (GNN) triage with large language model (LLM) review. The GNN scores candidate hypotheses and routes only ambiguous cases to the LLM, which receives structured evidence from the graph converted into natural language. Experiments on MatKG show HyGRAIL achieves the highest F1 score, improves over baselines, and cuts LLM calls by over 54%.
arXiv:2606. 26130v1 Announce Type: cross Abstract: Large Language Models (LLMs) are increasingly used to guide research methodology, yet their default methodological tendencies under minimal prompting remain unclear.
arXiv:2510. 04520v2 Announce Type: replace Abstract: Accurate auto-formalization of theorem statements is essential for advancing automated discovery and verification of research-level mathematics, yet remains a major bottleneck for LLMs due to hallucinations, semantic mismatches, and their inability to synthesize new definitions.
Scientific knowledge graphs organize entities and relations extracted from scientific literature, but they remain inherently incomplete. Missing typed links in such graphs can therefore represent plau...
The article presents a technical manual for an open toolkit designed to measure how transformer language models individuate word meanings across different contexts. It introduces the concept of a "bridge form"—a single word that appears unchanged in multiple domains but with distinct senses—and outlines a full pipeline from specifying these forms to extracting layer-wise representations, computing silhouette-based separation metrics, and visualizing results. The manual details each design choice and its intended methodological safeguards, emphasizing that it serves as a methodological reference rather than reporting empirical findings.
The paper introduces SGHA, a fully automated system that discovers research problems by structuring scientific literature into evidence-linked objects and a typed evidence graph. SGHA operates entirely on a local 9B open‑weight language model, avoiding proprietary frontier‑model APIs, and outputs traceable research‑problem families with assumptions, objectives, success criteria, and ambiguities. Comparative experiments in five machine‑learning domains show that SGHA’s corpus‑first, evidence‑constrained approach yields inspectable research‑problem formulation without relying on external models.
arXiv:2609.22174v1 Announce Type: cross Abstract: Anticipating emerging research directions is a critical goal of AI-assisted science. Existing methods mainly predict which concepts will co-occur in...