{"url":"/task/graph-similarity","name":"Graph Similarity","slug":"graph-similarity","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":113,"papers_with_code":51,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-similarity-on-imdb","slug":"graph-similarity-on-imdb","dataset":"IMDb","dataset_url":"/dataset/imdb-movie-reviews","rows_in_archive":1,"metrics":["mse (10^-3)"],"first_row_in_archive_order":{"model":"SimGNN","paper_title":"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation","paper_url":"/paper/graph-edit-distance-computation-via-graph","paper_date":"2018-08-16","arxiv_id":"1808.05689","code_links":[{"title":"benedekrozemberczki/SimGNN","url":"https://github.com/benedekrozemberczki/SimGNN"},{"title":"pulkit1joshi/SimGNN","url":"https://github.com/pulkit1joshi/SimGNN"},{"title":"Sangs3112/SimGNN","url":"https://github.com/Sangs3112/SimGNN"}],"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}}}],"datasets":[{"url":"/dataset/imdb-movie-reviews","name":"IMDb Movie Reviews","full_name":"","num_papers_in_archive":1787},{"url":"/dataset/imdb-multi","name":"IMDB-MULTI","full_name":"","num_papers_in_archive":243},{"url":"/dataset/linux","name":"Linux","full_name":"Linux Program Dependence Graphs","num_papers_in_archive":14}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":51,"tagged_in_all":113,"items":[{"url":"/paper/cldice-a-topology-preserving-loss-function","title":"clDice -- A Novel Topology-Preserving Loss Function for Tubular Structure Segmentation","date":"2020-03-16","arxiv_id":"2003.07311","repositories_listed":4,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/graph-edit-distance-computation-via-graph","title":"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation","date":"2018-08-16","arxiv_id":"1808.05689","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/distance-metric-learning-using-graph","title":"Distance Metric Learning using Graph Convolutional Networks: Application to Functional Brain Networks","date":"2017-03-07","arxiv_id":"1703.02161","repositories_listed":3,"syntology":{"n":9,"n_ran":0,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/a-neural-framework-for-learning-subgraph-and","title":"GREED: A Neural Framework for Learning Graph Distance Functions","date":"2021-12-24","arxiv_id":"2112.13143","repositories_listed":2,"syntology":{"n":15,"n_ran":2,"n_unverified":13,"n_pointer_only":0}},{"url":"/paper/scenir-visual-semantic-clarity-through","title":"SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval","date":"2025-05-21","arxiv_id":"2505.15867","repositories_listed":1,"syntology":null},{"url":"/paper/hegmn-heterogeneous-graph-matching-network","title":"HeGMN: Heterogeneous Graph Matching Network for Learning Graph Similarity","date":"2025-03-11","arxiv_id":"2503.08739","repositories_listed":1,"syntology":null},{"url":"/paper/quality-measures-for-dynamic-graph-generative","title":"Quality Measures for Dynamic Graph Generative Models","date":"2025-03-03","arxiv_id":"2503.01720","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_unverified":0,"n_pointer_only":5}},{"url":"/paper/neural-network-graph-similarity-computation","title":"Neural Network Graph Similarity Computation Based on Graph Fusion","date":"2025-02-25","arxiv_id":"2502.18291","repositories_listed":1,"syntology":null},{"url":"/paper/grasp-simple-yet-effective-graph-similarity","title":"GraSP: Simple yet Effective Graph Similarity Predictions","date":"2024-12-13","arxiv_id":"2412.09968","repositories_listed":1,"syntology":null},{"url":"/paper/covered-forest-fine-grained-generalization","title":"Covered Forest: Fine-grained generalization analysis of graph neural networks","date":"2024-12-10","arxiv_id":"2412.07106","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/efficient-graph-similarity-computation-with","title":"Efficient Graph Similarity Computation with Alignment Regularization","date":"2024-06-21","arxiv_id":"2406.14929","repositories_listed":1,"syntology":{"n":16,"n_ran":12,"n_unverified":4,"n_pointer_only":16}},{"url":"/paper/s-2mvtc-a-simple-yet-efficient-scalable-multi","title":"S^2MVTC: a Simple yet Efficient Scalable Multi-View Tensor Clustering","date":"2024-03-14","arxiv_id":"2403.09107","repositories_listed":1,"syntology":null},{"url":"/paper/structure-your-data-towards-semantic-graph","title":"Structure Your Data: Towards Semantic Graph Counterfactuals","date":"2024-03-11","arxiv_id":"2403.06514","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_unverified":3,"n_pointer_only":11}},{"url":"/paper/s2mvtc-a-simple-yet-efficient-scalable-multi","title":"S2MVTC: a Simple yet Efficient Scalable Multi-View Tensor Clustering","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/do-similar-entities-have-similar-embeddings","title":"Do Similar Entities have Similar Embeddings?","date":"2023-12-16","arxiv_id":"2312.10370","repositories_listed":1,"syntology":null},{"url":"/paper/mata-combining-learnable-node-matching-with-a","title":"MATA*: Combining Learnable Node Matching with A* Algorithm for Approximate Graph Edit Distance Computation","date":"2023-11-04","arxiv_id":"2311.02356","repositories_listed":1,"syntology":null},{"url":"/paper/factual-a-benchmark-for-faithful-and","title":"FACTUAL: A Benchmark for Faithful and Consistent Textual Scene Graph Parsing","date":"2023-05-27","arxiv_id":"2305.17497","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-writer-retrieval-using-netrvlad","title":"Towards Writer Retrieval for Historical Datasets","date":"2023-05-09","arxiv_id":"2305.05358","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-vertex-replacement-grammars","title":"Dynamic Vertex Replacement Grammars","date":"2023-03-21","arxiv_id":"2303.11553","repositories_listed":1,"syntology":null},{"url":"/paper/compressed-heterogeneous-graph-for","title":"Compressed Heterogeneous Graph for Abstractive Multi-Document Summarization","date":"2023-03-12","arxiv_id":"2303.06565","repositories_listed":1,"syntology":null},{"url":"/paper/learning-feature-recovery-transformer-for","title":"Learning Feature Recovery Transformer for Occluded Person Re-identification","date":"2023-01-05","arxiv_id":"2301.01879","repositories_listed":1,"syntology":null},{"url":"/paper/joint-graph-learning-from-gaussian","title":"Joint graph learning from Gaussian observations in the presence of hidden nodes","date":"2022-12-04","arxiv_id":"2212.01816","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserved-neural-graph-similarity","title":"Privacy-Preserved Neural Graph Similarity Learning","date":"2022-10-21","arxiv_id":"2210.11730","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-supervised-vs-unsupervised-1","title":"Beyond Supervised vs. Unsupervised: Representative Benchmarking and Analysis of Image Representation Learning","date":"2022-06-16","arxiv_id":"2206.08347","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/cgmn-a-contrastive-graph-matching-network-for","title":"CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning","date":"2022-05-30","arxiv_id":"2205.15083","repositories_listed":1,"syntology":null},{"url":"/paper/graph-similarity-learning-for-change-point","title":"Graph similarity learning for change-point detection in dynamic networks","date":"2022-03-29","arxiv_id":"2203.15470","repositories_listed":1,"syntology":null},{"url":"/paper/weisfeiler-leman-in-the-bamboo-novel-amr-1","title":"Weisfeiler-leman in the bamboo: Novel AMR graph metrics and a benchmark for AMR graph similarity.","date":"2022-01-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-wise-common-latent-factor-extraction","title":"Graph-wise Common Latent Factor Extraction for Unsupervised Graph Representation Learning","date":"2021-12-16","arxiv_id":"2112.08830","repositories_listed":1,"syntology":null},{"url":"/paper/slow-learning-and-fast-inference-efficient","title":"Slow Learning and Fast Inference: Efficient Graph Similarity Computation via Knowledge Distillation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cldice-a-novel-topology-preserving-loss","title":"clDice - A Novel Topology-Preserving Loss Function for Tubular Structure Segmentation","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":9,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}