Papers › PRAGA: Prototype-aware Graph Adaptive Aggregation for Spatial Multi-modal Omics Analysis

PRAGA: Prototype-aware Graph Adaptive Aggregation for Spatial Multi-modal Omics Analysis

19 Sep 2024arXiv:2409.12728archive 2025-07-28

Xinlei Huang, Zhiqi Ma, Dian Meng, Yanran Liu, Shiwei Ruan, Qingqiang Sun, Xubin Zheng, Ziyue Qiao

Spatial multi-modal omics technology, highlighted by Nature Methods as an advanced biological technique in 2023, plays a critical role in resolving biological regulatory processes with spatial context. Recently, graph neural networks based on K-nearest neighbor (KNN) graphs have gained prominence in spatial multi-modal omics methods due to their ability to model semantic relations between sequencing spots. However, the fixed KNN graph fails to capture the latent semantic relations hidden by the inevitable data perturbations during the biological sequencing process, resulting in the loss of semantic information. In addition, the common lack of spot annotation and class number priors in practice further hinders the optimization of spatial multi-modal omics models. Here, we propose a novel spatial multi-modal omics resolved framework, termed PRototype-Aware Graph Adaptative Aggregation for Spatial Multi-modal Omics Analysis (PRAGA). PRAGA constructs a dynamic graph to capture latent semantic relations and comprehensively integrate spatial information and feature semantics. The learnable graph structure can also denoise perturbations by learning cross-modal knowledge. Moreover, a dynamic prototype contrastive learning is proposed based on the dynamic adaptability of Bayesian Gaussian Mixture Models to optimize the multi-modal omics representations for unknown biological priors. Quantitative and qualitative experiments on simulated and real datasets with 7 competing methods demonstrate the superior performance of PRAGA. Code is available at https://github.com/Xubin-s-Lab/PRAGA.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2409.12728")

Code

Syntology Ran 8 of 11 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 8 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

xubin-s-lab/praga officialmentioned in paperpytorchAGPL-3.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 8 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

8ran
3unverified

Licence: 11 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from xubin-s-lab/praga. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

clr_normalize_each_cell xubin-s-lab/praga/PRAGA/preprocess.py official repository ran AGPL-3.0 (copyleft) · pointer only · 26c85baaa84ab990 · report
construct_neighbor_graph xubin-s-lab/praga/PRAGA/preprocess.py official repository ran AGPL-3.0 (copyleft) · pointer only · b00496f9ea926325 · report
get_rs xubin-s-lab/praga/metric.py official repository ran AGPL-3.0 (copyleft) · pointer only · 02117d09b11d48b5 · report
get_sub_assign_with_one_cluster xubin-s-lab/praga/clustering_utils.py official repository ran AGPL-3.0 (copyleft) · pointer only · dff3b6e32dbd1fd5 · report
mean_average_precision xubin-s-lab/praga/metric.py official repository ran AGPL-3.0 (copyleft) · pointer only · 9557c1988e29c353 · report
pairwise_distance xubin-s-lab/praga/clustering_utils.py official repository ran AGPL-3.0 (copyleft) · pointer only · c28231e92b528a79 · report
pca xubin-s-lab/praga/PRAGA/preprocess.py official repository ran AGPL-3.0 (copyleft) · pointer only · 434c64e6c74854b9 · report
read_list_from_file xubin-s-lab/praga/cal_matrics.py official repository ran AGPL-3.0 (copyleft) · pointer only · 5b67b0cdfe63acf3 · report
cluster_acc xubin-s-lab/praga/clustering_utils.py official repository unverified AGPL-3.0 (copyleft) · pointer only · b6de204a76f878fe · report
construct_neighbor_graph xubin-s-lab/praga/PRAGA/preprocess_3M.py official repository unverified AGPL-3.0 (copyleft) · pointer only · 9dd543809c490470 · report
mclust_R xubin-s-lab/praga/PRAGA/utils.py official repository unverified AGPL-3.0 (copyleft) · pointer only · b1af9bb9030ff289 · report

Tasks

Contrastive Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Contrastive Learning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections