{"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/7","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":7,"pages_in_order":30,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/knowledge-graphs/papers/8","papers":[{"url":"/paper/chatlaw-open-source-legal-large-language","slug":"chatlaw-open-source-legal-large-language","title":"Chatlaw: A Multi-Agent Collaborative Legal Assistant with Knowledge Graph Enhanced Mixture-of-Experts Large Language Model","date":"2023-06-28","arxiv_id":"2306.16092","repositories_listed":1,"syntology":null},{"url":"/paper/towards-few-shot-inductive-link-prediction-on","slug":"towards-few-shot-inductive-link-prediction-on","title":"Towards Few-shot Inductive Link Prediction on Knowledge Graphs: A Relational Anonymous Walk-guided Neural Process Approach","date":"2023-06-26","arxiv_id":"2307.01204","repositories_listed":1,"syntology":null},{"url":"/paper/dekgci-a-double-sided-recommendation-model","slug":"dekgci-a-double-sided-recommendation-model","title":"DEKGCI: A double-sided recommendation model for integrating knowledge graph and user-item interaction graph","date":"2023-06-24","arxiv_id":"2306.13837","repositories_listed":1,"syntology":null},{"url":"/paper/mutually-guided-few-shot-learning-for","slug":"mutually-guided-few-shot-learning-for","title":"Mutually Guided Few-shot Learning for Relational Triple Extraction","date":"2023-06-23","arxiv_id":"2306.13310","repositories_listed":1,"syntology":null},{"url":"/paper/a-decade-of-scholarly-research-on-open","slug":"a-decade-of-scholarly-research-on-open","title":"A Decade of Scholarly Research on Open Knowledge Graphs","date":"2023-06-22","arxiv_id":"2306.13186","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-representations-for-relation","slug":"explainable-representations-for-relation","title":"Explainable Representations for Relation Prediction in Knowledge Graphs","date":"2023-06-22","arxiv_id":"2306.12687","repositories_listed":1,"syntology":null},{"url":"/paper/otter-knowledge-benchmarks-of-multimodal","slug":"otter-knowledge-benchmarks-of-multimodal","title":"Otter-Knowledge: benchmarks of multimodal knowledge graph representation learning from different sources for drug discovery","date":"2023-06-22","arxiv_id":"2306.12802","repositories_listed":1,"syntology":null},{"url":"/paper/bidirectional-end-to-end-learning-of","slug":"bidirectional-end-to-end-learning-of","title":"Bidirectional End-to-End Learning of Retriever-Reader Paradigm for Entity Linking","date":"2023-06-21","arxiv_id":"2306.12245","repositories_listed":1,"syntology":null},{"url":"/paper/tuckerdncaching-high-quality-negative","slug":"tuckerdncaching-high-quality-negative","title":"TuckerDNCaching: high-quality negative sampling with tucker decomposition","date":"2023-06-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/uukg-unified-urban-knowledge-graph-dataset-1","slug":"uukg-unified-urban-knowledge-graph-dataset-1","title":"UUKG: Unified Urban Knowledge Graph Dataset for Urban Spatiotemporal Prediction","date":"2023-06-20","arxiv_id":"2306.11443","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/uukg-unified-urban-knowledge-graph-dataset-1#ran","syntology_url":"https://syntology.ai/paper/2306.11443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11443"}},"official":{"repos":["usail-hkust/uukg"],"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/bioblp-a-modular-framework-for-learning-on","slug":"bioblp-a-modular-framework-for-learning-on","title":"BioBLP: A Modular Framework for Learning on Multimodal Biomedical Knowledge Graphs","date":"2023-06-06","arxiv_id":"2306.03606","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-of-situational-reasoning-for-traffic","slug":"a-study-of-situational-reasoning-for-traffic","title":"A Study of Situational Reasoning for Traffic Understanding","date":"2023-06-05","arxiv_id":"2306.02520","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-study-of-situational-reasoning-for-traffic#ran","syntology_url":"https://syntology.ai/paper/2306.02520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02520"}},"official":{"repos":["saccharomycetes/text-based-traffic-understanding"],"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","unlocated"]}}},{"url":"/paper/joint-pre-training-and-local-re-training","slug":"joint-pre-training-and-local-re-training","title":"Joint Pre-training and Local Re-training: Transferable Representation Learning on Multi-source Knowledge Graphs","date":"2023-06-05","arxiv_id":"2306.02679","repositories_listed":1,"syntology":null},{"url":"/paper/what-makes-entities-similar-a-similarity","slug":"what-makes-entities-similar-a-similarity","title":"What Makes Entities Similar? A Similarity Flooding Perspective for Multi-sourced Knowledge Graph Embeddings","date":"2023-06-05","arxiv_id":"2306.02622","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/what-makes-entities-similar-a-similarity#ran","syntology_url":"https://syntology.ai/paper/2306.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02622"}},"official":{"repos":["nju-websoft/unify-ea-sf"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/shrinking-embeddings-for-hyper-relational","slug":"shrinking-embeddings-for-hyper-relational","title":"Shrinking Embeddings for Hyper-Relational Knowledge Graphs","date":"2023-06-03","arxiv_id":"2306.02199","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-reasoning-over-entities-and","slug":"knowledge-graph-reasoning-over-entities-and","title":"Knowledge Graph Reasoning over Entities and Numerical Values","date":"2023-06-02","arxiv_id":"2306.01399","repositories_listed":1,"syntology":null},{"url":"/paper/ingram-inductive-knowledge-graph-embedding","slug":"ingram-inductive-knowledge-graph-embedding","title":"InGram: Inductive Knowledge Graph Embedding via Relation Graphs","date":"2023-05-31","arxiv_id":"2305.19987","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":3,"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/ingram-inductive-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2305.19987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19987"}},"official":{"repos":["bdi-lab/ingram"],"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/knowledge-graph-embeddings-in-the-biomedical","slug":"knowledge-graph-embeddings-in-the-biomedical","title":"Knowledge Graph Embeddings in the Biomedical Domain: Are They Useful? A Look at Link Prediction, Rule Learning, and Downstream Polypharmacy Tasks","date":"2023-05-31","arxiv_id":"2305.19979","repositories_listed":1,"syntology":null},{"url":"/paper/complex-query-answering-on-eventuality-1","slug":"complex-query-answering-on-eventuality-1","title":"Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraints","date":"2023-05-30","arxiv_id":"2305.19068","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-on-hyper-relational","slug":"representation-learning-on-hyper-relational","title":"Representation Learning on Hyper-Relational and Numeric Knowledge Graphs with Transformers","date":"2023-05-29","arxiv_id":"2305.18256","repositories_listed":1,"syntology":null},{"url":"/paper/choose-your-data-wisely-a-framework-for","slug":"choose-your-data-wisely-a-framework-for","title":"Choose your Data Wisely: A Framework for Semantic Counterfactuals","date":"2023-05-28","arxiv_id":"2305.17667","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/choose-your-data-wisely-a-framework-for#ran","syntology_url":"https://syntology.ai/paper/2305.17667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17667"}},"official":{"repos":["geofila/Semantic-Counterfactuals"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/memegraphs-linking-memes-to-knowledge-graphs","slug":"memegraphs-linking-memes-to-knowledge-graphs","title":"MemeGraphs: Linking Memes to Knowledge Graphs","date":"2023-05-28","arxiv_id":"2305.18391","repositories_listed":1,"syntology":null},{"url":"/paper/complementing-gpt-3-with-few-shot-sequence-to","slug":"complementing-gpt-3-with-few-shot-sequence-to","title":"Fine-tuned LLMs Know More, Hallucinate Less with Few-Shot Sequence-to-Sequence Semantic Parsing over Wikidata","date":"2023-05-23","arxiv_id":"2305.14202","repositories_listed":1,"syntology":null},{"url":"/paper/query-structure-modeling-for-inductive","slug":"query-structure-modeling-for-inductive","title":"Query Structure Modeling for Inductive Logical Reasoning Over Knowledge Graphs","date":"2023-05-23","arxiv_id":"2305.13585","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-knowledge-graph-generation-from","slug":"boosting-knowledge-graph-generation-from","title":"Boosting Knowledge Graph Generation from Tabular Data with RML Views","date":"2023-05-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/friendly-neighbors-contextualized-sequence-to","slug":"friendly-neighbors-contextualized-sequence-to","title":"Friendly Neighbors: Contextualized Sequence-to-Sequence Link Prediction","date":"2023-05-22","arxiv_id":"2305.13059","repositories_listed":1,"syntology":null},{"url":"/paper/llms-for-knowledge-graph-construction-and","slug":"llms-for-knowledge-graph-construction-and","title":"LLMs for Knowledge Graph Construction and Reasoning: Recent Capabilities and Future Opportunities","date":"2023-05-22","arxiv_id":"2305.13168","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/llms-for-knowledge-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2305.13168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13168"}},"official":{"repos":["zjunlp/autokg"],"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/logical-entity-representation-in-knowledge","slug":"logical-entity-representation-in-knowledge","title":"Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning","date":"2023-05-22","arxiv_id":"2305.12738","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/logical-entity-representation-in-knowledge#ran","syntology_url":"https://syntology.ai/paper/2305.12738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12738"}},"official":{"repos":["glaciohound/lerp"],"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/from-alignment-to-entailment-a-unified","slug":"from-alignment-to-entailment-a-unified","title":"From Alignment to Entailment: A Unified Textual Entailment Framework for Entity Alignment","date":"2023-05-19","arxiv_id":"2305.11501","repositories_listed":1,"syntology":null},{"url":"/paper/analysing-biomedical-knowledge-graphs-using","slug":"analysing-biomedical-knowledge-graphs-using","title":"Analysing Biomedical Knowledge Graphs using Prime Adjacency Matrices","date":"2023-05-17","arxiv_id":"2305.10467","repositories_listed":1,"syntology":null},{"url":"/paper/iteratively-learning-representations-for","slug":"iteratively-learning-representations-for","title":"Iteratively Learning Representations for Unseen Entities with Inter-Rule Correlations","date":"2023-05-17","arxiv_id":"2305.10531","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-weighted-construction-of","slug":"similarity-weighted-construction-of","title":"Similarity-weighted Construction of Contextualized Commonsense Knowledge Graphs for Knowledge-intense Argumentation Tasks","date":"2023-05-15","arxiv_id":"2305.08495","repositories_listed":1,"syntology":null},{"url":"/paper/the-structure-and-dynamics-of-knowledge","slug":"the-structure-and-dynamics-of-knowledge","title":"The Structure and Dynamics of Knowledge Graphs, with Superficiality","date":"2023-05-14","arxiv_id":"2305.08116","repositories_listed":1,"syntology":null},{"url":"/paper/pre-trained-language-model-with-prompts-for","slug":"pre-trained-language-model-with-prompts-for","title":"Pre-trained Language Model with Prompts for Temporal Knowledge Graph Completion","date":"2023-05-13","arxiv_id":"2305.07912","repositories_listed":1,"syntology":null},{"url":"/paper/a-fused-gromov-wasserstein-framework-for","slug":"a-fused-gromov-wasserstein-framework-for","title":"A Fused Gromov-Wasserstein Framework for Unsupervised Knowledge Graph Entity Alignment","date":"2023-05-11","arxiv_id":"2305.06574","repositories_listed":1,"syntology":null},{"url":"/paper/factkg-fact-verification-via-reasoning-on","slug":"factkg-fact-verification-via-reasoning-on","title":"FactKG: Fact Verification via Reasoning on Knowledge Graphs","date":"2023-05-11","arxiv_id":"2305.06590","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/factkg-fact-verification-via-reasoning-on#ran","syntology_url":"https://syntology.ai/paper/2305.06590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06590"}},"official":{"repos":["jiho283/FactKG"],"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/hahe-hierarchical-attention-for-hyper","slug":"hahe-hierarchical-attention-for-hyper","title":"HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level","date":"2023-05-11","arxiv_id":"2305.06588","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":3,"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 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/hahe-hierarchical-attention-for-hyper#ran","syntology_url":"https://syntology.ai/paper/2305.06588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06588"}},"official":{"repos":["lhrlab/hahe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/analogykb-unlocking-analogical-reasoning-of","slug":"analogykb-unlocking-analogical-reasoning-of","title":"ANALOGYKB: Unlocking Analogical Reasoning of Language Models with A Million-scale Knowledge Base","date":"2023-05-10","arxiv_id":"2305.05994","repositories_listed":1,"syntology":null},{"url":"/paper/cadge-context-aware-dialogue-generation","slug":"cadge-context-aware-dialogue-generation","title":"CADGE: Context-Aware Dialogue Generation Enhanced with Graph-Structured Knowledge Aggregation","date":"2023-05-10","arxiv_id":"2305.06294","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-for-person-or-entity","slug":"representation-learning-for-person-or-entity","title":"Representation Learning for Person or Entity-centric Knowledge Graphs: An Application in Healthcare","date":"2023-05-09","arxiv_id":"2305.05640","repositories_listed":1,"syntology":null},{"url":"/paper/a-minimal-approach-for-natural-language","slug":"a-minimal-approach-for-natural-language","title":"A Minimal Approach for Natural Language Action Space in Text-based Games","date":"2023-05-06","arxiv_id":"2305.04082","repositories_listed":1,"syntology":null},{"url":"/paper/srtk-a-toolkit-for-semantic-relevant-subgraph","slug":"srtk-a-toolkit-for-semantic-relevant-subgraph","title":"SRTK: A Toolkit for Semantic-relevant Subgraph Retrieval","date":"2023-05-06","arxiv_id":"2305.04101","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-fisher-rao-embedding-logical","slug":"wasserstein-fisher-rao-embedding-logical","title":"Wasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transport","date":"2023-05-06","arxiv_id":"2305.04034","repositories_listed":1,"syntology":null},{"url":"/paper/conversational-semantic-parsing-using-dynamic","slug":"conversational-semantic-parsing-using-dynamic","title":"Conversational Semantic Parsing using Dynamic Context Graphs","date":"2023-05-04","arxiv_id":"2305.06164","repositories_listed":1,"syntology":null},{"url":"/paper/exekglib-knowledge-graphs-empowered-machine","slug":"exekglib-knowledge-graphs-empowered-machine","title":"ExeKGLib: Knowledge Graphs-Empowered Machine Learning Analytics","date":"2023-05-04","arxiv_id":"2305.02966","repositories_listed":1,"syntology":null},{"url":"/paper/causality-aware-concept-extraction-based-on","slug":"causality-aware-concept-extraction-based-on","title":"Causality-aware Concept Extraction based on Knowledge-guided Prompting","date":"2023-05-03","arxiv_id":"2305.01876","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-security-risks-of-knowledge-graph","slug":"on-the-security-risks-of-knowledge-graph","title":"On the Security Risks of Knowledge Graph Reasoning","date":"2023-05-03","arxiv_id":"2305.02383","repositories_listed":1,"syntology":null},{"url":"/paper/peacok-persona-commonsense-knowledge-for","slug":"peacok-persona-commonsense-knowledge-for","title":"PeaCoK: Persona Commonsense Knowledge for Consistent and Engaging Narratives","date":"2023-05-03","arxiv_id":"2305.02364","repositories_listed":1,"syntology":null},{"url":"/paper/complex-logical-reasoning-over-knowledge","slug":"complex-logical-reasoning-over-knowledge","title":"Complex Logical Reasoning over Knowledge Graphs using Large Language Models","date":"2023-05-02","arxiv_id":"2305.01157","repositories_listed":1,"syntology":null},{"url":"/paper/otiea-ontology-enhanced-triple-intrinsic","slug":"otiea-ontology-enhanced-triple-intrinsic","title":"OTIEA:Ontology-enhanced Triple Intrinsic-Correlation for Cross-lingual Entity Alignment","date":"2023-05-02","arxiv_id":"2305.01561","repositories_listed":1,"syntology":null},{"url":"/paper/type-enhanced-ensemble-triple-representation","slug":"type-enhanced-ensemble-triple-representation","title":"Type-enhanced Ensemble Triple Representation via Triple-aware Attention for Cross-lingual Entity Alignment","date":"2023-05-02","arxiv_id":"2305.01556","repositories_listed":1,"syntology":null},{"url":"/paper/improving-knowledge-graph-entity-alignment","slug":"improving-knowledge-graph-entity-alignment","title":"Improving Knowledge Graph Entity Alignment with Graph Augmentation","date":"2023-04-28","arxiv_id":"2304.14585","repositories_listed":1,"syntology":null},{"url":"/paper/litcqd-multi-hop-reasoning-in-incomplete","slug":"litcqd-multi-hop-reasoning-in-incomplete","title":"LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals","date":"2023-04-28","arxiv_id":"2304.14742","repositories_listed":1,"syntology":null},{"url":"/paper/neuralkg-ind-a-python-library-for-inductive","slug":"neuralkg-ind-a-python-library-for-inductive","title":"NeuralKG-ind: A Python Library for Inductive Knowledge Graph Representation Learning","date":"2023-04-28","arxiv_id":"2304.14678","repositories_listed":1,"syntology":null},{"url":"/paper/sgaligner-3d-scene-alignment-with-scene","slug":"sgaligner-3d-scene-alignment-with-scene","title":"SGAligner : 3D Scene Alignment with Scene Graphs","date":"2023-04-28","arxiv_id":"2304.14880","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/sgaligner-3d-scene-alignment-with-scene#ran","syntology_url":"https://syntology.ai/paper/2304.14880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14880"}},"official":{"repos":["sayands/sgaligner"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/connector-0-5-a-unified-framework-for-graph","slug":"connector-0-5-a-unified-framework-for-graph","title":"Connector 0.5: A unified framework for graph representation learning","date":"2023-04-25","arxiv_id":"2304.13195","repositories_listed":1,"syntology":null},{"url":"/paper/logicrec-recommendation-with-users-logical","slug":"logicrec-recommendation-with-users-logical","title":"LogicRec: Recommendation with Users' Logical Requirements","date":"2023-04-23","arxiv_id":"2304.11722","repositories_listed":1,"syntology":null},{"url":"/paper/enabling-knowledge-discovery-in-natural","slug":"enabling-knowledge-discovery-in-natural","title":"Enabling knowledge discovery in natural hazard engineering datasets on DesignSafe","date":"2023-04-21","arxiv_id":"2304.11273","repositories_listed":1,"syntology":null},{"url":"/paper/patecon-a-pattern-based-temporal-constraint","slug":"patecon-a-pattern-based-temporal-constraint","title":"PaTeCon: A Pattern-Based Temporal Constraint Mining Method for Conflict Detection on Knowledge Graphs","date":"2023-04-18","arxiv_id":"2304.09015","repositories_listed":1,"syntology":null},{"url":"/paper/normalizing-flow-based-neural-process-for-few","slug":"normalizing-flow-based-neural-process-for-few","title":"Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion","date":"2023-04-17","arxiv_id":"2304.08183","repositories_listed":1,"syntology":null},{"url":"/paper/syntactic-complexity-identification","slug":"syntactic-complexity-identification","title":"Syntactic Complexity Identification, Measurement, and Reduction Through Controlled Syntactic Simplification","date":"2023-04-16","arxiv_id":"2304.07774","repositories_listed":1,"syntology":null},{"url":"/paper/on-existential-first-order-queries-inference","slug":"on-existential-first-order-queries-inference","title":"Rethinking Complex Queries on Knowledge Graphs with Neural Link Predictors","date":"2023-04-14","arxiv_id":"2304.07063","repositories_listed":1,"syntology":{"n":41,"n_ran":20,"n_constructed":0,"n_ran_checked":13,"n_instrument":7,"n_unverified":21,"n_honours":2,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 0 violated, 11 with no contract checked; 7 where Syntology's instrument failed) · 21 unverified","sample_list":"/paper/on-existential-first-order-queries-inference#ran","syntology_url":"https://syntology.ai/paper/2304.07063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.07063"}},"official":{"repos":["hkust-knowcomp/fit"],"state":"official (archive's flag): 20 ran","n_ran":20,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":21,"ran_from_kinds":["official"]}}},{"url":"/paper/sea-a-scalable-entity-alignment-system","slug":"sea-a-scalable-entity-alignment-system","title":"SEA: A Scalable Entity Alignment System","date":"2023-04-14","arxiv_id":"2304.07065","repositories_listed":1,"syntology":null},{"url":"/paper/deep-active-alignment-of-knowledge-graph","slug":"deep-active-alignment-of-knowledge-graph","title":"Deep Active Alignment of Knowledge Graph Entities and Schemata","date":"2023-04-10","arxiv_id":"2304.04389","repositories_listed":1,"syntology":null},{"url":"/paper/evkg-an-interlinked-and-interoperable","slug":"evkg-an-interlinked-and-interoperable","title":"EVKG: An Interlinked and Interoperable Electric Vehicle Knowledge Graph for Smart Transportation System","date":"2023-04-10","arxiv_id":"2304.04893","repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph","slug":"graph-toolformer-to-empower-llms-with-graph","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Dataset Augmented by ChatGPT","date":"2023-04-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph-1","slug":"graph-toolformer-to-empower-llms-with-graph-1","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Augmented by ChatGPT","date":"2023-04-10","arxiv_id":"2304.11116","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-gnn-based-entity-alignment-on","slug":"rethinking-gnn-based-entity-alignment-on","title":"Toward Practical Entity Alignment Method Design: Insights from New Highly Heterogeneous Knowledge Graph Datasets","date":"2023-04-07","arxiv_id":"2304.03468","repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-the-users-challenges-and","slug":"characterizing-the-users-challenges-and","title":"Knowledge Graphs in Practice: Characterizing their Users, Challenges, and Visualization Opportunities","date":"2023-04-03","arxiv_id":"2304.01311","repositories_listed":1,"syntology":null},{"url":"/paper/improving-few-shot-inductive-learning-on","slug":"improving-few-shot-inductive-learning-on","title":"Improving Few-Shot Inductive Learning on Temporal Knowledge Graphs using Confidence-Augmented Reinforcement Learning","date":"2023-04-02","arxiv_id":"2304.00613","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-relation-prediction-from-relational","slug":"inductive-relation-prediction-from-relational","title":"Inductive Relation Prediction from Relational Paths and Context with Hierarchical Transformers","date":"2023-04-01","arxiv_id":"2304.00215","repositories_listed":1,"syntology":null},{"url":"/paper/aiseckg-knowledge-graph-dataset-for","slug":"aiseckg-knowledge-graph-dataset-for","title":"AISecKG: Knowledge Graph Dataset for Cybersecurity Education","date":"2023-03-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-set-of-semantic-data-flow-diagrams-and-its","slug":"a-set-of-semantic-data-flow-diagrams-and-its","title":"A set of semantic data flow diagrams and its security analysis based on ontologies and knowledge graphs","date":"2023-03-20","arxiv_id":"2303.11198","repositories_listed":1,"syntology":null},{"url":"/paper/imf-interactive-multimodal-fusion-model-for","slug":"imf-interactive-multimodal-fusion-model-for","title":"IMF: Interactive Multimodal Fusion Model for Link Prediction","date":"2023-03-20","arxiv_id":"2303.10816","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":3,"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/imf-interactive-multimodal-fusion-model-for#ran","syntology_url":"https://syntology.ai/paper/2303.10816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10816"}},"official":{"repos":["hestiasky/imf-pytorch"],"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-graph-enhanced-contrastive-learning","slug":"dynamic-graph-enhanced-contrastive-learning","title":"Dynamic Graph Enhanced Contrastive Learning for Chest X-ray Report Generation","date":"2023-03-18","arxiv_id":"2303.10323","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"10 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; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dynamic-graph-enhanced-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2303.10323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10323"}},"official":{"repos":["mlii0117/dcl"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/wikicoder-learning-to-write-knowledge-powered","slug":"wikicoder-learning-to-write-knowledge-powered","title":"WikiCoder: Learning to Write Knowledge-Powered Code","date":"2023-03-15","arxiv_id":"2303.08574","repositories_listed":1,"syntology":null},{"url":"/paper/answering-questions-over-knowledge-graphs","slug":"answering-questions-over-knowledge-graphs","title":"Domain Specific Question Answering Over Knowledge Graphs Using Logical Programming and Large Language Models","date":"2023-03-03","arxiv_id":"2303.02206","repositories_listed":1,"syntology":null},{"url":"/paper/linked-data-science-powered-by-knowledge","slug":"linked-data-science-powered-by-knowledge","title":"KGLiDS: A Platform for Semantic Abstraction, Linking, and Automation of Data Science","date":"2023-03-03","arxiv_id":"2303.02204","repositories_listed":1,"syntology":null},{"url":"/paper/structure-pretraining-and-prompt-tuning-for","slug":"structure-pretraining-and-prompt-tuning-for","title":"Structure Pretraining and Prompt Tuning for Knowledge Graph Transfer","date":"2023-03-03","arxiv_id":"2303.03922","repositories_listed":1,"syntology":null},{"url":"/paper/cardinality-estimation-over-knowledge-graphs","slug":"cardinality-estimation-over-knowledge-graphs","title":"Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks","date":"2023-03-02","arxiv_id":"2303.01140","repositories_listed":1,"syntology":null},{"url":"/paper/a-universal-question-answering-platform-for","slug":"a-universal-question-answering-platform-for","title":"A Universal Question-Answering Platform for Knowledge Graphs","date":"2023-03-01","arxiv_id":"2303.00595","repositories_listed":1,"syntology":null},{"url":"/paper/diversity-matters-robustness-of-bias","slug":"diversity-matters-robustness-of-bias","title":"Diversity matters: Robustness of bias measurements in Wikidata","date":"2023-02-27","arxiv_id":"2302.14027","repositories_listed":1,"syntology":null},{"url":"/paper/pyreason-software-for-open-world-temporal","slug":"pyreason-software-for-open-world-temporal","title":"PyReason: Software for Open World Temporal Logic","date":"2023-02-27","arxiv_id":"2302.13482","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-query-encoding-for-complex-query","slug":"sequential-query-encoding-for-complex-query","title":"Sequential Query Encoding For Complex Query Answering on Knowledge Graphs","date":"2023-02-25","arxiv_id":"2302.13114","repositories_listed":1,"syntology":null},{"url":"/paper/fits-fine-grained-two-stage-training-for","slug":"fits-fine-grained-two-stage-training-for","title":"FiTs: Fine-grained Two-stage Training for Knowledge-aware Question Answering","date":"2023-02-23","arxiv_id":"2302.11799","repositories_listed":1,"syntology":null},{"url":"/paper/khan-knowledge-aware-hierarchical-attention","slug":"khan-knowledge-aware-hierarchical-attention","title":"KHAN: Knowledge-Aware Hierarchical Attention Networks for Accurate Political Stance Prediction","date":"2023-02-23","arxiv_id":"2302.12126","repositories_listed":1,"syntology":null},{"url":"/paper/dual-policy-learning-for-aggregation","slug":"dual-policy-learning-for-aggregation","title":"Dual Policy Learning for Aggregation Optimization in Graph Neural Network-based Recommender Systems","date":"2023-02-21","arxiv_id":"2302.10567","repositories_listed":1,"syntology":null},{"url":"/paper/creating-knowledge-graphs-for-geographic-data","slug":"creating-knowledge-graphs-for-geographic-data","title":"Creating Knowledge Graphs for Geographic Data on the Web","date":"2023-02-17","arxiv_id":"2302.08823","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-outlier-detection-enable","slug":"differentiable-outlier-detection-enable","title":"Differentiable Outlier Detection Enable Robust Deep Multimodal Analysis","date":"2023-02-11","arxiv_id":"2302.05608","repositories_listed":1,"syntology":null},{"url":"/paper/toward-degree-bias-in-embedding-based","slug":"toward-degree-bias-in-embedding-based","title":"Toward Degree Bias in Embedding-Based Knowledge Graph Completion","date":"2023-02-10","arxiv_id":"2302.05044","repositories_listed":1,"syntology":null},{"url":"/paper/massively-multilingual-language-models-for","slug":"massively-multilingual-language-models-for","title":"Massively Multilingual Language Models for Cross Lingual Fact Extraction from Low Resource Indian Languages","date":"2023-02-09","arxiv_id":"2302.04790","repositories_listed":1,"syntology":null},{"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/entity-agnostic-representation-learning-for","slug":"entity-agnostic-representation-learning-for","title":"Entity-Agnostic Representation Learning for Parameter-Efficient Knowledge Graph Embedding","date":"2023-02-03","arxiv_id":"2302.01849","repositories_listed":1,"syntology":null},{"url":"/paper/double-permutation-equivariance-for-knowledge","slug":"double-permutation-equivariance-for-knowledge","title":"Double Equivariance for Inductive Link Prediction for Both New Nodes and New Relation Types","date":"2023-02-02","arxiv_id":"2302.01313","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 6 unverified","sample_list":"/paper/double-permutation-equivariance-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2302.01313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01313"}},"official":{"repos":["purdueminds/isdea"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":[]}}},{"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/semantic-parsing-for-conversational-question","slug":"semantic-parsing-for-conversational-question","title":"Semantic Parsing for Conversational Question Answering over Knowledge Graphs","date":"2023-01-28","arxiv_id":"2301.12217","repositories_listed":1,"syntology":null},{"url":"/paper/logical-message-passing-networks-with-one-hop","slug":"logical-message-passing-networks-with-one-hop","title":"Logical Message Passing Networks with One-hop Inference on Atomic Formulas","date":"2023-01-21","arxiv_id":"2301.08859","repositories_listed":1,"syntology":null},{"url":"/paper/who-should-i-engage-with-at-what-time-a","slug":"who-should-i-engage-with-at-what-time-a","title":"Who Should I Engage with At What Time? A Missing Event Aware Temporal Graph Neural Network","date":"2023-01-20","arxiv_id":"2301.08399","repositories_listed":1,"syntology":null},{"url":"/paper/towards-improving-the-explainability-of-text","slug":"towards-improving-the-explainability-of-text","title":"Towards Improving the Explainability of Text-based Information Retrieval with Knowledge Graphs","date":"2023-01-17","arxiv_id":"2301.06974","repositories_listed":1,"syntology":null}],"record_sha256":"dc258cc26c1d7a082b59bf90fae6d1d95e3810f2fa4902d4f1bd26e79e799555","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}