ArtifactLinker: Linking Scientific Artifacts for Automatic State-of-the-Art Discovery

• URL: http://arxiv.org/abs/2605.16902v1
• Date: Sat, 16 May 2026 09:26:08 GMT
• Title: ArtifactLinker: Linking Scientific Artifacts for Automatic State-of-the-Art Discovery
• Abstract summary: ArtifactLinker is a framework to automatically discover state-of-the-art (SOTA) models for datasets.<n>A benchmark named ArtifactBench with 14,053 artifacts and 51,337 relations is presented.<n>Results show that (1) graph structures between existing artifacts are effective for missing link prediction; (2) end-to-end ranking and verification with ArtifactLinker help discover potential SOTA results and research insights.
• Score: 58.48859167777581
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Scientific artifacts such as models and datasets are foundations for research. With the rapid growth of platforms like HuggingFace, researchers now have access to a large number of artifacts. Yet, a key challenge remains: how can we automatically discover the state-of-the-art (SOTA) model for a given dataset by fully leveraging existing artifacts? We formalize this task as automatic SOTA discovery by modeling HuggingFace as an artifact graph, where nodes are models/datasets and edges represent evaluations. We propose ArtifactLinker, a two-stage framework: (1) ranking promising unobserved model--dataset links using Graph Neural Networks (GNNs) or graph-augmented Large Language Models (LLMs), and (2) verifying top-ranked links via coding experiments with LLM-based agents. We further introduce a benchmark named ArtifactBench with 14,053 artifacts and 51,337 relations to evaluate the performance of both stages. Results show that (1) graph structures between existing artifacts are effective for missing link prediction; (2) end-to-end ranking and verification with ArtifactLinker help discover potential SOTA results and research insights.

Related papers

• HEHRGNN: A Unified Embedding Model for Knowledge Graphs with Hyperedges and Hyper-Relational Edges [0.0]
  Real-world knowledge bases have a significant share of complex and n-ary facts that cannot be represented by binary edges.<n>We propose a unified embedding model for n-ary relational KGs with both hyperedges and hyper-relational edges.<n>The model also shows improved link prediction performance over baseline models for hyperedge and hyper-relational datasets.
  arXiv  Detail & Related papers  (2026-02-21T16:38:23Z)
• Future Link Prediction Without Memory or Aggregation [25.066464612400768]
  Future link prediction on temporal graphs is a fundamental task with wide applicability in real-world dynamic systems.<n>Existing methods typically rely on complex memory and aggregation modules, yet struggle to handle unseen edges.<n>We propose Cross-Attention based Future Link Predictor on Temporal Graphs (CRAFT), a simple yet effective architecture that discards memory and aggregation modules.
  arXiv  Detail & Related papers  (2025-05-26T01:53:27Z)
• AutoG: Towards automatic graph construction from tabular data [60.877867570524884]
  We aim to formalize the graph construction problem and propose an effective solution.<n>Existing automatic construction methods can only be applied to some specific cases.<n>We present a set of datasets to formalize and evaluate graph construction methods.<n>Second, we propose an LLM-based solution, AutoG, automatically generating high-quality graph schemas.
  arXiv  Detail & Related papers  (2025-01-25T17:31:56Z)
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
  We present a code that successfully replicates results from six popular and recent graph recommendation models. We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations. By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
  arXiv  Detail & Related papers  (2023-08-01T09:31:44Z)
• Unified Visual Relationship Detection with Vision and Language Models [89.77838890788638]
  This work focuses on training a single visual relationship detector predicting over the union of label spaces from multiple datasets. We propose UniVRD, a novel bottom-up method for Unified Visual Relationship Detection by leveraging vision and language models. Empirical results on both human-object interaction detection and scene-graph generation demonstrate the competitive performance of our model.
  arXiv  Detail & Related papers  (2023-03-16T00:06:28Z)
• Text Representation Enrichment Utilizing Graph based Approaches: Stock Market Technical Analysis Case Study [0.0]
  We propose a transductive hybrid approach composed of an unsupervised node representation learning model followed by a node classification/edge prediction model. The proposed model is developed to classify stock market technical analysis reports, which to our knowledge is the first work in this domain.
  arXiv  Detail & Related papers  (2022-11-29T11:26:08Z)
• A Multi-Level Attention Model for Evidence-Based Fact Checking [58.95413968110558]
  We present a simple model that can be trained on sequence structures. Results on a large-scale dataset for Fact Extraction and VERification show that our model outperforms the graph-based approaches.
  arXiv  Detail & Related papers  (2021-06-02T05:40:12Z)
• NASE: Learning Knowledge Graph Embedding for Link Prediction via Neural Architecture Search [9.634626241415916]
  Link prediction is the task of predicting missing connections between entities in the knowledge graph (KG) Previous work has tried to use Automated Machine Learning (AutoML) to search for the best model for a given dataset. We propose a novel Neural Architecture Search (NAS) framework for the link prediction task.
  arXiv  Detail & Related papers  (2020-08-18T03:34:09Z)
• Mix Dimension in Poincar\'{e} Geometry for 3D Skeleton-based Action Recognition [57.98278794950759]
  Graph Convolutional Networks (GCNs) have already demonstrated their powerful ability to model the irregular data. We present a novel spatial-temporal GCN architecture which is defined via the Poincar'e geometry. We evaluate our method on two current largest scale 3D datasets.
  arXiv  Detail & Related papers  (2020-07-30T18:23:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.