{"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/11","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":11,"pages_in_order":30,"rows_per_page":100,"rows":[1001,1100],"of":2974,"counts":{"archive_papers_tagged":2974,"with_a_code_link":1273,"where_syntology_ran_a_sample":234,"not_listed_spam_title":0,"listed":2974,"listed_where_code_ran":234,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":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","prev":"/task/knowledge-graphs/papers/10","next":"/task/knowledge-graphs/papers/12","papers":[{"url":"/paper/finding-motifs-in-knowledge-graphs-using","slug":"finding-motifs-in-knowledge-graphs-using","title":"Finding Motifs in Knowledge Graphs using Compression","date":"2021-04-16","arxiv_id":"2104.08163","repositories_listed":1,"syntology":null},{"url":"/paper/improving-hyper-relational-knowledge-graph","slug":"improving-hyper-relational-knowledge-graph","title":"Improving Hyper-Relational Knowledge Graph Completion","date":"2021-04-16","arxiv_id":"2104.08167","repositories_listed":1,"syntology":null},{"url":"/paper/neptune-neural-powered-tucker-network-for","slug":"neptune-neural-powered-tucker-network-for","title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","date":"2021-04-15","arxiv_id":"2104.07824","repositories_listed":1,"syntology":null},{"url":"/paper/quadratic-gcn-for-graph-classification","slug":"quadratic-gcn-for-graph-classification","title":"Quadratic GCN for Graph Classification","date":"2021-04-14","arxiv_id":"2104.06750","repositories_listed":1,"syntology":null},{"url":"/paper/cbench-towards-better-evaluation-of-question","slug":"cbench-towards-better-evaluation-of-question","title":"CBench: Towards Better Evaluation of Question Answering Over Knowledge Graphs","date":"2021-04-05","arxiv_id":"2105.00811","repositories_listed":1,"syntology":null},{"url":"/paper/conversational-question-answering-over-1","slug":"conversational-question-answering-over-1","title":"Conversational Question Answering over Knowledge Graphs with Transformer and Graph Attention Networks","date":"2021-04-04","arxiv_id":"2104.01569","repositories_listed":1,"syntology":null},{"url":"/paper/grounding-dialogue-systems-via-knowledge","slug":"grounding-dialogue-systems-via-knowledge","title":"Grounding Dialogue Systems via Knowledge Graph Aware Decoding with Pre-trained Transformers","date":"2021-03-30","arxiv_id":"2103.16289","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-the-speed-of-entity-alignment-10","slug":"boosting-the-speed-of-entity-alignment-10","title":"Boosting the Speed of Entity Alignment 10*: Dual Attention Matching Network with Normalized Hard Sample Mining","date":"2021-03-29","arxiv_id":"2103.15452","repositories_listed":1,"syntology":null},{"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/demographic-aware-probabilistic-medical","slug":"demographic-aware-probabilistic-medical","title":"Demographic Aware Probabilistic Medical Knowledge Graph Embeddings of Electronic Medical Records","date":"2021-03-22","arxiv_id":"2103.11951","repositories_listed":1,"syntology":null},{"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/context-transformer-with-stacked-pointer","slug":"context-transformer-with-stacked-pointer","title":"Context Transformer with Stacked Pointer Networks for Conversational Question Answering over Knowledge Graphs","date":"2021-03-13","arxiv_id":"2103.07766","repositories_listed":1,"syntology":null},{"url":"/paper/paraqa-a-question-answering-dataset-with","slug":"paraqa-a-question-answering-dataset-with","title":"ParaQA: A Question Answering Dataset with Paraphrase Responses for Single-Turn Conversation","date":"2021-03-13","arxiv_id":"2103.07771","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-relation-prediction-by-bert","slug":"inductive-relation-prediction-by-bert","title":"Inductive Relation Prediction by BERT","date":"2021-03-12","arxiv_id":"2103.07102","repositories_listed":1,"syntology":null},{"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/secure-evaluation-of-knowledge-graph-merging","slug":"secure-evaluation-of-knowledge-graph-merging","title":"Secure Evaluation of Knowledge Graph Merging Gain","date":"2021-02-26","arxiv_id":"2103.00082","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-hypergraph-embedding-meets","slug":"knowledge-hypergraph-embedding-meets","title":"Knowledge Hypergraph Embedding Meets Relational Algebra","date":"2021-02-18","arxiv_id":"2102.09557","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-expansion-of-domain-specific","slug":"automatic-expansion-of-domain-specific","title":"Automatic Expansion of Domain-Specific Affective Models for Web Intelligence Applications","date":"2021-02-01","arxiv_id":"2102.00827","repositories_listed":1,"syntology":null},{"url":"/paper/commonsense-knowledge-mining-from-term","slug":"commonsense-knowledge-mining-from-term","title":"Commonsense Knowledge Mining from Term Definitions","date":"2021-02-01","arxiv_id":"2102.00651","repositories_listed":1,"syntology":null},{"url":"/paper/re-improving-multi-hop-question-answering","slug":"re-improving-multi-hop-question-answering","title":"[Re] Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings","date":"2021-01-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-entity-alignment-in-the-open-world-an","slug":"towards-entity-alignment-in-the-open-world-an","title":"Towards Entity Alignment in the Open World: An Unsupervised Approach","date":"2021-01-26","arxiv_id":"2101.10535","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-generation-variational-bayes-on","slug":"knowledge-generation-variational-bayes-on","title":"Knowledge Generation -- Variational Bayes on Knowledge Graphs","date":"2021-01-21","arxiv_id":"2101.08857","repositories_listed":1,"syntology":null},{"url":"/paper/eager-embedding-assisted-entity-resolution","slug":"eager-embedding-assisted-entity-resolution","title":"EAGER: Embedding-Assisted Entity Resolution for Knowledge Graphs","date":"2021-01-15","arxiv_id":"2101.06126","repositories_listed":1,"syntology":null},{"url":"/paper/continual-learning-of-knowledge-graph","slug":"continual-learning-of-knowledge-graph","title":"Continual Learning of Knowledge Graph Embeddings","date":"2021-01-14","arxiv_id":"2101.05850","repositories_listed":1,"syntology":null},{"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/application-of-knowledge-graphs-to-provide","slug":"application-of-knowledge-graphs-to-provide","title":"Application of Knowledge Graphs to Provide Side Information for Improved Recommendation Accuracy","date":"2021-01-07","arxiv_id":"2101.03054","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-based-collective","slug":"reinforcement-learning-based-collective","title":"Reinforcement Learning based Collective Entity Alignment with Adaptive Features","date":"2021-01-05","arxiv_id":"2101.01353","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-train-your-agent-to-read-and-write","slug":"how-to-train-your-agent-to-read-and-write","title":"How to Train Your Agent to Read and Write","date":"2021-01-04","arxiv_id":"2101.00916","repositories_listed":1,"syntology":null},{"url":"/paper/km-bart-knowledge-enhanced-multimodal-bart","slug":"km-bart-knowledge-enhanced-multimodal-bart","title":"KM-BART: Knowledge Enhanced Multimodal BART for Visual Commonsense Generation","date":"2021-01-02","arxiv_id":"2101.00419","repositories_listed":1,"syntology":null},{"url":"/paper/graphlog-a-benchmark-for-measuring-logical","slug":"graphlog-a-benchmark-for-measuring-logical","title":"GraphLog: A Benchmark for Measuring Logical Generalization in Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cocolm-complex-commonsense-enhanced-language","slug":"cocolm-complex-commonsense-enhanced-language","title":"CoCoLM: COmplex COmmonsense Enhanced Language Model with Discourse Relations","date":"2020-12-31","arxiv_id":"2012.15643","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-hyperboloid-representations","slug":"self-supervised-hyperboloid-representations","title":"Self-Supervised Hyperboloid Representations from Logical Queries over Knowledge Graphs","date":"2020-12-23","arxiv_id":"2012.13023","repositories_listed":1,"syntology":null},{"url":"/paper/cskg-the-commonsense-knowledge-graph","slug":"cskg-the-commonsense-knowledge-graph","title":"CSKG: The CommonSense Knowledge Graph","date":"2020-12-21","arxiv_id":"2012.11490","repositories_listed":1,"syntology":null},{"url":"/paper/distance-aware-molecule-graph-attention","slug":"distance-aware-molecule-graph-attention","title":"Distance-aware Molecule Graph Attention Network for Drug-Target Binding Affinity Prediction","date":"2020-12-17","arxiv_id":"2012.09624","repositories_listed":1,"syntology":null},{"url":"/paper/communicative-message-passing-for-inductive","slug":"communicative-message-passing-for-inductive","title":"Communicative Message Passing for Inductive Relation Reasoning","date":"2020-12-16","arxiv_id":"2012.08911","repositories_listed":1,"syntology":null},{"url":"/paper/keyword-guided-neural-conversational-model","slug":"keyword-guided-neural-conversational-model","title":"Keyword-Guided Neural Conversational Model","date":"2020-12-15","arxiv_id":"2012.08383","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-history-modeling-temporal","slug":"learning-from-history-modeling-temporal","title":"Learning from History: Modeling Temporal Knowledge Graphs with Sequential Copy-Generation Networks","date":"2020-12-15","arxiv_id":"2012.08492","repositories_listed":1,"syntology":null},{"url":"/paper/relation-aware-neighborhood-matching-model","slug":"relation-aware-neighborhood-matching-model","title":"Relation-Aware Neighborhood Matching Model for Entity Alignment","date":"2020-12-15","arxiv_id":"2012.08128","repositories_listed":1,"syntology":null},{"url":"/paper/fork-or-fail-cycle-consistent-training-with","slug":"fork-or-fail-cycle-consistent-training-with","title":"Fork or Fail: Cycle-Consistent Training with Many-to-One Mappings","date":"2020-12-14","arxiv_id":"2012.07412","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-and-interpretable-rule-based-link","slug":"scalable-and-interpretable-rule-based-link","title":"Scalable and interpretable rule-based link prediction for large heterogeneous knowledge graphs","date":"2020-12-10","arxiv_id":"2012.05750","repositories_listed":1,"syntology":null},{"url":"/paper/joint-entity-and-relation-canonicalization-in","slug":"joint-entity-and-relation-canonicalization-in","title":"Open Knowledge Graphs Canonicalization using Variational Autoencoders","date":"2020-12-08","arxiv_id":"2012.04780","repositories_listed":1,"syntology":null},{"url":"/paper/a-general-benchmarking-framework-for-text","slug":"a-general-benchmarking-framework-for-text","title":"A General Benchmarking Framework for Text Generation","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/genwiki-a-dataset-of-1-3-million-content","slug":"genwiki-a-dataset-of-1-3-million-content","title":"GenWiki: A Dataset of 1.3 Million Content-Sharing Text and Graphs for Unsupervised Graph-to-Text Generation","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graphs-meet-moral-values","slug":"knowledge-graphs-meet-moral-values","title":"Knowledge Graphs meet Moral Values","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-learning-for-knowledge-graph","slug":"multi-task-learning-for-knowledge-graph","title":"Multi-Task Learning for Knowledge Graph Completion with Pre-trained Language Models","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/suggest-me-a-movie-for-tonight-leveraging","slug":"suggest-me-a-movie-for-tonight-leveraging","title":"Suggest me a movie for tonight: Leveraging Knowledge Graphs for Conversational Recommendation","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/kst-gcn-a-knowledge-driven-spatial-temporal","slug":"kst-gcn-a-knowledge-driven-spatial-temporal","title":"KST-GCN: A Knowledge-Driven Spatial-Temporal Graph Convolutional Network for Traffic Forecasting","date":"2020-11-26","arxiv_id":"2011.14992","repositories_listed":1,"syntology":null},{"url":"/paper/the-geometry-of-distributed-representations","slug":"the-geometry-of-distributed-representations","title":"The Geometry of Distributed Representations for Better Alignment, Attenuated Bias, and Improved Interpretability","date":"2020-11-25","arxiv_id":"2011.12465","repositories_listed":1,"syntology":null},{"url":"/paper/entity-alignment-for-knowledge-graphs-with","slug":"entity-alignment-for-knowledge-graphs-with","title":"Entity Alignment for Knowledge Graphs with Multi-order Convolutional Networks","date":"2020-11-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tucker-decomposition-based-temporal-knowledge","slug":"tucker-decomposition-based-temporal-knowledge","title":"Tucker decomposition-based Temporal Knowledge Graph Completion","date":"2020-11-16","arxiv_id":"2011.07751","repositories_listed":1,"syntology":null},{"url":"/paper/rediscovering-alignment-relations-with-graph","slug":"rediscovering-alignment-relations-with-graph","title":"Discovering alignment relations with Graph Convolutional Networks: a biomedical case study","date":"2020-11-11","arxiv_id":"2011.06023","repositories_listed":1,"syntology":null},{"url":"/paper/node-attribute-completion-in-knowledge-graphs","slug":"node-attribute-completion-in-knowledge-graphs","title":"Node Attribute Completion in Knowledge Graphs with Multi-Relational Propagation","date":"2020-11-10","arxiv_id":"2011.05301","repositories_listed":1,"syntology":null},{"url":"/paper/dyernie-dynamic-evolution-of-riemannian","slug":"dyernie-dynamic-evolution-of-riemannian","title":"DyERNIE: Dynamic Evolution of Riemannian Manifold Embeddings for Temporal Knowledge Graph Completion","date":"2020-11-08","arxiv_id":"2011.03984","repositories_listed":1,"syntology":null},{"url":"/paper/coder-knowledge-infused-cross-lingual-medical","slug":"coder-knowledge-infused-cross-lingual-medical","title":"CODER: Knowledge infused cross-lingual medical term embedding for term normalization","date":"2020-11-05","arxiv_id":"2011.02947","repositories_listed":1,"syntology":null},{"url":"/paper/tough-tables-carefully-evaluating-entity","slug":"tough-tables-carefully-evaluating-entity","title":"Tough Tables: Carefully Evaluating Entity Linking for Tabular Data","date":"2020-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-critical-assessment-of-state-of-the-art-in","slug":"a-critical-assessment-of-state-of-the-art-in","title":"A Critical Assessment of State-of-the-Art in Entity Alignment","date":"2020-10-30","arxiv_id":"2010.16314","repositories_listed":1,"syntology":null},{"url":"/paper/cafe-coarse-to-fine-neural-symbolic-reasoning","slug":"cafe-coarse-to-fine-neural-symbolic-reasoning","title":"CAFE: Coarse-to-Fine Neural Symbolic Reasoning for Explainable Recommendation","date":"2020-10-29","arxiv_id":"2010.15620","repositories_listed":1,"syntology":null},{"url":"/paper/generating-knowledge-graphs-by-employing","slug":"generating-knowledge-graphs-by-employing","title":"Generating Knowledge Graphs by Employing Natural Language Processing and Machine Learning Techniques within the Scholarly Domain","date":"2020-10-28","arxiv_id":"2011.01103","repositories_listed":1,"syntology":null},{"url":"/paper/learning-contextualized-knowledge-structures","slug":"learning-contextualized-knowledge-structures","title":"Learning Contextualized Knowledge Structures for Commonsense Reasoning","date":"2020-10-24","arxiv_id":"2010.12873","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/learning-contextualized-knowledge-structures#ran","syntology_url":"https://syntology.ai/paper/2010.12873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12873"}},"official":{"repos":["INK-USC/HGN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/learning-to-deceive-knowledge-graph-augmented-1","slug":"learning-to-deceive-knowledge-graph-augmented-1","title":"Learning to Deceive Knowledge Graph Augmented Models via Targeted Perturbation","date":"2020-10-24","arxiv_id":"2010.12872","repositories_listed":1,"syntology":null},{"url":"/paper/pre-training-text-to-text-transformers-for","slug":"pre-training-text-to-text-transformers-for","title":"Pre-training Text-to-Text Transformers for Concept-centric Common Sense","date":"2020-10-24","arxiv_id":"2011.07956","repositories_listed":1,"syntology":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/privacy-preserving-visual-content-tagging","slug":"privacy-preserving-visual-content-tagging","title":"Privacy-Preserving Visual Content Tagging using Graph Transformer Networks","date":"2020-10-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-visual-content-tagging-1","slug":"privacy-preserving-visual-content-tagging-1","title":"Privacy-Preserving Visual Content Tagging using Graph Transformer Networks","date":"2020-10-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/temp-temporal-message-passing-for-temporal","slug":"temp-temporal-message-passing-for-temporal","title":"TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion","date":"2020-10-07","arxiv_id":"2010.03526","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-association-with-hyperbolic","slug":"knowledge-association-with-hyperbolic","title":"Knowledge Association with Hyperbolic Knowledge Graph Embeddings","date":"2020-10-05","arxiv_id":"2010.02162","repositories_listed":1,"syntology":null},{"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/contextual-knowledge-selection-and-embedding","slug":"contextual-knowledge-selection-and-embedding","title":"CokeBERT: Contextual Knowledge Selection and Embedding towards Enhanced Pre-Trained Language Models","date":"2020-09-29","arxiv_id":"2009.13964","repositories_listed":1,"syntology":null},{"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/inductively-representing-out-of-knowledge","slug":"inductively-representing-out-of-knowledge","title":"Inductively Representing Out-of-Knowledge-Graph Entities by Optimal Estimation Under Translational Assumptions","date":"2020-09-27","arxiv_id":"2009.12765","repositories_listed":1,"syntology":null},{"url":"/paper/quatre-relation-aware-quaternions-for","slug":"quatre-relation-aware-quaternions-for","title":"QuatRE: Relation-Aware Quaternions for Knowledge Graph Embeddings","date":"2020-09-26","arxiv_id":"2009.12517","repositories_listed":1,"syntology":null},{"url":"/paper/a-comparative-study-on-structural-and","slug":"a-comparative-study-on-structural-and","title":"A Comparative Study on Structural and Semantic Properties of Sentence Embeddings","date":"2020-09-23","arxiv_id":"2009.11226","repositories_listed":1,"syntology":null},{"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/extracting-summary-knowledge-graphs-from-long","slug":"extracting-summary-knowledge-graphs-from-long","title":"Extracting Summary Knowledge Graphs from Long Documents","date":"2020-09-19","arxiv_id":"2009.09162","repositories_listed":1,"syntology":null},{"url":"/paper/rdf2vec-light-a-lightweight-approachfor","slug":"rdf2vec-light-a-lightweight-approachfor","title":"RDF2Vec Light -- A Lightweight Approach for Knowledge Graph Embeddings","date":"2020-09-16","arxiv_id":"2009.07659","repositories_listed":1,"syntology":null},{"url":"/paper/revealing-secrets-in-sparql-session-level","slug":"revealing-secrets-in-sparql-session-level","title":"Revealing Secrets in SPARQL Session Level","date":"2020-09-13","arxiv_id":"2009.06625","repositories_listed":1,"syntology":null},{"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/dialogue-relation-extraction-with-document","slug":"dialogue-relation-extraction-with-document","title":"Dialogue Relation Extraction with Document-level Heterogeneous Graph Attention Networks","date":"2020-09-10","arxiv_id":"2009.05092","repositories_listed":1,"syntology":null},{"url":"/paper/rule-guided-graph-neural-networks-for","slug":"rule-guided-graph-neural-networks-for","title":"Rule-Guided Graph Neural Networks for Recommender Systems","date":"2020-09-09","arxiv_id":"2009.04104","repositories_listed":1,"syntology":null},{"url":"/paper/walk-extraction-strategies-for-node","slug":"walk-extraction-strategies-for-node","title":"Walk Extraction Strategies for Node Embeddings with RDF2Vec in Knowledge Graphs","date":"2020-09-09","arxiv_id":"2009.04404","repositories_listed":1,"syntology":null},{"url":"/paper/cava-a-visual-analytics-system-for","slug":"cava-a-visual-analytics-system-for","title":"CAVA: A Visual Analytics System for Exploratory Columnar Data Augmentation Using Knowledge Graphs","date":"2020-09-07","arxiv_id":"2009.02865","repositories_listed":1,"syntology":null},{"url":"/paper/more-is-not-always-better-the-negative-impact","slug":"more-is-not-always-better-the-negative-impact","title":"More is not Always Better: The Negative Impact of A-box Materialization on RDF2vec Knowledge Graph Embeddings","date":"2020-09-01","arxiv_id":"2009.00318","repositories_listed":1,"syntology":null},{"url":"/paper/pnel-pointer-network-based-end-to-end-entity","slug":"pnel-pointer-network-based-end-to-end-entity","title":"PNEL: Pointer Network based End-To-End Entity Linking over Knowledge Graphs","date":"2020-08-31","arxiv_id":"2009.00106","repositories_listed":1,"syntology":null},{"url":"/paper/lowfer-low-rank-bilinear-pooling-for-link","slug":"lowfer-low-rank-bilinear-pooling-for-link","title":"LowFER: Low-rank Bilinear Pooling for Link Prediction","date":"2020-08-25","arxiv_id":"2008.10858","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/lowfer-low-rank-bilinear-pooling-for-link#ran","syntology_url":"https://syntology.ai/paper/2008.10858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.10858"}},"official":{"repos":["suamin/LowFER"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/mmea-entity-alignment-for-multi-modal","slug":"mmea-entity-alignment-for-multi-modal","title":"MMEA: Entity Alignment for Multi-Modal Knowledge Graphs","date":"2020-08-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/challenges-of-linking-organizational","slug":"challenges-of-linking-organizational","title":"Challenges of Linking Organizational Information in Open Government Data to Knowledge Graphs","date":"2020-08-14","arxiv_id":"2008.06232","repositories_listed":1,"syntology":null},{"url":"/paper/quaternion-graph-neural-networks","slug":"quaternion-graph-neural-networks","title":"Quaternion Graph Neural Networks","date":"2020-08-12","arxiv_id":"2008.05089","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/quaternion-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2008.05089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05089"}},"official":{"repos":["daiquocnguyen/QGNN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dense-an-enhanced-non-abelian-group","slug":"dense-an-enhanced-non-abelian-group","title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","date":"2020-08-11","arxiv_id":"2008.04548","repositories_listed":1,"syntology":null},{"url":"/paper/oba-an-ontology-based-framework-for-creating","slug":"oba-an-ontology-based-framework-for-creating","title":"OBA: An Ontology-Based Framework for Creating REST APIs for Knowledge Graphs","date":"2020-07-17","arxiv_id":"2007.09206","repositories_listed":1,"syntology":null},{"url":"/paper/tackling-scalability-issues-in-mining-path","slug":"tackling-scalability-issues-in-mining-path","title":"Tackling scalability issues in mining path patterns from knowledge graphs: a preliminary study","date":"2020-07-17","arxiv_id":"2007.08821","repositories_listed":1,"syntology":null},{"url":"/paper/wordcraft-an-environment-for-benchmarking","slug":"wordcraft-an-environment-for-benchmarking","title":"WordCraft: An Environment for Benchmarking Commonsense Agents","date":"2020-07-17","arxiv_id":"2007.09185","repositories_listed":1,"syntology":null},{"url":"/paper/boxe-a-box-embedding-model-for-knowledge-base","slug":"boxe-a-box-embedding-model-for-knowledge-base","title":"BoxE: A Box Embedding Model for Knowledge Base Completion","date":"2020-07-13","arxiv_id":"2007.06267","repositories_listed":1,"syntology":null},{"url":"/paper/diverse-and-informative-dialogue-generation","slug":"diverse-and-informative-dialogue-generation","title":"Diverse and Informative Dialogue Generation with Context-Specific Commonsense Knowledge Awareness","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transint-embedding-implication-rules-in-1","slug":"transint-embedding-implication-rules-in-1","title":"TransINT: Embedding Implication Rules in Knowledge Graphs with Isomorphic Intersections of Linear Subspaces","date":"2020-07-01","arxiv_id":"2007.00271","repositories_listed":1,"syntology":null},{"url":"/paper/building-rule-hierarchies-for-efficient","slug":"building-rule-hierarchies-for-efficient","title":"Building Rule Hierarchies for Efficient Logical Rule Learning from Knowledge Graphs","date":"2020-06-29","arxiv_id":"2006.16171","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-approach-to-case-based-reasoning-in","slug":"a-simple-approach-to-case-based-reasoning-in","title":"A Simple Approach to Case-Based Reasoning in Knowledge Bases","date":"2020-06-25","arxiv_id":"2006.14198","repositories_listed":1,"syntology":null},{"url":"/paper/benchmark-and-best-practices-for-biomedical-1","slug":"benchmark-and-best-practices-for-biomedical-1","title":"Benchmark and Best Practices for Biomedical Knowledge Graph Embeddings","date":"2020-06-24","arxiv_id":"2006.13774","repositories_listed":1,"syntology":null},{"url":"/paper/malont-an-ontology-for-malware-threat","slug":"malont-an-ontology-for-malware-threat","title":"MALOnt: An Ontology for Malware Threat Intelligence","date":"2020-06-20","arxiv_id":"2006.11446","repositories_listed":1,"syntology":null},{"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"]}}}],"record_sha256":"51b6ac75a6b5f49dd63db1bd08a4a92c0e41936b0e2db8c8c3ff009d3665d2f4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}