{"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-base-completion","name":"Knowledge Base Completion","slug":"knowledge-base-completion","description_markdown":"Knowledge base completion is the task which automatically infers missing facts by reasoning about the information already present in the knowledge base. A knowledge base is a collection of relational\r\nfacts, often represented in the form of \"subject\", \"relation\", \"object\"-triples.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":156,"papers_with_code":69,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":2,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/aristo-v4","name":"Aristo-v4","full_name":"Aristo Tuple KB Version 4","num_papers_in_archive":1},{"url":"/dataset/zerokbc","name":"ZeroKBC","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/dynamic-graph-embedding","name":"Dynamic graph embedding"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":156,"of_with_code":69,"tagged_in_all":156,"counts":{"archive_papers_tagged":156,"with_a_code_link":69,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":156,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/canonical-tensor-decomposition-for-knowledge","slug":"canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","arxiv_id":"1806.07297","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/canonical-tensor-decomposition-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1806.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07297"}},"official":{"repos":["facebookresearch/kbc"],"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/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/lossless-compression-of-structured","slug":"lossless-compression-of-structured","title":"Lossless Compression of Structured Convolutional Models via Lifting","date":"2020-07-13","arxiv_id":"2007.06567","repositories_listed":2,"syntology":null},{"url":"/paper/tensor-decompositions-for-temporal-knowledge-1","slug":"tensor-decompositions-for-temporal-knowledge-1","title":"Tensor Decompositions for temporal knowledge base completion","date":"2020-04-10","arxiv_id":"2004.04926","repositories_listed":2,"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/tensor-decompositions-for-temporal-knowledge-1#ran","syntology_url":"https://syntology.ai/paper/2004.04926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04926"}},"official":{"repos":["facebookresearch/tkbc"],"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/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/embedding-multimodal-relational-data-for","slug":"embedding-multimodal-relational-data-for","title":"Embedding Multimodal Relational Data for Knowledge Base Completion","date":"2018-09-05","arxiv_id":"1809.01341","repositories_listed":2,"syntology":null},{"url":"/paper/a-novel-embedding-model-for-knowledge-base","slug":"a-novel-embedding-model-for-knowledge-base","title":"A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network","date":"2017-12-06","arxiv_id":"1712.02121","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/a-novel-embedding-model-for-knowledge-base#ran","syntology_url":"https://syntology.ai/paper/1712.02121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02121"}},"official":{"repos":["daiquocnguyen/ConvKB"],"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/kblrn-end-to-end-learning-of-knowledge-base","slug":"kblrn-end-to-end-learning-of-knowledge-base","title":"KBLRN : End-to-End Learning of Knowledge Base Representations with Latent, Relational, and Numerical Features","date":"2017-09-14","arxiv_id":"1709.04676","repositories_listed":2,"syntology":null},{"url":"/paper/joint-matrix-tensor-factorization-for","slug":"joint-matrix-tensor-factorization-for","title":"Joint Matrix-Tensor Factorization for Knowledge Base Inference","date":"2017-06-02","arxiv_id":"1706.00637","repositories_listed":2,"syntology":null},{"url":"/paper/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/traversing-knowledge-graphs-in-vector-space","slug":"traversing-knowledge-graphs-in-vector-space","title":"Traversing Knowledge Graphs in Vector Space","date":"2015-06-03","arxiv_id":"1506.01094","repositories_listed":2,"syntology":null},{"url":"/paper/combining-two-and-three-way-embeddings-models","slug":"combining-two-and-three-way-embeddings-models","title":"Combining Two And Three-Way Embeddings Models for Link Prediction in Knowledge Bases","date":"2015-06-02","arxiv_id":"1506.00999","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/dele-deductive-mathcal-el-thinspace","slug":"dele-deductive-mathcal-el-thinspace","title":"DELE: Deductive $\\mathcal{EL}^{++} \\thinspace $ Embeddings for Knowledge Base Completion","date":"2024-11-03","arxiv_id":"2411.01574","repositories_listed":1,"syntology":null},{"url":"/paper/do-llms-really-adapt-to-domains-an-ontology","slug":"do-llms-really-adapt-to-domains-an-ontology","title":"Do LLMs Really Adapt to Domains? An Ontology Learning Perspective","date":"2024-07-29","arxiv_id":"2407.19998","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/do-llms-really-adapt-to-domains-an-ontology#ran","syntology_url":"https://syntology.ai/paper/2407.19998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.19998"}},"official":{"repos":["boschresearch/llm-vs-gibberish-ontologies"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/pre-training-and-diagnosing-knowledge-base","slug":"pre-training-and-diagnosing-knowledge-base","title":"Pre-training and Diagnosing Knowledge Base Completion Models","date":"2024-01-27","arxiv_id":"2401.15439","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-base-completion-for-long-tail","slug":"knowledge-base-completion-for-long-tail","title":"Knowledge Base Completion for Long-Tail Entities","date":"2023-06-30","arxiv_id":"2306.17472","repositories_listed":1,"syntology":null},{"url":"/paper/cate-embedding-mathcal-alc-ontologies-using","slug":"cate-embedding-mathcal-alc-ontologies-using","title":"Lattice-preserving $\\mathcal{ALC}$ ontology embeddings with saturation","date":"2023-05-11","arxiv_id":"2305.07163","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-language-models-for-knowledge-base","slug":"evaluating-language-models-for-knowledge-base","title":"Evaluating Language Models for Knowledge Base Completion","date":"2023-03-20","arxiv_id":"2303.11082","repositories_listed":1,"syntology":null},{"url":"/paper/zerokbc-a-comprehensive-benchmark-for-zero","slug":"zerokbc-a-comprehensive-benchmark-for-zero","title":"ZeroKBC: A Comprehensive Benchmark for Zero-Shot Knowledge Base Completion","date":"2022-12-06","arxiv_id":"2212.03091","repositories_listed":1,"syntology":null},{"url":"/paper/instance-based-learning-for-knowledge-base","slug":"instance-based-learning-for-knowledge-base","title":"Instance-based Learning for Knowledge Base Completion","date":"2022-11-13","arxiv_id":"2211.06807","repositories_listed":1,"syntology":null},{"url":"/paper/mokb6-a-multilingual-open-knowledge-base","slug":"mokb6-a-multilingual-open-knowledge-base","title":"mOKB6: A Multilingual Open Knowledge Base Completion Benchmark","date":"2022-11-13","arxiv_id":"2211.06959","repositories_listed":1,"syntology":null},{"url":"/paper/robust-and-efficient-imbalanced-positive","slug":"robust-and-efficient-imbalanced-positive","title":"Robust and Efficient Imbalanced Positive-Unlabeled Learning with Self-supervision","date":"2022-09-06","arxiv_id":"2209.02459","repositories_listed":1,"syntology":null},{"url":"/paper/falcon-sound-and-complete-neural-semantic","slug":"falcon-sound-and-complete-neural-semantic","title":"FALCON: Scalable Reasoning over Inconsistent ALC Ontologies","date":"2022-08-16","arxiv_id":"2208.07628","repositories_listed":1,"syntology":null},{"url":"/paper/effective-few-shot-named-entity-linking-by","slug":"effective-few-shot-named-entity-linking-by","title":"Effective Few-Shot Named Entity Linking by Meta-Learning","date":"2022-07-12","arxiv_id":"2207.05280","repositories_listed":1,"syntology":null},{"url":"/paper/capacity-and-bias-of-learned-geometric","slug":"capacity-and-bias-of-learned-geometric","title":"Capacity and Bias of Learned Geometric Embeddings for Directed Graphs","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/time-in-a-box-advancing-knowledge-graph","slug":"time-in-a-box-advancing-knowledge-graph","title":"Time in a Box: Advancing Knowledge Graph Completion with Temporal Scopes","date":"2021-11-12","arxiv_id":"2111.06854","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-knowledge-base-completion-with","slug":"scalable-knowledge-base-completion-with","title":"Scalable knowledge base completion with superposition memories","date":"2021-10-24","arxiv_id":"2110.12341","repositories_listed":1,"syntology":null},{"url":"/paper/relation-prediction-as-an-auxiliary-training","slug":"relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-base-completion-meets-transfer","slug":"knowledge-base-completion-meets-transfer","title":"Knowledge Base Completion Meets Transfer Learning","date":"2021-08-30","arxiv_id":"2108.13073","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/knowledge-base-completion-meets-transfer#ran","syntology_url":"https://syntology.ai/paper/2108.13073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13073"}},"official":{"repos":["vid-koci/kbctransferlearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scientific-language-models-for-biomedical","slug":"scientific-language-models-for-biomedical","title":"Scientific Language Models for Biomedical Knowledge Base Completion: An Empirical Study","date":"2021-06-17","arxiv_id":"2106.09700","repositories_listed":1,"syntology":null},{"url":"/paper/bertnesia-investigating-the-capture-and-1","slug":"bertnesia-investigating-the-capture-and-1","title":"BERTnesia: Investigating the capture and forgetting of knowledge in BERT","date":"2021-06-05","arxiv_id":"2106.02902","repositories_listed":1,"syntology":null},{"url":"/paper/quatde-dynamic-quaternion-embedding-for","slug":"quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","arxiv_id":"2105.09002","repositories_listed":1,"syntology":null},{"url":"/paper/k-plug-knowledge-injected-pre-trained-1","slug":"k-plug-knowledge-injected-pre-trained-1","title":"K-PLUG: Knowledge-injected Pre-trained Language Model for Natural Language Understanding and Generation in E-Commerce","date":"2021-04-14","arxiv_id":"2104.06960","repositories_listed":1,"syntology":null},{"url":"/paper/ranking-vs-classifying-measuring-knowledge","slug":"ranking-vs-classifying-measuring-knowledge","title":"Ranking vs. Classifying: Measuring Knowledge Base Completion Quality","date":"2021-02-02","arxiv_id":"2102.06145","repositories_listed":1,"syntology":null},{"url":"/paper/k-plug-knowledge-injected-pre-trained","slug":"k-plug-knowledge-injected-pre-trained","title":"K-PLUG: KNOWLEDGE-INJECTED PRE-TRAINED LANGUAGE MODEL FOR NATURAL LANGUAGE UNDERSTANDING AND GENERATION","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/intkb-a-verifiable-interactive-framework-for","slug":"intkb-a-verifiable-interactive-framework-for","title":"IntKB: A Verifiable Interactive Framework for Knowledge Base Completion","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bertnesia-investigating-the-capture-and","slug":"bertnesia-investigating-the-capture-and","title":"BERTnesia: Investigating the capture and forgetting of knowledge in BERT","date":"2020-10-19","arxiv_id":"2010.09313","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-neural-matrix-factorization-with","slug":"explaining-neural-matrix-factorization-with","title":"Explaining Neural Matrix Factorization with Gradient Rollback","date":"2020-10-12","arxiv_id":"2010.05516","repositories_listed":1,"syntology":null},{"url":"/paper/boxe-a-box-embedding-model-for-knowledge-base","slug":"boxe-a-box-embedding-model-for-knowledge-base","title":"BoxE: A Box Embedding Model for Knowledge Base Completion","date":"2020-07-13","arxiv_id":"2007.06267","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-base-completion-baseline-strikes","slug":"knowledge-base-completion-baseline-strikes","title":"Knowledge Base Completion: Baseline strikes back (Again)","date":"2020-05-02","arxiv_id":"2005.00804","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-base-completion-new","slug":"temporal-knowledge-base-completion-new","title":"Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols","date":"2020-05-02","arxiv_id":"2005.05035","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":12,"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) · 9 unverified","sample_list":"/paper/temporal-knowledge-base-completion-new#ran","syntology_url":"https://syntology.ai/paper/2005.05035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05035"}},"official":{"repos":["dair-iitd/tkbi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-base-inference-for-regular","slug":"knowledge-base-inference-for-regular","title":"Regex Queries over Incomplete Knowledge Bases","date":"2020-05-01","arxiv_id":"2005.00480","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-base-completion-for-constructing","slug":"knowledge-base-completion-for-constructing","title":"Knowledge Base Completion for Constructing Problem-Oriented Medical Records","date":"2020-04-27","arxiv_id":"2004.12905","repositories_listed":1,"syntology":null},{"url":"/paper/oxkbc-outcome-explanation-for-factorization","slug":"oxkbc-outcome-explanation-for-factorization","title":"OxKBC: Outcome Explanation for Factorization Based Knowledge Base Completion","date":"2020-02-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-structural-and-semantic-context","slug":"exploiting-structural-and-semantic-context","title":"Commonsense Knowledge Base Completion with Structural and Semantic Context","date":"2019-10-07","arxiv_id":"1910.02915","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/exploiting-structural-and-semantic-context#ran","syntology_url":"https://syntology.ai/paper/1910.02915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02915"}},"official":null}},{"url":"/paper/dynamically-pruned-message-passing-networks","slug":"dynamically-pruned-message-passing-networks","title":"Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning","date":"2019-09-25","arxiv_id":"1909.11334","repositories_listed":1,"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":0,"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/dynamically-pruned-message-passing-networks#ran","syntology_url":"https://syntology.ai/paper/1909.11334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11334"}},"official":{"repos":["netpaladinx/DPMPN"],"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/modeling-paths-for-explainable-knowledge-base","slug":"modeling-paths-for-explainable-knowledge-base","title":"Modeling Paths for Explainable Knowledge Base Completion","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-consciousness-flow","slug":"neural-consciousness-flow","title":"Neural Consciousness Flow","date":"2019-05-30","arxiv_id":"1905.13049","repositories_listed":1,"syntology":null},{"url":"/paper/path-ranking-with-attention-to-type","slug":"path-ranking-with-attention-to-type","title":"Path Ranking with Attention to Type Hierarchies","date":"2019-05-26","arxiv_id":"1905.10799","repositories_listed":1,"syntology":null},{"url":"/paper/scene-graph-prediction-with-limited-labels","slug":"scene-graph-prediction-with-limited-labels","title":"Scene Graph Prediction with Limited Labels","date":"2019-04-25","arxiv_id":"1904.11622","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/scene-graph-prediction-with-limited-labels#ran","syntology_url":"https://syntology.ai/paper/1904.11622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11622"}},"official":null}},{"url":"/paper/fact-discovery-from-knowledge-base-via-facet","slug":"fact-discovery-from-knowledge-base-via-facet","title":"Fact Discovery from Knowledge Base via Facet Decomposition","date":"2019-04-21","arxiv_id":"1904.09540","repositories_listed":1,"syntology":null},{"url":"/paper/combining-axiom-injection-and-knowledge-base","slug":"combining-axiom-injection-and-knowledge-base","title":"Combining Axiom Injection and Knowledge Base Completion for Efficient Natural Language Inference","date":"2018-11-15","arxiv_id":"1811.06203","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-positive-and-unlabeled-data-a","slug":"learning-from-positive-and-unlabeled-data-a","title":"Learning from positive and unlabeled data: a survey","date":"2018-11-12","arxiv_id":"1811.04820","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-structure-aware-convolutional","slug":"end-to-end-structure-aware-convolutional","title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","date":"2018-11-11","arxiv_id":"1811.04441","repositories_listed":1,"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":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/end-to-end-structure-aware-convolutional#ran","syntology_url":"https://syntology.ai/paper/1811.04441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04441"}},"official":{"repos":["JD-AI-Research-Silicon-Valley/SACN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/hierarchical-attention-networks-for-knowledge","slug":"hierarchical-attention-networks-for-knowledge","title":"Modeling relation paths for knowledge base completion via joint adversarial training","date":"2018-10-14","arxiv_id":"1810.06033","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-and-predictive-entity-embedding","slug":"attributed-and-predictive-entity-embedding","title":"Attributed and Predictive Entity Embedding for Fine-Grained Entity Typing in Knowledge Bases","date":"2018-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cross-lingual-knowledge-projection-using","slug":"cross-lingual-knowledge-projection-using","title":"Cross-lingual Knowledge Projection Using Machine Translation and Target-side Knowledge Base Completion","date":"2018-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/type-sensitive-knowledge-base-inference","slug":"type-sensitive-knowledge-base-inference","title":"Type-Sensitive Knowledge Base Inference Without Explicit Type Supervision","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-embeddings-as-an-alternative-paradigm-for","slug":"on-embeddings-as-an-alternative-paradigm-for","title":"A Comparative Study of Distributional and Symbolic Paradigms for Relational Learning","date":"2018-06-29","arxiv_id":"1806.11391","repositories_listed":1,"syntology":null},{"url":"/paper/interpreting-embedding-models-of-knowledge","slug":"interpreting-embedding-models-of-knowledge","title":"Interpreting Embedding Models of Knowledge Bases: A Pedagogical Approach","date":"2018-06-20","arxiv_id":"1806.09504","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-and-compositional-relation","slug":"interpretable-and-compositional-relation","title":"Interpretable and Compositional Relation Learning by Joint Training with an Autoencoder","date":"2018-05-24","arxiv_id":"1805.09547","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-simple-neural-networks-for","slug":"revisiting-simple-neural-networks-for","title":"Revisiting Simple Neural Networks for Learning Representations of Knowledge Graphs","date":"2017-11-15","arxiv_id":"1711.05401","repositories_listed":1,"syntology":null},{"url":"/paper/fast-linear-model-for-knowledge-graph","slug":"fast-linear-model-for-knowledge-graph","title":"Fast Linear Model for Knowledge Graph Embeddings","date":"2017-10-30","arxiv_id":"1710.10881","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-transfer-for-out-of-knowledge-base","slug":"knowledge-transfer-for-out-of-knowledge-base","title":"Knowledge Transfer for Out-of-Knowledge-Base Entities: A Graph Neural Network Approach","date":"2017-06-18","arxiv_id":"1706.05674","repositories_listed":1,"syntology":null},{"url":"/paper/stranse-a-novel-embedding-model-of-entities","slug":"stranse-a-novel-embedding-model-of-entities","title":"STransE: a novel embedding model of entities and relationships in knowledge bases","date":"2016-06-27","arxiv_id":"1606.08140","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-guided-linguistic-rewrites-for","slug":"knowledge-guided-linguistic-rewrites-for","title":"Knowledge-Guided Linguistic Rewrites for Inference Rule Verification","date":"2016-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modeling-relation-paths-for-representation","slug":"modeling-relation-paths-for-representation","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","date":"2015-06-01","arxiv_id":"1506.00379","repositories_listed":1,"syntology":null},{"url":null,"slug":"large-language-model-enhanced-symbolic","title":"Large Language Model-Enhanced Symbolic Reasoning for Knowledge Base Completion","date":"2025-01-02","arxiv_id":"2501.01246","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-triples-from-dialogues-for","title":"Extracting triples from dialogues for conversational social agents","date":"2024-12-24","arxiv_id":"2412.18364","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graphs-the-future-of-data","title":"Knowledge Graphs: The Future of Data Integration and Insightful Discovery","date":"2024-12-17","arxiv_id":"2502.15689","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-parallel-multi-hop-reasoning-a","title":"Efficient Parallel Multi-Hop Reasoning: A Scalable Approach for Knowledge Graph Analysis","date":"2024-06-11","arxiv_id":"2406.07727","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-the-knowledge-base-completion","title":"Evaluating the Knowledge Base Completion Potential of GPT","date":"2023-10-23","arxiv_id":"2310.14771","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-affinity-ties-in-a-surname-network","title":"Predicting affinity ties in a surname network","date":"2023-06-02","arxiv_id":"2306.01218","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-lifting-and-link-prediction","title":"Causal Lifting and Link Prediction","date":"2023-02-02","arxiv_id":"2302.01198","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-driven-knowledge-base-completion-using","title":"Query-Driven Knowledge Base Completion using Multimodal Path Fusion over Multimodal Knowledge Graph","date":"2022-12-04","arxiv_id":"2212.01923","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-base-completion-using-web-based","title":"Knowledge Base Completion using Web-Based Question Answering and Multimodal Fusion","date":"2022-11-14","arxiv_id":"2211.07098","repositories_listed":0,"syntology":null},{"url":null,"slug":"heat-hyperedge-attention-networks","title":"HEAT: Hyperedge Attention Networks","date":"2022-01-28","arxiv_id":"2201.12113","repositories_listed":0,"syntology":null},{"url":null,"slug":"kgboost-a-classification-based-knowledge-base","title":"KGBoost: A Classification-based Knowledge Base Completion Method with Negative Sampling","date":"2021-12-17","arxiv_id":"2112.09340","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-rules-and-embeddings-via-neuro","title":"Combining Rules and Embeddings via Neuro-Symbolic AI for Knowledge Base Completion","date":"2021-09-16","arxiv_id":"2109.09566","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-a-naive-way-to-combine-symbolic-and","title":"Why a Naive Way to Combine Symbolic and Latent Knowledge Base Completion Works Surprisingly Well","date":"2021-06-22","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cear-cross-entity-aware-reranker-for","title":"CEAR: Cross-Entity Aware Reranker for Knowledge Base Completion","date":"2021-04-18","arxiv_id":"2104.08741","repositories_listed":0,"syntology":null},{"url":null,"slug":"docent-learning-self-supervised-entity","title":"DOCENT: Learning Self-Supervised Entity Representations from Large Document Collections","date":"2021-02-26","arxiv_id":"2102.13247","repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-general-properties-of-nouns-by","title":"Modelling General Properties of Nouns by Selectively Averaging Contextualised Embeddings","date":"2020-12-04","arxiv_id":"2012.07580","repositories_listed":0,"syntology":null},{"url":null,"slug":"association-rules-enhanced-knowledge-graph","title":"Association Rules Enhanced Knowledge Graph Attention Network","date":"2020-11-14","arxiv_id":"2011.08431","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-and-interactive-factual-knowledge","title":"Continuous and Interactive Factual Knowledge Learning in Verification Dialogues","date":"2020-10-15","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-graph-neural-networks-for","title":"A Survey on Graph Neural Networks for Knowledge Graph Completion","date":"2020-07-24","arxiv_id":"2007.12374","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-structured-knowledge-in-text-via","title":"Exploiting Structured Knowledge in Text via Graph-Guided Representation Learning","date":"2020-04-29","arxiv_id":"2004.14224","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-evaluation-of-knowledge-base","title":"Revisiting Evaluation of Knowledge Base Completion Models","date":"2020-02-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-commonsense-facts-from-the-physical","title":"Mining Commonsense Facts from the Physical World","date":"2020-02-08","arxiv_id":"2002.03149","repositories_listed":0,"syntology":null},{"url":"/paper/knowledge-graph-embedding-via-graph","slug":"knowledge-graph-embedding-via-graph","title":"Knowledge Graph Embedding via Graph Attenuated Attention Networks","date":"2019-12-31","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-over-paths-via-knowledge-base-1","title":"Reasoning Over Paths via Knowledge Base Completion","date":"2019-11-01","arxiv_id":"1911.00492","repositories_listed":0,"syntology":null},{"url":null,"slug":"projected-canonical-decomposition-for","title":"Projected Canonical Decomposition for Knowledge Base Completion","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"text-based-joint-prediction-of-numeric-and","title":"Text-Based Joint Prediction of Numeric and Categorical Attributes of Entities in Knowledge Bases","date":"2019-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"populating-web-scale-knowledge-graphs-using","title":"Populating Web Scale Knowledge Graphs using Distantly Supervised Relation Extraction and Validation","date":"2019-08-21","arxiv_id":"1908.08104","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributional-negative-sampling-for","title":"Distributional Negative Sampling for Knowledge Base Completion","date":"2019-08-16","arxiv_id":"1908.06178","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperkg-hyperbolic-knowledge-graph-embeddings","title":"HyperKG: Hyperbolic Knowledge Graph Embeddings for Knowledge Base Completion","date":"2019-08-14","arxiv_id":"1908.04895","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-reasoning-over-knowledge-graphs","title":"Meta Reasoning over Knowledge Graphs","date":"2019-08-13","arxiv_id":"1908.04877","repositories_listed":0,"syntology":null},{"url":null,"slug":"constructing-large-scale-biomedical-knowledge","title":"Constructing large scale biomedical knowledge bases from scratch with rapid annotation of interpretable patterns","date":"2019-07-02","arxiv_id":"1907.01417","repositories_listed":0,"syntology":null}],"syntology_records":13,"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":12,"papers_where_code_ran_first_page":"/task/knowledge-base-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":2,"url":"/task/knowledge-base-completion/papers/2","json":"/task/knowledge-base-completion/papers/2.json","rows":56},{"order":"ran","page":1,"of":1,"url":"/task/knowledge-base-completion/papers/ran/1","json":"/task/knowledge-base-completion/papers/ran/1.json","rows":12}],"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":"f905cbfef37610e9191229cd111a1a907702375c31b4a5f791c65ec2560c5ab2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}