{"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-completion","name":"Knowledge Graph Completion","slug":"knowledge-graph-completion","description_markdown":"Knowledge graphs $G$ are represented as a collection of triples $\\\\{(h, r, t)\\\\}\\subseteq E\\times R\\times E$, where $E$ and $R$ are the entity set and relation set. The task of **Knowledge Graph Completion** is to either predict unseen relations $r$ between two existing entities: $(h, ?, t)$ or predict the tail entity $t$ given the head entity and the query relation: $(h, r, ?)$.\r\n\r\n\r\n<span class=\"description-source\">Source: [One-Shot Relational Learning for Knowledge Graphs ](https://arxiv.org/abs/1808.09040)</span>","categories":[{"name":"Graphs","url":"/area/graphs"},{"name":"Knowledge Base","url":"/area/knowledge-base"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":482,"papers_with_code":251,"benchmarks":7,"benchmark_tables_in_archive":7,"benchmark_tables_shown":7,"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":16,"subtasks":4,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/knowledge-graph-completion-on-fb15k-237","slug":"knowledge-graph-completion-on-fb15k-237","dataset":"FB15k-237","dataset_url":"/dataset/fb15k-237","rows_in_archive":4,"metrics":["Hits@10","Hits@1","Hits@3","MR","MRR"],"first_row_in_archive_order":{"model":"KBGAT","paper_title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","paper_url":"/paper/learning-attention-based-embeddings-for","paper_date":"2019-06-04","arxiv_id":"1906.01195","code_links":[{"title":"deepakn97/relationPrediction","url":"https://github.com/deepakn97/relationPrediction"},{"title":"KXY-PUBLIC/NASE","url":"https://github.com/KXY-PUBLIC/NASE"}],"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/learning-attention-based-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1906.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01195"}},"official":{"repos":["deepakn97/relationPrediction"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"leaderboard":"/sota/knowledge-graph-completion-on-dbp-5l","slug":"knowledge-graph-completion-on-dbp-5l","dataset":"DBP-5L (Greek)","dataset_url":"/dataset/dbp-5l","rows_in_archive":3,"metrics":["MRR"],"first_row_in_archive_order":{"model":"JMAC","paper_title":"Joint Multilingual Knowledge Graph Completion and Alignment","paper_url":"/paper/joint-multilingual-knowledge-graph-completion","paper_date":"2022-10-17","arxiv_id":"2210.08922","code_links":[{"title":"vinhsuhi/jmac","url":"https://github.com/vinhsuhi/jmac"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graph-completion-on-dbp-5l-english","slug":"knowledge-graph-completion-on-dbp-5l-english","dataset":"DBP-5L (English)","dataset_url":"/dataset/dbp-5l-english","rows_in_archive":3,"metrics":["MRR"],"first_row_in_archive_order":{"model":"JMAC","paper_title":"Joint Multilingual Knowledge Graph Completion and Alignment","paper_url":"/paper/joint-multilingual-knowledge-graph-completion","paper_date":"2022-10-17","arxiv_id":"2210.08922","code_links":[{"title":"vinhsuhi/jmac","url":"https://github.com/vinhsuhi/jmac"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graph-completion-on-dpb-5l-french","slug":"knowledge-graph-completion-on-dpb-5l-french","dataset":"DPB-5L (French)","dataset_url":"/dataset/dpb-5l-french","rows_in_archive":3,"metrics":["MRR"],"first_row_in_archive_order":{"model":"JMAC","paper_title":"Joint Multilingual Knowledge Graph Completion and Alignment","paper_url":"/paper/joint-multilingual-knowledge-graph-completion","paper_date":"2022-10-17","arxiv_id":"2210.08922","code_links":[{"title":"vinhsuhi/jmac","url":"https://github.com/vinhsuhi/jmac"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graph-completion-on-wn18rr","slug":"knowledge-graph-completion-on-wn18rr","dataset":"WN18RR","dataset_url":"/dataset/wn18rr","rows_in_archive":2,"metrics":["Hits@3","Hits@1","Hits@10"],"first_row_in_archive_order":{"model":"HAKE","paper_title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","paper_url":"/paper/learning-hierarchy-aware-knowledge-graph","paper_date":"2019-11-21","arxiv_id":"1911.09419","code_links":[{"title":"MIRALab-USTC/KGE-HAKE","url":"https://github.com/MIRALab-USTC/KGE-HAKE"},{"title":"thu-keg/eakit","url":"https://github.com/thu-keg/eakit"},{"title":"MIRALab-USTC/KGE-DURA","url":"https://github.com/MIRALab-USTC/KGE-DURA"},{"title":"miralab-ustc/qe-cone","url":"https://github.com/miralab-ustc/qe-cone"},{"title":"kamigaito/icml2022","url":"https://github.com/kamigaito/icml2022"},{"title":"guixiangyu1/KGE-HAKE-master","url":"https://github.com/guixiangyu1/KGE-HAKE-master"},{"title":"jiean001/models_m","url":"https://github.com/jiean001/models_m/tree/main/hake"},{"title":"kingcong/models","url":"https://github.com/kingcong/models/tree/main/hake"},{"title":"zyjcs/KGE-HAE","url":"https://github.com/zyjcs/KGE-HAE"}],"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"]}}}},{"leaderboard":"/sota/knowledge-graph-completion-on-dbbook2014","slug":"knowledge-graph-completion-on-dbbook2014","dataset":"DBbook2014","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@10","Mean Rank"],"first_row_in_archive_order":{"model":"KTUP (soft)","paper_title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","paper_url":"/paper/unifying-knowledge-graph-learning-and","paper_date":"2019-02-17","arxiv_id":"1902.06236","code_links":[{"title":"TaoMiner/joint-kg-recommender","url":"https://github.com/TaoMiner/joint-kg-recommender"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graph-completion-on-movielens-1m","slug":"knowledge-graph-completion-on-movielens-1m","dataset":"MovieLens 1M","dataset_url":"/dataset/movielens","rows_in_archive":1,"metrics":["Hits@10","Mean Rank"],"first_row_in_archive_order":{"model":"KTUP (soft)","paper_title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","paper_url":"/paper/unifying-knowledge-graph-learning-and","paper_date":"2019-02-17","arxiv_id":"1902.06236","code_links":[{"title":"TaoMiner/joint-kg-recommender","url":"https://github.com/TaoMiner/joint-kg-recommender"}],"syntology":null}}],"datasets":[{"url":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","num_papers_in_archive":1246},{"url":"/dataset/fb15k","name":"FB15k","full_name":"Freebase 15K","num_papers_in_archive":641},{"url":"/dataset/wn18","name":"WN18","full_name":"WordNet18","num_papers_in_archive":485},{"url":"/dataset/fb15k-237","name":"FB15k-237","full_name":"","num_papers_in_archive":452},{"url":"/dataset/wn18rr","name":"WN18RR","full_name":"","num_papers_in_archive":394},{"url":"/dataset/wiki-one","name":"Wiki-One","full_name":"","num_papers_in_archive":16},{"url":"/dataset/codex-medium","name":"CoDEx Medium","full_name":"","num_papers_in_archive":5},{"url":"/dataset/codex","name":"CoDEx Small","full_name":"","num_papers_in_archive":5},{"url":"/dataset/codex-large","name":"CoDEx Large","full_name":"","num_papers_in_archive":4},{"url":"/dataset/dbp-5l","name":"DBP-5L (Greek)","full_name":"","num_papers_in_archive":4},{"url":"/dataset/inferwiki","name":"InferWiki","full_name":"","num_papers_in_archive":4},{"url":"/dataset/dbp-5l-english","name":"DBP-5L (English)","full_name":"","num_papers_in_archive":3},{"url":"/dataset/dpb-5l-french","name":"DPB-5L (French)","full_name":"","num_papers_in_archive":3},{"url":"/dataset/aristo-v4","name":"Aristo-v4","full_name":"Aristo Tuple KB Version 4","num_papers_in_archive":1},{"url":"/dataset/dbp-5l-spanish","name":"DBP-5L (Spanish)","full_name":"","num_papers_in_archive":1},{"url":"/dataset/dbp-5l-japanese","name":"DBP-5L (Japanese)","full_name":"","num_papers_in_archive":0}],"subtasks":[{"url":"/task/inductive-knowledge-graph-completion","name":"Inductive knowledge graph completion"},{"url":"/task/inductive-relation-prediction","name":"Inductive Relation Prediction"},{"url":"/task/large-language-model","name":"Large Language Model"},{"url":"/task/triple-classification","name":"Triple Classification"}],"parent_tasks":[{"url":"/task/knowledge-graphs","name":"Knowledge Graphs"}],"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":482,"of_with_code":251,"tagged_in_all":482,"counts":{"archive_papers_tagged":482,"with_a_code_link":251,"where_syntology_ran_a_sample":47,"not_listed_spam_title":0,"listed":482,"listed_where_code_ran":47,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":41,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":41,"listed_every_run_a_failure_of_syntologys_instrument":6,"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/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/knowledge-graphs-meet-multi-modal-learning-a","slug":"knowledge-graphs-meet-multi-modal-learning-a","title":"Knowledge Graphs Meet Multi-Modal Learning: A Comprehensive Survey","date":"2024-02-08","arxiv_id":"2402.05391","repositories_listed":6,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":10,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":8,"n_pointer_only":4,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 2 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/knowledge-graphs-meet-multi-modal-learning-a#ran","syntology_url":"https://syntology.ai/paper/2402.05391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05391"}},"official":{"repos":["zjukg/kg-mm-survey"],"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/tucker-tensor-factorization-for-knowledge","slug":"tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","arxiv_id":"1901.09590","repositories_listed":5,"syntology":null},{"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/mining-implicit-entity-preference-from-user","slug":"mining-implicit-entity-preference-from-user","title":"Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning","date":"2020-03-28","arxiv_id":"2003.12718","repositories_listed":4,"syntology":null},{"url":"/paper/entity-context-and-relational-paths-for","slug":"entity-context-and-relational-paths-for","title":"Relational Message Passing for Knowledge Graph Completion","date":"2020-02-17","arxiv_id":"2002.06757","repositories_listed":4,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/entity-context-and-relational-paths-for#ran","syntology_url":"https://syntology.ai/paper/2002.06757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06757"}},"official":{"repos":["hwwang55/PathCon"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/benchmarking-the-abilities-of-large-language","slug":"benchmarking-the-abilities-of-large-language","title":"Benchmarking the Abilities of Large Language Models for RDF Knowledge Graph Creation and Comprehension: How Well Do LLMs Speak Turtle?","date":"2023-09-29","arxiv_id":"2309.17122","repositories_listed":3,"syntology":null},{"url":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}},"official":{"repos":["DeepGraphLearning/NBFNet"],"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":["community","listed","official"]}}},{"url":"/paper/duality-induced-regularizer-for-tensor","slug":"duality-induced-regularizer-for-tensor","title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","date":"2020-11-11","arxiv_id":"2011.05816","repositories_listed":3,"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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/duality-induced-regularizer-for-tensor#ran","syntology_url":"https://syntology.ai/paper/2011.05816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05816"}},"official":{"repos":["MIRALab-USTC/KGE-DURA"],"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/kg-bert-bert-for-knowledge-graph-completion","slug":"kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}},"official":{"repos":["yao8839836/kg-bert"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-sequence-encoders-for-temporal","slug":"learning-sequence-encoders-for-temporal","title":"Learning Sequence Encoders for Temporal Knowledge Graph Completion","date":"2018-09-10","arxiv_id":"1809.03202","repositories_listed":3,"syntology":null},{"url":"/paper/mygo-discrete-modality-information-as-fine","slug":"mygo-discrete-modality-information-as-fine","title":"Tokenization, Fusion, and Augmentation: Towards Fine-grained Multi-modal Entity Representation","date":"2024-04-15","arxiv_id":"2404.09468","repositories_listed":2,"syntology":null},{"url":"/paper/zero-shot-logical-query-reasoning-on-any","slug":"zero-shot-logical-query-reasoning-on-any","title":"A Foundation Model for Zero-shot Logical Query Reasoning","date":"2024-04-10","arxiv_id":"2404.07198","repositories_listed":2,"syntology":null},{"url":"/paper/hyperformer-enhancing-entity-and-relation","slug":"hyperformer-enhancing-entity-and-relation","title":"HyperFormer: Enhancing Entity and Relation Interaction for Hyper-Relational Knowledge Graph Completion","date":"2023-08-12","arxiv_id":"2308.06512","repositories_listed":2,"syntology":null},{"url":"/paper/dipping-plms-sauce-bridging-structure-and","slug":"dipping-plms-sauce-bridging-structure-and","title":"Dipping PLMs Sauce: Bridging Structure and Text for Effective Knowledge Graph Completion via Conditional Soft Prompting","date":"2023-07-04","arxiv_id":"2307.01709","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/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/promptkg-a-prompt-learning-framework-for","slug":"promptkg-a-prompt-learning-framework-for","title":"LambdaKG: A Library for Pre-trained Language Model-Based Knowledge Graph Embeddings","date":"2022-10-01","arxiv_id":"2210.00305","repositories_listed":2,"syntology":null},{"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/a-probabilistic-framework-for-knowledge-graph","slug":"a-probabilistic-framework-for-knowledge-graph","title":"A Probabilistic Framework for Knowledge Graph Data Augmentation","date":"2021-10-25","arxiv_id":"2110.13205","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/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/codex-a-comprehensive-knowledge-graph","slug":"codex-a-comprehensive-knowledge-graph","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","date":"2020-09-16","arxiv_id":"2009.07810","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/generative-adversarial-zero-shot-relational","slug":"generative-adversarial-zero-shot-relational","title":"Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs","date":"2020-01-08","arxiv_id":"2001.02332","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/generative-adversarial-zero-shot-relational#ran","syntology_url":"https://syntology.ai/paper/2001.02332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.02332"}},"official":{"repos":["Panda0406/Zero-shot-knowledge-graph-relational-learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"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/a-re-evaluation-of-knowledge-graph-completion","slug":"a-re-evaluation-of-knowledge-graph-completion","title":"A Re-evaluation of Knowledge Graph Completion Methods","date":"2019-11-10","arxiv_id":"1911.03903","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-re-evaluation-of-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1911.03903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03903"}},"official":{"repos":["svjan5/kg-reeval"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/diachronic-embedding-for-temporal-knowledge","slug":"diachronic-embedding-for-temporal-knowledge","title":"Diachronic Embedding for Temporal Knowledge Graph Completion","date":"2019-07-06","arxiv_id":"1907.03143","repositories_listed":2,"syntology":null},{"url":"/paper/learning-attention-based-embeddings-for","slug":"learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","arxiv_id":"1906.01195","repositories_listed":2,"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/learning-attention-based-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1906.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01195"}},"official":{"repos":["deepakn97/relationPrediction"],"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/binarized-knowledge-graph-embeddings","slug":"binarized-knowledge-graph-embeddings","title":"Binarized Knowledge Graph Embeddings","date":"2019-02-08","arxiv_id":"1902.02970","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-representation-learning-a","slug":"knowledge-representation-learning-a","title":"Knowledge Representation Learning: A Quantitative Review","date":"2018-12-28","arxiv_id":"1812.10901","repositories_listed":2,"syntology":null},{"url":"/paper/a-capsule-network-based-embedding-model-for-1","slug":"a-capsule-network-based-embedding-model-for-1","title":"A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization","date":"2018-08-13","arxiv_id":"1808.04122","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-capsule-network-based-embedding-model-for-1#ran","syntology_url":"https://syntology.ai/paper/1808.04122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04122"}},"official":{"repos":["daiquocnguyen/CapsE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/an-overview-of-embedding-models-of-entities","slug":"an-overview-of-embedding-models-of-entities","title":"A survey of embedding models of entities and relationships for knowledge graph completion","date":"2017-03-23","arxiv_id":"1703.08098","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-graph-completion-via-complex-tensor","slug":"knowledge-graph-completion-via-complex-tensor","title":"Knowledge Graph Completion via Complex Tensor Factorization","date":"2017-02-22","arxiv_id":"1702.06879","repositories_listed":2,"syntology":null},{"url":"/paper/proje-embedding-projection-for-knowledge","slug":"proje-embedding-projection-for-knowledge","title":"ProjE: Embedding Projection for Knowledge Graph Completion","date":"2016-11-16","arxiv_id":"1611.05425","repositories_listed":2,"syntology":null},{"url":"/paper/learning-entity-and-relation-embeddings-for","slug":"learning-entity-and-relation-embeddings-for","title":"Learning Entity and Relation Embeddings for Knowledge Graph Completion","date":"2015-01-25","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/graph-collaborative-attention-network-for","slug":"graph-collaborative-attention-network-for","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","date":"2025-07-05","arxiv_id":"2507.03947","repositories_listed":1,"syntology":null},{"url":"/paper/genic-an-llm-based-framework-for-instance","slug":"genic-an-llm-based-framework-for-instance","title":"GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs","date":"2025-05-29","arxiv_id":"2505.24036","repositories_listed":1,"syntology":null},{"url":"/paper/recdap-relation-based-conditional-diffusion","slug":"recdap-relation-based-conditional-diffusion","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","date":"2025-05-12","arxiv_id":"2505.07171","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-completion-with-relation","slug":"knowledge-graph-completion-with-relation","title":"Knowledge Graph Completion with Relation-Aware Anchor Enhancement","date":"2025-04-08","arxiv_id":"2504.06129","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-completion-with-mixed","slug":"knowledge-graph-completion-with-mixed","title":"Knowledge Graph Completion with Mixed Geometry Tensor Factorization","date":"2025-04-03","arxiv_id":"2504.02589","repositories_listed":1,"syntology":null},{"url":"/paper/trix-a-more-expressive-model-for-zero-shot","slug":"trix-a-more-expressive-model-for-zero-shot","title":"TRIX: A More Expressive Model for Zero-shot Domain Transfer in Knowledge Graphs","date":"2025-02-26","arxiv_id":"2502.19512","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-based-hierarchical-negative","slug":"diffusion-based-hierarchical-negative","title":"Diffusion-based Hierarchical Negative Sampling for Multimodal Knowledge Graph Completion","date":"2025-01-26","arxiv_id":"2501.15393","repositories_listed":1,"syntology":null},{"url":"/paper/halal-or-not-knowledge-graph-completion-for","slug":"halal-or-not-knowledge-graph-completion-for","title":"Halal or Not: Knowledge Graph Completion for Predicting Cultural Appropriateness of Daily Products","date":"2025-01-10","arxiv_id":"2501.05768","repositories_listed":1,"syntology":null},{"url":"/paper/s-2-dn-learning-to-denoise-unconvincing","slug":"s-2-dn-learning-to-denoise-unconvincing","title":"S$^2$DN: Learning to Denoise Unconvincing Knowledge for Inductive Knowledge Graph Completion","date":"2024-12-20","arxiv_id":"2412.15822","repositories_listed":1,"syntology":null},{"url":"/paper/multi-class-and-multi-task-strategies-for","slug":"multi-class-and-multi-task-strategies-for","title":"Multi-Class and Multi-Task Strategies for Neural Directed Link Prediction","date":"2024-12-14","arxiv_id":"2412.10895","repositories_listed":1,"syntology":null},{"url":"/paper/filter-then-generate-large-language-models","slug":"filter-then-generate-large-language-models","title":"Filter-then-Generate: Large Language Models with Structure-Text Adapter for Knowledge Graph Completion","date":"2024-12-12","arxiv_id":"2412.09094","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/pagerank-bandits-for-link-prediction","slug":"pagerank-bandits-for-link-prediction","title":"PageRank Bandits for Link Prediction","date":"2024-11-03","arxiv_id":"2411.01410","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pagerank-bandits-for-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2411.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01410"}},"official":{"repos":["jiaruzouu/prb"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/atap-automatic-template-augmented-commonsense","slug":"atap-automatic-template-augmented-commonsense","title":"ATAP: Automatic Template-Augmented Commonsense Knowledge Graph Completion via Pre-Trained Language Models","date":"2024-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-inductive-knowledge-graph","slug":"context-aware-inductive-knowledge-graph","title":"Context-aware Inductive Knowledge Graph Completion with Latent Type Constraints and Subgraph Reasoning","date":"2024-10-22","arxiv_id":"2410.16803","repositories_listed":1,"syntology":null},{"url":"/paper/replacing-paths-with-connection-biased","slug":"replacing-paths-with-connection-biased","title":"Replacing Paths with Connection-Biased Attention for Knowledge Graph Completion","date":"2024-10-01","arxiv_id":"2410.00876","repositories_listed":1,"syntology":null},{"url":"/paper/complex-logical-query-answering-by","slug":"complex-logical-query-answering-by","title":"Complex Logical Query Answering by Calibrating Knowledge Graph Completion Models","date":"2024-09-30","arxiv_id":"2410.07165","repositories_listed":1,"syntology":null},{"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/learning-granularity-representation-for","slug":"learning-granularity-representation-for","title":"Learning Granularity Representation for Temporal Knowledge Graph Completion","date":"2024-08-27","arxiv_id":"2408.15293","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/finetuning-generative-large-language-models","slug":"finetuning-generative-large-language-models","title":"Finetuning Generative Large Language Models with Discrimination Instructions for Knowledge Graph Completion","date":"2024-07-23","arxiv_id":"2407.16127","repositories_listed":1,"syntology":null},{"url":"/paper/subgraph-aware-training-of-text-based-methods","slug":"subgraph-aware-training-of-text-based-methods","title":"Subgraph-Aware Training of Language Models for Knowledge Graph Completion Using Structure-Aware Contrastive Learning","date":"2024-07-17","arxiv_id":"2407.12703","repositories_listed":1,"syntology":null},{"url":"/paper/contrast-then-memorize-semantic-neighbor","slug":"contrast-then-memorize-semantic-neighbor","title":"Contrast then Memorize: Semantic Neighbor Retrieval-Enhanced Inductive Multimodal Knowledge Graph Completion","date":"2024-07-03","arxiv_id":"2407.02867","repositories_listed":1,"syntology":null},{"url":"/paper/simple-augmentations-of-logical-rules-for","slug":"simple-augmentations-of-logical-rules-for","title":"Simple Augmentations of Logical Rules for Neuro-Symbolic Knowledge Graph Completion","date":"2024-07-02","arxiv_id":"2407.01994","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-knowledge-graph-completion-from","slug":"multilingual-knowledge-graph-completion-from","title":"Multilingual Knowledge Graph Completion from Pretrained Language Models with Knowledge Constraints","date":"2024-06-26","arxiv_id":"2406.18085","repositories_listed":1,"syntology":null},{"url":"/paper/start-from-zero-triple-set-prediction-for","slug":"start-from-zero-triple-set-prediction-for","title":"Start from Zero: Triple Set Prediction for Automatic Knowledge Graph Completion","date":"2024-06-26","arxiv_id":"2406.18166","repositories_listed":1,"syntology":null},{"url":"/paper/cogmg-collaborative-augmentation-between","slug":"cogmg-collaborative-augmentation-between","title":"CogMG: Collaborative Augmentation Between Large Language Model and Knowledge Graph","date":"2024-06-25","arxiv_id":"2406.17231","repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-benchmark-datasets-for","slug":"towards-better-benchmark-datasets-for","title":"Towards Better Benchmark Datasets for Inductive Knowledge Graph Completion","date":"2024-06-14","arxiv_id":"2406.11898","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-llms-suitability-for-knowledge","slug":"assessing-llms-suitability-for-knowledge","title":"Assessing LLMs Suitability for Knowledge Graph Completion","date":"2024-05-27","arxiv_id":"2405.17249","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-modality-knowledge-experts-for","slug":"mixture-of-modality-knowledge-experts-for","title":"Multiple Heads are Better than One: Mixture of Modality Knowledge Experts for Entity Representation Learning","date":"2024-05-27","arxiv_id":"2405.16869","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mixture-of-modality-knowledge-experts-for#ran","syntology_url":"https://syntology.ai/paper/2405.16869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16869"}},"official":{"repos":["zjukg/momok"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-completion-using-structural","slug":"knowledge-graph-completion-using-structural","title":"Knowledge Graph Completion using Structural and Textual Embeddings","date":"2024-04-24","arxiv_id":"2404.16206","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/hypermono-a-monotonicity-aware-approach-to","slug":"hypermono-a-monotonicity-aware-approach-to","title":"HyperMono: A Monotonicity-aware Approach to Hyper-Relational Knowledge Representation","date":"2024-04-15","arxiv_id":"2404.09848","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-knowledge-graph-completion","slug":"progressive-knowledge-graph-completion","title":"Progressive Knowledge Graph Completion","date":"2024-04-15","arxiv_id":"2404.09897","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-relational-learning-for-multimodal","slug":"zero-shot-relational-learning-for-multimodal","title":"Zero-Shot Relational Learning for Multimodal Knowledge Graphs","date":"2024-04-09","arxiv_id":"2404.06220","repositories_listed":1,"syntology":null},{"url":"/paper/harnessing-the-power-of-large-language-model","slug":"harnessing-the-power-of-large-language-model","title":"Harnessing the Power of Large Language Model for Uncertainty Aware Graph Processing","date":"2024-03-31","arxiv_id":"2404.00589","repositories_listed":1,"syntology":null},{"url":"/paper/kc-genre-a-knowledge-constrained-generative","slug":"kc-genre-a-knowledge-constrained-generative","title":"KC-GenRe: A Knowledge-constrained Generative Re-ranking Method Based on Large Language Models for Knowledge Graph Completion","date":"2024-03-26","arxiv_id":"2403.17532","repositories_listed":1,"syntology":null},{"url":"/paper/hyper-cl-conditioning-sentence","slug":"hyper-cl-conditioning-sentence","title":"Hyper-CL: Conditioning Sentence Representations with Hypernetworks","date":"2024-03-14","arxiv_id":"2403.09490","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hyper-cl-conditioning-sentence#ran","syntology_url":"https://syntology.ai/paper/2403.09490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09490"}},"official":{"repos":["hyu-nlp/hyper-cl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/counterfactual-reasoning-with-knowledge-graph","slug":"counterfactual-reasoning-with-knowledge-graph","title":"Counterfactual Reasoning with Knowledge Graph Embeddings","date":"2024-03-11","arxiv_id":"2403.06936","repositories_listed":1,"syntology":null},{"url":"/paper/the-power-of-noise-toward-a-unified-multi","slug":"the-power-of-noise-toward-a-unified-multi","title":"Noise-powered Multi-modal Knowledge Graph Representation Framework","date":"2024-03-11","arxiv_id":"2403.06832","repositories_listed":1,"syntology":null},{"url":"/paper/multi-perspective-improvement-of-knowledge","slug":"multi-perspective-improvement-of-knowledge","title":"Multi-perspective Improvement of Knowledge Graph Completion with Large Language Models","date":"2024-03-04","arxiv_id":"2403.01972","repositories_listed":1,"syntology":null},{"url":"/paper/unleashing-the-power-of-imbalanced-modality","slug":"unleashing-the-power-of-imbalanced-modality","title":"Unleashing the Power of Imbalanced Modality Information for Multi-modal Knowledge Graph Completion","date":"2024-02-22","arxiv_id":"2402.15444","repositories_listed":1,"syntology":null},{"url":"/paper/urbankgent-a-unified-large-language-model","slug":"urbankgent-a-unified-large-language-model","title":"UrbanKGent: A Unified Large Language Model Agent Framework for Urban Knowledge Graph Construction","date":"2024-02-10","arxiv_id":"2402.06861","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/urbankgent-a-unified-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2402.06861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06861"}},"official":{"repos":["usail-hkust/urbankgent"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/kicgpt-large-language-model-with-knowledge-in","slug":"kicgpt-large-language-model-with-knowledge-in","title":"KICGPT: Large Language Model with Knowledge in Context for Knowledge Graph Completion","date":"2024-02-04","arxiv_id":"2402.02389","repositories_listed":1,"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":1,"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/kicgpt-large-language-model-with-knowledge-in#ran","syntology_url":"https://syntology.ai/paper/2402.02389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02389"}},"official":{"repos":["weiyanbin1999/kicgpt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/contextualization-distillation-from-large","slug":"contextualization-distillation-from-large","title":"Contextualization Distillation from Large Language Model for Knowledge Graph Completion","date":"2024-01-28","arxiv_id":"2402.01729","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/contextualization-distillation-from-large#ran","syntology_url":"https://syntology.ai/paper/2402.01729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01729"}},"official":{"repos":["david-li0406/contextulization-distillation"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/progressive-distillation-based-on-masked","slug":"progressive-distillation-based-on-masked","title":"Progressive Distillation Based on Masked Generation Feature Method for Knowledge Graph Completion","date":"2024-01-19","arxiv_id":"2401.12997","repositories_listed":1,"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":1,"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/progressive-distillation-based-on-masked#ran","syntology_url":"https://syntology.ai/paper/2401.12997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.12997"}},"official":{"repos":["cyjie429/pmd"],"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/path-based-explanation-for-knowledge-graph","slug":"path-based-explanation-for-knowledge-graph","title":"Path-based Explanation for Knowledge Graph Completion","date":"2024-01-04","arxiv_id":"2401.02290","repositories_listed":1,"syntology":null},{"url":"/paper/prompting-disentangled-embeddings-for","slug":"prompting-disentangled-embeddings-for","title":"Prompting Disentangled Embeddings for Knowledge Graph Completion with Pre-trained Language Model","date":"2023-12-04","arxiv_id":"2312.01837","repositories_listed":1,"syntology":null},{"url":"/paper/increasing-coverage-and-precision-of-textual","slug":"increasing-coverage-and-precision-of-textual","title":"Increasing Coverage and Precision of Textual Information in Multilingual Knowledge Graphs","date":"2023-11-27","arxiv_id":"2311.15781","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/increasing-coverage-and-precision-of-textual#ran","syntology_url":"https://syntology.ai/paper/2311.15781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15781"}},"official":{"repos":["apple/ml-kge"],"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/ensembling-textual-and-structure-based-models","slug":"ensembling-textual-and-structure-based-models","title":"DynaSemble: Dynamic Ensembling of Textual and Structure-Based Models for Knowledge Graph Completion","date":"2023-11-07","arxiv_id":"2311.03780","repositories_listed":1,"syntology":null},{"url":"/paper/better-together-enhancing-generative","slug":"better-together-enhancing-generative","title":"Better Together: Enhancing Generative Knowledge Graph Completion with Language Models and Neighborhood Information","date":"2023-11-02","arxiv_id":"2311.01326","repositories_listed":1,"syntology":null},{"url":"/paper/distance-based-propagation-for-efficient","slug":"distance-based-propagation-for-efficient","title":"Distance-Based Propagation for Efficient Knowledge Graph Reasoning","date":"2023-11-02","arxiv_id":"2311.01024","repositories_listed":1,"syntology":null},{"url":"/paper/re-temp-relation-aware-temporal","slug":"re-temp-relation-aware-temporal","title":"Re-Temp: Relation-Aware Temporal Representation Learning for Temporal Knowledge Graph Completion","date":"2023-10-24","arxiv_id":"2310.15722","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/cp-kgc-constrained-prompt-knowledge-graph","slug":"cp-kgc-constrained-prompt-knowledge-graph","title":"Enhancing Text-based Knowledge Graph Completion with Zero-Shot Large Language Models: A Focus on Semantic Enhancement","date":"2023-10-12","arxiv_id":"2310.08279","repositories_listed":1,"syntology":null},{"url":"/paper/making-large-language-models-perform-better","slug":"making-large-language-models-perform-better","title":"Making Large Language Models Perform Better in Knowledge Graph Completion","date":"2023-10-10","arxiv_id":"2310.06671","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/making-large-language-models-perform-better#ran","syntology_url":"https://syntology.ai/paper/2310.06671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06671"}},"official":{"repos":["zjukg/kopa"],"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":["official"]}}},{"url":"/paper/an-investigation-of-llms-inefficacy-in","slug":"an-investigation-of-llms-inefficacy-in","title":"An Investigation of LLMs' Inefficacy in Understanding Converse Relations","date":"2023-10-08","arxiv_id":"2310.05163","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-pre-trained-language-models-for-2","slug":"leveraging-pre-trained-language-models-for-2","title":"Leveraging Pre-trained Language Models for Time Interval Prediction in Text-Enhanced Temporal Knowledge Graphs","date":"2023-09-28","arxiv_id":"2309.16357","repositories_listed":1,"syntology":null},{"url":"/paper/kermit-knowledge-graph-completion-of-enhanced","slug":"kermit-knowledge-graph-completion-of-enhanced","title":"KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation","date":"2023-09-26","arxiv_id":"2309.14770","repositories_listed":1,"syntology":null},{"url":"/paper/prior-bilinear-based-models-for-knowledge","slug":"prior-bilinear-based-models-for-knowledge","title":"Prior Bilinear Based Models for Knowledge Graph Completion","date":"2023-09-25","arxiv_id":"2309.13834","repositories_listed":1,"syntology":null}],"syntology_records":22,"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":2,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/knowledge-graph-completion-on-fb15k-237","since_archive":"/sota/knowledge-graph-completion-on-fb15k-237#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/knowledge-graph-completion-on-wn18rr","since_archive":"/sota/knowledge-graph-completion-on-wn18rr#since-judged","papers_judged":2,"placed":0}]},"papers_where_code_ran":47,"papers_where_code_ran_first_page":"/task/knowledge-graph-completion/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-completion/papers/2","json":"/task/knowledge-graph-completion/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/knowledge-graph-completion/papers/3","json":"/task/knowledge-graph-completion/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/knowledge-graph-completion/papers/4","json":"/task/knowledge-graph-completion/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/knowledge-graph-completion/papers/5","json":"/task/knowledge-graph-completion/papers/5.json","rows":82},{"order":"ran","page":1,"of":1,"url":"/task/knowledge-graph-completion/papers/ran/1","json":"/task/knowledge-graph-completion/papers/ran/1.json","rows":47}],"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":"52184128093ce7f8d8a755cf5fc06c35244eed8b3d6280b8ee7b9221837286e8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}