{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/graph-edit-distance-computation-via-graph#ran","syntology_url":"https://syntology.ai/paper/1808.05689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.05689"}},"official":null}}}],"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":113,"of_with_code":51,"tagged_in_all":113,"counts":{"archive_papers_tagged":113,"with_a_code_link":51,"where_syntology_ran_a_sample":10,"not_listed_spam_title":0,"listed":113,"listed_where_code_ran":10,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":10,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/cldice-a-topology-preserving-loss-function","slug":"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_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cldice-a-topology-preserving-loss-function#ran","syntology_url":"https://syntology.ai/paper/2003.07311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07311"}},"official":{"repos":["jocpae/clDice"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/graph-edit-distance-computation-via-graph","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/graph-edit-distance-computation-via-graph#ran","syntology_url":"https://syntology.ai/paper/1808.05689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.05689"}},"official":null}},{"url":"/paper/distance-metric-learning-using-graph","slug":"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":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/distance-metric-learning-using-graph#ran","syntology_url":"https://syntology.ai/paper/1703.02161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.02161"}},"official":{"repos":["sk1712/gcn_metric_learning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-neural-framework-for-learning-subgraph-and","slug":"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":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/a-neural-framework-for-learning-subgraph-and#ran","syntology_url":"https://syntology.ai/paper/2112.13143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13143"}},"official":{"repos":["idea-iitd/neurosed","idea-iitd/greed"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/scenir-visual-semantic-clarity-through","slug":"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","slug":"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","slug":"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_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quality-measures-for-dynamic-graph-generative#ran","syntology_url":"https://syntology.ai/paper/2503.01720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01720"}},"official":{"repos":["ryienh/jl-metric"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-network-graph-similarity-computation","slug":"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","slug":"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","slug":"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":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/covered-forest-fine-grained-generalization#ran","syntology_url":"https://syntology.ai/paper/2412.07106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.07106"}},"official":{"repos":["benfinkelshtein/CoveredForests"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-graph-similarity-computation-with","slug":"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_constructed":3,"n_ran_checked":7,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":16,"phrase":"12 ran (of which 3 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/efficient-graph-similarity-computation-with#ran","syntology_url":"https://syntology.ai/paper/2406.14929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14929"}},"official":{"repos":["jhuow/eric"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":3,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/s-2mvtc-a-simple-yet-efficient-scalable-multi","slug":"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","slug":"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_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-your-data-towards-semantic-graph#ran","syntology_url":"https://syntology.ai/paper/2403.06514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06514"}},"official":{"repos":["aggeliki-dimitriou/sgce"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/s2mvtc-a-simple-yet-efficient-scalable-multi","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/beyond-supervised-vs-unsupervised-1#ran","syntology_url":"https://syntology.ai/paper/2206.08347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08347"}},"official":{"repos":["mgwillia/unsupervised-analysis"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/cgmn-a-contrastive-graph-matching-network-for","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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},{"url":"/paper/towards-clustering-friendly-representations","slug":"towards-clustering-friendly-representations","title":"Towards Clustering-friendly Representations: Subspace Clustering via Graph Filtering","date":"2021-06-18","arxiv_id":"2106.09874","repositories_listed":1,"syntology":null},{"url":"/paper/image-to-image-retrieval-by-learning","slug":"image-to-image-retrieval-by-learning","title":"Image-to-Image Retrieval by Learning Similarity between Scene Graphs","date":"2020-12-29","arxiv_id":"2012.14700","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-graph-based-place-recognition-for-3d","slug":"semantic-graph-based-place-recognition-for-3d","title":"Semantic Graph Based Place Recognition for 3D Point Clouds","date":"2020-08-26","arxiv_id":"2008.11459","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semantic-graph-based-place-recognition-for-3d#ran","syntology_url":"https://syntology.ai/paper/2008.11459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.11459"}},"official":{"repos":["kxhit/SG_PR"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/funcgnn-a-graph-neural-network-approach-to","slug":"funcgnn-a-graph-neural-network-approach-to","title":"funcGNN: A Graph Neural Network Approach to Program Similarity","date":"2020-07-26","arxiv_id":"2007.13239","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-graph-matching-networks-for-deep-1","slug":"hierarchical-graph-matching-networks-for-deep-1","title":"Multilevel Graph Matching Networks for Deep Graph Similarity Learning","date":"2020-07-08","arxiv_id":"2007.04395","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-graph-matching-networks-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2007.04395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04395"}},"official":{"repos":["kleincup/MGMN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inferring-point-cloud-quality-via-graph","slug":"inferring-point-cloud-quality-via-graph","title":"Inferring Point Cloud Quality via Graph Similarity","date":"2020-05-31","arxiv_id":"2006.00497","repositories_listed":1,"syntology":null},{"url":"/paper/tree-truncated-tree-based-graph-kernels","slug":"tree-truncated-tree-based-graph-kernels","title":"Tree++: Truncated Tree Based Graph Kernels","date":"2020-02-23","arxiv_id":"2002.09846","repositories_listed":1,"syntology":null},{"url":"/paper/a-unifying-framework-for-spectrum-preserving","slug":"a-unifying-framework-for-spectrum-preserving","title":"A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-kernel-methods-for-node","slug":"rethinking-kernel-methods-for-node","title":"Rethinking Kernel Methods for Node Representation Learning on Graphs","date":"2019-10-06","arxiv_id":"1910.02548","repositories_listed":1,"syntology":null},{"url":"/paper/ddgk-learning-graph-representations-for-deep","slug":"ddgk-learning-graph-representations-for-deep","title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","date":"2019-04-21","arxiv_id":"1904.09671","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-inductive-whole-graph-embedding","slug":"unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","arxiv_id":"1904.01098","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-drug-drug-interactions-using","slug":"detecting-drug-drug-interactions-using","title":"Detecting drug-drug interactions using artificial neural networks and classic graph similarity measures","date":"2019-03-11","arxiv_id":"1903.04571","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-label-propagation-methods-for","slug":"generalized-label-propagation-methods-for","title":"Label Efficient Semi-Supervised Learning via Graph Filtering","date":"2019-01-28","arxiv_id":"1901.09993","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/generalized-label-propagation-methods-for#ran","syntology_url":"https://syntology.ai/paper/1901.09993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09993"}},"official":{"repos":["liqimai/Efficient-SSL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/inferring-networks-from-random-walk-based","slug":"inferring-networks-from-random-walk-based","title":"Inferring Networks From Random Walk-Based Node Similarities","date":"2018-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-set-matching-for-graph","slug":"convolutional-set-matching-for-graph","title":"Convolutional Set Matching for Graph Similarity","date":"2018-10-23","arxiv_id":"1810.10866","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-networks-for-fast","slug":"convolutional-neural-networks-for-fast","title":"Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching","date":"2018-09-10","arxiv_id":"1809.04440","repositories_listed":1,"syntology":null},{"url":"/paper/message-passing-graph-kernels","slug":"message-passing-graph-kernels","title":"Message Passing Graph Kernels","date":"2018-08-07","arxiv_id":"1808.02510","repositories_listed":1,"syntology":null},{"url":"/paper/fast-incremental-von-neumann-graph-entropy","slug":"fast-incremental-von-neumann-graph-entropy","title":"Fast Incremental von Neumann Graph Entropy Computation: Theory, Algorithm, and Applications","date":"2018-05-30","arxiv_id":"1805.11769","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-spectral-clustering-using-random","slug":"scalable-spectral-clustering-using-random","title":"Scalable Spectral Clustering Using Random Binning Features","date":"2018-05-25","arxiv_id":"1805.11048","repositories_listed":1,"syntology":null},{"url":"/paper/learning-networks-from-random-walk-based-node","slug":"learning-networks-from-random-walk-based-node","title":"Learning Networks from Random Walk-Based Node Similarities","date":"2018-01-23","arxiv_id":"1801.07386","repositories_listed":1,"syntology":null},{"url":"/paper/mathlingbudapest-concept-networks-for","slug":"mathlingbudapest-concept-networks-for","title":"MathLingBudapest: Concept Networks for Semantic Similarity","date":"2015-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"pieceformer-similarity-driven-knowledge","title":"Pieceformer: Similarity-Driven Knowledge Transfer via Scalable Graph Transformer in VLSI","date":"2025-06-18","arxiv_id":"2506.15907","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-graduated-assignment-for-maximum","title":"Neural Graduated Assignment for Maximum Common Edge Subgraphs","date":"2025-05-18","arxiv_id":"2505.12325","repositories_listed":0,"syntology":null},{"url":null,"slug":"pne-sgan-probabilistic-ndt-enhanced-semantic","title":"PNE-SGAN: Probabilistic NDT-Enhanced Semantic Graph Attention Network for LiDAR Loop Closure Detection","date":"2025-04-11","arxiv_id":"2504.08280","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-graph-similarity-computation-with-a","title":"Flexible Graph Similarity Computation With A Proactive Optimization Strategy","date":"2025-04-09","arxiv_id":"2504.06533","repositories_listed":0,"syntology":null},{"url":null,"slug":"point-cloud-objective-quality-benchmarking","title":"Point Cloud Objective Quality: Benchmarking Features and Quality Evaluation","date":"2025-04-04","arxiv_id":"2504.03381","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-relation-graph-kernel-strengthen","title":"Multi-Relation Graph-Kernel Strengthen Network for Graph-Level Clustering","date":"2025-04-02","arxiv_id":"2504.01605","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-text-to-talent-a-pipeline-for-extracting","title":"From Text to Talent: A Pipeline for Extracting Insights from Candidate Profiles","date":"2025-03-21","arxiv_id":"2503.17438","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-backdoor-attacks-with-reasonable","title":"Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks","date":"2025-03-12","arxiv_id":"2503.09049","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-databases-a-survey","title":"Graph Neural Networks for Databases: A Survey","date":"2025-02-18","arxiv_id":"2502.12908","repositories_listed":0,"syntology":null},{"url":null,"slug":"circuit-diagram-retrieval-based-on","title":"Circuit Diagram Retrieval Based on Hierarchical Circuit Graph Representation","date":"2025-02-05","arxiv_id":"2503.11658","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-space-decoupling-framework-for-optimization","title":"A space-decoupling framework for optimization on bounded-rank matrices with orthogonally invariant constraints","date":"2025-01-23","arxiv_id":"2501.13830","repositories_listed":0,"syntology":null},{"url":null,"slug":"segmn-a-structure-enhanced-graph-matching","title":"SEGMN: A Structure-Enhanced Graph Matching Network for Graph Similarity Learning","date":"2024-11-06","arxiv_id":"2411.03624","repositories_listed":0,"syntology":null},{"url":null,"slug":"pieclam-a-universal-graph-autoencoder-based","title":"PieClam: A Universal Graph Autoencoder Based on Overlapping Inclusive and Exclusive Communities","date":"2024-09-18","arxiv_id":"2409.11618","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-domain-evolutionary-optimization-of","title":"Multi-Domain Evolutionary Optimization of Network Structures","date":"2024-06-21","arxiv_id":"2406.14865","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-weighted-property-approaches-for","title":"Exploring Weighted Property Approaches for RDF Graph Similarity Measure","date":"2024-04-29","arxiv_id":"2404.19052","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-search-in-graph-edit-distance","title":"Efficient Search in Graph Edit Distance: Metric Search Trees vs. Brute Force Verification","date":"2024-03-15","arxiv_id":"2405.17434","repositories_listed":0,"syntology":null},{"url":null,"slug":"salsa-semantically-aware-latent-space","title":"SALSA: Semantically-Aware Latent Space Autoencoder","date":"2023-10-04","arxiv_id":"2310.02744","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-deformable-3d-graph-similarity-to","title":"Learning Deformable 3D Graph Similarity to Track Plant Cells in Unregistered Time Lapse Images","date":"2023-09-20","arxiv_id":"2309.11157","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-edit-distance-learning-via-different","title":"Graph Edit Distance Learning via Different Attention","date":"2023-08-26","arxiv_id":"2308.13871","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-level-embedding-for-time-evolving","title":"Graph-Level Embedding for Time-Evolving Graphs","date":"2023-06-01","arxiv_id":"2306.01012","repositories_listed":0,"syntology":null},{"url":null,"slug":"bures-wasserstein-means-of-graphs","title":"Bures-Wasserstein Means of Graphs","date":"2023-05-31","arxiv_id":"2305.19738","repositories_listed":0,"syntology":null},{"url":null,"slug":"more-interpretable-graph-similarity","title":"More Interpretable Graph Similarity Computation via Maximum Common Subgraph Inference","date":"2022-08-09","arxiv_id":"2208.04580","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexibert-are-current-transformer","title":"FlexiBERT: Are Current Transformer Architectures too Homogeneous and Rigid?","date":"2022-05-23","arxiv_id":"2205.11656","repositories_listed":0,"syntology":null},{"url":null,"slug":"spa-gcn-efficient-and-flexible-gcn","title":"SPA-GCN: Efficient and Flexible GCN Accelerator with an Application for Graph Similarity Computation","date":"2021-11-10","arxiv_id":"2111.05936","repositories_listed":0,"syntology":null},{"url":"/paper/weisfeiler-leman-in-the-bamboo-novel-amr","slug":"weisfeiler-leman-in-the-bamboo-novel-amr","title":"Weisfeiler-Leman in the BAMBOO: Novel AMR Graph Metrics and a Benchmark for AMR Graph Similarity","date":"2021-08-26","arxiv_id":"2108.11949","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-similarity-description-how-are-these","title":"Graph Similarity Description: How Are These Graphs Similar?","date":"2021-05-29","arxiv_id":"2105.14364","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-adaptive-pooling-by-capturing","title":"Hierarchical Adaptive Pooling by Capturing High-order Dependency for Graph Representation Learning","date":"2021-04-13","arxiv_id":"2104.05960","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-study-of-the-expressiveness-of","title":"An Empirical Study of the Expressiveness of Graph Kernels and Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-graph-similarity-network","title":"Graph-Graph Similarity Network","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-graph-matching-networks-for-deep","title":"Multi-level Graph Matching Networks for Deep and Robust Graph Similarity Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"some-algorithms-on-exact-approximate-and","title":"Some Algorithms on Exact, Approximate and Error-Tolerant Graph Matching","date":"2020-12-30","arxiv_id":"2012.15279","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-similarity-for-deep-learning","title":"A graph similarity for deep learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"node-centric-graph-learning-from-data-for","title":"Node-Centric Graph Learning from Data for Brain State Identification","date":"2020-11-04","arxiv_id":"2011.02179","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-edit-distance-by-graph-neural","title":"Learning Graph Edit Distance by Graph Neural Networks","date":"2020-08-17","arxiv_id":"2008.07641","repositories_listed":0,"syntology":null},{"url":null,"slug":"nasgem-neural-architecture-search-via-graph","title":"NASGEM: Neural Architecture Search via Graph Embedding Method","date":"2020-07-08","arxiv_id":"2007.04452","repositories_listed":0,"syntology":null},{"url":null,"slug":"feedback-graph-attention-convolutional","title":"Feedback Graph Attention Convolutional Network for Medical Image Enhancement","date":"2020-06-24","arxiv_id":"2006.13863","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-semantic-matching-by-exploring-high","title":"Visual-Semantic Matching by Exploring High-Order Attention and Distraction","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-partitioning-and-graph-neural-network","title":"Graph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation","date":"2020-05-16","arxiv_id":"2005.08008","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-and-fast-graph-similarity","title":"CoSimGNN: Towards Large-scale Graph Similarity Computation","date":"2020-05-14","arxiv_id":"2005.07115","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-and-unsupervised-representation","title":"Inductive and Unsupervised Representation Learning on Graph Structured Objects","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-similarity-using-pagerank-and","title":"Fast and Scalable Complex Network Descriptor Using PageRank and Persistent Homology","date":"2020-02-12","arxiv_id":"2002.05158","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-graph-similarity-learning-a-survey","title":"Deep Graph Similarity Learning: A Survey","date":"2019-12-25","arxiv_id":"1912.11615","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-maximum-entropy-approach-to-massive-graph","title":"A Maximum Entropy approach to Massive Graph Spectra","date":"2019-12-19","arxiv_id":"1912.09068","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-graph-matching-networks-for-deep","title":"Hierarchical Graph Matching Networks for Deep Graph Similarity Learning","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/spi-gcn-a-simple-permutation-invariant-graph","slug":"spi-gcn-a-simple-permutation-invariant-graph","title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","date":"2019-04-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-neural-architecture-search","title":"Understanding Neural Architecture Search Techniques","date":"2019-03-31","arxiv_id":"1904.00438","repositories_listed":0,"syntology":null},{"url":null,"slug":"similarity-learning-with-higher-order","title":"Similarity Learning with Higher-Order Graph Convolutions for Brain Network Analysis","date":"2018-11-02","arxiv_id":"1811.02662","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-limitations-of-unsupervised-bilingual","title":"On the Limitations of Unsupervised Bilingual Dictionary Induction","date":"2018-05-09","arxiv_id":"1805.03620","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-semi-supervised-learning-approach","title":"Graph Based Semi-Supervised Learning Approach for Tamil POS tagging","date":"2018-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":12,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":10,"papers_where_code_ran_first_page":"/task/graph-similarity/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/graph-similarity/papers/2","json":"/task/graph-similarity/papers/2.json","rows":13},{"order":"ran","page":1,"of":1,"url":"/task/graph-similarity/papers/ran/1","json":"/task/graph-similarity/papers/ran/1.json","rows":10}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"176869c09162522f8ae74224e0874643945ceaf0c65e503576b9b72cd03a104f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}