Graph-Based Discovery of Mathematical Software Communities and Publication-to-Community Prediction
- URL: http://arxiv.org/abs/2608.16455v1
- Date: Mon, 17 Aug 2026 11:56:08 GMT
- Title: Graph-Based Discovery of Mathematical Software Communities and Publication-to-Community Prediction
- Abstract summary: Research software forms distinct co-usage communities that span traditional disciplinary boundaries.<n>We present a graph-based framework for discovering mathematical software communities and predicting their association with research publications.
- Score: 2.006352089238062
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Research software forms distinct co-usage communities that span traditional disciplinary boundaries, yet the structure of these communities remains largely unexplored. We present a graph-based framework for discovering mathematical software communities and predicting their association with research publications. We construct a software co-usage network from publication-software relationships using a curated swMATH dataset and subsequently apply community detection method, revealing a heterogeneous landscape of mathematical software communities. We formulate publication-to-community mapping as a multi-label classification task and further investigate whether community membership can be predicted from lightweight scholarly metadata. Specifically, we compare two feature representations of scientific publications: Mathematics Subject Classification (MSC) and title-based embeddings. Across a range of models, structured MSC representation consistently provides a stronger precision-recall trade-off, demonstrating that structured domain metadata captures software-community structure more effectively than compressed title-only semantics in this setting. This work highlights the continuing value of structured scholarly metadata for large-scale research software discovery, classification and recommendation.
Related papers
- The zbMATH Open Knowledge Graph: Tracing Centuries of Mathematical Research [2.2549386819889734]
The zbMATH Open KG is a large-scale RDF knowledge graph covering more than 250 years of mathematical scholarship.<n>The graph comprises 34 million entities and 168 million RDF triples represented using established Semantic Web vocabularies.
arXiv Detail & Related papers (2026-09-01T09:27:06Z) - Reconnecting Fragmented Citation Networks with Semantic Augmentation [0.6598115808819748]
We propose a computationally efficient hybrid framework integrating citation topology with large language model (LLM)-based text similarity.<n>We augment the original graph by adding semantic edges from small, disconnected components and weighting existing citations according to textual similarity.<n>The method scales efficiently to large datasets and offers a practical strategy for strengthening citation-based indicators without collapsing disciplinary boundaries.
arXiv Detail & Related papers (2026-05-12T15:28:39Z) - SotA Lens: A Network-Augmented Methodology and Tool for Exploratory State-of-the-Art Reviews [0.0]
SotA Lens is a network-augmented methodology and lightweight software toolkit for exploratory State-of-the-Art reviews.<n>It is designed to complement, not replace, established review protocols such as PRISMA, PRISMA-ScR, systematic mapping studies, and bibliometric science mapping.
arXiv Detail & Related papers (2026-05-05T19:44:35Z) - Intelligent Scientific Literature Explorer using Machine Learning (ISLE) [0.797970449705065]
This paper presents an integrated system for scientific literature exploration that combines large-scale data acquisition, hybrid retrieval, semantic topic modeling, and heterogeneous knowledge graph construction.<n>The proposed framework contributes a foundation for AI-assisted scientific discovery.
arXiv Detail & Related papers (2025-12-14T16:54:24Z) - Graph Foundation Models: A Comprehensive Survey [66.74249119139661]
Graph Foundation Models (GFMs) aim to bring scalable, general-purpose intelligence to structured data.<n>This survey provides a comprehensive overview of GFMs, unifying diverse efforts under a modular framework.<n>GFMs are poised to become foundational infrastructure for open-ended reasoning over structured data.
arXiv Detail & Related papers (2025-05-21T05:08:00Z) - Are Large Language Models Good Classifiers? A Study on Edit Intent Classification in Scientific Document Revisions [62.12545440385489]
Large language models (LLMs) have brought substantial advancements in text generation, but their potential for enhancing classification tasks remains underexplored.
We propose a framework for thoroughly investigating fine-tuning LLMs for classification, including both generation- and encoding-based approaches.
We instantiate this framework in edit intent classification (EIC), a challenging and underexplored classification task.
arXiv Detail & Related papers (2024-10-02T20:48:28Z) - Masked Image Modeling: A Survey [73.21154550957898]
Masked image modeling emerged as a powerful self-supervised learning technique in computer vision.<n>We construct a taxonomy and review the most prominent papers in recent years.<n>We aggregate the performance results of various masked image modeling methods on the most popular datasets.
arXiv Detail & Related papers (2024-08-13T07:27:02Z) - SciMMIR: Benchmarking Scientific Multi-modal Information Retrieval [64.03631654052445]
Current benchmarks for evaluating MMIR performance in image-text pairing within the scientific domain show a notable gap.
We develop a specialised scientific MMIR benchmark by leveraging open-access paper collections.
This benchmark comprises 530K meticulously curated image-text pairs, extracted from figures and tables with detailed captions in scientific documents.
arXiv Detail & Related papers (2024-01-24T14:23:12Z) - SciNoBo : A Hierarchical Multi-Label Classifier of Scientific
Publications [0.7305019142196583]
Classifying scientific publications according to Field-of-Science (FoS) is of crucial importance.
We present SciNoBo, a novel classification system of publications to predefined FoS.
In contrast to other works, our system supports assignments of publications to multiple fields by considering their multi-arity potential.
arXiv Detail & Related papers (2022-04-02T15:09:33Z) - Deep Relational Metric Learning [84.95793654872399]
This paper presents a deep relational metric learning framework for image clustering and retrieval.
We learn an ensemble of features that characterizes an image from different aspects to model both interclass and intraclass distributions.
Experiments on the widely-used CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate that our framework improves existing deep metric learning methods and achieves very competitive results.
arXiv Detail & Related papers (2021-08-23T09:31:18Z) - Amortized Probabilistic Detection of Communities in Graphs [39.56798207634738]
We propose a simple framework for amortized community detection.
We combine the expressive power of GNNs with recent methods for amortized clustering.
We evaluate several models from our framework on synthetic and real datasets.
arXiv Detail & Related papers (2020-10-29T16:18:48Z) - Learning to Combine: Knowledge Aggregation for Multi-Source Domain
Adaptation [56.694330303488435]
We propose a Learning to Combine for Multi-Source Domain Adaptation (LtC-MSDA) framework.
In the nutshell, a knowledge graph is constructed on the prototypes of various domains to realize the information propagation among semantically adjacent representations.
Our approach outperforms existing methods with a remarkable margin.
arXiv Detail & Related papers (2020-07-17T07:52:44Z) - Relational Learning Analysis of Social Politics using Knowledge Graph
Embedding [11.978556412301975]
This paper presents a novel credibility domain-based KG Embedding framework.
It involves capturing a fusion of data obtained from heterogeneous resources into a formal KG representation depicted by a domain.
The framework also embodies a credibility module to ensure data quality and trustworthiness.
arXiv Detail & Related papers (2020-06-02T14:10:28Z)
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.