Browse State-of-the-Art › Graph Ranking
Graph Ranking
5 papers with code · 4 benchmarks · 1 dataset archive 2025-07-28
Benchmarks archive 2025-07-28
4 leaderboard tables shown for this task, 4 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| ogbg-molesol (4 rows) | 2-WL-GNN + CmpNN | Ranking Structured Objects with Graph Neural Networks | code | — | Compare |
| ogbg-molfreesolv (4 rows) | 2-WL-GNN + Utility Regression | Ranking Structured Objects with Graph Neural Networks | code | — | Compare |
| ogbg-mollipo (4 rows) | 2-WL-GNN + Utility Regression | Ranking Structured Objects with Graph Neural Networks | code | — | Compare |
| ZINC (4 rows) | 2-WL-GNN + DirectRanker | Ranking Structured Objects with Graph Neural Networks | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
1 dataset whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 18 · with a code link: 5 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 18 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 18 of 18, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
1 Nov 2021 2 repositories listedThe high-level decoding generates an AQG as a constraint to prune the search space and reduce the locally ambiguous query graph.
-
17 Feb 2025 1 repository listedMulti-behavior recommendation predicts items a user may purchase by analyzing diverse behaviors like viewing, adding to a cart, and purchasing.
-
1 Oct 2022 1 repository listedIn this paper, we develop a Graph-Based Unsupervised Summarization(GUSUM) method for extractive text summarization based on the principle of including the most important sentences while excluding sentences with similar…
-
18 Apr 2021 1 repository listedGraph neural networks (GNNs) have been successfully applied in many structured data domains, with applications ranging from molecular property prediction to the analysis of social networks.
-
2 Nov 2018 1 repository listedIn this paper, we conduct an empirical investigation of neural query graph ranking approaches for the task of complex question answering over knowledge graphs.
-
Advanced Academic Team Worker Recommendation Models7 Feb 2024 0 repositories listedCollaborator recommendation is an important task in academic domain.
-
Graph Ranking Contrastive Learning: A Extremely Simple yet Efficient Method23 Oct 2023 0 repositories listedGraph contrastive learning (GCL) has emerged as a representative graph self-supervised method, achieving significant success.
-
ToDD: Topological Compound Fingerprinting in Computer-Aided Drug Discovery7 Nov 2022 0 repositories listedIn computer-aided drug discovery (CADD), virtual screening (VS) is used for identifying the drug candidates that are most likely to bind to a molecular target in a large library of compounds.
-
A Method of Query Graph Reranking for Knowledge Base Question Answering27 Apr 2022 0 repositories listedThis paper presents a novel reranking method to better choose the optimal query graph, a sub-graph of knowledge graph, to retrieve the answer for an input question in Knowledge Base Question Answering (KBQA).
-
GUSUM: Graph-Based Unsupervised Summarization using Sentence-BERT and Sentence Features16 Jan 2022 0 repositories listedUnsupervised extractive document summarization aims to extract salient sentences from a document without requiring a labelled corpus.
-
Addressing Time Bias in Bipartite Graph Ranking for Important Node Identification28 Nov 2019 0 repositories listedThe goal of the ranking problem in networks is to rank nodes from best to worst, according to a chosen criterion.
-
Temporal Coherent and Graph Optimized Manifold Ranking for Visual Tracking17 Apr 2018 0 repositories listedRecently, weighted patch representation has been widely studied for alleviating the impact of background information included in bounding box to improve visual tracking results.
-
Graph Centrality Measures for Boosting Popularity-Based Entity Linking30 Nov 2017 0 repositories listedMany Entity Linking systems use collective graph-based methods to disambiguate the entity mentions within a document.
-
SCIR-QA at SemEval-2017 Task 3: CNN Model Based on Similar and Dissimilar Information between Keywords for Question Similarity1 Aug 2017 0 repositories listedWe describe a method of calculating the similarity of questions in community QA.
-
A Graph Framework for Multimodal Medical Information Processing22 Feb 2017 0 repositories listedMultimodal medical information processing is currently the epicenter of intense interdisciplinary research, as proper data fusion may lead to more accurate diagnoses.
-
Collective Named Entity Disambiguation using Graph Ranking and Clique Partitioning Approaches1 Aug 2014 0 repositories listed
-
Query-focused Multi-Document Summarization: Combining a Topic Model with Graph-based Semi-supervised Learning1 Aug 2014 0 repositories listed
-
Graph Ranking for Collective Named Entity Disambiguation1 Jun 2014 0 repositories listed
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