{"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/13","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":13,"pages_in_order":30,"rows_per_page":100,"rows":[1201,1300],"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/12","next":"/task/knowledge-graphs/papers/14","papers":[{"url":"/paper/190513132","slug":"190513132","title":"Content based News Recommendation via Shortest Entity Distance over Knowledge Graphs","date":"2019-05-24","arxiv_id":"1905.13132","repositories_listed":1,"syntology":null},{"url":"/paper/multi-relational-poincare-graph-embeddings","slug":"multi-relational-poincare-graph-embeddings","title":"Multi-relational Poincaré Graph Embeddings","date":"2019-05-23","arxiv_id":"1905.09791","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/multi-relational-poincare-graph-embeddings#ran","syntology_url":"https://syntology.ai/paper/1905.09791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09791"}},"official":{"repos":["ibalazevic/multirelational-poincare"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simulation-and-augmentation-of-social","slug":"simulation-and-augmentation-of-social","title":"Simulation and Augmentation of Social Networks for Building Deep Learning Models","date":"2019-05-22","arxiv_id":"1905.09087","repositories_listed":1,"syntology":null},{"url":"/paper/tucker-tensor-factorization-for-knowledge-1","slug":"tucker-tensor-factorization-for-knowledge-1","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-05-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-exploit-long-term-relational","slug":"learning-to-exploit-long-term-relational","title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs","date":"2019-05-13","arxiv_id":"1905.04914","repositories_listed":1,"syntology":null},{"url":"/paper/knowledgeable-storyteller-a-commonsense","slug":"knowledgeable-storyteller-a-commonsense","title":"Knowledgeable Storyteller: A Commonsense-Driven Generative Model for Visual Storytelling","date":"2019-05-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-the-use-of-arxiv-as-a-dataset","slug":"on-the-use-of-arxiv-as-a-dataset","title":"On the Use of ArXiv as a Dataset","date":"2019-04-30","arxiv_id":"1905.00075","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-use-of-arxiv-as-a-dataset#ran","syntology_url":"https://syntology.ai/paper/1905.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00075"}},"official":{"repos":["mattbierbaum/arxiv-public-datasets"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/quaternion-knowledge-graph-embedding","slug":"quaternion-knowledge-graph-embedding","title":"Quaternion Knowledge Graph Embeddings","date":"2019-04-23","arxiv_id":"1904.10281","repositories_listed":1,"syntology":null},{"url":"/paper/be-concise-and-precise-synthesizing-open","slug":"be-concise-and-precise-synthesizing-open","title":"Be Concise and Precise: Synthesizing Open-Domain Entity Descriptions from Facts","date":"2019-04-16","arxiv_id":"1904.07391","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-knowledge-graph-embedding-methods","slug":"analyzing-knowledge-graph-embedding-methods","title":"Analyzing Knowledge Graph Embedding Methods from a Multi-Embedding Interaction Perspective","date":"2019-03-27","arxiv_id":"1903.11406","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-conversation-generation-with","slug":"knowledge-aware-conversation-generation-with","title":"Knowledge Aware Conversation Generation with Explainable Reasoning over Augmented Graphs","date":"2019-03-25","arxiv_id":"1903.10245","repositories_listed":1,"syntology":null},{"url":"/paper/deep-models-for-relational-databases","slug":"deep-models-for-relational-databases","title":"Equivariant Entity-Relationship Networks","date":"2019-03-21","arxiv_id":"1903.09033","repositories_listed":1,"syntology":null},{"url":"/paper/matching-entities-across-different-knowledge","slug":"matching-entities-across-different-knowledge","title":"Matching Entities Across Different Knowledge Graphs with Graph Embeddings","date":"2019-03-15","arxiv_id":"1903.06607","repositories_listed":1,"syntology":null},{"url":"/paper/jointly-learning-explainable-rules-for","slug":"jointly-learning-explainable-rules-for","title":"Jointly Learning Explainable Rules for Recommendation with Knowledge Graph","date":"2019-03-09","arxiv_id":"1903.03714","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/jointly-learning-explainable-rules-for#ran","syntology_url":"https://syntology.ai/paper/1903.03714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03714"}},"official":{"repos":["THUIR/RuleRec"],"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/el-embeddings-geometric-construction-of","slug":"el-embeddings-geometric-construction-of","title":"EL Embeddings: Geometric construction of models for the Description Logic EL ++","date":"2019-02-27","arxiv_id":"1902.10499","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-neural-machine-translation-with","slug":"augmenting-neural-machine-translation-with","title":"Augmenting Neural Machine Translation with Knowledge Graphs","date":"2019-02-23","arxiv_id":"1902.08816","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-conceptnet-path-quality-using","slug":"predicting-conceptnet-path-quality-using","title":"Predicting ConceptNet Path Quality Using Crowdsourced Assessments of Naturalness","date":"2019-02-21","arxiv_id":"1902.07831","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-fact-prediction-via-knowledge","slug":"knowledge-graph-fact-prediction-via-knowledge","title":"Knowledge Graph Fact Prediction via Knowledge-Enriched Tensor Factorization","date":"2019-02-08","arxiv_id":"1902.03077","repositories_listed":1,"syntology":null},{"url":"/paper/learning-vertex-representations-for-bipartite","slug":"learning-vertex-representations-for-bipartite","title":"Learning Vertex Representations for Bipartite Networks","date":"2019-01-16","arxiv_id":"1901.09676","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-uncertain-knowledge-graphs","slug":"embedding-uncertain-knowledge-graphs","title":"Embedding Uncertain Knowledge Graphs","date":"2018-11-26","arxiv_id":"1811.10667","repositories_listed":1,"syntology":null},{"url":"/paper/hcqa-hybrid-and-complex-question-answering-on","slug":"hcqa-hybrid-and-complex-question-answering-on","title":"HCqa: Hybrid and Complex Question Answering on Textual Corpus and Knowledge Graph","date":"2018-11-24","arxiv_id":"1811.10986","repositories_listed":1,"syntology":null},{"url":"/paper/differentiating-concepts-and-instances-for","slug":"differentiating-concepts-and-instances-for","title":"Differentiating Concepts and Instances for Knowledge Graph Embedding","date":"2018-11-12","arxiv_id":"1811.04588","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiating-concepts-and-instances-for#ran","syntology_url":"https://syntology.ai/paper/1811.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04588"}},"official":{"repos":["davidlvxin/TransC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-structure-aware-convolutional","slug":"end-to-end-structure-aware-convolutional","title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","date":"2018-11-11","arxiv_id":"1811.04441","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/end-to-end-structure-aware-convolutional#ran","syntology_url":"https://syntology.ai/paper/1811.04441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04441"}},"official":{"repos":["JD-AI-Research-Silicon-Valley/SACN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/logic-attention-based-neighborhood","slug":"logic-attention-based-neighborhood","title":"Logic Attention Based Neighborhood Aggregation for Inductive Knowledge Graph Embedding","date":"2018-11-04","arxiv_id":"1811.01399","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-explicit-paths-for-multi-hop","slug":"exploiting-explicit-paths-for-multi-hop","title":"Exploiting Explicit Paths for Multi-hop Reading Comprehension","date":"2018-11-02","arxiv_id":"1811.01127","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-query-graphs-for-complex","slug":"learning-to-rank-query-graphs-for-complex","title":"Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs","date":"2018-11-02","arxiv_id":"1811.01118","repositories_listed":1,"syntology":null},{"url":"/paper/openke-an-open-toolkit-for-knowledge","slug":"openke-an-open-toolkit-for-knowledge","title":"OpenKE: An Open Toolkit for Knowledge Embedding","date":"2018-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-micro-planned-generation-of","slug":"scalable-micro-planned-generation-of","title":"Scalable Micro-planned Generation of Discourse from Structured Data","date":"2018-10-05","arxiv_id":"1810.02889","repositories_listed":1,"syntology":null},{"url":"/paper/cross-lingual-knowledge-graph-alignment-via","slug":"cross-lingual-knowledge-graph-alignment-via","title":"Cross-lingual Knowledge Graph Alignment via Graph Convolutional Networks","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-relation-extraction-with-coarse","slug":"hierarchical-relation-extraction-with-coarse","title":"Hierarchical Relation Extraction with Coarse-to-Fine Grained Attention","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hyte-hyperplane-based-temporally-aware","slug":"hyte-hyperplane-based-temporally-aware","title":"HyTE: Hyperplane-based Temporally aware Knowledge Graph Embedding","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/edge2vec-representation-learning-using-edge","slug":"edge2vec-representation-learning-using-edge","title":"edge2vec: Representation learning using edge semantics for biomedical knowledge discovery","date":"2018-09-07","arxiv_id":"1809.02269","repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-better-metric-for-evaluating","slug":"towards-a-better-metric-for-evaluating","title":"Towards a Better Metric for Evaluating Question Generation Systems","date":"2018-08-30","arxiv_id":"1808.10192","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":3,"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/towards-a-better-metric-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/1808.10192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10192"}},"official":{"repos":["PrekshaNema25/Answerability-Metric"],"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/one-shot-relational-learning-for-knowledge","slug":"one-shot-relational-learning-for-knowledge","title":"One-Shot Relational Learning for Knowledge Graphs","date":"2018-08-27","arxiv_id":"1808.09040","repositories_listed":1,"syntology":null},{"url":"/paper/hypernetwork-knowledge-graph-embeddings","slug":"hypernetwork-knowledge-graph-embeddings","title":"Hypernetwork Knowledge Graph Embeddings","date":"2018-08-21","arxiv_id":"1808.07018","repositories_listed":1,"syntology":null},{"url":"/paper/farewell-freebase-migrating-the","slug":"farewell-freebase-migrating-the","title":"Farewell Freebase: Migrating the SimpleQuestions Dataset to DBpedia","date":"2018-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/feature-based-reformulation-of-entities-in","slug":"feature-based-reformulation-of-entities-in","title":"Feature-based reformulation of entities in triple pattern queries","date":"2018-07-04","arxiv_id":"1807.01801","repositories_listed":1,"syntology":null},{"url":"/paper/towards-understanding-the-geometry-of","slug":"towards-understanding-the-geometry-of","title":"Towards Understanding the Geometry of Knowledge Graph Embeddings","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-embeddings-as-an-alternative-paradigm-for","slug":"on-embeddings-as-an-alternative-paradigm-for","title":"A Comparative Study of Distributional and Symbolic Paradigms for Relational Learning","date":"2018-06-29","arxiv_id":"1806.11391","repositories_listed":1,"syntology":null},{"url":"/paper/elden-improved-entity-linking-using-densified","slug":"elden-improved-entity-linking-using-densified","title":"ELDEN: Improved Entity Linking Using Densified Knowledge Graphs","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generating-fine-grained-open-vocabulary","slug":"generating-fine-grained-open-vocabulary","title":"Generating Fine-Grained Open Vocabulary Entity Type Descriptions","date":"2018-05-27","arxiv_id":"1805.10564","repositories_listed":1,"syntology":null},{"url":"/paper/entity-duet-neural-ranking-understanding-the-1","slug":"entity-duet-neural-ranking-understanding-the-1","title":"Entity-Duet Neural Ranking: Understanding the Role of Knowledge Graph Semantics in Neural Information Retrieval","date":"2018-05-19","arxiv_id":"1805.07591","repositories_listed":1,"syntology":null},{"url":"/paper/improving-knowledge-graph-embedding-using","slug":"improving-knowledge-graph-embedding-using","title":"Improving Knowledge Graph Embedding Using Simple Constraints","date":"2018-05-07","arxiv_id":"1805.02408","repositories_listed":1,"syntology":null},{"url":"/paper/robust-discovery-of-positive-and-negative","slug":"robust-discovery-of-positive-and-negative","title":"Robust Discovery of Positive and Negative Rules in Knowledge-Bases","date":"2018-04-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-label-propagation-for-multi","slug":"scalable-label-propagation-for-multi","title":"Scalable Label Propagation for Multi-relational Learning on the Tensor Product of Graphs","date":"2018-02-20","arxiv_id":"1802.07379","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-question-generation-from-knowledge","slug":"zero-shot-question-generation-from-knowledge","title":"Zero-Shot Question Generation from Knowledge Graphs for Unseen Predicates and Entity Types","date":"2018-02-19","arxiv_id":"1802.06842","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/zero-shot-question-generation-from-knowledge#ran","syntology_url":"https://syntology.ai/paper/1802.06842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06842"}},"official":{"repos":["NAACL2018Anonymous/submission"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/incorporating-literals-into-knowledge-graph","slug":"incorporating-literals-into-knowledge-graph","title":"Incorporating Literals into Knowledge Graph Embeddings","date":"2018-02-03","arxiv_id":"1802.00934","repositories_listed":1,"syntology":null},{"url":"/paper/complex-sequential-question-answering-towards","slug":"complex-sequential-question-answering-towards","title":"Complex Sequential Question Answering: Towards Learning to Converse Over Linked Question Answer Pairs with a Knowledge Graph","date":"2018-01-31","arxiv_id":"1801.10314","repositories_listed":1,"syntology":null},{"url":"/paper/earl-joint-entity-and-relation-linking-for","slug":"earl-joint-entity-and-relation-linking-for","title":"EARL: Joint Entity and Relation Linking for Question Answering over Knowledge Graphs","date":"2018-01-11","arxiv_id":"1801.03825","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-with-iterative","slug":"knowledge-graph-embedding-with-iterative","title":"Knowledge Graph Embedding with Iterative Guidance from Soft Rules","date":"2017-11-30","arxiv_id":"1711.11231","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-zero-shot-learning-with","slug":"multi-label-zero-shot-learning-with","title":"Multi-Label Zero-Shot Learning with Structured Knowledge Graphs","date":"2017-11-17","arxiv_id":"1711.06526","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-simple-neural-networks-for","slug":"revisiting-simple-neural-networks-for","title":"Revisiting Simple Neural Networks for Learning Representations of Knowledge Graphs","date":"2017-11-15","arxiv_id":"1711.05401","repositories_listed":1,"syntology":null},{"url":"/paper/rdf2vec-rdf-graph-embeddings-and-their","slug":"rdf2vec-rdf-graph-embeddings-and-their","title":"RDF2Vec: RDF Graph Embeddings and Their Applications","date":"2017-11-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/open-world-knowledge-graph-completion","slug":"open-world-knowledge-graph-completion","title":"Open-World Knowledge Graph Completion","date":"2017-11-09","arxiv_id":"1711.03438","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/open-world-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1711.03438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03438"}},"official":{"repos":["bxshi/ConMask"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/semtk-an-ontology-first-open-source-semantic","slug":"semtk-an-ontology-first-open-source-semantic","title":"SemTK: An Ontology-first, Open Source Semantic Toolkit for Managing and Querying Knowledge Graphs","date":"2017-10-31","arxiv_id":"1710.11531","repositories_listed":1,"syntology":null},{"url":"/paper/on-inductive-abilities-of-latent-factor","slug":"on-inductive-abilities-of-latent-factor","title":"On Inductive Abilities of Latent Factor Models for Relational Learning","date":"2017-09-17","arxiv_id":"1709.05666","repositories_listed":1,"syntology":null},{"url":"/paper/variational-reasoning-for-question-answering","slug":"variational-reasoning-for-question-answering","title":"Variational Reasoning for Question Answering with Knowledge Graph","date":"2017-09-12","arxiv_id":"1709.04071","repositories_listed":1,"syntology":null},{"url":"/paper/dict2vec-learning-word-embeddings-using","slug":"dict2vec-learning-word-embeddings-using","title":"Dict2vec : Learning Word Embeddings using Lexical Dictionaries","date":"2017-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sparsity-and-noise-where-knowledge-graph","slug":"sparsity-and-noise-where-knowledge-graph","title":"Sparsity and Noise: Where Knowledge Graph Embeddings Fall Short","date":"2017-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/finding-streams-in-knowledge-graphs-to","slug":"finding-streams-in-knowledge-graphs-to","title":"Finding Streams in Knowledge Graphs to Support Fact Checking","date":"2017-08-24","arxiv_id":"1708.07239","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-the-impact-of-negative-sampling","slug":"analysis-of-the-impact-of-negative-sampling","title":"Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs","date":"2017-08-22","arxiv_id":"1708.06816","repositories_listed":1,"syntology":null},{"url":"/paper/retrofitting-distributional-embeddings-to","slug":"retrofitting-distributional-embeddings-to","title":"Retrofitting Distributional Embeddings to Knowledge Graphs with Functional Relations","date":"2017-08-01","arxiv_id":"1708.00112","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-entity-alignment-via-joint","slug":"iterative-entity-alignment-via-joint","title":"Iterative Entity Alignment via Joint Knowledge Embeddings","date":"2017-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/using-titles-vs-full-text-as-source-for","slug":"using-titles-vs-full-text-as-source-for","title":"Using Titles vs. Full-text as Source for Automated Semantic Document Annotation","date":"2017-05-15","arxiv_id":"1705.05311","repositories_listed":1,"syntology":null},{"url":"/paper/does-william-shakespeare-really-write-hamlet","slug":"does-william-shakespeare-really-write-hamlet","title":"Does William Shakespeare REALLY Write Hamlet? Knowledge Representation Learning with Confidence","date":"2017-05-09","arxiv_id":"1705.03202","repositories_listed":1,"syntology":null},{"url":"/paper/analogical-inference-for-multi-relational","slug":"analogical-inference-for-multi-relational","title":"Analogical Inference for Multi-Relational Embeddings","date":"2017-05-06","arxiv_id":"1705.02426","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-parallel-translating-embedding-for","slug":"efficient-parallel-translating-embedding-for","title":"Efficient Parallel Translating Embedding For Knowledge Graphs","date":"2017-03-30","arxiv_id":"1703.10316","repositories_listed":1,"syntology":null},{"url":"/paper/neuro-symbolic-representation-learning-on","slug":"neuro-symbolic-representation-learning-on","title":"Neuro-symbolic representation learning on biological knowledge graphs","date":"2016-12-13","arxiv_id":"1612.04256","repositories_listed":1,"syntology":null},{"url":"/paper/kognac-efficient-encoding-of-large-knowledge","slug":"kognac-efficient-encoding-of-large-knowledge","title":"KOGNAC: Efficient Encoding of Large Knowledge Graphs","date":"2016-04-16","arxiv_id":"1604.04795","repositories_listed":1,"syntology":null},{"url":"/paper/column-oriented-datalog-materialization-for","slug":"column-oriented-datalog-materialization-for","title":"Column-Oriented Datalog Materialization for Large Knowledge Graphs (Extended Technical Report)","date":"2015-11-28","arxiv_id":"1511.08915","repositories_listed":1,"syntology":null},{"url":"/paper/discriminative-predicate-path-mining-for-fact","slug":"discriminative-predicate-path-mining-for-fact","title":"Discriminative Predicate Path Mining for Fact Checking in Knowledge Graphs","date":"2015-10-20","arxiv_id":"1510.05911","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-via-dynamic-mapping","slug":"knowledge-graph-embedding-via-dynamic-mapping","title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","date":"2015-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-explain-entity-relationships-in","slug":"learning-to-explain-entity-relationships-in","title":"Learning to Explain Entity Relationships in Knowledge Graphs","date":"2015-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"smart-relation-aware-learning-of-geometric","title":"SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs","date":"2025-07-17","arxiv_id":"2507.13001","repositories_listed":0,"syntology":null},{"url":null,"slug":"topic-modeling-and-link-prediction-for","title":"Topic Modeling and Link-Prediction for Material Property Discovery","date":"2025-07-08","arxiv_id":"2507.06139","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-driven-knowledge-graph-completion","title":"Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing","date":"2025-06-29","arxiv_id":"2506.23141","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-inference-ai-systems-for-scientific","title":"Active Inference AI Systems for Scientific Discovery","date":"2025-06-26","arxiv_id":"2506.21329","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-llm-tool-use-with-high-quality","title":"Enhancing LLM Tool Use with High-quality Instruction Data from Knowledge Graph","date":"2025-06-26","arxiv_id":"2506.21071","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-reliable-adverse-event-profiles","title":"Generating Reliable Adverse event Profiles for Health through Automated Integrated Data (GRAPH-AID): A Semi-Automated Ontology Building Approach","date":"2025-06-25","arxiv_id":"2506.20851","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-scaled-graphrag-improving-multi-hop","title":"Inference Scaled GraphRAG: Improving Multi Hop Question Answering on Knowledge Graphs","date":"2025-06-24","arxiv_id":"2506.19967","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowml-improving-generalization-of-ml-nids","title":"KnowML: Improving Generalization of ML-NIDS with Attack Knowledge Graphs","date":"2025-06-24","arxiv_id":"2506.19802","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-prediction-structuring-epistemic","title":"Beyond Prediction -- Structuring Epistemic Integrity in Artificial Reasoning Systems","date":"2025-06-19","arxiv_id":"2506.17331","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semantically-aware-relevance-measure-for","title":"A Semantically-Aware Relevance Measure for Content-Based Medical Image Retrieval Evaluation","date":"2025-06-16","arxiv_id":"2506.13509","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-knowledge-graphs-and-bayesian","title":"Integrating Knowledge Graphs and Bayesian Networks: A Hybrid Approach for Explainable Disease Risk Prediction","date":"2025-06-16","arxiv_id":"2506.13920","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-immutable-memory-systems-for-artificial","title":"On Immutable Memory Systems for Artificial Agents: A Blockchain-Indexed Automata-Theoretic Framework Using ECDH-Keyed Merkle Chains","date":"2025-06-16","arxiv_id":"2506.13246","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-effect-of-knowledge-graph","title":"Understanding the Effect of Knowledge Graph Extraction Error on Downstream Graph Analyses: A Case Study on Affiliation Graphs","date":"2025-06-14","arxiv_id":"2506.12367","repositories_listed":0,"syntology":null},{"url":null,"slug":"reliable-reasoning-path-distilling-effective","title":"Reliable Reasoning Path: Distilling Effective Guidance for LLM Reasoning with Knowledge Graphs","date":"2025-06-12","arxiv_id":"2506.10508","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-pixels-to-graphs-using-scene-and","title":"From Pixels to Graphs: using Scene and Knowledge Graphs for HD-EPIC VQA Challenge","date":"2025-06-10","arxiv_id":"2506.08553","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-temporal-frbr-frbroo-based-model-for","title":"A Temporal FRBR/FRBRoo-Based Model for Component-Level Versioning of Legal Norms","date":"2025-06-09","arxiv_id":"2506.07853","repositories_listed":0,"syntology":null},{"url":null,"slug":"representing-time-continuous-behavior-of","title":"Representing Time-Continuous Behavior of Cyber-Physical Systems in Knowledge Graphs","date":"2025-06-08","arxiv_id":"2506.13773","repositories_listed":0,"syntology":null},{"url":null,"slug":"openag-democratizing-agricultural","title":"OpenAg: Democratizing Agricultural Intelligence","date":"2025-06-05","arxiv_id":"2506.04571","repositories_listed":0,"syntology":null},{"url":null,"slug":"schema-generation-for-large-knowledge-graphs","title":"Schema Generation for Large Knowledge Graphs Using Large Language Models","date":"2025-06-04","arxiv_id":"2506.04512","repositories_listed":0,"syntology":null},{"url":null,"slug":"iquest-an-iterative-question-guided-framework","title":"iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering","date":"2025-06-02","arxiv_id":"2506.01784","repositories_listed":0,"syntology":null},{"url":null,"slug":"retrieval-augmented-generation-of-ontologies","title":"Retrieval-Augmented Generation of Ontologies from Relational Databases","date":"2025-06-02","arxiv_id":"2506.01232","repositories_listed":0,"syntology":null},{"url":null,"slug":"guiding-generative-storytelling-with","title":"Guiding Generative Storytelling with Knowledge Graphs","date":"2025-05-30","arxiv_id":"2505.24803","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-knowledge-graphs-and-llms-for-1","title":"Leveraging Knowledge Graphs and LLMs for Structured Generation of Misinformation","date":"2025-05-30","arxiv_id":"2505.24479","repositories_listed":0,"syntology":null},{"url":null,"slug":"lkd-kgc-domain-specific-kg-construction-via","title":"LKD-KGC: Domain-Specific KG Construction via LLM-driven Knowledge Dependency Parsing","date":"2025-05-30","arxiv_id":"2505.24163","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-the-interface-between-knowledge","title":"Optimizing the Interface Between Knowledge Graphs and LLMs for Complex Reasoning","date":"2025-05-30","arxiv_id":"2505.24478","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-parameters-to-prompts-understanding-and","title":"From Parameters to Prompts: Understanding and Mitigating the Factuality Gap between Fine-Tuned LLMs","date":"2025-05-29","arxiv_id":"2505.23410","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graphs-for-digitized-manuscripts-in","title":"Knowledge Graphs for Digitized Manuscripts in Jagiellonian Digital Library Application","date":"2025-05-29","arxiv_id":"2506.03180","repositories_listed":0,"syntology":null}],"record_sha256":"1d7ab662604668ad3ea6a0180e17314da256dc6fb7e489e814aefa65e8565993","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}