{"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-embedding","name":"Graph Embedding","slug":"graph-embedding","description_markdown":"Graph embeddings learn a mapping from a network to a vector space, while preserving relevant network properties.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [GAT](https://github.com/PetarV-/GAT) )</span>","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":1192,"papers_with_code":533,"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":12,"subtasks":5,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-embedding-on-barabasi-albert","slug":"graph-embedding-on-barabasi-albert","dataset":"Barabasi-Albert","dataset_url":null,"rows_in_archive":1,"metrics":["Entropy Difference"],"first_row_in_archive_order":{"model":"DeepGG","paper_title":"DeepGG: a Deep Graph Generator","paper_url":"/paper/deep-graph-generators","paper_date":"2020-06-07","arxiv_id":"2006.04159","code_links":[{"title":"innvariant/deepgg","url":"https://github.com/innvariant/deepgg"}],"syntology":null}}],"datasets":[{"url":"/dataset/biogrid","name":"BioGRID","full_name":"Biological General Repository for Interaction Datasets","num_papers_in_archive":34},{"url":"/dataset/lastfm-asia","name":"LastFM Asia","full_name":"","num_papers_in_archive":21},{"url":"/dataset/card-660","name":"CARD-660","full_name":"","num_papers_in_archive":10},{"url":"/dataset/era","name":"ERA","full_name":"Event Recognition in Aerial videos","num_papers_in_archive":8},{"url":"/dataset/kg20c","name":"KG20C","full_name":"A scholarly knowledge graph benchmark dataset","num_papers_in_archive":5},{"url":"/dataset/is-a","name":"IS-A","full_name":null,"num_papers_in_archive":4},{"url":"/dataset/olpbench","name":"OLPBENCH","full_name":"OLPBENCH","num_papers_in_archive":4},{"url":"/dataset/chembl-v-27","name":"ChEMBL","full_name":"","num_papers_in_archive":2},{"url":"/dataset/herigraph","name":"HeriGraph","full_name":"Multimodal Machine Learning Datasets on Graphs of Heritage Values and Attributes","num_papers_in_archive":2},{"url":"/dataset/aids-antiviral-screen","name":"AIDS Antiviral Screen","full_name":"AIDS Antiviral Screen","num_papers_in_archive":1},{"url":"/dataset/financial-dynamic-knowledge-graph","name":"Financial Dynamic Knowledge Graph","full_name":"","num_papers_in_archive":1},{"url":"/dataset/synthetic-dynamic-networks","name":"Synthetic Dynamic Networks","full_name":"from Aging, Fitness Preferential Attachment mechanisms","num_papers_in_archive":1}],"subtasks":[{"url":"/task/dynamic-graph-embedding","name":"Dynamic graph embedding"},{"url":"/task/knowledge-graph-embedding","name":"Knowledge Graph Embedding"},{"url":"/task/knowledge-graph-embeddings","name":"Knowledge Graph Embeddings"},{"url":"/task/role-embedding","name":"Role Embedding"},{"url":"/task/structural-node-embedding","name":"Structural Node Embedding"}],"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":12,"rows_per_page":100,"shown":100,"of":1192,"of_with_code":533,"tagged_in_all":1192,"counts":{"archive_papers_tagged":1192,"with_a_code_link":533,"where_syntology_ran_a_sample":92,"not_listed_spam_title":0,"listed":1192,"listed_where_code_ran":92,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":83,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":83,"listed_every_run_a_failure_of_syntologys_instrument":9,"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/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/rotate-knowledge-graph-embedding-by","slug":"rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rotate-knowledge-graph-embedding-by#ran","syntology_url":"https://syntology.ai/paper/1902.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10197"}},"official":{"repos":["DeepGraphLearning/KnowledgeGraphEmbedding"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-hierarchy-aware-knowledge-graph","slug":"learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","repositories_listed":9,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-hierarchy-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09419"}},"official":{"repos":["MIRALab-USTC/KGE-HAKE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/poincare-embeddings-for-learning-hierarchical","slug":"poincare-embeddings-for-learning-hierarchical","title":"Poincaré Embeddings for Learning Hierarchical Representations","date":"2017-05-22","arxiv_id":"1705.08039","repositories_listed":9,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":8,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/poincare-embeddings-for-learning-hierarchical#ran","syntology_url":"https://syntology.ai/paper/1705.08039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08039"}},"official":null}},{"url":"/paper/line-large-scale-information-network","slug":"line-large-scale-information-network","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","repositories_listed":9,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/line-large-scale-information-network#ran","syntology_url":"https://syntology.ai/paper/1503.03578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.03578"}},"official":{"repos":["tangjianpku/LINE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graphsaint-graph-sampling-based-inductive","slug":"graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","repositories_listed":8,"syntology":null},{"url":"/paper/learning-combinatorial-optimization","slug":"learning-combinatorial-optimization","title":"Learning Combinatorial Optimization Algorithms over Graphs","date":"2017-04-05","arxiv_id":"1704.01665","repositories_listed":8,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/1704.01665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01665"}},"official":{"repos":["Hanjun-Dai/graph_comb_opt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/nscaching-simple-and-efficient-negative","slug":"nscaching-simple-and-efficient-negative","title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","date":"2018-12-16","arxiv_id":"1812.06410","repositories_listed":6,"syntology":null},{"url":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}},"official":null}},{"url":"/paper/spherical-and-hyperbolic-toric-topology-based","slug":"spherical-and-hyperbolic-toric-topology-based","title":"Spherical and Hyperbolic Toric Topology-Based Codes On Graph Embedding for Ising MRF Models: Classical and Quantum Topology Machine Learning","date":"2023-07-28","arxiv_id":"2307.15778","repositories_listed":5,"syntology":null},{"url":"/paper/inductive-representation-learning-on-temporal-1","slug":"inductive-representation-learning-on-temporal-1","title":"Inductive Representation Learning on Temporal Graphs","date":"2020-02-19","arxiv_id":"2002.07962","repositories_listed":5,"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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/inductive-representation-learning-on-temporal-1#ran","syntology_url":"https://syntology.ai/paper/2002.07962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07962"}},"official":{"repos":["StatsDLMathsRecomSys/Inductive-representation-learning-on-temporal-graphs"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/struc2vec-learning-node-representations-from","slug":"struc2vec-learning-node-representations-from","title":"struc2vec: Learning Node Representations from Structural Identity","date":"2017-04-11","arxiv_id":"1704.03165","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/struc2vec-learning-node-representations-from#ran","syntology_url":"https://syntology.ai/paper/1704.03165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.03165"}},"official":{"repos":["leoribeiro/struc2vec"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/multi-paradigm-analysis-of-thai-capital","slug":"multi-paradigm-analysis-of-thai-capital","title":"Multi-Paradigm Analysis of Thai Capital Market Linkages: Bivariate/Vine Copulas, Granger Causality, Network Centrality, and Graph Neural Network/Graph Embedding Approaches","date":"2023-02-23","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","repositories_listed":4,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}},"official":{"repos":["tranhungnghiep/meim-kge"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/multi-relational-embedding-for-knowledge","slug":"multi-relational-embedding-for-knowledge","title":"Multi-Relational Embedding for Knowledge Graph Representation and Analysis","date":"2020-09-28","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/fast-sequence-based-embedding-with-diffusion-1","slug":"fast-sequence-based-embedding-with-diffusion-1","title":"Fast Sequence-Based Embedding with Diffusion Graphs","date":"2020-01-21","arxiv_id":"2001.07463","repositories_listed":4,"syntology":null},{"url":"/paper/neural-recurrent-structure-search-for","slug":"neural-recurrent-structure-search-for","title":"Interstellar: Searching Recurrent Architecture for Knowledge Graph Embedding","date":"2019-11-17","arxiv_id":"1911.07132","repositories_listed":4,"syntology":null},{"url":"/paper/composition-based-multi-relational-graph","slug":"composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/composition-based-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/1911.03082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03082"}},"official":{"repos":["malllabiisc/CompGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/knowledge-graph-embedding-for","slug":"knowledge-graph-embedding-for","title":"Knowledge Graph Embedding for Ecotoxicological Effect Prediction","date":"2019-07-02","arxiv_id":"1907.01328","repositories_listed":4,"syntology":null},{"url":"/paper/graph-embedding-on-biomedical-networks","slug":"graph-embedding-on-biomedical-networks","title":"Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations","date":"2019-06-12","arxiv_id":"1906.05017","repositories_listed":4,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/graph-embedding-on-biomedical-networks#ran","syntology_url":"https://syntology.ai/paper/1906.05017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05017"}},"official":{"repos":["xiangyue9607/BioNEV"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/190501669","slug":"190501669","title":"Representation Learning for Attributed Multiplex Heterogeneous Network","date":"2019-05-05","arxiv_id":"1905.01669","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarially-regularized-graph-autoencoder","slug":"adversarially-regularized-graph-autoencoder","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","date":"2018-02-13","arxiv_id":"1802.04407","repositories_listed":4,"syntology":null},{"url":"/paper/laplacian-canonization-a-minimalist-approach-1","slug":"laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","arxiv_id":"2310.18716","repositories_listed":3,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"11 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/laplacian-canonization-a-minimalist-approach-1#ran","syntology_url":"https://syntology.ai/paper/2310.18716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18716"}},"official":{"repos":["GeorgeMLP/basis-invariance-synthetic-experiment","pku-ml/laplaciancanonization","georgemlp/laplacian-canonization"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-encoder-embedding","slug":"graph-encoder-embedding","title":"One-Hot Graph Encoder Embedding","date":"2021-09-27","arxiv_id":"2109.13098","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-encoder-embedding#ran","syntology_url":"https://syntology.ai/paper/2109.13098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.13098"}},"official":{"repos":["cshen6/graphemd","cshen6/graphnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autosf-towards-automatic-scoring-function","slug":"autosf-towards-automatic-scoring-function","title":"Bilinear Scoring Function Search for Knowledge Graph Learning","date":"2021-07-01","arxiv_id":"2107.00184","repositories_listed":3,"syntology":null},{"url":"/paper/efficient-relation-aware-scoring-function","slug":"efficient-relation-aware-scoring-function","title":"Efficient Relation-aware Scoring Function Search for Knowledge Graph Embedding","date":"2021-04-22","arxiv_id":"2104.10880","repositories_listed":3,"syntology":null},{"url":"/paper/coke-contextualized-knowledge-graph-embedding","slug":"coke-contextualized-knowledge-graph-embedding","title":"CoKE: Contextualized Knowledge Graph Embedding","date":"2019-11-06","arxiv_id":"1911.02168","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/coke-contextualized-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/1911.02168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02168"}},"official":{"repos":["PaddlePaddle/Research","PaddlePaddle/models"],"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":["official"]}}},{"url":"/paper/attributed-graph-clustering-a-deep","slug":"attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","arxiv_id":"1906.06532","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attributed-graph-clustering-a-deep#ran","syntology_url":"https://syntology.ai/paper/1906.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06532"}},"official":null}},{"url":"/paper/geometric-laplacian-eigenmap-embedding","slug":"geometric-laplacian-eigenmap-embedding","title":"GLEE: Geometric Laplacian Eigenmap Embedding","date":"2019-05-23","arxiv_id":"1905.09763","repositories_listed":3,"syntology":null},{"url":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}},"official":{"repos":["HongyangGao/gunet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/autokge-searching-scoring-functions-for","slug":"autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","arxiv_id":"1904.11682","repositories_listed":3,"syntology":null},{"url":"/paper/multi-task-feature-learning-for-knowledge","slug":"multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","arxiv_id":"1901.08907","repositories_listed":3,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-feature-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1901.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08907"}},"official":{"repos":["hwwang55/MKR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-baseline-algorithm-for-graph","slug":"a-simple-baseline-algorithm-for-graph","title":"A Simple Baseline Algorithm for Graph Classification","date":"2018-10-22","arxiv_id":"1810.09155","repositories_listed":3,"syntology":null},{"url":"/paper/hyperbolic-entailment-cones-for-learning","slug":"hyperbolic-entailment-cones-for-learning","title":"Hyperbolic Entailment Cones for Learning Hierarchical Embeddings","date":"2018-04-03","arxiv_id":"1804.01882","repositories_listed":3,"syntology":null},{"url":"/paper/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kbgan-adversarial-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1711.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04071"}},"official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/graph-embedding-techniques-applications-and","slug":"graph-embedding-techniques-applications-and","title":"Graph Embedding Techniques, Applications, and Performance: A Survey","date":"2017-05-08","arxiv_id":"1705.02801","repositories_listed":3,"syntology":null},{"url":"/paper/a-canonization-perspective-on-invariant-and","slug":"a-canonization-perspective-on-invariant-and","title":"A Canonicalization Perspective on Invariant and Equivariant Learning","date":"2024-05-28","arxiv_id":"2405.18378","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-canonization-perspective-on-invariant-and#ran","syntology_url":"https://syntology.ai/paper/2405.18378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18378"}},"official":{"repos":["PKU-ML/canonicalization","georgemlp/canonicalization"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/rdf-star2vec-rdf-star-graph-embeddings-for","slug":"rdf-star2vec-rdf-star-graph-embeddings-for","title":"RDF-star2Vec: RDF-star Graph Embeddings for Data Mining","date":"2023-12-25","arxiv_id":"2312.15626","repositories_listed":2,"syntology":null},{"url":"/paper/stockformer-a-swing-trading-strategy-based-on","slug":"stockformer-a-swing-trading-strategy-based-on","title":"Stockformer: A Price-Volume Factor Stock Selection Model Based on Wavelet Transform and Multi-Task Self-Attention Networks","date":"2023-11-23","arxiv_id":"2401.06139","repositories_listed":2,"syntology":null},{"url":"/paper/relation-aware-ensemble-learning-for","slug":"relation-aware-ensemble-learning-for","title":"Relation-aware Ensemble Learning for Knowledge Graph Embedding","date":"2023-10-13","arxiv_id":"2310.08917","repositories_listed":2,"syntology":null},{"url":"/paper/transerr-translation-based-knowledge-graph","slug":"transerr-translation-based-knowledge-graph","title":"TransERR: Translation-based Knowledge Graph Embedding via Efficient Relation Rotation","date":"2023-06-26","arxiv_id":"2306.14580","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-knowledge-graph-embedding-models","slug":"enhancing-knowledge-graph-embedding-models","title":"Treat Different Negatives Differently: Enriching Loss Functions with Domain and Range Constraints for Link Prediction","date":"2023-03-01","arxiv_id":"2303.00286","repositories_listed":2,"syntology":null},{"url":"/paper/sem-k-is-my-knowledge-graph-embedding-model","slug":"sem-k-is-my-knowledge-graph-embedding-model","title":"Sem@$K$: Is my knowledge graph embedding model semantic-aware?","date":"2023-01-13","arxiv_id":"2301.05601","repositories_listed":2,"syntology":null},{"url":"/paper/bess-balanced-entity-sampling-and-sharing-for","slug":"bess-balanced-entity-sampling-and-sharing-for","title":"BESS: Balanced Entity Sampling and Sharing for Large-Scale Knowledge Graph Completion","date":"2022-11-22","arxiv_id":"2211.12281","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bess-balanced-entity-sampling-and-sharing-for#ran","syntology_url":"https://syntology.ai/paper/2211.12281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12281"}},"official":{"repos":["graphcore/distributed-kge-poplar"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/region2vec-community-detection-on-spatial","slug":"region2vec-community-detection-on-spatial","title":"Region2Vec: Community Detection on Spatial Networks Using Graph Embedding with Node Attributes and Spatial Interactions","date":"2022-10-10","arxiv_id":"2210.08041","repositories_listed":2,"syntology":null},{"url":"/paper/multimodal-analogical-reasoning-over","slug":"multimodal-analogical-reasoning-over","title":"Multimodal Analogical Reasoning over Knowledge Graphs","date":"2022-10-01","arxiv_id":"2210.00312","repositories_listed":2,"syntology":{"n":27,"n_ran":17,"n_constructed":2,"n_ran_checked":14,"n_instrument":3,"n_unverified":10,"n_honours":1,"n_violates":1,"n_no_contract":12,"n_pointer_only":2,"phrase":"17 ran (of which 2 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 1 violated, 12 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/multimodal-analogical-reasoning-over#ran","syntology_url":"https://syntology.ai/paper/2210.00312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00312"}},"official":{"repos":["zjunlp/MKG_Analogy"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":10,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/start-small-think-big-on-hyperparameter","slug":"start-small-think-big-on-hyperparameter","title":"Start Small, Think Big: On Hyperparameter Optimization for Large-Scale Knowledge Graph Embeddings","date":"2022-07-11","arxiv_id":"2207.04979","repositories_listed":2,"syntology":null},{"url":"/paper/pie-a-parameter-and-inference-efficient","slug":"pie-a-parameter-and-inference-efficient","title":"PIE: a Parameter and Inference Efficient Solution for Large Scale Knowledge Graph Embedding Reasoning","date":"2022-04-29","arxiv_id":"2204.13957","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pie-a-parameter-and-inference-efficient#ran","syntology_url":"https://syntology.ai/paper/2204.13957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13957"}},"official":{"repos":["alipay/parameter_inference_efficient_pie"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unified-framework-for-rank-based-evaluation","slug":"a-unified-framework-for-rank-based-evaluation","title":"A Unified Framework for Rank-based Evaluation Metrics for Link Prediction in Knowledge Graphs","date":"2022-03-14","arxiv_id":"2203.07544","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-unified-framework-for-rank-based-evaluation#ran","syntology_url":"https://syntology.ai/paper/2203.07544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.07544"}},"official":{"repos":["pykeen/pykeen","pykeen/ranking-metrics-manuscript"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/simkgc-simple-contrastive-knowledge-graph","slug":"simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","arxiv_id":"2203.02167","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/simkgc-simple-contrastive-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2203.02167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02167"}},"official":{"repos":["intfloat/simkgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/rethinking-graph-convolutional-networks-in","slug":"rethinking-graph-convolutional-networks-in","title":"Rethinking Graph Convolutional Networks in Knowledge Graph Completion","date":"2022-02-08","arxiv_id":"2202.05679","repositories_listed":2,"syntology":null},{"url":"/paper/kge-cl-contrastive-learning-of-knowledge","slug":"kge-cl-contrastive-learning-of-knowledge","title":"KGE-CL: Contrastive Learning of Tensor Decomposition Based Knowledge Graph Embeddings","date":"2021-12-09","arxiv_id":"2112.04871","repositories_listed":2,"syntology":null},{"url":"/paper/prediction-of-adverse-biological-effects-of","slug":"prediction-of-adverse-biological-effects-of","title":"Prediction of Adverse Biological Effects of Chemicals Using Knowledge Graph Embeddings","date":"2021-12-08","arxiv_id":"2112.04605","repositories_listed":2,"syntology":null},{"url":"/paper/a-multi-purposed-unsupervised-framework-for","slug":"a-multi-purposed-unsupervised-framework-for","title":"A Multi-purposed Unsupervised Framework for Comparing Embeddings of Undirected and Directed Graphs","date":"2021-11-30","arxiv_id":"2112.00075","repositories_listed":2,"syntology":null},{"url":"/paper/spatio-temporal-scene-graph-embedding-for","slug":"spatio-temporal-scene-graph-embedding-for","title":"Spatio-Temporal Scene-Graph Embedding for Autonomous Vehicle Collision Prediction","date":"2021-11-11","arxiv_id":"2111.06123","repositories_listed":2,"syntology":null},{"url":"/paper/rot-pro-modeling-transitivity-by-projection","slug":"rot-pro-modeling-transitivity-by-projection","title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14450","repositories_listed":2,"syntology":null},{"url":"/paper/disenkgat-knowledge-graph-embedding-with","slug":"disenkgat-knowledge-graph-embedding-with","title":"DisenKGAT: Knowledge Graph Embedding with Disentangled Graph Attention Network","date":"2021-08-22","arxiv_id":"2108.09628","repositories_listed":2,"syntology":null},{"url":"/paper/convolutional-hypercomplex-embeddings-for","slug":"convolutional-hypercomplex-embeddings-for","title":"Convolutional Hypercomplex Embeddings for Link Prediction","date":"2021-06-29","arxiv_id":"2106.15230","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-the-performance-of-knowledge","slug":"understanding-the-performance-of-knowledge","title":"Understanding the Performance of Knowledge Graph Embeddings in Drug Discovery","date":"2021-05-17","arxiv_id":"2105.10488","repositories_listed":2,"syntology":null},{"url":"/paper/pyramidal-reservoir-graph-neural-network","slug":"pyramidal-reservoir-graph-neural-network","title":"Pyramidal Reservoir Graph Neural Network","date":"2021-04-10","arxiv_id":"2104.04710","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/pyramidal-reservoir-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2104.04710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04710"}},"official":{"repos":["FilippoMB/Benchmark_dataset_for_graph_classification","FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/evaluating-node-embeddings-of-complex","slug":"evaluating-node-embeddings-of-complex","title":"Evaluating Node Embeddings of Complex Networks","date":"2021-02-16","arxiv_id":"2102.08275","repositories_listed":2,"syntology":null},{"url":"/paper/spade-a-spectral-method-for-black-box","slug":"spade-a-spectral-method-for-black-box","title":"SPADE: A Spectral Method for Black-Box Adversarial Robustness Evaluation","date":"2021-02-07","arxiv_id":"2102.03716","repositories_listed":2,"syntology":null},{"url":"/paper/cleora-a-simple-strong-and-scalable-graph","slug":"cleora-a-simple-strong-and-scalable-graph","title":"Cleora: A Simple, Strong and Scalable Graph Embedding Scheme","date":"2021-02-03","arxiv_id":"2102.02302","repositories_listed":2,"syntology":null},{"url":"/paper/pairre-knowledge-graph-embeddings-via-paired","slug":"pairre-knowledge-graph-embeddings-via-paired","title":"PairRE: Knowledge Graph Embeddings via Paired Relation Vectors","date":"2020-11-07","arxiv_id":"2011.03798","repositories_listed":2,"syntology":null},{"url":"/paper/fede-embedding-knowledge-graphs-in-federated","slug":"fede-embedding-knowledge-graphs-in-federated","title":"FedE: Embedding Knowledge Graphs in Federated Setting","date":"2020-10-24","arxiv_id":"2010.12882","repositories_listed":2,"syntology":null},{"url":"/paper/tero-a-time-aware-knowledge-graph-embedding","slug":"tero-a-time-aware-knowledge-graph-embedding","title":"TeRo: A Time-aware Knowledge Graph Embedding via Temporal Rotation","date":"2020-10-02","arxiv_id":"2010.01029","repositories_listed":2,"syntology":null},{"url":"/paper/pykeen-1-0-a-python-library-for-training-and","slug":"pykeen-1-0-a-python-library-for-training-and","title":"PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings","date":"2020-07-28","arxiv_id":"2007.14175","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pykeen-1-0-a-python-library-for-training-and#ran","syntology_url":"https://syntology.ai/paper/2007.14175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14175"}},"official":{"repos":["pykeen/pykeen"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/overlaying-spaces-and-practical-applicability","slug":"overlaying-spaces-and-practical-applicability","title":"Overlapping Spaces for Compact Graph Representations","date":"2020-07-05","arxiv_id":"2007.02445","repositories_listed":2,"syntology":null},{"url":"/paper/jointly-non-sampling-learning-for-knowledge","slug":"jointly-non-sampling-learning-for-knowledge","title":"Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation","date":"2020-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/multi-partition-embedding-interaction-with","slug":"multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","repositories_listed":2,"syntology":null},{"url":"/paper/bringing-light-into-the-dark-a-large-scale","slug":"bringing-light-into-the-dark-a-large-scale","title":"Bringing Light Into the Dark: A Large-scale Evaluation of Knowledge Graph Embedding Models Under a Unified Framework","date":"2020-06-23","arxiv_id":"2006.13365","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bringing-light-into-the-dark-a-large-scale#ran","syntology_url":"https://syntology.ai/paper/2006.13365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13365"}},"official":{"repos":["pykeen/benchmarking"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/iterative-deep-graph-learning-for-graph-1","slug":"iterative-deep-graph-learning-for-graph-1","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","date":"2020-06-21","arxiv_id":"2006.13009","repositories_listed":2,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/iterative-deep-graph-learning-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2006.13009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13009"}},"official":{"repos":["hugochan/IDGL"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/you-can-teach-an-old-dog-new-tricks-on","slug":"you-can-teach-an-old-dog-new-tricks-on","title":"You CAN Teach an Old Dog New Tricks! On Training Knowledge Graph Embeddings","date":"2020-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/an-api-oriented-open-source-python-framework-1","slug":"an-api-oriented-open-source-python-framework-1","title":"Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.04819","repositories_listed":2,"syntology":null},{"url":"/paper/magnn-metapath-aggregated-graph-neural","slug":"magnn-metapath-aggregated-graph-neural","title":"MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding","date":"2020-02-05","arxiv_id":"2002.01680","repositories_listed":2,"syntology":null},{"url":"/paper/exem-expert-embedding-using-dominating-set","slug":"exem-expert-embedding-using-dominating-set","title":"ExEm: Expert Embedding using dominating set theory with deep learning approaches","date":"2020-01-16","arxiv_id":"2001.08503","repositories_listed":2,"syntology":null},{"url":"/paper/probability-calibration-for-knowledge-graph-1","slug":"probability-calibration-for-knowledge-graph-1","title":"Probability Calibration for Knowledge Graph Embedding Models","date":"2019-12-20","arxiv_id":"1912.10000","repositories_listed":2,"syntology":null},{"url":"/paper/temporal-knowledge-graph-embedding-model","slug":"temporal-knowledge-graph-embedding-model","title":"Temporal Knowledge Graph Embedding Model based on Additive Time Series Decomposition","date":"2019-11-18","arxiv_id":"1911.07893","repositories_listed":2,"syntology":null},{"url":"/paper/combinatorial-optimization-by-graph-pointer","slug":"combinatorial-optimization-by-graph-pointer","title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning","date":"2019-11-12","arxiv_id":"1911.04936","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combinatorial-optimization-by-graph-pointer#ran","syntology_url":"https://syntology.ai/paper/1911.04936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04936"}},"official":{"repos":["qiang-ma/graph-pointer-network"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/neural-graph-embedding-methods-for-natural","slug":"neural-graph-embedding-methods-for-natural","title":"Neural Graph Embedding Methods for Natural Language Processing","date":"2019-11-08","arxiv_id":"1911.03042","repositories_listed":2,"syntology":null},{"url":"/paper/learning-graph-structured-data-using-poincare","slug":"learning-graph-structured-data-using-poincare","title":"From Node Embedding To Community Embedding : A Hyperbolic Approach","date":"2019-07-02","arxiv_id":"1907.01662","repositories_listed":2,"syntology":null},{"url":"/paper/probabilistic-logic-neural-networks-for","slug":"probabilistic-logic-neural-networks-for","title":"Probabilistic Logic Neural Networks for Reasoning","date":"2019-06-20","arxiv_id":"1906.08495","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-translational-metric-learning","slug":"collaborative-translational-metric-learning","title":"Collaborative Translational Metric Learning","date":"2019-06-04","arxiv_id":"1906.01637","repositories_listed":2,"syntology":null},{"url":"/paper/an-unsupervised-framework-for-comparing-graph","slug":"an-unsupervised-framework-for-comparing-graph","title":"An Unsupervised Framework for Comparing Graph Embeddings","date":"2019-05-29","arxiv_id":"1906.04562","repositories_listed":2,"syntology":null},{"url":"/paper/is-a-single-embedding-enough-learning-node","slug":"is-a-single-embedding-enough-learning-node","title":"Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts","date":"2019-05-06","arxiv_id":"1905.02138","repositories_listed":2,"syntology":null},{"url":"/paper/fairwalk-towards-fair-graph-embedding","slug":"fairwalk-towards-fair-graph-embedding","title":"Fairwalk: Towards fair graph embedding","date":"2019-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-graph-representation-learning-via","slug":"dynamic-graph-representation-learning-via","title":"Dynamic Graph Representation Learning via Self-Attention Networks","date":"2018-12-22","arxiv_id":"1812.09430","repositories_listed":2,"syntology":null},{"url":"/paper/accurate-efficient-and-scalable-graph","slug":"accurate-efficient-and-scalable-graph","title":"Accurate, Efficient and Scalable Graph Embedding","date":"2018-10-28","arxiv_id":"1810.11899","repositories_listed":2,"syntology":null},{"url":"/paper/binarized-attributed-network-embedding","slug":"binarized-attributed-network-embedding","title":"Binarized Attributed Network Embedding","date":"2018-10-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/exploring-the-semantic-content-of","slug":"exploring-the-semantic-content-of","title":"Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study","date":"2018-06-19","arxiv_id":"1806.07464","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploring-the-semantic-content-of#ran","syntology_url":"https://syntology.ai/paper/1806.07464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07464"}},"official":{"repos":["sbonner0/unsupervised-graph-embedding","sbonner0/unsupervised-graph-embeddings"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-sequence-based-embedding-with-diffusion","slug":"fast-sequence-based-embedding-with-diffusion","title":"Fast Sequence Based Embedding with Diffusion Graphs","date":"2018-03-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/billion-scale-commodity-embedding-for-e","slug":"billion-scale-commodity-embedding-for-e","title":"Billion-scale Commodity Embedding for E-commerce Recommendation in Alibaba","date":"2018-03-06","arxiv_id":"1803.02349","repositories_listed":2,"syntology":null},{"url":"/paper/watch-your-step-learning-node-embeddings-via","slug":"watch-your-step-learning-node-embeddings-via","title":"Watch Your Step: Learning Node Embeddings via Graph Attention","date":"2017-10-26","arxiv_id":"1710.09599","repositories_listed":2,"syntology":null},{"url":"/paper/representation-learning-for-visual-relational","slug":"representation-learning-for-visual-relational","title":"Answering Visual-Relational Queries in Web-Extracted Knowledge Graphs","date":"2017-09-07","arxiv_id":"1709.02314","repositories_listed":2,"syntology":null},{"url":"/paper/deeppath-a-reinforcement-learning-method-for","slug":"deeppath-a-reinforcement-learning-method-for","title":"DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning","date":"2017-07-20","arxiv_id":"1707.06690","repositories_listed":2,"syntology":null},{"url":"/paper/from-node-embedding-to-community-embedding","slug":"from-node-embedding-to-community-embedding","title":"From Node Embedding To Community Embedding","date":"2016-10-31","arxiv_id":"1610.09950","repositories_listed":2,"syntology":null},{"url":"/paper/ett-ckge-efficient-task-driven-tokens-for","slug":"ett-ckge-efficient-task-driven-tokens-for","title":"ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding","date":"2025-06-09","arxiv_id":"2506.08158","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-identity-and-position-graph","slug":"efficient-identity-and-position-graph","title":"Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation","date":"2025-05-27","arxiv_id":"2505.20992","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-graph-embedding-smoothness-in-self","slug":"balancing-graph-embedding-smoothness-in-self","title":"Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition","date":"2025-04-16","arxiv_id":"2504.12011","repositories_listed":1,"syntology":null}],"syntology_records":33,"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":92,"papers_where_code_ran_first_page":"/task/graph-embedding/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":12,"url":"/task/graph-embedding/papers/2","json":"/task/graph-embedding/papers/2.json","rows":100},{"order":"archive","page":3,"of":12,"url":"/task/graph-embedding/papers/3","json":"/task/graph-embedding/papers/3.json","rows":100},{"order":"archive","page":4,"of":12,"url":"/task/graph-embedding/papers/4","json":"/task/graph-embedding/papers/4.json","rows":100},{"order":"archive","page":5,"of":12,"url":"/task/graph-embedding/papers/5","json":"/task/graph-embedding/papers/5.json","rows":100},{"order":"archive","page":6,"of":12,"url":"/task/graph-embedding/papers/6","json":"/task/graph-embedding/papers/6.json","rows":100},{"order":"archive","page":7,"of":12,"url":"/task/graph-embedding/papers/7","json":"/task/graph-embedding/papers/7.json","rows":100},{"order":"archive","page":8,"of":12,"url":"/task/graph-embedding/papers/8","json":"/task/graph-embedding/papers/8.json","rows":100},{"order":"archive","page":9,"of":12,"url":"/task/graph-embedding/papers/9","json":"/task/graph-embedding/papers/9.json","rows":100},{"order":"archive","page":10,"of":12,"url":"/task/graph-embedding/papers/10","json":"/task/graph-embedding/papers/10.json","rows":100},{"order":"archive","page":11,"of":12,"url":"/task/graph-embedding/papers/11","json":"/task/graph-embedding/papers/11.json","rows":100},{"order":"archive","page":12,"of":12,"url":"/task/graph-embedding/papers/12","json":"/task/graph-embedding/papers/12.json","rows":92},{"order":"ran","page":1,"of":1,"url":"/task/graph-embedding/papers/ran/1","json":"/task/graph-embedding/papers/ran/1.json","rows":92}],"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":"6b8564ae8bb6cec89b921706c892951f54ac12e191bedd4e452566affe4a5088","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}