{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/knowledge-graph-completion/papers/3","list_of":"/task/knowledge-graph-completion","task":"Knowledge Graph Completion","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":5,"rows_per_page":100,"rows":[201,300],"of":482,"counts":{"archive_papers_tagged":482,"with_a_code_link":251,"where_syntology_ran_a_sample":47,"not_listed_spam_title":0,"listed":482,"listed_where_code_ran":47,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":41,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":41,"listed_every_run_a_failure_of_syntologys_instrument":6,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/knowledge-graph-completion","prev":"/task/knowledge-graph-completion/papers/2","next":"/task/knowledge-graph-completion/papers/4","papers":[{"url":"/paper/multi-task-learning-for-knowledge-graph","slug":"multi-task-learning-for-knowledge-graph","title":"Multi-Task Learning for Knowledge Graph Completion with Pre-trained Language Models","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/relation-specific-transformations-for-open","slug":"relation-specific-transformations-for-open","title":"Relation Specific Transformations for Open World Knowledge Graph Completion","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tucker-decomposition-based-temporal-knowledge","slug":"tucker-decomposition-based-temporal-knowledge","title":"Tucker decomposition-based Temporal Knowledge Graph Completion","date":"2020-11-16","arxiv_id":"2011.07751","repositories_listed":1,"syntology":null},{"url":"/paper/node-attribute-completion-in-knowledge-graphs","slug":"node-attribute-completion-in-knowledge-graphs","title":"Node Attribute Completion in Knowledge Graphs with Multi-Relational Propagation","date":"2020-11-10","arxiv_id":"2011.05301","repositories_listed":1,"syntology":null},{"url":"/paper/dyernie-dynamic-evolution-of-riemannian","slug":"dyernie-dynamic-evolution-of-riemannian","title":"DyERNIE: Dynamic Evolution of Riemannian Manifold Embeddings for Temporal Knowledge Graph Completion","date":"2020-11-08","arxiv_id":"2011.03984","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-attentional-network-for-few-shot","slug":"adaptive-attentional-network-for-few-shot","title":"Adaptive Attentional Network for Few-Shot Knowledge Graph Completion","date":"2020-10-19","arxiv_id":"2010.09638","repositories_listed":1,"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":0,"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/adaptive-attentional-network-for-few-shot#ran","syntology_url":"https://syntology.ai/paper/2010.09638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09638"}},"official":{"repos":["JiaweiSheng/FAAN"],"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/drug-repurposing-for-covid-19-via-knowledge","slug":"drug-repurposing-for-covid-19-via-knowledge","title":"Drug Repurposing for COVID-19 via Knowledge Graph Completion","date":"2020-10-19","arxiv_id":"2010.09600","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-knowledge-graph-completion-via","slug":"multilingual-knowledge-graph-completion-via","title":"Multilingual Knowledge Graph Completion via Ensemble Knowledge Transfer","date":"2020-10-07","arxiv_id":"2010.03158","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-case-based-reasoning-for-open","slug":"probabilistic-case-based-reasoning-for-open","title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","date":"2020-10-07","arxiv_id":"2010.03548","repositories_listed":1,"syntology":null},{"url":"/paper/temp-temporal-message-passing-for-temporal","slug":"temp-temporal-message-passing-for-temporal","title":"TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion","date":"2020-10-07","arxiv_id":"2010.03526","repositories_listed":1,"syntology":null},{"url":"/paper/colake-contextualized-language-and-knowledge","slug":"colake-contextualized-language-and-knowledge","title":"CoLAKE: Contextualized Language and Knowledge Embedding","date":"2020-10-01","arxiv_id":"2010.00309","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/colake-contextualized-language-and-knowledge#ran","syntology_url":"https://syntology.ai/paper/2010.00309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00309"}},"official":{"repos":["txsun1997/CoLAKE"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/direct-multi-hop-attention-based-graph-neural","slug":"direct-multi-hop-attention-based-graph-neural","title":"Multi-hop Attention Graph Neural Network","date":"2020-09-29","arxiv_id":"2009.14332","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/direct-multi-hop-attention-based-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2009.14332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14332"}},"official":{"repos":["xjtuwgt/gnn-magna"],"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/inductively-representing-out-of-knowledge","slug":"inductively-representing-out-of-knowledge","title":"Inductively Representing Out-of-Knowledge-Graph Entities by Optimal Estimation Under Translational Assumptions","date":"2020-09-27","arxiv_id":"2009.12765","repositories_listed":1,"syntology":null},{"url":"/paper/quatre-relation-aware-quaternions-for","slug":"quatre-relation-aware-quaternions-for","title":"QuatRE: Relation-Aware Quaternions for Knowledge Graph Embeddings","date":"2020-09-26","arxiv_id":"2009.12517","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-learning-on-commonsense-knowledge","slug":"inductive-learning-on-commonsense-knowledge","title":"Inductive Learning on Commonsense Knowledge Graph Completion","date":"2020-09-19","arxiv_id":"2009.09263","repositories_listed":1,"syntology":null},{"url":"/paper/em-rbr-a-reinforced-framework-for-knowledge","slug":"em-rbr-a-reinforced-framework-for-knowledge","title":"EM-RBR: a reinforced framework for knowledge graph completion from reasoning perspective","date":"2020-09-18","arxiv_id":"2009.08656","repositories_listed":1,"syntology":null},{"url":"/paper/lowfer-low-rank-bilinear-pooling-for-link","slug":"lowfer-low-rank-bilinear-pooling-for-link","title":"LowFER: Low-rank Bilinear Pooling for Link Prediction","date":"2020-08-25","arxiv_id":"2008.10858","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/lowfer-low-rank-bilinear-pooling-for-link#ran","syntology_url":"https://syntology.ai/paper/2008.10858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.10858"}},"official":{"repos":["suamin/LowFER"],"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/quaternion-graph-neural-networks","slug":"quaternion-graph-neural-networks","title":"Quaternion Graph Neural Networks","date":"2020-08-12","arxiv_id":"2008.05089","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/quaternion-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2008.05089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05089"}},"official":{"repos":["daiquocnguyen/QGNN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dense-an-enhanced-non-abelian-group","slug":"dense-an-enhanced-non-abelian-group","title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","date":"2020-08-11","arxiv_id":"2008.04548","repositories_listed":1,"syntology":null},{"url":"/paper/connecting-embeddings-for-knowledge-graph-1","slug":"connecting-embeddings-for-knowledge-graph-1","title":"Connecting Embeddings for Knowledge Graph Entity Typing","date":"2020-07-21","arxiv_id":"2007.10873","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-link-prediction-via-graph-neural","slug":"few-shot-link-prediction-via-graph-neural","title":"Few-shot link prediction via graph neural networks for Covid-19 drug-repurposing","date":"2020-07-20","arxiv_id":"2007.10261","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-extrapolate-knowledge","slug":"learning-to-extrapolate-knowledge","title":"Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction","date":"2020-06-11","arxiv_id":"2006.06648","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/learning-to-extrapolate-knowledge#ran","syntology_url":"https://syntology.ai/paper/2006.06648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06648"}},"official":{"repos":["JinheonBaek/GEN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-data-driven-approach-for-noise-reduction-in","slug":"a-data-driven-approach-for-noise-reduction-in","title":"A Data-driven Approach for Noise Reduction in Distantly Supervised Biomedical Relation Extraction","date":"2020-05-26","arxiv_id":"2005.12565","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-neural-embeddings-for-link","slug":"benchmarking-neural-embeddings-for-link","title":"Benchmarking neural embeddings for link prediction in knowledge graphs under semantic and structural changes","date":"2020-05-15","arxiv_id":"2005.07654","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/semantic-triple-encoder-for-fast-open-set","slug":"semantic-triple-encoder-for-fast-open-set","title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","date":"2020-04-30","arxiv_id":"2004.14781","repositories_listed":1,"syntology":null},{"url":"/paper/realistic-re-evaluation-of-knowledge-graph","slug":"realistic-re-evaluation-of-knowledge-graph","title":"Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study","date":"2020-03-18","arxiv_id":"2003.08001","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-rule-learning-with-template","slug":"efficient-rule-learning-with-template","title":"Towards Learning Instantiated Logical Rules from Knowledge Graphs","date":"2020-03-13","arxiv_id":"2003.06071","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-knowledge-graphs-representation","slug":"a-survey-on-knowledge-graphs-representation","title":"A Survey on Knowledge Graphs: Representation, Acquisition and Applications","date":"2020-02-02","arxiv_id":"2002.00388","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-knowledge-graph-completion","slug":"few-shot-knowledge-graph-completion","title":"Few-Shot Knowledge Graph Completion","date":"2019-11-26","arxiv_id":"1911.11298","repositories_listed":1,"syntology":null},{"url":"/paper/kepler-a-unified-model-for-knowledge","slug":"kepler-a-unified-model-for-knowledge","title":"KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation","date":"2019-11-13","arxiv_id":"1911.06136","repositories_listed":1,"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":5,"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/kepler-a-unified-model-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06136"}},"official":{"repos":["THU-KEG/KEPLER"],"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/representation-learning-with-ordered-relation","slug":"representation-learning-with-ordered-relation","title":"Representation Learning with Ordered Relation Paths for Knowledge Graph Completion","date":"2019-09-26","arxiv_id":"1909.11864","repositories_listed":1,"syntology":null},{"url":"/paper/tackling-long-tailed-relations-and-uncommon","slug":"tackling-long-tailed-relations-and-uncommon","title":"Tackling Long-Tailed Relations and Uncommon Entities in Knowledge Graph Completion","date":"2019-09-25","arxiv_id":"1909.11359","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":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/tackling-long-tailed-relations-and-uncommon#ran","syntology_url":"https://syntology.ai/paper/1909.11359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11359"}},"official":{"repos":["ZihaoWang/Few-shot-KGC"],"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/exploring-scholarly-data-by-semantic-query-on","slug":"exploring-scholarly-data-by-semantic-query-on","title":"Exploring Scholarly Data by Semantic Query on Knowledge Graph Embedding Space","date":"2019-09-17","arxiv_id":"1909.08191","repositories_listed":1,"syntology":null},{"url":"/paper/an-open-world-extension-to-knowledge-graph","slug":"an-open-world-extension-to-knowledge-graph","title":"An Open-World Extension to Knowledge Graph Completion Models","date":"2019-06-19","arxiv_id":"1906.08382","repositories_listed":1,"syntology":null},{"url":"/paper/190600137","slug":"190600137","title":"Knowledge Hypergraphs: Prediction Beyond Binary Relations","date":"2019-06-01","arxiv_id":"1906.00137","repositories_listed":1,"syntology":null},{"url":"/paper/tucker-tensor-factorization-for-knowledge-1","slug":"tucker-tensor-factorization-for-knowledge-1","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-05-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/quaternion-knowledge-graph-embedding","slug":"quaternion-knowledge-graph-embedding","title":"Quaternion Knowledge Graph Embeddings","date":"2019-04-23","arxiv_id":"1904.10281","repositories_listed":1,"syntology":null},{"url":"/paper/unifying-knowledge-graph-learning-and","slug":"unifying-knowledge-graph-learning-and","title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","date":"2019-02-17","arxiv_id":"1902.06236","repositories_listed":1,"syntology":null},{"url":"/paper/logic-attention-based-neighborhood","slug":"logic-attention-based-neighborhood","title":"Logic Attention Based Neighborhood Aggregation for Inductive Knowledge Graph Embedding","date":"2018-11-04","arxiv_id":"1811.01399","repositories_listed":1,"syntology":null},{"url":"/paper/dskg-a-deep-sequential-model-for-knowledge","slug":"dskg-a-deep-sequential-model-for-knowledge","title":"DSKG: A Deep Sequential Model for Knowledge Graph Completion","date":"2018-10-30","arxiv_id":"1810.12582","repositories_listed":1,"syntology":null},{"url":"/paper/one-shot-relational-learning-for-knowledge","slug":"one-shot-relational-learning-for-knowledge","title":"One-Shot Relational Learning for Knowledge Graphs","date":"2018-08-27","arxiv_id":"1808.09040","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/expeditious-generation-of-knowledge-graph","slug":"expeditious-generation-of-knowledge-graph","title":"Expeditious Generation of Knowledge Graph Embeddings","date":"2018-03-21","arxiv_id":"1803.07828","repositories_listed":1,"syntology":null},{"url":"/paper/open-world-knowledge-graph-completion","slug":"open-world-knowledge-graph-completion","title":"Open-World Knowledge Graph Completion","date":"2017-11-09","arxiv_id":"1711.03438","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/open-world-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1711.03438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03438"}},"official":{"repos":["bxshi/ConMask"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/retrofitting-distributional-embeddings-to","slug":"retrofitting-distributional-embeddings-to","title":"Retrofitting Distributional Embeddings to Knowledge Graphs with Functional Relations","date":"2017-08-01","arxiv_id":"1708.00112","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-entity-alignment-via-joint","slug":"iterative-entity-alignment-via-joint","title":"Iterative Entity Alignment via Joint Knowledge Embeddings","date":"2017-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/does-william-shakespeare-really-write-hamlet","slug":"does-william-shakespeare-really-write-hamlet","title":"Does William Shakespeare REALLY Write Hamlet? Knowledge Representation Learning with Confidence","date":"2017-05-09","arxiv_id":"1705.03202","repositories_listed":1,"syntology":null},{"url":"/paper/image-embodied-knowledge-representation","slug":"image-embodied-knowledge-representation","title":"Image-embodied Knowledge Representation Learning","date":"2016-09-22","arxiv_id":"1609.07028","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-via-dynamic-mapping","slug":"knowledge-graph-embedding-via-dynamic-mapping","title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","date":"2015-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"context-driven-knowledge-graph-completion","title":"Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing","date":"2025-06-29","arxiv_id":"2506.23141","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-regularization-methods-for","title":"Rethinking Regularization Methods for Knowledge Graph Completion","date":"2025-05-29","arxiv_id":"2505.23442","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-architectural-complexity-overrated","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","date":"2025-05-25","arxiv_id":"2505.18971","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-knowledge-graph-completion-with-gnn","title":"Enhancing Knowledge Graph Completion with GNN Distillation and Probabilistic Interaction Modeling","date":"2025-05-18","arxiv_id":"2505.12272","repositories_listed":0,"syntology":null},{"url":null,"slug":"prompted-meta-learning-for-few-shot-knowledge","title":"Prompted Meta-Learning for Few-shot Knowledge Graph Completion","date":"2025-05-08","arxiv_id":"2505.05684","repositories_listed":0,"syntology":null},{"url":null,"slug":"scientific-hypothesis-generation-and","title":"Scientific Hypothesis Generation and Validation: Methods, Datasets, and Future Directions","date":"2025-05-06","arxiv_id":"2505.04651","repositories_listed":0,"syntology":null},{"url":null,"slug":"soft-reasoning-paths-for-knowledge-graph","title":"Soft Reasoning Paths for Knowledge Graph Completion","date":"2025-05-06","arxiv_id":"2505.03285","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-on-large-graphs-using-a","title":"Efficient Learning on Large Graphs using a Densifying Regularity Lemma","date":"2025-04-25","arxiv_id":"2504.18273","repositories_listed":0,"syntology":null},{"url":null,"slug":"quate-d-a-distance-based-quaternion-model-for","title":"QuatE-D: A Distance-Based Quaternion Model for Knowledge Graph Embedding","date":"2025-04-18","arxiv_id":"2504.13983","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-large-scale-evaluation-of-embedding-models","title":"On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion","date":"2025-04-11","arxiv_id":"2504.08970","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusioncom-structure-aware-multimodal","title":"DiffusionCom: Structure-Aware Multimodal Diffusion Model for Multimodal Knowledge Graph Completion","date":"2025-04-09","arxiv_id":"2504.06543","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-knowledge-graph-completion-with","title":"Enhancing Knowledge Graph Completion with Entity Neighborhood and Relation Context","date":"2025-03-29","arxiv_id":"2503.23205","repositories_listed":0,"syntology":null},{"url":null,"slug":"muco-kgc-multi-context-aware-knowledge-graph","title":"MuCo-KGC: Multi-Context-Aware Knowledge Graph Completion","date":"2025-03-05","arxiv_id":"2503.03091","repositories_listed":0,"syntology":null},{"url":null,"slug":"gltw-joint-improved-graph-transformer-and-llm","title":"GLTW: Joint Improved Graph Transformer and LLM via Three-Word Language for Knowledge Graph Completion","date":"2025-02-17","arxiv_id":"2502.11471","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-graph-networks-ugn-a-deep-neural","title":"Unified Graph Networks (UGN): A Deep Neural Framework for Solving Graph Problems","date":"2025-02-11","arxiv_id":"2502.07500","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformer-based-multimodal-knowledge-graph","title":"Transformer-Based Multimodal Knowledge Graph Completion with Link-Aware Contexts","date":"2025-01-26","arxiv_id":"2501.15688","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-assisted-knowledge-graph-completion-for","title":"LLM-Assisted Knowledge Graph Completion for Curriculum and Domain Modelling in Personalized Higher Education Recommendations","date":"2025-01-21","arxiv_id":"2501.12300","repositories_listed":0,"syntology":null},{"url":null,"slug":"kg-trick-unifying-textual-and-relational","title":"KG-TRICK: Unifying Textual and Relational Information Completion of Knowledge for Multilingual Knowledge Graphs","date":"2025-01-07","arxiv_id":"2501.03560","repositories_listed":0,"syntology":null},{"url":null,"slug":"kg-cf-knowledge-graph-completion-with-context","title":"KG-CF: Knowledge Graph Completion with Context Filtering under the Guidance of Large Language Models","date":"2025-01-06","arxiv_id":"2501.02711","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-relational-context-perception-for","title":"Efficient Relational Context Perception for Knowledge Graph Completion","date":"2024-12-31","arxiv_id":"2501.00397","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-pattern-aware-data-augmentation-for","title":"Towards Pattern-aware Data Augmentation for Temporal Knowledge Graph Completion","date":"2024-12-31","arxiv_id":"2501.00252","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-large-language-model-good-at-triple-set","title":"Is Large Language Model Good at Triple Set Prediction? An Empirical Study","date":"2024-12-24","arxiv_id":"2412.18443","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-contextualized-bert-model-for-knowledge","title":"A Contextualized BERT model for Knowledge Graph Completion","date":"2024-12-15","arxiv_id":"2412.11016","repositories_listed":0,"syntology":null},{"url":null,"slug":"in-context-learning-with-topological","title":"In-Context Learning with Topological Information for Knowledge Graph Completion","date":"2024-12-11","arxiv_id":"2412.08742","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-net-and-nbfnet-learn-negative-patterns-on","title":"A*Net and NBFNet Learn Negative Patterns on Knowledge Graphs","date":"2024-12-06","arxiv_id":"2412.05114","repositories_listed":0,"syntology":null},{"url":null,"slug":"kalm-knowledge-aligned-autoregressive","title":"KaLM: Knowledge-aligned Autoregressive Language Modeling via Dual-view Knowledge Graph Contrastive Learning","date":"2024-12-06","arxiv_id":"2412.04948","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-sparse-latent-feature-models-for","title":"Deep Sparse Latent Feature Models for Knowledge Graph Completion","date":"2024-11-24","arxiv_id":"2411.15694","repositories_listed":0,"syntology":null},{"url":"/paper/mocokgc-momentum-contrast-entity-encoding-for","slug":"mocokgc-momentum-contrast-entity-encoding-for","title":"MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion","date":"2024-11-12","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"retrieval-reasoning-re-ranking-a-context","title":"Retrieval, Reasoning, Re-ranking: A Context-Enriched Framework for Knowledge Graph Completion","date":"2024-11-12","arxiv_id":"2411.08165","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridge-a-unified-framework-to-knowledge-graph","title":"Bridge: A Unified Framework to Knowledge Graph Completion via Language Models and Knowledge Representation","date":"2024-11-11","arxiv_id":"2411.06660","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-hyperbolic-rotation-for-knowledge-graph","title":"Fully Hyperbolic Rotation for Knowledge Graph Embedding","date":"2024-11-06","arxiv_id":"2411.03622","repositories_listed":0,"syntology":null},{"url":null,"slug":"chartkg-a-knowledge-graph-based","title":"ChartKG: A Knowledge-Graph-Based Representation for Chart Images","date":"2024-10-13","arxiv_id":"2410.09761","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pluggable-common-sense-enhanced-framework","title":"A Pluggable Common Sense-Enhanced Framework for Knowledge Graph Completion","date":"2024-10-06","arxiv_id":"2410.04488","repositories_listed":0,"syntology":null},{"url":null,"slug":"muse-integrating-multi-knowledge-for","title":"MUSE: Integrating Multi-Knowledge for Knowledge Graph Completion","date":"2024-09-26","arxiv_id":"2409.17536","repositories_listed":0,"syntology":null},{"url":null,"slug":"cyber-knowledge-completion-using-large","title":"Cyber Knowledge Completion Using Large Language Models","date":"2024-09-24","arxiv_id":"2409.16176","repositories_listed":0,"syntology":null},{"url":null,"slug":"dsparse-dynamic-sparse-embedding-for","title":"DSparsE: Dynamic Sparse Embedding for Knowledge Graph Completion","date":"2024-09-22","arxiv_id":"2410.07140","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypercausallp-causal-link-prediction-using","title":"HyperCausalLP: Causal Link Prediction using Hyper-Relational Knowledge Graph","date":"2024-09-12","arxiv_id":"2410.14679","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-margin-prototypical-network-for-few","title":"Large Margin Prototypical Network for Few-shot Relation Classification with Fine-grained Features","date":"2024-09-06","arxiv_id":"2409.04009","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-large-language-models-capabilities","title":"GS-KGC: A Generative Subgraph-based Framework for Knowledge Graph Completion with Large Language Models","date":"2024-08-20","arxiv_id":"2408.10819","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlock-the-power-of-frozen-llms-in-knowledge","title":"Bridging LLMs and KGs without Fine-Tuning: Intermediate Probing Meets Subgraph-Aware Entity Descriptions","date":"2024-08-13","arxiv_id":"2408.06787","repositories_listed":0,"syntology":null},{"url":null,"slug":"muse-multi-knowledge-passing-on-the-edges","title":"MUSE: Multi-Knowledge Passing on the Edges, Boosting Knowledge Graph Completion","date":"2024-08-09","arxiv_id":"2408.05283","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-01784","title":"Graph Stochastic Neural Process for Inductive Few-shot Knowledge Graph Completion","date":"2024-08-03","arxiv_id":"2408.01784","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-enhanced-adaptive-semantic-path","title":"Query-Enhanced Adaptive Semantic Path Reasoning for Inductive Knowledge Graph Completion","date":"2024-06-04","arxiv_id":"2406.02205","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-latent-to-lucid-transforming-knowledge","title":"From Latent to Lucid: Transforming Knowledge Graph Embeddings into Interpretable Structures with KGEPrisma","date":"2024-06-03","arxiv_id":"2406.01759","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-reasoning-with-relation-network-for","title":"Logical Reasoning with Relation Network for Inductive Knowledge Graph Completion","date":"2024-06-03","arxiv_id":"2406.01140","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-from-a-different-perspective-in-re","title":"Predicting from a Different Perspective: A Re-ranking Model for Inductive Knowledge Graph Completion","date":"2024-05-27","arxiv_id":"2405.16902","repositories_listed":0,"syntology":null},{"url":null,"slug":"empowering-small-scale-knowledge-graphs-a","title":"Empowering Small-Scale Knowledge Graphs: A Strategy of Leveraging General-Purpose Knowledge Graphs for Enriched Embeddings","date":"2024-05-17","arxiv_id":"2405.10745","repositories_listed":0,"syntology":null},{"url":null,"slug":"harmonizing-human-insights-and-ai-precision","title":"Harmonizing Human Insights and AI Precision: Hand in Hand for Advancing Knowledge Graph Task","date":"2024-05-15","arxiv_id":"2405.09477","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-shared-knowledge-guided-learning","title":"Multi-level Shared Knowledge Guided Learning for Knowledge Graph Completion","date":"2024-05-08","arxiv_id":"2405.06696","repositories_listed":0,"syntology":null}],"record_sha256":"31fc1d7488ff0ec8b4a8489e9344fd49a4572889e4ce7b9eba0deb928957e1af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}