{"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-graphs","name":"Knowledge Graphs","slug":"knowledge-graphs","description_markdown":"A knowledge graph is a structured representation of information that organizes data into nodes (entities) and edges (relationships) to show how different pieces of knowledge are interconnected. It enables enhanced data integration, search, and inference by modeling the relationships between concepts and entities in a graph format.","categories":[{"name":"Graphs","url":"/area/graphs"},{"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":2974,"papers_with_code":1273,"benchmarks":4,"benchmark_tables_in_archive":4,"benchmark_tables_shown":4,"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":46,"subtasks":5,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/knowledge-graphs-on-mars-multimodal","slug":"knowledge-graphs-on-mars-multimodal","dataset":"MARS (Multimodal Analogical Reasoning dataSet)","dataset_url":"/dataset/mars-multimodal-analogical-reasoning-dataset","rows_in_archive":8,"metrics":["MRR"],"first_row_in_archive_order":{"model":"MarT_MKGformer","paper_title":"Multimodal Analogical Reasoning over Knowledge Graphs","paper_url":"/paper/multimodal-analogical-reasoning-over","paper_date":"2022-10-01","arxiv_id":"2210.00312","code_links":[{"title":"zjunlp/MKGformer","url":"https://github.com/zjunlp/MKGformer"},{"title":"zjunlp/MKG_Analogy","url":"https://github.com/zjunlp/MKG_Analogy"}],"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"]}}}},{"leaderboard":"/sota/knowledge-graphs-on-jerichoworld","slug":"knowledge-graphs-on-jerichoworld","dataset":"JerichoWorld","dataset_url":"/dataset/jerichoworld","rows_in_archive":5,"metrics":["Set accuracy"],"first_row_in_archive_order":{"model":"Worldformer","paper_title":"Learning Knowledge Graph-based World Models of Textual Environments","paper_url":"/paper/learning-knowledge-graph-based-world-models","paper_date":"2021-06-17","arxiv_id":"2106.09608","code_links":[],"syntology":null}},{"leaderboard":"/sota/knowledge-graphs-on-wikikg90m-lsc","slug":"knowledge-graphs-on-wikikg90m-lsc","dataset":"WikiKG90M-LSC","dataset_url":"/dataset/ogb-lsc","rows_in_archive":4,"metrics":["Test MRR","Validation MRR"],"first_row_in_archive_order":{"model":"TransE-Concat","paper_title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","paper_url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","paper_date":"2021-03-17","arxiv_id":"2103.09430","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/ogb_lsc"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb"},{"title":"graphcore/ogb-lsc-pcqm4mv2","url":"https://github.com/graphcore/ogb-lsc-pcqm4mv2"},{"title":"shamim-hussain/egt","url":"https://github.com/shamim-hussain/egt"},{"title":"graphcore/distributed-kge-poplar","url":"https://github.com/graphcore/distributed-kge-poplar"},{"title":"lars-research/3d-pgt","url":"https://github.com/lars-research/3d-pgt"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graphs-on-fb15k","slug":"knowledge-graphs-on-fb15k","dataset":"FB15k","dataset_url":"/dataset/fb15k","rows_in_archive":2,"metrics":["MRR"],"first_row_in_archive_order":{"model":"HHolE","paper_title":"Augmenting Compositional Models for Knowledge Base Completion Using Gradient Representations","paper_url":"/paper/augmenting-compositional-models-for-knowledge","paper_date":"2018-11-02","arxiv_id":"1811.01062","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/conceptnet","name":"ConceptNet","full_name":"","num_papers_in_archive":852},{"url":"/dataset/fb15k","name":"FB15k","full_name":"Freebase 15K","num_papers_in_archive":641},{"url":"/dataset/atomic","name":"ATOMIC","full_name":"","num_papers_in_archive":170},{"url":"/dataset/cord-19","name":"CORD-19","full_name":"CORD-19","num_papers_in_archive":163},{"url":"/dataset/redial","name":"ReDial","full_name":"","num_papers_in_archive":105},{"url":"/dataset/metaqa","name":"MetaQA","full_name":"MoviE Text Audio QA","num_papers_in_archive":81},{"url":"/dataset/semantic-scholar","name":"Semantic Scholar","full_name":"Semantic Scholar","num_papers_in_archive":75},{"url":"/dataset/dbp15k","name":"DBP15K","full_name":"DBP15K","num_papers_in_archive":65},{"url":"/dataset/complexwebquestions","name":"ComplexWebQuestions","full_name":"ComplexWebQuestions","num_papers_in_archive":62},{"url":"/dataset/opendialkg","name":"OpenDialKG","full_name":"","num_papers_in_archive":55},{"url":"/dataset/jericho","name":"Jericho","full_name":"","num_papers_in_archive":54},{"url":"/dataset/mmkg","name":"MMKG","full_name":"","num_papers_in_archive":49},{"url":"/dataset/csqa","name":"CSQA","full_name":"","num_papers_in_archive":40},{"url":"/dataset/ogb-lsc","name":"OGB-LSC","full_name":"OGB Large-Scale Challenge","num_papers_in_archive":34},{"url":"/dataset/holl-e","name":"Holl-E","full_name":"","num_papers_in_archive":30},{"url":"/dataset/robocup","name":"RoboCup","full_name":"RoboCup","num_papers_in_archive":20},{"url":"/dataset/webchild","name":"WebChild","full_name":"","num_papers_in_archive":20},{"url":"/dataset/agriculture-vision","name":"Agriculture-Vision","full_name":"","num_papers_in_archive":18},{"url":"/dataset/kinship","name":"Kinship","full_name":null,"num_papers_in_archive":10},{"url":"/dataset/wikiconv","name":"WikiConv","full_name":"","num_papers_in_archive":10},{"url":"/dataset/semeval-2021-task-11-nlpcontributiongraph","name":"SemEval-2021 Task-11","full_name":"","num_papers_in_archive":8},{"url":"/dataset/forecastqa","name":"ForecastQA","full_name":"","num_papers_in_archive":7},{"url":"/dataset/jerichoworld","name":"JerichoWorld","full_name":"","num_papers_in_archive":6},{"url":"/dataset/knowledgenet","name":"KnowledgeNet","full_name":"KnowledgeNet","num_papers_in_archive":6},{"url":"/dataset/semopenalex","name":"SemOpenAlex","full_name":"","num_papers_in_archive":6},{"url":"/dataset/mmea-umvm","name":"UMVM","full_name":"","num_papers_in_archive":6},{"url":"/dataset/comfact","name":"ComFact","full_name":"","num_papers_in_archive":5},{"url":"/dataset/kg20c","name":"KG20C","full_name":"A scholarly knowledge graph benchmark dataset","num_papers_in_archive":5},{"url":"/dataset/organizational-graph","name":"Organizational Graph","full_name":"","num_papers_in_archive":5},{"url":"/dataset/worldkg","name":"WorldKG","full_name":"","num_papers_in_archive":5},{"url":"/dataset/fb15k-237-low","name":"FB15k-237-low","full_name":null,"num_papers_in_archive":3},{"url":"/dataset/wikiwiki","name":"WikiWiki","full_name":"","num_papers_in_archive":3},{"url":"/dataset/biographical","name":"Biographical","full_name":"Biographical: A Semi-Supervised Relation Extraction Dataset","num_papers_in_archive":2},{"url":"/dataset/cookie","name":"Cookie","full_name":"","num_papers_in_archive":2},{"url":"/dataset/simpledbpediaqa","name":"SimpleDBpediaQA","full_name":"","num_papers_in_archive":2},{"url":"/dataset/aiseckg","name":"AISECKG","full_name":"AISecKG: Knowledge Graph Dataset for Cybersecurity Education","num_papers_in_archive":1},{"url":"/dataset/compmix-ir","name":"CompMix-IR","full_name":"","num_papers_in_archive":1},{"url":"/dataset/dtbm","name":"DTBM","full_name":"Digital Twin Benchmark Model","num_papers_in_archive":1},{"url":"/dataset/ent-desc","name":"ENT-DESC","full_name":"","num_papers_in_archive":1},{"url":"/dataset/event-qa","name":"Event-QA","full_name":"","num_papers_in_archive":1},{"url":"/dataset/fb1-5m","name":"FB1.5M","full_name":null,"num_papers_in_archive":1},{"url":"/dataset/kacc","name":"KACC","full_name":"","num_papers_in_archive":1},{"url":"/dataset/mars-multimodal-analogical-reasoning-dataset","name":"MARS (Multimodal Analogical Reasoning dataSet)","full_name":"","num_papers_in_archive":1},{"url":"/dataset/orkg-qa","name":"ORKG-QA","full_name":"","num_papers_in_archive":1},{"url":"/dataset/textworld-kg","name":"TextWorld KG","full_name":null,"num_papers_in_archive":1},{"url":"/dataset/kg-dataset","name":"KG dataset","full_name":"","num_papers_in_archive":0}],"subtasks":[{"url":"/task/complex-query-answering","name":"Complex Query Answering"},{"url":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion"},{"url":"/task/open-knowledge-graph-canonicalization","name":"Open Knowledge Graph Canonicalization"},{"url":"/task/person-centric-knowledge-graphs","name":"Person-Centric Knowledge Graphs"},{"url":"/task/relational-pattern-learning","name":"Relational Pattern Learning"}],"parent_tasks":[{"url":"/task/large-language-model","name":"Large Language Model"}],"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":30,"rows_per_page":100,"shown":100,"of":2974,"of_with_code":1273,"tagged_in_all":2974,"counts":{"archive_papers_tagged":2974,"with_a_code_link":1273,"where_syntology_ran_a_sample":234,"not_listed_spam_title":0,"listed":2974,"listed_where_code_ran":234,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":204,"every_run_a_failure_of_syntologys_instrument":30,"listed_with_a_run_with_no_instrument_failure":204,"listed_every_run_a_failure_of_syntologys_instrument":30,"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/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":18,"n_constructed":3,"n_ran_checked":13,"n_instrument":5,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}},"official":{"repos":["tkipf/relational-gcn"],"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","unlocated"]}}},{"url":"/paper/open-graph-benchmark-datasets-for-machine","slug":"open-graph-benchmark-datasets-for-machine","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","date":"2020-05-02","arxiv_id":"2005.00687","repositories_listed":21,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/open-graph-benchmark-datasets-for-machine#ran","syntology_url":"https://syntology.ai/paper/2005.00687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00687"}},"official":{"repos":["snap-stanford/ogb"],"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/embedding-logical-queries-on-knowledge-graphs","slug":"embedding-logical-queries-on-knowledge-graphs","title":"Embedding Logical Queries on Knowledge Graphs","date":"2018-06-05","arxiv_id":"1806.01445","repositories_listed":12,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/embedding-logical-queries-on-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/1806.01445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01445"}},"official":{"repos":["williamleif/graphqembed"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/rotate-knowledge-graph-embedding-by","slug":"rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rotate-knowledge-graph-embedding-by#ran","syntology_url":"https://syntology.ai/paper/1902.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10197"}},"official":{"repos":["DeepGraphLearning/KnowledgeGraphEmbedding"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/beta-embeddings-for-multi-hop-logical","slug":"beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","arxiv_id":"2010.11465","repositories_listed":9,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/beta-embeddings-for-multi-hop-logical#ran","syntology_url":"https://syntology.ai/paper/2010.11465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11465"}},"official":null}},{"url":"/paper/query2box-reasoning-over-knowledge-graphs-in-1","slug":"query2box-reasoning-over-knowledge-graphs-in-1","title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","date":"2020-02-14","arxiv_id":"2002.05969","repositories_listed":9,"syntology":{"n":41,"n_ran":30,"n_constructed":13,"n_ran_checked":18,"n_instrument":12,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":17,"n_pointer_only":2,"phrase":"30 ran (of which 13 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 12 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/query2box-reasoning-over-knowledge-graphs-in-1#ran","syntology_url":"https://syntology.ai/paper/2002.05969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05969"}},"official":{"repos":["hyren/query2box"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"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/convolutional-2d-knowledge-graph-embeddings","slug":"convolutional-2d-knowledge-graph-embeddings","title":"Convolutional 2D Knowledge Graph Embeddings","date":"2017-07-05","arxiv_id":"1707.01476","repositories_listed":8,"syntology":null},{"url":"/paper/kgat-knowledge-graph-attention-network-for","slug":"kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","arxiv_id":"1905.07854","repositories_listed":7,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/kgat-knowledge-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1905.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07854"}},"official":{"repos":["xiangwang1223/knowledge_graph_attention_network"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"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/qa-gnn-reasoning-with-language-models-and","slug":"qa-gnn-reasoning-with-language-models-and","title":"QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering","date":"2021-04-13","arxiv_id":"2104.06378","repositories_listed":6,"syntology":{"n":25,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":17,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/qa-gnn-reasoning-with-language-models-and#ran","syntology_url":"https://syntology.ai/paper/2104.06378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06378"}},"official":{"repos":["michiyasunaga/qagnn","worksheets.codalab.org/worksheets/0xf215deb05edf44a2ac353c711f52a25f"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","slug":"ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","repositories_listed":6,"syntology":null},{"url":"/paper/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","repositories_listed":6,"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/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}},"official":null}},{"url":"/paper/complex-query-answering-with-neural-link-1","slug":"complex-query-answering-with-neural-link-1","title":"Complex Query Answering with Neural Link Predictors","date":"2020-11-06","arxiv_id":"2011.03459","repositories_listed":5,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/complex-query-answering-with-neural-link-1#ran","syntology_url":"https://syntology.ai/paper/2011.03459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03459"}},"official":{"repos":["uclnlp/cqd"],"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/rnnlogic-learning-logic-rules-for-reasoning-1","slug":"rnnlogic-learning-logic-rules-for-reasoning-1","title":"RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs","date":"2020-10-08","arxiv_id":"2010.04029","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rnnlogic-learning-logic-rules-for-reasoning-1#ran","syntology_url":"https://syntology.ai/paper/2010.04029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04029"}},"official":{"repos":["DeepGraphLearning/RNNLogic"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mmkg-multi-modal-knowledge-graphs","slug":"mmkg-multi-modal-knowledge-graphs","title":"MMKG: Multi-Modal Knowledge Graphs","date":"2019-03-13","arxiv_id":"1903.05485","repositories_listed":5,"syntology":null},{"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/x-lora-mixture-of-low-rank-adapter-experts-a","slug":"x-lora-mixture-of-low-rank-adapter-experts-a","title":"X-LoRA: Mixture of Low-Rank Adapter Experts, a Flexible Framework for Large Language Models with Applications in Protein Mechanics and Molecular Design","date":"2024-02-11","arxiv_id":"2402.07148","repositories_listed":4,"syntology":null},{"url":"/paper/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","repositories_listed":4,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}},"official":{"repos":["tranhungnghiep/meim-kge"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/nodepiece-compositional-and-parameter","slug":"nodepiece-compositional-and-parameter","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","date":"2021-06-23","arxiv_id":"2106.12144","repositories_listed":4,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/nodepiece-compositional-and-parameter#ran","syntology_url":"https://syntology.ai/paper/2106.12144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12144"}},"official":{"repos":["migalkin/NodePiece"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/logic-embeddings-for-complex-query-answering","slug":"logic-embeddings-for-complex-query-answering","title":"Logic Embeddings for Complex Query Answering","date":"2021-02-28","arxiv_id":"2103.00418","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/logic-embeddings-for-complex-query-answering#ran","syntology_url":"https://syntology.ai/paper/2103.00418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.00418"}},"official":{"repos":["francoisluus/KGReasoning"],"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":["unlocated"]}}},{"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/holographic-embeddings-of-knowledge-graphs","slug":"holographic-embeddings-of-knowledge-graphs","title":"Holographic Embeddings of Knowledge Graphs","date":"2015-10-16","arxiv_id":"1510.04935","repositories_listed":4,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/holographic-embeddings-of-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/1510.04935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.04935"}},"official":null}},{"url":"/paper/tgb-2-0-a-benchmark-for-learning-on-temporal","slug":"tgb-2-0-a-benchmark-for-learning-on-temporal","title":"TGB 2.0: A Benchmark for Learning on Temporal Knowledge Graphs and Heterogeneous Graphs","date":"2024-06-14","arxiv_id":"2406.09639","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/tgb-2-0-a-benchmark-for-learning-on-temporal#ran","syntology_url":"https://syntology.ai/paper/2406.09639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09639"}},"official":{"repos":["erfanloghmani/myket-android-application-market-dataset","juliagast/tgb2","shenyanghuang/tgb"],"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/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/think-on-graph-deep-and-responsible-reasoning","slug":"think-on-graph-deep-and-responsible-reasoning","title":"Think-on-Graph: Deep and Responsible Reasoning of Large Language Model on Knowledge Graph","date":"2023-07-15","arxiv_id":"2307.07697","repositories_listed":3,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":3,"n_no_contract":6,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 3 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/think-on-graph-deep-and-responsible-reasoning#ran","syntology_url":"https://syntology.ai/paper/2307.07697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07697"}},"official":{"repos":["gasolsun36/tog","idea-finai/tog"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["community","official"]}}},{"url":"/paper/step-by-step-a-hierarchical-framework-for","slug":"step-by-step-a-hierarchical-framework-for","title":"Step by step: a hierarchical framework for multi-hop knowledge graph reasoning with reinforcement learning","date":"2022-07-19","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/tempoqr-temporal-question-reasoning-over","slug":"tempoqr-temporal-question-reasoning-over","title":"TempoQR: Temporal Question Reasoning over Knowledge Graphs","date":"2021-12-10","arxiv_id":"2112.05785","repositories_listed":3,"syntology":null},{"url":"/paper/vogue-answer-verbalization-through-multi-task","slug":"vogue-answer-verbalization-through-multi-task","title":"VOGUE: Answer Verbalization through Multi-Task Learning","date":"2021-06-24","arxiv_id":"2106.13316","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/raga-relation-aware-graph-attention-networks","slug":"raga-relation-aware-graph-attention-networks","title":"RAGA: Relation-aware Graph Attention Networks for Global Entity Alignment","date":"2021-03-01","arxiv_id":"2103.00791","repositories_listed":3,"syntology":null},{"url":"/paper/a-generalization-of-transformer-networks-to","slug":"a-generalization-of-transformer-networks-to","title":"A Generalization of Transformer Networks to Graphs","date":"2020-12-17","arxiv_id":"2012.09699","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-generalization-of-transformer-networks-to#ran","syntology_url":"https://syntology.ai/paper/2012.09699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09699"}},"official":{"repos":["graphdeeplearning/graphtransformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/comet-atomic-2020-on-symbolic-and-neural","slug":"comet-atomic-2020-on-symbolic-and-neural","title":"COMET-ATOMIC 2020: On Symbolic and Neural Commonsense Knowledge Graphs","date":"2020-10-12","arxiv_id":"2010.05953","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/comet-atomic-2020-on-symbolic-and-neural#ran","syntology_url":"https://syntology.ai/paper/2010.05953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05953"}},"official":{"repos":["allenai/comet-atomic-2020"],"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/investigating-pretrained-language-models-for","slug":"investigating-pretrained-language-models-for","title":"Investigating Pretrained Language Models for Graph-to-Text Generation","date":"2020-07-16","arxiv_id":"2007.08426","repositories_listed":3,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"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) · 3 unverified","sample_list":"/paper/investigating-pretrained-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2007.08426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08426"}},"official":{"repos":["UKPLab/plms-graph2text"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/zero-shot-learning-with-common-sense","slug":"zero-shot-learning-with-common-sense","title":"Zero-Shot Learning with Common Sense Knowledge Graphs","date":"2020-06-18","arxiv_id":"2006.10713","repositories_listed":3,"syntology":null},{"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/stochastic-shared-embeddings-data-driven","slug":"stochastic-shared-embeddings-data-driven","title":"Stochastic Shared Embeddings: Data-driven Regularization of Embedding Layers","date":"2019-05-25","arxiv_id":"1905.10630","repositories_listed":3,"syntology":null},{"url":"/paper/aser-a-large-scale-eventuality-knowledge","slug":"aser-a-large-scale-eventuality-knowledge","title":"ASER: A Large-scale Eventuality Knowledge Graph","date":"2019-05-01","arxiv_id":"1905.00270","repositories_listed":3,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 3 unverified","sample_list":"/paper/aser-a-large-scale-eventuality-knowledge#ran","syntology_url":"https://syntology.ai/paper/1905.00270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00270"}},"official":{"repos":["HKUST-KnowComp/ASER"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/text-generation-from-knowledge-graphs-with","slug":"text-generation-from-knowledge-graphs-with","title":"Text Generation from Knowledge Graphs with Graph Transformers","date":"2019-04-04","arxiv_id":"1904.02342","repositories_listed":3,"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/text-generation-from-knowledge-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1904.02342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02342"}},"official":{"repos":["rikdz/GraphWriter"],"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":["official"]}}},{"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/no-one-is-perfect-analysing-the-performance","slug":"no-one-is-perfect-analysing-the-performance","title":"No One is Perfect: Analysing the Performance of Question Answering Components over the DBpedia Knowledge Graph","date":"2018-09-26","arxiv_id":"1809.10044","repositories_listed":3,"syntology":null},{"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/multi-hop-knowledge-graph-reasoning-with","slug":"multi-hop-knowledge-graph-reasoning-with","title":"Multi-Hop Knowledge Graph Reasoning with Reward Shaping","date":"2018-08-31","arxiv_id":"1808.10568","repositories_listed":3,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/multi-hop-knowledge-graph-reasoning-with#ran","syntology_url":"https://syntology.ai/paper/1808.10568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10568"}},"official":{"repos":["salesforce/MultiHopKG"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/zero-shot-recognition-via-semantic-embeddings","slug":"zero-shot-recognition-via-semantic-embeddings","title":"Zero-shot Recognition via Semantic Embeddings and Knowledge Graphs","date":"2018-03-21","arxiv_id":"1803.08035","repositories_listed":3,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/zero-shot-recognition-via-semantic-embeddings#ran","syntology_url":"https://syntology.ai/paper/1803.08035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08035"}},"official":null}},{"url":"/paper/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kbgan-adversarial-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1711.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04071"}},"official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/structural-alignment-in-link-prediction","slug":"structural-alignment-in-link-prediction","title":"Structural Alignment in Link Prediction","date":"2025-05-08","arxiv_id":"2505.04939","repositories_listed":2,"syntology":null},{"url":"/paper/ras-retrieval-and-structuring-for-knowledge","slug":"ras-retrieval-and-structuring-for-knowledge","title":"RAS: Retrieval-And-Structuring for Knowledge-Intensive LLM Generation","date":"2025-02-16","arxiv_id":"2502.10996","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/ras-retrieval-and-structuring-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2502.10996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10996"}},"official":{"repos":["pat-jj/ras","pat-jj/Retrieval-And-Structure"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["community","official"]}}},{"url":"/paper/plan-on-graph-self-correcting-adaptive","slug":"plan-on-graph-self-correcting-adaptive","title":"Plan-on-Graph: Self-Correcting Adaptive Planning of Large Language Model on Knowledge Graphs","date":"2024-10-31","arxiv_id":"2410.23875","repositories_listed":2,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":9,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/plan-on-graph-self-correcting-adaptive#ran","syntology_url":"https://syntology.ai/paper/2410.23875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23875"}},"official":{"repos":["liyichen-cly/pog"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-high-order-interaction-awareness-in","slug":"enhancing-high-order-interaction-awareness-in","title":"Enhancing High-order Interaction Awareness in LLM-based Recommender Model","date":"2024-09-30","arxiv_id":"2409.19979","repositories_listed":2,"syntology":null},{"url":"/paper/assessing-sparql-capabilities-of-large","slug":"assessing-sparql-capabilities-of-large","title":"Assessing SPARQL capabilities of Large Language Models","date":"2024-09-09","arxiv_id":"2409.05925","repositories_listed":2,"syntology":null},{"url":"/paper/sciagents-automating-scientific-discovery","slug":"sciagents-automating-scientific-discovery","title":"SciAgents: Automating scientific discovery through multi-agent intelligent graph reasoning","date":"2024-09-09","arxiv_id":"2409.05556","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sciagents-automating-scientific-discovery#ran","syntology_url":"https://syntology.ai/paper/2409.05556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05556"}},"official":{"repos":["lamm-mit/SciAgentsDiscovery"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vhakg-a-multi-modal-knowledge-graph-based-on","slug":"vhakg-a-multi-modal-knowledge-graph-based-on","title":"VHAKG: A Multi-modal Knowledge Graph Based on Synchronized Multi-view Videos of Daily Activities","date":"2024-08-27","arxiv_id":"2408.14895","repositories_listed":2,"syntology":null},{"url":"/paper/hipporag-neurobiologically-inspired-long-term","slug":"hipporag-neurobiologically-inspired-long-term","title":"HippoRAG: Neurobiologically Inspired Long-Term Memory for Large Language Models","date":"2024-05-23","arxiv_id":"2405.14831","repositories_listed":2,"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/hipporag-neurobiologically-inspired-long-term#ran","syntology_url":"https://syntology.ai/paper/2405.14831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14831"}},"official":{"repos":["osu-nlp-group/hipporag"],"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/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/asgea-exploiting-logic-rules-from-align","slug":"asgea-exploiting-logic-rules-from-align","title":"ASGEA: Exploiting Logic Rules from Align-Subgraphs for Entity Alignment","date":"2024-02-16","arxiv_id":"2402.11000","repositories_listed":2,"syntology":null},{"url":"/paper/forecasting-high-impact-research-topics-via","slug":"forecasting-high-impact-research-topics-via","title":"Forecasting high-impact research topics via machine learning on evolving knowledge graphs","date":"2024-02-13","arxiv_id":"2402.08640","repositories_listed":2,"syntology":null},{"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/generating-explanations-to-understand-and","slug":"generating-explanations-to-understand-and","title":"Generating Explanations to Understand and Repair Embedding-based Entity Alignment","date":"2023-12-08","arxiv_id":"2312.04877","repositories_listed":2,"syntology":null},{"url":"/paper/constructing-temporal-dynamic-knowledge","slug":"constructing-temporal-dynamic-knowledge","title":"Constructing Temporal Dynamic Knowledge Graphs from Interactive Text-based Games","date":"2023-11-03","arxiv_id":"2311.01928","repositories_listed":2,"syntology":null},{"url":"/paper/dkec-domain-knowledge-enhanced-multi-label","slug":"dkec-domain-knowledge-enhanced-multi-label","title":"DKEC: Domain Knowledge Enhanced Multi-Label Classification for Diagnosis Prediction","date":"2023-10-10","arxiv_id":"2310.07059","repositories_listed":2,"syntology":null},{"url":"/paper/developing-a-scalable-benchmark-for-assessing","slug":"developing-a-scalable-benchmark-for-assessing","title":"Developing a Scalable Benchmark for Assessing Large Language Models in Knowledge Graph Engineering","date":"2023-08-31","arxiv_id":"2308.16622","repositories_listed":2,"syntology":null},{"url":"/paper/darwin-series-domain-specific-large-language","slug":"darwin-series-domain-specific-large-language","title":"DARWIN Series: Domain Specific Large Language Models for Natural Science","date":"2023-08-25","arxiv_id":"2308.13565","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/darwin-series-domain-specific-large-language#ran","syntology_url":"https://syntology.ai/paper/2308.13565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13565"}},"official":{"repos":["masterai-eam/darwin","masterai-eam/scicrawler"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/towards-populating-generalizable-engineering","slug":"towards-populating-generalizable-engineering","title":"Retrieval Augmented Generation using Engineering Design Knowledge","date":"2023-07-13","arxiv_id":"2307.06985","repositories_listed":2,"syntology":null},{"url":"/paper/streame-learning-to-update-representations","slug":"streame-learning-to-update-representations","title":"StreamE: Learning to Update Representations for Temporal Knowledge Graphs in Streaming Scenarios","date":"2023-07-01","arxiv_id":null,"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/molfm-a-multimodal-molecular-foundation-model","slug":"molfm-a-multimodal-molecular-foundation-model","title":"MolFM: A Multimodal Molecular Foundation Model","date":"2023-06-06","arxiv_id":"2307.09484","repositories_listed":2,"syntology":null},{"url":"/paper/pk-chat-pointer-network-guided-knowledge","slug":"pk-chat-pointer-network-guided-knowledge","title":"PK-Chat: Pointer Network Guided Knowledge Driven Generative Dialogue Model","date":"2023-04-02","arxiv_id":"2304.00592","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/box-2-el-concept-and-role-box-embeddings-for","slug":"box-2-el-concept-and-role-box-embeddings-for","title":"Dual Box Embeddings for the Description Logic EL++","date":"2023-01-26","arxiv_id":"2301.11118","repositories_listed":2,"syntology":null},{"url":"/paper/indegx-a-model-and-a-framework-for-indexing","slug":"indegx-a-model-and-a-framework-for-indexing","title":"IndeGx: A Model and a Framework for Indexing RDF Knowledge Graphs with SPARQL-based Test Suits","date":"2023-01-23","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/causalgraph-a-python-package-for-modeling","slug":"causalgraph-a-python-package-for-modeling","title":"causalgraph: A Python Package for Modeling, Persisting and Visualizing Causal Graphs Embedded in Knowledge Graphs","date":"2023-01-20","arxiv_id":"2301.08490","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/there-is-no-big-brother-or-small-brother","slug":"there-is-no-big-brother-or-small-brother","title":"There is No Big Brother or Small Brother: Knowledge Infusion in Language Models for Link Prediction and Question Answering","date":"2023-01-10","arxiv_id":"2301.04013","repositories_listed":2,"syntology":null},{"url":"/paper/deep-bidirectional-language-knowledge-graph","slug":"deep-bidirectional-language-knowledge-graph","title":"Deep Bidirectional Language-Knowledge Graph Pretraining","date":"2022-10-17","arxiv_id":"2210.09338","repositories_listed":2,"syntology":{"n":18,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":9,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/deep-bidirectional-language-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2210.09338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09338"}},"official":{"repos":["michiyasunaga/dragon"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["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/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/adversarial-robustness-of-representation","slug":"adversarial-robustness-of-representation","title":"Adversarial Robustness of Representation Learning for Knowledge Graphs","date":"2022-09-30","arxiv_id":"2210.00122","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-knowledge-graph-reasoning-for-multi","slug":"inductive-knowledge-graph-reasoning-for-multi","title":"Inductive Knowledge Graph Reasoning for Multi-batch Emerging Entities","date":"2022-08-22","arxiv_id":"2208.10378","repositories_listed":2,"syntology":null},{"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/bertnet-harvesting-knowledge-graphs-from","slug":"bertnet-harvesting-knowledge-graphs-from","title":"BertNet: Harvesting Knowledge Graphs with Arbitrary Relations from Pretrained Language Models","date":"2022-06-28","arxiv_id":"2206.14268","repositories_listed":2,"syntology":null},{"url":"/paper/a-net-a-scalable-path-based-reasoning-1","slug":"a-net-a-scalable-path-based-reasoning-1","title":"A*Net: A Scalable Path-based Reasoning Approach for Knowledge Graphs","date":"2022-06-07","arxiv_id":"2206.04798","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-net-a-scalable-path-based-reasoning-1#ran","syntology_url":"https://syntology.ai/paper/2206.04798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04798"}},"official":{"repos":["deepgraphlearning/astarnet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-adaptive-propagation-for-knowledge","slug":"learning-adaptive-propagation-for-knowledge","title":"AdaProp: Learning Adaptive Propagation for Graph Neural Network based Knowledge Graph Reasoning","date":"2022-05-30","arxiv_id":"2205.15319","repositories_listed":2,"syntology":null},{"url":"/paper/stargraph-a-coarse-to-fine-representation","slug":"stargraph-a-coarse-to-fine-representation","title":"StarGraph: Knowledge Representation Learning based on Incomplete Two-hop Subgraph","date":"2022-05-27","arxiv_id":"2205.14209","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":4,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stargraph-a-coarse-to-fine-representation#ran","syntology_url":"https://syntology.ai/paper/2205.14209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14209"}},"official":{"repos":["hzli-ucas/stargraph"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/clusterea-scalable-entity-alignment-with","slug":"clusterea-scalable-entity-alignment-with","title":"ClusterEA: Scalable Entity Alignment with Stochastic Training and Normalized Mini-batch Similarities","date":"2022-05-20","arxiv_id":"2205.10312","repositories_listed":2,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/clusterea-scalable-entity-alignment-with#ran","syntology_url":"https://syntology.ai/paper/2205.10312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10312"}},"official":{"repos":["joker-xii/clusterea"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"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/eablock-a-declarative-entity-alignment-block","slug":"eablock-a-declarative-entity-alignment-block","title":"EABlock: A Declarative Entity Alignment Block for Knowledge Graph Creation Pipelines","date":"2021-12-14","arxiv_id":"2112.07493","repositories_listed":2,"syntology":null},{"url":"/paper/mplr-a-novel-model-for-multi-target-learning","slug":"mplr-a-novel-model-for-multi-target-learning","title":"An original model for multi-target learning of logical rules for knowledge graph reasoning","date":"2021-12-12","arxiv_id":"2112.06189","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/outlining-and-filling-hierarchical-query","slug":"outlining-and-filling-hierarchical-query","title":"Outlining and Filling: Hierarchical Query Graph Generation for Answering Complex Questions over Knowledge Graphs","date":"2021-11-01","arxiv_id":"2111.00732","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/knowledge-graph-informed-fake-news","slug":"knowledge-graph-informed-fake-news","title":"Knowledge Graph informed Fake News Classification via Heterogeneous Representation Ensembles","date":"2021-10-20","arxiv_id":"2110.10457","repositories_listed":2,"syntology":null},{"url":"/paper/benchmarking-the-combinatorial","slug":"benchmarking-the-combinatorial","title":"Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphs","date":"2021-09-18","arxiv_id":"2109.08925","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/benchmarking-the-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2109.08925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08925"}},"official":{"repos":["hkust-knowcomp/efo-1-qa-benchmark"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/robust-retrieval-augmented-generation-for","slug":"robust-retrieval-augmented-generation-for","title":"Robust Retrieval Augmented Generation for Zero-shot Slot Filling","date":"2021-08-31","arxiv_id":"2108.13934","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-retrieval-augmented-generation-for#ran","syntology_url":"https://syntology.ai/paper/2108.13934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13934"}},"official":{"repos":["ibm/kgi-slot-filling"],"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/scalable-end-to-end-training-of-knowledge","slug":"scalable-end-to-end-training-of-knowledge","title":"AR-BERT: Aspect-relation enhanced Aspect-level Sentiment Classification with Multi-modal Explanations","date":"2021-08-26","arxiv_id":"2108.11656","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/fuzzy-logic-based-logical-query-answering-on","slug":"fuzzy-logic-based-logical-query-answering-on","title":"Fuzzy Logic Based Logical Query Answering on Knowledge Graphs","date":"2021-08-05","arxiv_id":"2108.02390","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"8 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fuzzy-logic-based-logical-query-answering-on#ran","syntology_url":"https://syntology.ai/paper/2108.02390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.02390"}},"official":null}},{"url":"/paper/zero-shot-visual-question-answering-using","slug":"zero-shot-visual-question-answering-using","title":"Zero-shot Visual Question Answering using Knowledge Graph","date":"2021-07-12","arxiv_id":"2107.05348","repositories_listed":2,"syntology":null}],"syntology_records":44,"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":234,"papers_where_code_ran_first_page":"/task/knowledge-graphs/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":30,"url":"/task/knowledge-graphs/papers/2","json":"/task/knowledge-graphs/papers/2.json","rows":100},{"order":"archive","page":3,"of":30,"url":"/task/knowledge-graphs/papers/3","json":"/task/knowledge-graphs/papers/3.json","rows":100},{"order":"archive","page":4,"of":30,"url":"/task/knowledge-graphs/papers/4","json":"/task/knowledge-graphs/papers/4.json","rows":100},{"order":"archive","page":5,"of":30,"url":"/task/knowledge-graphs/papers/5","json":"/task/knowledge-graphs/papers/5.json","rows":100},{"order":"archive","page":6,"of":30,"url":"/task/knowledge-graphs/papers/6","json":"/task/knowledge-graphs/papers/6.json","rows":100},{"order":"archive","page":7,"of":30,"url":"/task/knowledge-graphs/papers/7","json":"/task/knowledge-graphs/papers/7.json","rows":100},{"order":"archive","page":8,"of":30,"url":"/task/knowledge-graphs/papers/8","json":"/task/knowledge-graphs/papers/8.json","rows":100},{"order":"archive","page":9,"of":30,"url":"/task/knowledge-graphs/papers/9","json":"/task/knowledge-graphs/papers/9.json","rows":100},{"order":"archive","page":10,"of":30,"url":"/task/knowledge-graphs/papers/10","json":"/task/knowledge-graphs/papers/10.json","rows":100},{"order":"archive","page":11,"of":30,"url":"/task/knowledge-graphs/papers/11","json":"/task/knowledge-graphs/papers/11.json","rows":100},{"order":"archive","page":12,"of":30,"url":"/task/knowledge-graphs/papers/12","json":"/task/knowledge-graphs/papers/12.json","rows":100},{"order":"archive","page":13,"of":30,"url":"/task/knowledge-graphs/papers/13","json":"/task/knowledge-graphs/papers/13.json","rows":100},{"order":"archive","page":14,"of":30,"url":"/task/knowledge-graphs/papers/14","json":"/task/knowledge-graphs/papers/14.json","rows":100},{"order":"archive","page":15,"of":30,"url":"/task/knowledge-graphs/papers/15","json":"/task/knowledge-graphs/papers/15.json","rows":100},{"order":"archive","page":16,"of":30,"url":"/task/knowledge-graphs/papers/16","json":"/task/knowledge-graphs/papers/16.json","rows":100},{"order":"archive","page":17,"of":30,"url":"/task/knowledge-graphs/papers/17","json":"/task/knowledge-graphs/papers/17.json","rows":100},{"order":"archive","page":18,"of":30,"url":"/task/knowledge-graphs/papers/18","json":"/task/knowledge-graphs/papers/18.json","rows":100},{"order":"archive","page":19,"of":30,"url":"/task/knowledge-graphs/papers/19","json":"/task/knowledge-graphs/papers/19.json","rows":100},{"order":"archive","page":20,"of":30,"url":"/task/knowledge-graphs/papers/20","json":"/task/knowledge-graphs/papers/20.json","rows":100},{"order":"archive","page":21,"of":30,"url":"/task/knowledge-graphs/papers/21","json":"/task/knowledge-graphs/papers/21.json","rows":100},{"order":"archive","page":22,"of":30,"url":"/task/knowledge-graphs/papers/22","json":"/task/knowledge-graphs/papers/22.json","rows":100},{"order":"archive","page":23,"of":30,"url":"/task/knowledge-graphs/papers/23","json":"/task/knowledge-graphs/papers/23.json","rows":100},{"order":"archive","page":24,"of":30,"url":"/task/knowledge-graphs/papers/24","json":"/task/knowledge-graphs/papers/24.json","rows":100},{"order":"archive","page":25,"of":30,"url":"/task/knowledge-graphs/papers/25","json":"/task/knowledge-graphs/papers/25.json","rows":100},{"order":"archive","page":26,"of":30,"url":"/task/knowledge-graphs/papers/26","json":"/task/knowledge-graphs/papers/26.json","rows":100},{"order":"archive","page":27,"of":30,"url":"/task/knowledge-graphs/papers/27","json":"/task/knowledge-graphs/papers/27.json","rows":100},{"order":"archive","page":28,"of":30,"url":"/task/knowledge-graphs/papers/28","json":"/task/knowledge-graphs/papers/28.json","rows":100},{"order":"archive","page":29,"of":30,"url":"/task/knowledge-graphs/papers/29","json":"/task/knowledge-graphs/papers/29.json","rows":100},{"order":"archive","page":30,"of":30,"url":"/task/knowledge-graphs/papers/30","json":"/task/knowledge-graphs/papers/30.json","rows":74},{"order":"ran","page":1,"of":3,"url":"/task/knowledge-graphs/papers/ran/1","json":"/task/knowledge-graphs/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":3,"url":"/task/knowledge-graphs/papers/ran/2","json":"/task/knowledge-graphs/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":3,"url":"/task/knowledge-graphs/papers/ran/3","json":"/task/knowledge-graphs/papers/ran/3.json","rows":34}],"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":"bda366d39b4394ccb2775d8c1587263ba29ac55c4c72f66e9f4e5a7a189076f6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}