{"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/papers/ran/2","list_of":"/task/knowledge-graphs","task":"Knowledge Graphs","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"of":234,"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":207,"every_run_a_failure_of_syntologys_instrument":27,"listed_with_a_run_with_no_instrument_failure":207,"listed_every_run_a_failure_of_syntologys_instrument":27,"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-graphs/papers/ran/1","prev":"/task/knowledge-graphs/papers/ran/1","next":"/task/knowledge-graphs/papers/ran/3","papers":[{"url":"/paper/learning-representations-of-bi-level","slug":"learning-representations-of-bi-level","title":"Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction","date":"2023-02-06","arxiv_id":"2302.02601","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-representations-of-bi-level#ran","syntology_url":"https://syntology.ai/paper/2302.02601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02601"}},"official":{"repos":["bdi-lab/bive"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-theory-of-link-prediction-via-relational-1","slug":"a-theory-of-link-prediction-via-relational-1","title":"A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs","date":"2023-02-04","arxiv_id":"2302.02209","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/a-theory-of-link-prediction-via-relational-1#ran","syntology_url":"https://syntology.ai/paper/2302.02209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02209"}},"official":{"repos":["hxyscotthuang/cmpnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-entity-alignment-for-temporal","slug":"unsupervised-entity-alignment-for-temporal","title":"Unsupervised Entity Alignment for Temporal Knowledge Graphs","date":"2023-02-01","arxiv_id":"2302.00796","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-entity-alignment-for-temporal#ran","syntology_url":"https://syntology.ai/paper/2302.00796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00796"}},"official":{"repos":["zju-daily/dualmatch"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/meaformer-multi-modal-entity-alignment","slug":"meaformer-multi-modal-entity-alignment","title":"MEAformer: Multi-modal Entity Alignment Transformer for Meta Modality Hybrid","date":"2022-12-29","arxiv_id":"2212.14454","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"11 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meaformer-multi-modal-entity-alignment#ran","syntology_url":"https://syntology.ai/paper/2212.14454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.14454"}},"official":{"repos":["zjukg/MEAformer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/answering-complex-logical-queries-on","slug":"answering-complex-logical-queries-on","title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","date":"2022-12-19","arxiv_id":"2212.09567","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"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) · 6 unverified","sample_list":"/paper/answering-complex-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2212.09567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09567"}},"official":{"repos":["bys0318/qto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}},"official":{"repos":["ibpa/kglm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gammae-gamma-embeddings-for-logical-queries","slug":"gammae-gamma-embeddings-for-logical-queries","title":"GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs","date":"2022-10-27","arxiv_id":"2210.15578","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gammae-gamma-embeddings-for-logical-queries#ran","syntology_url":"https://syntology.ai/paper/2210.15578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15578"}},"official":{"repos":["dyang67/GammaE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/inductive-logical-query-answering-in","slug":"inductive-logical-query-answering-in","title":"Inductive Logical Query Answering in Knowledge Graphs","date":"2022-10-13","arxiv_id":"2210.08008","repositories_listed":1,"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":4,"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/inductive-logical-query-answering-in#ran","syntology_url":"https://syntology.ai/paper/2210.08008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08008"}},"official":null}},{"url":"/paper/kalm-knowledge-aware-integration-of-local","slug":"kalm-knowledge-aware-integration-of-local","title":"KALM: Knowledge-Aware Integration of Local, Document, and Global Contexts for Long Document Understanding","date":"2022-10-08","arxiv_id":"2210.04105","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kalm-knowledge-aware-integration-of-local#ran","syntology_url":"https://syntology.ai/paper/2210.04105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.04105"}},"official":{"repos":["bunsenfeng/kalm"],"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/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/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/neural-methods-for-logical-reasoning-over-1","slug":"neural-methods-for-logical-reasoning-over-1","title":"Neural Methods for Logical Reasoning Over Knowledge Graphs","date":"2022-09-28","arxiv_id":"2209.14464","repositories_listed":1,"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/neural-methods-for-logical-reasoning-over-1#ran","syntology_url":"https://syntology.ai/paper/2209.14464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.14464"}},"official":{"repos":["amayuelas/NNKGReasoning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-geometric-space-embedding-model-for-two","slug":"dual-geometric-space-embedding-model-for-two","title":"Dual-Geometric Space Embedding Model for Two-View Knowledge Graphs","date":"2022-09-19","arxiv_id":"2209.08767","repositories_listed":1,"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/dual-geometric-space-embedding-model-for-two#ran","syntology_url":"https://syntology.ai/paper/2209.08767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08767"}},"official":{"repos":["roshnigiyer/dgs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-modal-contrastive-representation","slug":"multi-modal-contrastive-representation","title":"Multi-modal Contrastive Representation Learning for Entity Alignment","date":"2022-09-02","arxiv_id":"2209.00891","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/multi-modal-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2209.00891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.00891"}},"official":{"repos":["lzxlin/mclea"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/subgraph-neighboring-relations-infomax-for","slug":"subgraph-neighboring-relations-infomax-for","title":"Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs","date":"2022-07-28","arxiv_id":"2208.00850","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":7,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"7 ran (of which 7 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) · 3 unverified; every one of the 7 samples that ran constructed an object rather than computing a result","sample_list":"/paper/subgraph-neighboring-relations-infomax-for#ran","syntology_url":"https://syntology.ai/paper/2208.00850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.00850"}},"official":{"repos":["Tebmer/SNRI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/lako-knowledge-driven-visual-question","slug":"lako-knowledge-driven-visual-question","title":"LaKo: Knowledge-driven Visual Question Answering via Late Knowledge-to-Text Injection","date":"2022-07-26","arxiv_id":"2207.12888","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/lako-knowledge-driven-visual-question#ran","syntology_url":"https://syntology.ai/paper/2207.12888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.12888"}},"official":{"repos":["hackerchenzhuo/LaKo"],"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/zero-shot-object-goal-visual-navigation","slug":"zero-shot-object-goal-visual-navigation","title":"Zero-shot object goal visual navigation","date":"2022-06-15","arxiv_id":"2206.07423","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/zero-shot-object-goal-visual-navigation#ran","syntology_url":"https://syntology.ai/paper/2206.07423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07423"}},"official":{"repos":["pioneer-innovation/zero-shot-object-navigation"],"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/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":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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/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":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tflex-temporal-feature-logic-embedding-1","slug":"tflex-temporal-feature-logic-embedding-1","title":"TFLEX: Temporal Feature-Logic Embedding Framework for Complex Reasoning over Temporal Knowledge Graph","date":"2022-05-28","arxiv_id":"2205.14307","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/tflex-temporal-feature-logic-embedding-1#ran","syntology_url":"https://syntology.ai/paper/2205.14307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14307"}},"official":{"repos":["linxueyuanstdio/tflex"],"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/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/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}},"official":{"repos":["zjunlp/relphormer"],"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":["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/neural-symbolic-models-for-logical-queries-on","slug":"neural-symbolic-models-for-logical-queries-on","title":"Neural-Symbolic Models for Logical Queries on Knowledge Graphs","date":"2022-05-16","arxiv_id":"2205.10128","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-symbolic-models-for-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2205.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10128"}},"official":{"repos":["DeepGraphLearning/GNN-QE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-question-answering-datasets","slug":"knowledge-graph-question-answering-datasets","title":"Knowledge Graph Question Answering Datasets and Their Generalizability: Are They Enough for Future Research?","date":"2022-05-13","arxiv_id":"2205.06573","repositories_listed":1,"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/knowledge-graph-question-answering-datasets#ran","syntology_url":"https://syntology.ai/paper/2205.06573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06573"}},"official":{"repos":["KGQA/KGQA-datasets-generalization"],"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":["official"]}}},{"url":"/paper/knowledge-graph-contrastive-learning-for","slug":"knowledge-graph-contrastive-learning-for","title":"Knowledge Graph Contrastive Learning for Recommendation","date":"2022-05-02","arxiv_id":"2205.00976","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-graph-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2205.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00976"}},"official":{"repos":["yuh-yang/kgcl-sigir22"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/query2particles-knowledge-graph-reasoning","slug":"query2particles-knowledge-graph-reasoning","title":"Query2Particles: Knowledge Graph Reasoning with Particle Embeddings","date":"2022-04-27","arxiv_id":"2204.12847","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/query2particles-knowledge-graph-reasoning#ran","syntology_url":"https://syntology.ai/paper/2204.12847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.12847"}},"official":{"repos":["hkust-knowcomp/query2particles"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/transher-translating-knowledge-graph","slug":"transher-translating-knowledge-graph","title":"TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction","date":"2022-04-27","arxiv_id":"2204.13221","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/transher-translating-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2204.13221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13221"}},"official":{"repos":["yizhilll/transher"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/kcd-knowledge-walks-and-textual-cues-enhanced-1","slug":"kcd-knowledge-walks-and-textual-cues-enhanced-1","title":"KCD: Knowledge Walks and Textual Cues Enhanced Political Perspective Detection in News Media","date":"2022-04-08","arxiv_id":"2204.04046","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kcd-knowledge-walks-and-textual-cues-enhanced-1#ran","syntology_url":"https://syntology.ai/paper/2204.04046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.04046"}},"official":{"repos":["wenqian-zhang/kcd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/augmenting-knowledge-graphs-for-better-link","slug":"augmenting-knowledge-graphs-for-better-link","title":"Augmenting Knowledge Graphs for Better Link Prediction","date":"2022-03-26","arxiv_id":"2203.13965","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/augmenting-knowledge-graphs-for-better-link#ran","syntology_url":"https://syntology.ai/paper/2203.13965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13965"}},"official":{"repos":["otamio/kga"],"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/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/selfkg-self-supervised-entity-alignment-in","slug":"selfkg-self-supervised-entity-alignment-in","title":"SelfKG: Self-Supervised Entity Alignment in Knowledge Graphs","date":"2022-03-02","arxiv_id":"2203.01044","repositories_listed":1,"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/selfkg-self-supervised-entity-alignment-in#ran","syntology_url":"https://syntology.ai/paper/2203.01044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01044"}},"official":{"repos":["THUDM/SelfKG"],"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/evokg-jointly-modeling-event-time-and-network","slug":"evokg-jointly-modeling-event-time-and-network","title":"EvoKG: Jointly Modeling Event Time and Network Structure for Reasoning over Temporal Knowledge Graphs","date":"2022-02-15","arxiv_id":"2202.07648","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/evokg-jointly-modeling-event-time-and-network#ran","syntology_url":"https://syntology.ai/paper/2202.07648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07648"}},"official":null}},{"url":"/paper/ontoprotein-protein-pretraining-with-gene-1","slug":"ontoprotein-protein-pretraining-with-gene-1","title":"OntoProtein: Protein Pretraining With Gene Ontology Embedding","date":"2022-01-23","arxiv_id":"2201.11147","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ontoprotein-protein-pretraining-with-gene-1#ran","syntology_url":"https://syntology.ai/paper/2201.11147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.11147"}},"official":{"repos":["zjunlp/ontoprotein"],"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/greaselm-graph-reasoning-enhanced-language-1","slug":"greaselm-graph-reasoning-enhanced-language-1","title":"GreaseLM: Graph REASoning Enhanced Language Models for Question Answering","date":"2022-01-21","arxiv_id":"2201.08860","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/greaselm-graph-reasoning-enhanced-language-1#ran","syntology_url":"https://syntology.ai/paper/2201.08860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08860"}},"official":{"repos":["snap-stanford/greaselm"],"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/implications-of-topological-imbalance-for","slug":"implications-of-topological-imbalance-for","title":"Implications of Topological Imbalance for Representation Learning on Biomedical Knowledge Graphs","date":"2021-12-13","arxiv_id":"2112.06567","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/implications-of-topological-imbalance-for#ran","syntology_url":"https://syntology.ai/paper/2112.06567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.06567"}},"official":{"repos":["astrazeneca/biomedical-kg-topological-imbalance"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/poisoning-knowledge-graph-embeddings-via-1","slug":"poisoning-knowledge-graph-embeddings-via-1","title":"Poisoning Knowledge Graph Embeddings via Relation Inference Patterns","date":"2021-11-11","arxiv_id":"2111.06345","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/poisoning-knowledge-graph-embeddings-via-1#ran","syntology_url":"https://syntology.ai/paper/2111.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06345"}},"official":{"repos":["perubhardwaj/inferenceattack"],"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/sqaler-scaling-question-answering-by","slug":"sqaler-scaling-question-answering-by","title":"SQALER: Scaling Question Answering by Decoupling Multi-Hop and Logical Reasoning","date":"2021-10-27","arxiv_id":"2110.14266","repositories_listed":0,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/sqaler-scaling-question-answering-by#ran","syntology_url":"https://syntology.ai/paper/2110.14266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14266"}},"official":null}},{"url":"/paper/probabilistic-entity-representation-model-for","slug":"probabilistic-entity-representation-model-for","title":"Probabilistic Entity Representation Model for Reasoning over Knowledge Graphs","date":"2021-10-26","arxiv_id":"2110.13522","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/probabilistic-entity-representation-model-for#ran","syntology_url":"https://syntology.ai/paper/2110.13522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13522"}},"official":{"repos":["akirato/perm-gaussiankg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cone-cone-embeddings-for-multi-hop-reasoning","slug":"cone-cone-embeddings-for-multi-hop-reasoning","title":"ConE: Cone Embeddings for Multi-Hop Reasoning over Knowledge Graphs","date":"2021-10-26","arxiv_id":"2110.13715","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":4,"n_ran_checked":5,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"9 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cone-cone-embeddings-for-multi-hop-reasoning#ran","syntology_url":"https://syntology.ai/paper/2110.13715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13715"}},"official":{"repos":["miralab-ustc/qe-cone"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-with-learnable-1","slug":"graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","arxiv_id":"2110.07875","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-neural-networks-with-learnable-1#ran","syntology_url":"https://syntology.ai/paper/2110.07875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.07875"}},"official":{"repos":["vijaydwivedi75/gnn-lspe"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bique-biquaternionic-embeddings-of-knowledge","slug":"bique-biquaternionic-embeddings-of-knowledge","title":"BiQUE: Biquaternionic Embeddings of Knowledge Graphs","date":"2021-09-29","arxiv_id":"2109.14401","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/bique-biquaternionic-embeddings-of-knowledge#ran","syntology_url":"https://syntology.ai/paper/2109.14401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.14401"}},"official":{"repos":["guojiapub/bique"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/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/temporal-knowledge-graph-completion-using-box","slug":"temporal-knowledge-graph-completion-using-box","title":"Temporal Knowledge Graph Completion using Box Embeddings","date":"2021-09-18","arxiv_id":"2109.08970","repositories_listed":1,"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/temporal-knowledge-graph-completion-using-box#ran","syntology_url":"https://syntology.ai/paper/2109.08970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08970"}},"official":null}},{"url":"/paper/expanding-end-to-end-question-answering-on","slug":"expanding-end-to-end-question-answering-on","title":"Expanding End-to-End Question Answering on Differentiable Knowledge Graphs with Intersection","date":"2021-09-13","arxiv_id":"2109.05808","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/expanding-end-to-end-question-answering-on#ran","syntology_url":"https://syntology.ai/paper/2109.05808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.05808"}},"official":null}},{"url":"/paper/mixture-of-partitions-infusing-large","slug":"mixture-of-partitions-infusing-large","title":"Mixture-of-Partitions: Infusing Large Biomedical Knowledge Graphs into BERT","date":"2021-09-10","arxiv_id":"2109.04810","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/mixture-of-partitions-infusing-large#ran","syntology_url":"https://syntology.ai/paper/2109.04810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04810"}},"official":{"repos":["cambridgeltl/mop"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["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/interactive-machine-comprehension-with-1","slug":"interactive-machine-comprehension-with-1","title":"Interactive Machine Comprehension with Dynamic Knowledge Graphs","date":"2021-08-31","arxiv_id":"2109.00077","repositories_listed":1,"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":6,"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/interactive-machine-comprehension-with-1#ran","syntology_url":"https://syntology.ai/paper/2109.00077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00077"}},"official":{"repos":["xingdi-eric-yuan/imrc_graph_public"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-augmented-political","slug":"knowledge-graph-augmented-political","title":"KGAP: Knowledge Graph Augmented Political Perspective Detection in News Media","date":"2021-08-09","arxiv_id":"2108.03861","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-graph-augmented-political#ran","syntology_url":"https://syntology.ai/paper/2108.03861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03861"}},"official":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/okgit-open-knowledge-graph-link-prediction","slug":"okgit-open-knowledge-graph-link-prediction","title":"OKGIT: Open Knowledge Graph Link Prediction with Implicit Types","date":"2021-06-24","arxiv_id":"2106.12806","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/okgit-open-knowledge-graph-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2106.12806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12806"}},"official":{"repos":["Chandrahasd/OKGIT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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/modeling-worlds-in-text","slug":"modeling-worlds-in-text","title":"Modeling Worlds in Text","date":"2021-06-17","arxiv_id":"2106.09578","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/modeling-worlds-in-text#ran","syntology_url":"https://syntology.ai/paper/2106.09578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09578"}},"official":{"repos":["JerichoWorld/JerichoWorld"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/query-embedding-on-hyper-relational-knowledge","slug":"query-embedding-on-hyper-relational-knowledge","title":"Query Embedding on Hyper-relational Knowledge Graphs","date":"2021-06-15","arxiv_id":"2106.08166","repositories_listed":1,"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/query-embedding-on-hyper-relational-knowledge#ran","syntology_url":"https://syntology.ai/paper/2106.08166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08166"}},"official":{"repos":["DimitrisAlivas/StarQE"],"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/knowing-the-no-match-entity-alignment-with","slug":"knowing-the-no-match-entity-alignment-with","title":"Knowing the No-match: Entity Alignment with Dangling Cases","date":"2021-06-04","arxiv_id":"2106.02248","repositories_listed":1,"syntology":{"n":22,"n_ran":6,"n_constructed":2,"n_ran_checked":5,"n_instrument":1,"n_unverified":16,"n_honours":3,"n_violates":0,"n_no_contract":2,"n_pointer_only":22,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/knowing-the-no-match-entity-alignment-with#ran","syntology_url":"https://syntology.ai/paper/2106.02248","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02248"}},"official":{"repos":["nju-websoft/OpenEA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":5,"n_unverified":16,"ran_from_kinds":["official"]}}},{"url":"/paper/diakg-an-annotated-diabetes-dataset-for","slug":"diakg-an-annotated-diabetes-dataset-for","title":"DiaKG: an Annotated Diabetes Dataset for Medical Knowledge Graph Construction","date":"2021-05-31","arxiv_id":"2105.15033","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diakg-an-annotated-diabetes-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2105.15033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.15033"}},"official":{"repos":["changdejie/diaKG-code"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-semantic-graph-construction-and","slug":"dynamic-semantic-graph-construction-and","title":"Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering","date":"2021-05-25","arxiv_id":"2105.11776","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/dynamic-semantic-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2105.11776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11776"}},"official":{"repos":["wwxu21/AMR-SG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-embeddings-from-knowledge-graphs","slug":"learning-embeddings-from-knowledge-graphs","title":"Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes","date":"2021-05-18","arxiv_id":"2105.08683","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/learning-embeddings-from-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/2105.08683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08683"}},"official":{"repos":["Accenture/AmpliGraph"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/an-adversarial-transfer-network-for-knowledge","slug":"an-adversarial-transfer-network-for-knowledge","title":"An Adversarial Transfer Network for Knowledge Representation Learning","date":"2021-04-30","arxiv_id":"2104.14757","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-adversarial-transfer-network-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2104.14757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14757"}},"official":{"repos":["LemonNoel/ATransN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/faithfully-explainable-recommendation-via","slug":"faithfully-explainable-recommendation-via","title":"Faithfully Explainable Recommendation via Neural Logic Reasoning","date":"2021-04-16","arxiv_id":"2104.07869","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/faithfully-explainable-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/2104.07869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07869"}},"official":{"repos":["orcax/LOGER"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/unicorn-on-rainbow-a-universal-commonsense","slug":"unicorn-on-rainbow-a-universal-commonsense","title":"UNICORN on RAINBOW: A Universal Commonsense Reasoning Model on a New Multitask Benchmark","date":"2021-03-24","arxiv_id":"2103.13009","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":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/unicorn-on-rainbow-a-universal-commonsense#ran","syntology_url":"https://syntology.ai/paper/2103.13009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13009"}},"official":{"repos":["allenai/rainbow"],"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/universal-representation-learning-of","slug":"universal-representation-learning-of","title":"Universal Representation Learning of Knowledge Bases by Jointly Embedding Instances and Ontological Concepts","date":"2021-03-15","arxiv_id":"2103.08115","repositories_listed":1,"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/universal-representation-learning-of#ran","syntology_url":"https://syntology.ai/paper/2103.08115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.08115"}},"official":{"repos":["JunhengH/joie-kdd19"],"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/topology-aware-correlations-between-relations","slug":"topology-aware-correlations-between-relations","title":"Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs","date":"2021-03-05","arxiv_id":"2103.03642","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 4 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; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/topology-aware-correlations-between-relations#ran","syntology_url":"https://syntology.ai/paper/2103.03642","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03642"}},"official":{"repos":["MIRALab-USTC/KG-TACT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/temporal-knowledge-graph-forecasting-with","slug":"temporal-knowledge-graph-forecasting-with","title":"Temporal Knowledge Graph Forecasting with Neural ODE","date":"2021-01-13","arxiv_id":"2101.05151","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/temporal-knowledge-graph-forecasting-with#ran","syntology_url":"https://syntology.ai/paper/2101.05151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.05151"}},"official":{"repos":["temporalkgteam/tango"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/xerte-explainable-reasoning-on-temporal","slug":"xerte-explainable-reasoning-on-temporal","title":"xERTE: Explainable Reasoning on Temporal Knowledge Graphs for Forecasting Future Links","date":"2020-12-31","arxiv_id":"2012.15537","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"3 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/xerte-explainable-reasoning-on-temporal#ran","syntology_url":"https://syntology.ai/paper/2012.15537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15537"}},"official":{"repos":["TemporalKGTeam/xERTE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/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/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/an-industry-evaluation-of-embedding-based","slug":"an-industry-evaluation-of-embedding-based","title":"An Industry Evaluation of Embedding-based Entity Alignment","date":"2020-10-22","arxiv_id":"2010.11522","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/an-industry-evaluation-of-embedding-based#ran","syntology_url":"https://syntology.ai/paper/2010.11522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11522"}},"official":{"repos":["ZihengZZH/industry-eval-EA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-reinforcement-learning-with-stacked","slug":"deep-reinforcement-learning-with-stacked","title":"Deep Reinforcement Learning with Stacked Hierarchical Attention for Text-based Games","date":"2020-10-22","arxiv_id":"2010.11655","repositories_listed":1,"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/deep-reinforcement-learning-with-stacked#ran","syntology_url":"https://syntology.ai/paper/2010.11655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11655"}},"official":{"repos":["YunqiuXu/SHA-KG"],"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/language-models-are-open-knowledge-graphs-1","slug":"language-models-are-open-knowledge-graphs-1","title":"Language Models are Open Knowledge Graphs","date":"2020-10-22","arxiv_id":"2010.11967","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":1,"n_no_contract":5,"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, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/language-models-are-open-knowledge-graphs-1#ran","syntology_url":"https://syntology.ai/paper/2010.11967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11967"}},"official":null}},{"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/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/inductive-entity-representations-from-text","slug":"inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"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/inductive-entity-representations-from-text#ran","syntology_url":"https://syntology.ai/paper/2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"}},"official":{"repos":["dfdazac/blp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sumgnn-multi-typed-drug-interaction","slug":"sumgnn-multi-typed-drug-interaction","title":"SumGNN: Multi-typed Drug Interaction Prediction via Efficient Knowledge Graph Summarization","date":"2020-10-04","arxiv_id":"2010.01450","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/sumgnn-multi-typed-drug-interaction#ran","syntology_url":"https://syntology.ai/paper/2010.01450","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01450"}},"official":{"repos":["yueyu1030/SumGNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/owl2vec-embedding-of-owl-ontologies","slug":"owl2vec-embedding-of-owl-ontologies","title":"OWL2Vec*: Embedding of OWL Ontologies","date":"2020-09-30","arxiv_id":"2009.14654","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/owl2vec-embedding-of-owl-ontologies#ran","syntology_url":"https://syntology.ai/paper/2009.14654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14654"}},"official":{"repos":["KRR-Oxford/OWL2Vec-Star"],"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":["listed","official"]}}},{"url":"/paper/graph-adversarial-networks-protecting","slug":"graph-adversarial-networks-protecting","title":"Information Obfuscation of Graph Neural Networks","date":"2020-09-28","arxiv_id":"2009.13504","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":5,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 5 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) · 0 unverified","sample_list":"/paper/graph-adversarial-networks-protecting#ran","syntology_url":"https://syntology.ai/paper/2009.13504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13504"}},"official":{"repos":["liaopeiyuan/GAL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-pivoting-for-unsupervised-entity","slug":"visual-pivoting-for-unsupervised-entity","title":"Visual Pivoting for (Unsupervised) Entity Alignment","date":"2020-09-28","arxiv_id":"2009.13603","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/visual-pivoting-for-unsupervised-entity#ran","syntology_url":"https://syntology.ai/paper/2009.13603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13603"}},"official":{"repos":["cambridgeltl/eva"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/message-passing-for-hyper-relational","slug":"message-passing-for-hyper-relational","title":"Message Passing for Hyper-Relational Knowledge Graphs","date":"2020-09-22","arxiv_id":"2009.10847","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":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/message-passing-for-hyper-relational#ran","syntology_url":"https://syntology.ai/paper/2009.10847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.10847"}},"official":{"repos":["migalkin/StarE"],"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/transfer-learning-of-graph-neural-networks","slug":"transfer-learning-of-graph-neural-networks","title":"Transfer Learning of Graph Neural Networks with Ego-graph Information Maximization","date":"2020-09-11","arxiv_id":"2009.05204","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transfer-learning-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2009.05204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05204"}},"official":{"repos":["GentleZhu/EGI"],"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":["official"]}}},{"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/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/generalized-multi-relational-graph","slug":"generalized-multi-relational-graph","title":"Knowledge Embedding Based Graph Convolutional Network","date":"2020-06-12","arxiv_id":"2006.07331","repositories_listed":1,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/generalized-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/2006.07331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07331"}},"official":{"repos":["Maysir/GEM-GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/cyclegt-unsupervised-graph-to-text-and-text","slug":"cyclegt-unsupervised-graph-to-text-and-text","title":"CycleGT: Unsupervised Graph-to-Text and Text-to-Graph Generation via Cycle Training","date":"2020-06-08","arxiv_id":"2006.04702","repositories_listed":2,"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/cyclegt-unsupervised-graph-to-text-and-text#ran","syntology_url":"https://syntology.ai/paper/2006.04702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04702"}},"official":{"repos":["QipengGuo/CycleGT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"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/connecting-the-dots-a-knowledgeable-path","slug":"connecting-the-dots-a-knowledgeable-path","title":"Connecting the Dots: A Knowledgeable Path Generator for Commonsense Question Answering","date":"2020-05-02","arxiv_id":"2005.00691","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/connecting-the-dots-a-knowledgeable-path#ran","syntology_url":"https://syntology.ai/paper/2005.00691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00691"}},"official":{"repos":["wangpf3/Commonsense-Path-Generator"],"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/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/transedge-translating-relation-contextualized","slug":"transedge-translating-relation-contextualized","title":"TransEdge: Translating Relation-contextualized Embeddings for Knowledge Graphs","date":"2020-04-22","arxiv_id":"2004.13579","repositories_listed":1,"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":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/transedge-translating-relation-contextualized#ran","syntology_url":"https://syntology.ai/paper/2004.13579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13579"}},"official":{"repos":["nju-websoft/TransEdge"],"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/kdconv-a-chinese-multi-domain-dialogue","slug":"kdconv-a-chinese-multi-domain-dialogue","title":"KdConv: A Chinese Multi-domain Dialogue Dataset Towards Multi-turn Knowledge-driven Conversation","date":"2020-04-08","arxiv_id":"2004.04100","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kdconv-a-chinese-multi-domain-dialogue#ran","syntology_url":"https://syntology.ai/paper/2004.04100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04100"}},"official":{"repos":["thu-coai/KdConv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/answering-complex-queries-in-knowledge-graphs","slug":"answering-complex-queries-in-knowledge-graphs","title":"Answering Complex Queries in Knowledge Graphs with Bidirectional Sequence Encoders","date":"2020-04-06","arxiv_id":"2004.02596","repositories_listed":1,"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/answering-complex-queries-in-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/2004.02596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02596"}},"official":null}},{"url":"/paper/the-graph-hawkes-network-for-reasoning-on","slug":"the-graph-hawkes-network-for-reasoning-on","title":"Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs","date":"2020-03-30","arxiv_id":"2003.13432","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/the-graph-hawkes-network-for-reasoning-on#ran","syntology_url":"https://syntology.ai/paper/2003.13432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13432"}},"official":{"repos":["Jeff20100601/GHNN_clean"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/how-to-avoid-being-eaten-by-a-grue","slug":"how-to-avoid-being-eaten-by-a-grue","title":"How To Avoid Being Eaten By a Grue: Exploration Strategies for Text-Adventure Agents","date":"2020-02-19","arxiv_id":"2002.08795","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/how-to-avoid-being-eaten-by-a-grue#ran","syntology_url":"https://syntology.ai/paper/2002.08795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08795"}},"official":{"repos":["rajammanabrolu/Q-BERT"],"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/interpretable-and-fair-comparison-of-link","slug":"interpretable-and-fair-comparison-of-link","title":"On the Ambiguity of Rank-Based Evaluation of Entity Alignment or Link Prediction Methods","date":"2020-02-17","arxiv_id":"2002.06914","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/interpretable-and-fair-comparison-of-link#ran","syntology_url":"https://syntology.ai/paper/2002.06914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06914"}},"official":{"repos":["mberr/rank-based-evaluation"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/message-passing-for-query-answering-over","slug":"message-passing-for-query-answering-over","title":"Message Passing Query Embedding","date":"2020-02-06","arxiv_id":"2002.02406","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":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/message-passing-for-query-answering-over#ran","syntology_url":"https://syntology.ai/paper/2002.02406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02406"}},"official":{"repos":["dfdazac/mpqe"],"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/generative-adversarial-zero-shot-relational","slug":"generative-adversarial-zero-shot-relational","title":"Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs","date":"2020-01-08","arxiv_id":"2001.02332","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/generative-adversarial-zero-shot-relational#ran","syntology_url":"https://syntology.ai/paper/2001.02332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.02332"}},"official":{"repos":["Panda0406/Zero-shot-knowledge-graph-relational-learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-hierarchy-aware-knowledge-graph","slug":"learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","repositories_listed":9,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-hierarchy-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09419"}},"official":{"repos":["MIRALab-USTC/KGE-HAKE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/knowledge-graph-alignment-network-with-gated","slug":"knowledge-graph-alignment-network-with-gated","title":"Knowledge Graph Alignment Network with Gated Multi-hop Neighborhood Aggregation","date":"2019-11-20","arxiv_id":"1911.08936","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/knowledge-graph-alignment-network-with-gated#ran","syntology_url":"https://syntology.ai/paper/1911.08936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08936"}},"official":{"repos":["nju-websoft/AliNet"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}}],"record_sha256":"6d3c84cbadcae214c7ea81fcd1c93afff8fc25bdb9b0f8192c76fb5ee014eb9a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}