{"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/knowledge-graph-embedding","name":"Knowledge Graph Embedding","slug":"knowledge-graph-embedding","description_markdown":null,"categories":[{"name":"Knowledge Base","url":"/area/knowledge-base"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":467,"papers_with_code":220,"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":4,"subtasks":1,"parent_tasks":2},"benchmarks":[{"leaderboard":"/sota/knowledge-graph-embedding-on-fb15k-1","slug":"knowledge-graph-embedding-on-fb15k-1","dataset":"FB15k","dataset_url":"/dataset/fb15k","rows_in_archive":1,"metrics":["MRR"],"first_row_in_archive_order":{"model":"AcrE","paper_title":"Knowledge Graph Embedding with Atrous Convolution and Residual Learning","paper_url":"/paper/knowledge-graph-embedding-with-atrous","paper_date":"2020-10-23","arxiv_id":"2010.12121","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/fb15k","name":"FB15k","full_name":"Freebase 15K","num_papers_in_archive":641},{"url":"/dataset/kg20c","name":"KG20C","full_name":"A scholarly knowledge graph benchmark dataset","num_papers_in_archive":5},{"url":"/dataset/kgrc-rdf-star","name":"KGRC-RDF-star","full_name":"","num_papers_in_archive":2},{"url":"/dataset/geval-for-kgrc-rdf-star","name":"GEval for KGRC-RDF-star","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/open-knowledge-graph-embedding","name":"Open Knowledge Graph Embedding"}],"parent_tasks":[{"url":"/task/graph-embedding","name":"Graph Embedding"},{"url":"/task/graph-representation-learning","name":"Graph Representation Learning"}],"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":5,"rows_per_page":100,"shown":100,"of":467,"of_with_code":220,"tagged_in_all":467,"counts":{"archive_papers_tagged":467,"with_a_code_link":220,"where_syntology_ran_a_sample":40,"not_listed_spam_title":0,"listed":467,"listed_where_code_ran":40,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":39,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":39,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/joint-matrix-tensor-factorization-for","slug":"joint-matrix-tensor-factorization-for","title":"Joint Matrix-Tensor Factorization for Knowledge Base Inference","date":"2017-06-02","arxiv_id":"1706.00637","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/optimal-embedding-guided-negative-sample","slug":"optimal-embedding-guided-negative-sample","title":"Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction","date":"2025-04-04","arxiv_id":"2504.03327","repositories_listed":1,"syntology":null},{"url":"/paper/multi-dataset-and-transfer-learning-using","slug":"multi-dataset-and-transfer-learning-using","title":"Multi-dataset and Transfer Learning Using Gene Expression Knowledge Graphs","date":"2025-03-26","arxiv_id":"2503.20400","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-contrastive-representation","slug":"multimodal-contrastive-representation","title":"Multimodal Contrastive Representation Learning in Augmented Biomedical Knowledge Graphs","date":"2025-01-03","arxiv_id":"2501.01644","repositories_listed":1,"syntology":null},{"url":"/paper/distance-adaptive-quaternion-knowledge-graph","slug":"distance-adaptive-quaternion-knowledge-graph","title":"Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation","date":"2024-12-05","arxiv_id":"2412.04076","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-by-normalizing","slug":"knowledge-graph-embedding-by-normalizing","title":"Knowledge Graph Embedding by Normalizing Flows","date":"2024-09-30","arxiv_id":"2409.19977","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/knowledge-graph-embedding-by-normalizing#ran","syntology_url":"https://syntology.ai/paper/2409.19977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19977"}},"official":{"repos":["changyi7231/nfe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-role-of-graph-topology-in-the-performance","slug":"the-role-of-graph-topology-in-the-performance","title":"The Role of Graph Topology in the Performance of Biomedical Knowledge Graph Completion Models","date":"2024-09-06","arxiv_id":"2409.04103","repositories_listed":1,"syntology":null},{"url":"/paper/simple-but-effective-compound-geometric","slug":"simple-but-effective-compound-geometric","title":"Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion","date":"2024-08-13","arxiv_id":"2408.06603","repositories_listed":1,"syntology":null},{"url":"/paper/cpa-wac-constellation-partitioning-based","slug":"cpa-wac-constellation-partitioning-based","title":"CPa-WAC: Constellation Partitioning-based Scalable Weighted Aggregation Composition for Knowledge Graph Embedding","date":"2024-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-continual-knowledge-graph-embedding","slug":"fast-and-continual-knowledge-graph-embedding","title":"Fast and Continual Knowledge Graph Embedding via Incremental LoRA","date":"2024-07-08","arxiv_id":"2407.05705","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fast-and-continual-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2407.05705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05705"}},"official":{"repos":["seukgcode/fastkge"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unified-interpretation-of-smoothing-methods","slug":"unified-interpretation-of-smoothing-methods","title":"Unified Interpretation of Smoothing Methods for Negative Sampling Loss Functions in Knowledge Graph Embedding","date":"2024-07-05","arxiv_id":"2407.04251","repositories_listed":1,"syntology":null},{"url":"/paper/linklogic-a-new-method-and-benchmark-for","slug":"linklogic-a-new-method-and-benchmark-for","title":"LinkLogic: A New Method and Benchmark for Explainable Knowledge Graph Predictions","date":"2024-06-02","arxiv_id":"2406.00855","repositories_listed":1,"syntology":null},{"url":"/paper/kg-fit-knowledge-graph-fine-tuning-upon-open","slug":"kg-fit-knowledge-graph-fine-tuning-upon-open","title":"KG-FIT: Knowledge Graph Fine-Tuning Upon Open-World Knowledge","date":"2024-05-26","arxiv_id":"2405.16412","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/kg-fit-knowledge-graph-fine-tuning-upon-open#ran","syntology_url":"https://syntology.ai/paper/2405.16412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16412"}},"official":{"repos":["pat-jj/KG-FIT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalizing-knowledge-graph-embedding-with","slug":"generalizing-knowledge-graph-embedding-with","title":"Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization","date":"2024-05-14","arxiv_id":"2405.08540","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/generalizing-knowledge-graph-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2405.08540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.08540"}},"official":{"repos":["xxrep/golde"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-continual-knowledge-graph-embedding","slug":"towards-continual-knowledge-graph-embedding","title":"Towards Continual Knowledge Graph Embedding via Incremental Distillation","date":"2024-05-07","arxiv_id":"2405.04453","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-continual-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2405.04453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04453"}},"official":{"repos":["seukgcode/incde"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/arbitrary-time-information-modeling-via","slug":"arbitrary-time-information-modeling-via","title":"Arbitrary Time Information Modeling via Polynomial Approximation for Temporal Knowledge Graph Embedding","date":"2024-05-01","arxiv_id":"2405.00358","repositories_listed":1,"syntology":null},{"url":"/paper/sphere-expressive-and-interpretable-knowledge","slug":"sphere-expressive-and-interpretable-knowledge","title":"SpherE: Expressive and Interpretable Knowledge Graph Embedding for Set Retrieval","date":"2024-04-29","arxiv_id":"2404.19130","repositories_listed":1,"syntology":null},{"url":"/paper/causaldisco-causal-discovery-using-knowledge","slug":"causaldisco-causal-discovery-using-knowledge","title":"CausalLP: Learning causal relations with weighted knowledge graph link prediction","date":"2024-04-23","arxiv_id":"2405.02327","repositories_listed":1,"syntology":null},{"url":"/paper/sharing-parameter-by-conjugation-for-1","slug":"sharing-parameter-by-conjugation-for-1","title":"Sharing Parameter by Conjugation for Knowledge Graph Embeddings in Complex Space","date":"2024-04-18","arxiv_id":"2404.11809","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-heterogeneity-among-factor-tensors","slug":"mitigating-heterogeneity-among-factor-tensors","title":"Mitigating Heterogeneity among Factor Tensors via Lie Group Manifolds for Tensor Decomposition Based Temporal Knowledge Graph Embedding","date":"2024-04-14","arxiv_id":"2404.09155","repositories_listed":1,"syntology":null},{"url":"/paper/structural-positional-encoding-for-knowledge","slug":"structural-positional-encoding-for-knowledge","title":"Structural Positional Encoding for knowledge integration in transformer-based medical process monitoring","date":"2024-03-13","arxiv_id":"2403.08836","repositories_listed":1,"syntology":null},{"url":"/paper/block-diagonal-orthogonal-relation-and-matrix","slug":"block-diagonal-orthogonal-relation-and-matrix","title":"Block-Diagonal Orthogonal Relation and Matrix Entity for Knowledge Graph Embedding","date":"2024-01-11","arxiv_id":"2401.05967","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/vexir2vec-an-architecture-neutral-embedding","slug":"vexir2vec-an-architecture-neutral-embedding","title":"VEXIR2Vec: An Architecture-Neutral Embedding Framework for Binary Similarity","date":"2023-12-01","arxiv_id":"2312.00507","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-on-knowledge-graph-embeddings-and","slug":"a-study-on-knowledge-graph-embeddings-and","title":"A Study on Knowledge Graph Embeddings and Graph Neural Networks for Web Of Things","date":"2023-10-23","arxiv_id":"2310.14866","repositories_listed":1,"syntology":null},{"url":"/paper/universal-knowledge-graph-embeddings","slug":"universal-knowledge-graph-embeddings","title":"Universal Knowledge Graph Embeddings","date":"2023-10-23","arxiv_id":"2310.14899","repositories_listed":1,"syntology":null},{"url":"/paper/node-based-knowledge-graph-contrastive","slug":"node-based-knowledge-graph-contrastive","title":"Node-based Knowledge Graph Contrastive Learning for Medical Relationship Prediction","date":"2023-10-16","arxiv_id":"2310.10138","repositories_listed":1,"syntology":null},{"url":"/paper/negative-sampling-with-adaptive-denoising","slug":"negative-sampling-with-adaptive-denoising","title":"Negative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embedding","date":"2023-10-15","arxiv_id":"2310.09781","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-domain-knowledge-graph-into","slug":"incorporating-domain-knowledge-graph-into","title":"Incorporating Domain Knowledge Graph into Multimodal Movie Genre Classification with Self-Supervised Attention and Contrastive Learning","date":"2023-10-12","arxiv_id":"2310.08032","repositories_listed":1,"syntology":null},{"url":"/paper/contextualized-structural-self-supervised","slug":"contextualized-structural-self-supervised","title":"Contextualized Structural Self-supervised Learning for Ontology Matching","date":"2023-10-05","arxiv_id":"2310.03840","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-subsampling-for-knowledge-graph","slug":"model-based-subsampling-for-knowledge-graph","title":"Model-based Subsampling for Knowledge Graph Completion","date":"2023-09-17","arxiv_id":"2309.09296","repositories_listed":1,"syntology":null},{"url":"/paper/extending-transductive-knowledge-graph","slug":"extending-transductive-knowledge-graph","title":"Extending Transductive Knowledge Graph Embedding Models for Inductive Logical Relational Inference","date":"2023-09-07","arxiv_id":"2309.03773","repositories_listed":1,"syntology":null},{"url":"/paper/companion-animal-disease-diagnostics-based-on","slug":"companion-animal-disease-diagnostics-based-on","title":"Companion Animal Disease Diagnostics based on Literal-aware Medical Knowledge Graph Representation Learning","date":"2023-08-31","arxiv_id":"2309.03219","repositories_listed":1,"syntology":null},{"url":"/paper/development-of-a-knowledge-graph-embeddings","slug":"development-of-a-knowledge-graph-embeddings","title":"Development of a Knowledge Graph Embeddings Model for Pain","date":"2023-08-17","arxiv_id":"2308.08904","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-study-on-knowledge-graph","slug":"a-comprehensive-study-on-knowledge-graph","title":"A Comprehensive Study on Knowledge Graph Embedding over Relational Patterns Based on Rule Learning","date":"2023-08-15","arxiv_id":"2308.07889","repositories_listed":1,"syntology":null},{"url":"/paper/biomedical-knowledge-graph-embeddings-with","slug":"biomedical-knowledge-graph-embeddings-with","title":"Biomedical Knowledge Graph Embeddings with Negative Statements","date":"2023-08-07","arxiv_id":"2308.03447","repositories_listed":1,"syntology":null},{"url":"/paper/cause-towards-causal-knowledge-graph","slug":"cause-towards-causal-knowledge-graph","title":"CausE: Towards Causal Knowledge Graph Embedding","date":"2023-07-21","arxiv_id":"2307.11610","repositories_listed":1,"syntology":null},{"url":"/paper/intelligraphs-datasets-for-benchmarking","slug":"intelligraphs-datasets-for-benchmarking","title":"IntelliGraphs: Datasets for Benchmarking Knowledge Graph Generation","date":"2023-07-13","arxiv_id":"2307.06698","repositories_listed":1,"syntology":null},{"url":"/paper/improving-heterogeneous-graph-learning-with","slug":"improving-heterogeneous-graph-learning-with","title":"Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold","date":"2023-07-10","arxiv_id":"2307.04514","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-heterogeneous-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2307.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04514"}},"official":{"repos":["sharecodesubmission/weighted_product_manifold"],"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/a-decade-of-scholarly-research-on-open","slug":"a-decade-of-scholarly-research-on-open","title":"A Decade of Scholarly Research on Open Knowledge Graphs","date":"2023-06-22","arxiv_id":"2306.13186","repositories_listed":1,"syntology":null},{"url":"/paper/tuckerdncaching-high-quality-negative","slug":"tuckerdncaching-high-quality-negative","title":"TuckerDNCaching: high-quality negative sampling with tucker decomposition","date":"2023-06-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/schema-first-learn-versatile-knowledge-graph","slug":"schema-first-learn-versatile-knowledge-graph","title":"Schema First! Learn Versatile Knowledge Graph Embeddings by Capturing Semantics with MASCHInE","date":"2023-06-06","arxiv_id":"2306.03659","repositories_listed":1,"syntology":null},{"url":"/paper/ingram-inductive-knowledge-graph-embedding","slug":"ingram-inductive-knowledge-graph-embedding","title":"InGram: Inductive Knowledge Graph Embedding via Relation Graphs","date":"2023-05-31","arxiv_id":"2305.19987","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/ingram-inductive-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2305.19987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19987"}},"official":{"repos":["bdi-lab/ingram"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-embeddings-in-the-biomedical","slug":"knowledge-graph-embeddings-in-the-biomedical","title":"Knowledge Graph Embeddings in the Biomedical Domain: Are They Useful? A Look at Link Prediction, Rule Learning, and Downstream Polypharmacy Tasks","date":"2023-05-31","arxiv_id":"2305.19979","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-on-hyper-relational","slug":"representation-learning-on-hyper-relational","title":"Representation Learning on Hyper-Relational and Numeric Knowledge Graphs with Transformers","date":"2023-05-29","arxiv_id":"2305.18256","repositories_listed":1,"syntology":null},{"url":"/paper/an-investigation-of-evaluation-metrics-for","slug":"an-investigation-of-evaluation-metrics-for","title":"An Investigation of Evaluation Metrics for Automated Medical Note Generation","date":"2023-05-27","arxiv_id":"2305.17364","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-turn-your-knowledge-graph-embeddings-1","slug":"how-to-turn-your-knowledge-graph-embeddings-1","title":"How to Turn Your Knowledge Graph Embeddings into Generative Models","date":"2023-05-25","arxiv_id":"2305.15944","repositories_listed":1,"syntology":null},{"url":"/paper/3d-rotation-and-translation-for-hyperbolic","slug":"3d-rotation-and-translation-for-hyperbolic","title":"3D Rotation and Translation for Hyperbolic Knowledge Graph Embedding","date":"2023-05-22","arxiv_id":"2305.13015","repositories_listed":1,"syntology":null},{"url":"/paper/friendly-neighbors-contextualized-sequence-to","slug":"friendly-neighbors-contextualized-sequence-to","title":"Friendly Neighbors: Contextualized Sequence-to-Sequence Link Prediction","date":"2023-05-22","arxiv_id":"2305.13059","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-the-effect-of-hard-negative","slug":"investigating-the-effect-of-hard-negative","title":"HaSa: Hardness and Structure-Aware Contrastive Knowledge Graph Embedding","date":"2023-05-17","arxiv_id":"2305.10563","repositories_listed":1,"syntology":null},{"url":"/paper/modality-aware-negative-sampling-for-multi","slug":"modality-aware-negative-sampling-for-multi","title":"Modality-Aware Negative Sampling for Multi-modal Knowledge Graph Embedding","date":"2023-04-23","arxiv_id":"2304.11618","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-with-3d-compound","slug":"knowledge-graph-embedding-with-3d-compound","title":"Knowledge Graph Embedding with 3D Compound Geometric Transformations","date":"2023-04-01","arxiv_id":"2304.00378","repositories_listed":1,"syntology":null},{"url":"/paper/diversity-matters-robustness-of-bias","slug":"diversity-matters-robustness-of-bias","title":"Diversity matters: Robustness of bias measurements in Wikidata","date":"2023-02-27","arxiv_id":"2302.14027","repositories_listed":1,"syntology":null}],"syntology_records":21,"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":40,"papers_where_code_ran_first_page":"/task/knowledge-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":5,"url":"/task/knowledge-graph-embedding/papers/2","json":"/task/knowledge-graph-embedding/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/knowledge-graph-embedding/papers/3","json":"/task/knowledge-graph-embedding/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/knowledge-graph-embedding/papers/4","json":"/task/knowledge-graph-embedding/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/knowledge-graph-embedding/papers/5","json":"/task/knowledge-graph-embedding/papers/5.json","rows":67},{"order":"ran","page":1,"of":1,"url":"/task/knowledge-graph-embedding/papers/ran/1","json":"/task/knowledge-graph-embedding/papers/ran/1.json","rows":40}],"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":"0e47210395d1299621195344f3ba9f8ff592b133798d36798b0c9ae78bf821ec","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}