{"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/2","list_of":"/task/knowledge-graphs","task":"Knowledge Graphs","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":30,"rows_per_page":100,"rows":[101,200],"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","next":"/task/knowledge-graphs/papers/3","papers":[{"url":"/paper/improving-inductive-link-prediction-using","slug":"improving-inductive-link-prediction-using","title":"Improving Inductive Link Prediction Using Hyper-Relational Facts","date":"2021-07-10","arxiv_id":"2107.04894","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-taxonomy-completion-with-concept","slug":"enhancing-taxonomy-completion-with-concept","title":"Enhancing Taxonomy Completion with Concept Generation via Fusing Relational Representations","date":"2021-06-05","arxiv_id":"2106.02974","repositories_listed":2,"syntology":null},{"url":"/paper/question-answering-over-temporal-knowledge","slug":"question-answering-over-temporal-knowledge","title":"Question Answering Over Temporal Knowledge Graphs","date":"2021-06-03","arxiv_id":"2106.01515","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/question-answering-over-temporal-knowledge#ran","syntology_url":"https://syntology.ai/paper/2106.01515","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01515"}},"official":{"repos":["apoorvumang/CronKGQA"],"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/understanding-the-performance-of-knowledge","slug":"understanding-the-performance-of-knowledge","title":"Understanding the Performance of Knowledge Graph Embeddings in Drug Discovery","date":"2021-05-17","arxiv_id":"2105.10488","repositories_listed":2,"syntology":null},{"url":"/paper/explainable-neural-symbolic-learning-x-nesyl","slug":"explainable-neural-symbolic-learning-x-nesyl","title":"EXplainable Neural-Symbolic Learning (X-NeSyL) methodology to fuse deep learning representations with expert knowledge graphs: the MonuMAI cultural heritage use case","date":"2021-04-24","arxiv_id":"2104.11914","repositories_listed":2,"syntology":null},{"url":"/paper/zero-shot-slot-filling-with-dpr-and-rag","slug":"zero-shot-slot-filling-with-dpr-and-rag","title":"Zero-shot Slot Filling with DPR and RAG","date":"2021-04-17","arxiv_id":"2104.08610","repositories_listed":2,"syntology":null},{"url":"/paper/neural-multi-hop-reasoning-with-logical-rules","slug":"neural-multi-hop-reasoning-with-logical-rules","title":"Neural Multi-Hop Reasoning With Logical Rules on Biomedical Knowledge Graphs","date":"2021-03-18","arxiv_id":"2103.10367","repositories_listed":2,"syntology":null},{"url":"/paper/a-review-of-biomedical-datasets-relating-to","slug":"a-review-of-biomedical-datasets-relating-to","title":"A Review of Biomedical Datasets Relating to Drug Discovery: A Knowledge Graph Perspective","date":"2021-02-19","arxiv_id":"2102.10062","repositories_listed":2,"syntology":null},{"url":"/paper/typing-errors-in-factual-knowledge-graphs","slug":"typing-errors-in-factual-knowledge-graphs","title":"Typing Errors in Factual Knowledge Graphs: Severity and Possible Ways Out","date":"2021-02-03","arxiv_id":"2102.02307","repositories_listed":2,"syntology":null},{"url":"/paper/hyperbolic-deep-neural-networks-a-survey","slug":"hyperbolic-deep-neural-networks-a-survey","title":"Hyperbolic Deep Neural Networks: A Survey","date":"2021-01-12","arxiv_id":"2101.04562","repositories_listed":2,"syntology":null},{"url":"/paper/xerte-explainable-reasoning-on-temporal","slug":"xerte-explainable-reasoning-on-temporal","title":"xERTE: Explainable Reasoning on Temporal Knowledge Graphs for Forecasting Future Links","date":"2020-12-31","arxiv_id":"2012.15537","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/xerte-explainable-reasoning-on-temporal#ran","syntology_url":"https://syntology.ai/paper/2012.15537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15537"}},"official":{"repos":["TemporalKGTeam/xERTE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/fusing-context-into-knowledge-graph-for","slug":"fusing-context-into-knowledge-graph-for","title":"Fusing Context Into Knowledge Graph for Commonsense Question Answering","date":"2020-12-09","arxiv_id":"2012.04808","repositories_listed":2,"syntology":null},{"url":"/paper/fede-embedding-knowledge-graphs-in-federated","slug":"fede-embedding-knowledge-graphs-in-federated","title":"FedE: Embedding Knowledge Graphs in Federated Setting","date":"2020-10-24","arxiv_id":"2010.12882","repositories_listed":2,"syntology":null},{"url":"/paper/language-models-are-open-knowledge-graphs-1","slug":"language-models-are-open-knowledge-graphs-1","title":"Language Models are Open Knowledge Graphs","date":"2020-10-22","arxiv_id":"2010.11967","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/language-models-are-open-knowledge-graphs-1#ran","syntology_url":"https://syntology.ai/paper/2010.11967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11967"}},"official":null}},{"url":"/paper/inductive-entity-representations-from-text","slug":"inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-entity-representations-from-text#ran","syntology_url":"https://syntology.ai/paper/2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"}},"official":{"repos":["dfdazac/blp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/owl2vec-embedding-of-owl-ontologies","slug":"owl2vec-embedding-of-owl-ontologies","title":"OWL2Vec*: Embedding of OWL Ontologies","date":"2020-09-30","arxiv_id":"2009.14654","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/owl2vec-embedding-of-owl-ontologies#ran","syntology_url":"https://syntology.ai/paper/2009.14654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14654"}},"official":{"repos":["KRR-Oxford/OWL2Vec-Star"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/visual-pivoting-for-unsupervised-entity","slug":"visual-pivoting-for-unsupervised-entity","title":"Visual Pivoting for (Unsupervised) Entity Alignment","date":"2020-09-28","arxiv_id":"2009.13603","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/visual-pivoting-for-unsupervised-entity#ran","syntology_url":"https://syntology.ai/paper/2009.13603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13603"}},"official":{"repos":["cambridgeltl/eva"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/codex-a-comprehensive-knowledge-graph","slug":"codex-a-comprehensive-knowledge-graph","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","date":"2020-09-16","arxiv_id":"2009.07810","repositories_listed":2,"syntology":null},{"url":"/paper/relational-reflection-entity-alignment","slug":"relational-reflection-entity-alignment","title":"Relational Reflection Entity Alignment","date":"2020-08-18","arxiv_id":"2008.07962","repositories_listed":2,"syntology":null},{"url":"/paper/convolutional-complex-knowledge-graph","slug":"convolutional-complex-knowledge-graph","title":"Convolutional Complex Knowledge Graph Embeddings","date":"2020-08-07","arxiv_id":"2008.03130","repositories_listed":2,"syntology":null},{"url":"/paper/improving-conversational-recommender-systems","slug":"improving-conversational-recommender-systems","title":"Improving Conversational Recommender Systems via Knowledge Graph based Semantic Fusion","date":"2020-07-08","arxiv_id":"2007.04032","repositories_listed":2,"syntology":null},{"url":"/paper/improving-multi-hop-question-answering-over","slug":"improving-multi-hop-question-answering-over","title":"Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings","date":"2020-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/jointly-non-sampling-learning-for-knowledge","slug":"jointly-non-sampling-learning-for-knowledge","title":"Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation","date":"2020-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/clinical-risk-prediction-with-temporal","slug":"clinical-risk-prediction-with-temporal","title":"Clinical Risk Prediction with Temporal Probabilistic Asymmetric Multi-Task Learning","date":"2020-06-23","arxiv_id":"2006.12777","repositories_listed":2,"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/clinical-risk-prediction-with-temporal#ran","syntology_url":"https://syntology.ai/paper/2006.12777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12777"}},"official":{"repos":["anhtuan5696/TPAMTL"],"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/cyclegt-unsupervised-graph-to-text-and-text","slug":"cyclegt-unsupervised-graph-to-text-and-text","title":"CycleGT: Unsupervised Graph-to-Text and Text-to-Graph Generation via Cycle Training","date":"2020-06-08","arxiv_id":"2006.04702","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cyclegt-unsupervised-graph-to-text-and-text#ran","syntology_url":"https://syntology.ai/paper/2006.04702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04702"}},"official":{"repos":["QipengGuo/CycleGT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/scalable-multi-hop-relational-reasoning-for","slug":"scalable-multi-hop-relational-reasoning-for","title":"Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering","date":"2020-05-01","arxiv_id":"2005.00646","repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-self-constructing-graph","slug":"multi-view-self-constructing-graph","title":"Multi-view Self-Constructing Graph Convolutional Networks with Adaptive Class Weighting Loss for Semantic Segmentation","date":"2020-04-21","arxiv_id":"2004.10327","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-graphs","slug":"knowledge-graphs","title":"Knowledge Graphs","date":"2020-03-04","arxiv_id":"2003.02320","repositories_listed":2,"syntology":null},{"url":"/paper/deep-graph-matching-consensus-1","slug":"deep-graph-matching-consensus-1","title":"Deep Graph Matching Consensus","date":"2020-01-27","arxiv_id":"2001.09621","repositories_listed":2,"syntology":null},{"url":"/paper/generative-adversarial-zero-shot-relational","slug":"generative-adversarial-zero-shot-relational","title":"Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs","date":"2020-01-08","arxiv_id":"2001.02332","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/generative-adversarial-zero-shot-relational#ran","syntology_url":"https://syntology.ai/paper/2001.02332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.02332"}},"official":{"repos":["Panda0406/Zero-shot-knowledge-graph-relational-learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/reasoning-on-knowledge-graphs-with-debate","slug":"reasoning-on-knowledge-graphs-with-debate","title":"Reasoning on Knowledge Graphs with Debate Dynamics","date":"2020-01-02","arxiv_id":"2001.00461","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/reasoning-on-knowledge-graphs-with-debate#ran","syntology_url":"https://syntology.ai/paper/2001.00461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00461"}},"official":{"repos":["m-hildebrandt/R2D2"],"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/what-does-my-qa-model-know-devising","slug":"what-does-my-qa-model-know-devising","title":"What Does My QA Model Know? Devising Controlled Probes using Expert Knowledge","date":"2019-12-31","arxiv_id":"1912.13337","repositories_listed":2,"syntology":null},{"url":"/paper/probability-calibration-for-knowledge-graph-1","slug":"probability-calibration-for-knowledge-graph-1","title":"Probability Calibration for Knowledge Graph Embedding Models","date":"2019-12-20","arxiv_id":"1912.10000","repositories_listed":2,"syntology":null},{"url":"/paper/a-re-evaluation-of-knowledge-graph-completion","slug":"a-re-evaluation-of-knowledge-graph-completion","title":"A Re-evaluation of Knowledge Graph Completion Methods","date":"2019-11-10","arxiv_id":"1911.03903","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-re-evaluation-of-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1911.03903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03903"}},"official":{"repos":["svjan5/kg-reeval"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-graph-embedding-methods-for-natural","slug":"neural-graph-embedding-methods-for-natural","title":"Neural Graph Embedding Methods for Natural Language Processing","date":"2019-11-08","arxiv_id":"1911.03042","repositories_listed":2,"syntology":null},{"url":"/paper/conversation-generation-with-concept-flow","slug":"conversation-generation-with-concept-flow","title":"Grounded Conversation Generation as Guided Traverses in Commonsense Knowledge Graphs","date":"2019-11-07","arxiv_id":"1911.02707","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conversation-generation-with-concept-flow#ran","syntology_url":"https://syntology.ai/paper/1911.02707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02707"}},"official":{"repos":["thunlp/ConceptFlow"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contextual-graph-attention-for-answering","slug":"contextual-graph-attention-for-answering","title":"Contextual Graph Attention for Answering Logical Queries over Incomplete Knowledge Graphs","date":"2019-09-30","arxiv_id":"1910.00084","repositories_listed":2,"syntology":null},{"url":"/paper/k-bert-enabling-language-representation-with","slug":"k-bert-enabling-language-representation-with","title":"K-BERT: Enabling Language Representation with Knowledge Graph","date":"2019-09-17","arxiv_id":"1909.07606","repositories_listed":2,"syntology":null},{"url":"/paper/kagnet-knowledge-aware-graph-networks-for","slug":"kagnet-knowledge-aware-graph-networks-for","title":"KagNet: Knowledge-Aware Graph Networks for Commonsense Reasoning","date":"2019-09-04","arxiv_id":"1909.02151","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kagnet-knowledge-aware-graph-networks-for#ran","syntology_url":"https://syntology.ai/paper/1909.02151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02151"}},"official":{"repos":["INK-USC/KagNet"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/diachronic-embedding-for-temporal-knowledge","slug":"diachronic-embedding-for-temporal-knowledge","title":"Diachronic Embedding for Temporal Knowledge Graph Completion","date":"2019-07-06","arxiv_id":"1907.03143","repositories_listed":2,"syntology":null},{"url":"/paper/explainable-knowledge-graph-based","slug":"explainable-knowledge-graph-based","title":"Ekar: An Explainable Method for Knowledge Aware Recommendation","date":"2019-06-22","arxiv_id":"1906.09506","repositories_listed":2,"syntology":null},{"url":"/paper/neural-machine-translating-from-natural","slug":"neural-machine-translating-from-natural","title":"Neural Machine Translating from Natural Language to SPARQL","date":"2019-06-21","arxiv_id":"1906.09302","repositories_listed":2,"syntology":null},{"url":"/paper/probabilistic-logic-neural-networks-for","slug":"probabilistic-logic-neural-networks-for","title":"Probabilistic Logic Neural Networks for Reasoning","date":"2019-06-20","arxiv_id":"1906.08495","repositories_listed":2,"syntology":null},{"url":"/paper/learning-attention-based-embeddings-for","slug":"learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","arxiv_id":"1906.01195","repositories_listed":2,"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/learning-attention-based-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1906.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01195"}},"official":{"repos":["deepakn97/relationPrediction"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/esa-entity-summarization-with-attention","slug":"esa-entity-summarization-with-attention","title":"ESA: Entity Summarization with Attention","date":"2019-05-25","arxiv_id":"1905.10625","repositories_listed":2,"syntology":null},{"url":"/paper/mde-multi-distance-embeddings-for-link","slug":"mde-multi-distance-embeddings-for-link","title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","date":"2019-05-25","arxiv_id":"1905.10702","repositories_listed":2,"syntology":null},{"url":"/paper/paperrobot-incremental-draft-generation-of","slug":"paperrobot-incremental-draft-generation-of","title":"PaperRobot: Incremental Draft Generation of Scientific Ideas","date":"2019-05-20","arxiv_id":"1905.07870","repositories_listed":2,"syntology":null},{"url":"/paper/ernie-enhanced-language-representation-with","slug":"ernie-enhanced-language-representation-with","title":"ERNIE: Enhanced Language Representation with Informative Entities","date":"2019-05-17","arxiv_id":"1905.07129","repositories_listed":2,"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":1,"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/ernie-enhanced-language-representation-with#ran","syntology_url":"https://syntology.ai/paper/1905.07129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07129"}},"official":{"repos":["thunlp/ERNIE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/recurrent-event-network-for-reasoning-over","slug":"recurrent-event-network-for-reasoning-over","title":"Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs","date":"2019-04-11","arxiv_id":"1904.05530","repositories_listed":2,"syntology":null},{"url":"/paper/binarized-knowledge-graph-embeddings","slug":"binarized-knowledge-graph-embeddings","title":"Binarized Knowledge Graph Embeddings","date":"2019-02-08","arxiv_id":"1902.02970","repositories_listed":2,"syntology":null},{"url":"/paper/explainable-reasoning-over-knowledge-graphs","slug":"explainable-reasoning-over-knowledge-graphs","title":"Explainable Reasoning over Knowledge Graphs for Recommendation","date":"2018-11-12","arxiv_id":"1811.04540","repositories_listed":2,"syntology":null},{"url":"/paper/reasoning-over-rdf-knowledge-bases-using-deep","slug":"reasoning-over-rdf-knowledge-bases-using-deep","title":"Reasoning over RDF Knowledge Bases using Deep Learning","date":"2018-11-09","arxiv_id":"1811.04132","repositories_listed":2,"syntology":null},{"url":"/paper/measuring-semantic-coherence-of-a","slug":"measuring-semantic-coherence-of-a","title":"Measuring Semantic Coherence of a Conversation","date":"2018-06-17","arxiv_id":"1806.06411","repositories_listed":2,"syntology":null},{"url":"/paper/scene-graph-parsing-as-dependency-parsing","slug":"scene-graph-parsing-as-dependency-parsing","title":"Scene Graph Parsing as Dependency Parsing","date":"2018-03-25","arxiv_id":"1803.09189","repositories_listed":2,"syntology":null},{"url":"/paper/simple-embedding-for-link-prediction-in","slug":"simple-embedding-for-link-prediction-in","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","date":"2018-02-13","arxiv_id":"1802.04868","repositories_listed":2,"syntology":null},{"url":"/paper/representation-learning-for-visual-relational","slug":"representation-learning-for-visual-relational","title":"Answering Visual-Relational Queries in Web-Extracted Knowledge Graphs","date":"2017-09-07","arxiv_id":"1709.02314","repositories_listed":2,"syntology":null},{"url":"/paper/position-aware-attention-and-supervised-data","slug":"position-aware-attention-and-supervised-data","title":"Position-aware Attention and Supervised Data Improve Slot Filling","date":"2017-09-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/deeppath-a-reinforcement-learning-method-for","slug":"deeppath-a-reinforcement-learning-method-for","title":"DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning","date":"2017-07-20","arxiv_id":"1707.06690","repositories_listed":2,"syntology":null},{"url":"/paper/know-evolve-deep-temporal-reasoning-for","slug":"know-evolve-deep-temporal-reasoning-for","title":"Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs","date":"2017-05-16","arxiv_id":"1705.05742","repositories_listed":2,"syntology":null},{"url":"/paper/an-overview-of-embedding-models-of-entities","slug":"an-overview-of-embedding-models-of-entities","title":"A survey of embedding models of entities and relationships for knowledge graph completion","date":"2017-03-23","arxiv_id":"1703.08098","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-graph-completion-via-complex-tensor","slug":"knowledge-graph-completion-via-complex-tensor","title":"Knowledge Graph Completion via Complex Tensor Factorization","date":"2017-02-22","arxiv_id":"1702.06879","repositories_listed":2,"syntology":null},{"url":"/paper/multilingual-knowledge-graph-embeddings-for","slug":"multilingual-knowledge-graph-embeddings-for","title":"Multilingual Knowledge Graph Embeddings for Cross-lingual Knowledge Alignment","date":"2016-11-12","arxiv_id":"1611.03954","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/multilingual-knowledge-graph-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1611.03954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.03954"}},"official":null}},{"url":"/paper/traversing-knowledge-graphs-in-vector-space","slug":"traversing-knowledge-graphs-in-vector-space","title":"Traversing Knowledge Graphs in Vector Space","date":"2015-06-03","arxiv_id":"1506.01094","repositories_listed":2,"syntology":null},{"url":"/paper/a-review-of-relational-machine-learning-for","slug":"a-review-of-relational-machine-learning-for","title":"A Review of Relational Machine Learning for Knowledge Graphs","date":"2015-03-02","arxiv_id":"1503.00759","repositories_listed":2,"syntology":null},{"url":"/paper/graph-collaborative-attention-network-for","slug":"graph-collaborative-attention-network-for","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","date":"2025-07-05","arxiv_id":"2507.03947","repositories_listed":1,"syntology":null},{"url":"/paper/a-multi-expert-structural-semantic-hybrid","slug":"a-multi-expert-structural-semantic-hybrid","title":"A Multi-Expert Structural-Semantic Hybrid Framework for Unveiling Historical Patterns in Temporal Knowledge Graphs","date":"2025-06-17","arxiv_id":"2506.14235","repositories_listed":1,"syntology":null},{"url":"/paper/learning-efficient-and-generalizable-graph","slug":"learning-efficient-and-generalizable-graph","title":"Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering","date":"2025-06-11","arxiv_id":"2506.09645","repositories_listed":1,"syntology":null},{"url":"/paper/2506-08743","slug":"2506-08743","title":"Bridging RDF Knowledge Graphs with Graph Neural Networks for Semantically-Rich Recommender Systems","date":"2025-06-10","arxiv_id":"2506.08743","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-link-prediction-in-n-ary","slug":"a-survey-of-link-prediction-in-n-ary","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","date":"2025-06-10","arxiv_id":"2506.08970","repositories_listed":1,"syntology":null},{"url":"/paper/paths-to-causality-finding-informative","slug":"paths-to-causality-finding-informative","title":"Paths to Causality: Finding Informative Subgraphs Within Knowledge Graphs for Knowledge-Based Causal Discovery","date":"2025-06-10","arxiv_id":"2506.08771","repositories_listed":1,"syntology":null},{"url":"/paper/g2s-a-general-to-specific-learning-framework","slug":"g2s-a-general-to-specific-learning-framework","title":"G2S: A General-to-Specific Learning Framework for Temporal Knowledge Graph Forecasting with Large Language Models","date":"2025-05-31","arxiv_id":"2506.00445","repositories_listed":1,"syntology":null},{"url":"/paper/llm-inference-enhanced-by-external-knowledge","slug":"llm-inference-enhanced-by-external-knowledge","title":"LLM Inference Enhanced by External Knowledge: A Survey","date":"2025-05-30","arxiv_id":"2505.24377","repositories_listed":1,"syntology":null},{"url":"/paper/autoschemakg-autonomous-knowledge-graph","slug":"autoschemakg-autonomous-knowledge-graph","title":"AutoSchemaKG: Autonomous Knowledge Graph Construction through Dynamic Schema Induction from Web-Scale Corpora","date":"2025-05-29","arxiv_id":"2505.23628","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autoschemakg-autonomous-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2505.23628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23628"}},"official":{"repos":["hkust-knowcomp/autoschemakg"],"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/genic-an-llm-based-framework-for-instance","slug":"genic-an-llm-based-framework-for-instance","title":"GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs","date":"2025-05-29","arxiv_id":"2505.24036","repositories_listed":1,"syntology":null},{"url":"/paper/kgmark-a-diffusion-watermark-for-knowledge","slug":"kgmark-a-diffusion-watermark-for-knowledge","title":"KGMark: A Diffusion Watermark for Knowledge Graphs","date":"2025-05-29","arxiv_id":"2505.23873","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-meet-knowledge-graphs-1","slug":"large-language-models-meet-knowledge-graphs-1","title":"Large Language Models Meet Knowledge Graphs for Question Answering: Synthesis and Opportunities","date":"2025-05-26","arxiv_id":"2505.20099","repositories_listed":1,"syntology":null},{"url":"/paper/managing-fair-knowledge-graphs-as-polyglot","slug":"managing-fair-knowledge-graphs-as-polyglot","title":"Managing FAIR Knowledge Graphs as Polyglot Data End Points: A Benchmark based on the rdf2pg Framework and Plant Biology Data","date":"2025-05-23","arxiv_id":"2505.17498","repositories_listed":1,"syntology":null},{"url":"/paper/deliberation-on-priors-trustworthy-reasoning","slug":"deliberation-on-priors-trustworthy-reasoning","title":"Deliberation on Priors: Trustworthy Reasoning of Large Language Models on Knowledge Graphs","date":"2025-05-21","arxiv_id":"2505.15210","repositories_listed":1,"syntology":{"n":14,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":9,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 9 unverified","sample_list":"/paper/deliberation-on-priors-trustworthy-reasoning#ran","syntology_url":"https://syntology.ai/paper/2505.15210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.15210"}},"official":{"repos":["reml-group/deliberation-on-priors"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":9,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/graph-foundation-models-a-comprehensive","slug":"graph-foundation-models-a-comprehensive","title":"Graph Foundation Models: A Comprehensive Survey","date":"2025-05-21","arxiv_id":"2505.15116","repositories_listed":1,"syntology":null},{"url":"/paper/towards-explainable-temporal-reasoning-in","slug":"towards-explainable-temporal-reasoning-in","title":"Towards Explainable Temporal Reasoning in Large Language Models: A Structure-Aware Generative Framework","date":"2025-05-21","arxiv_id":"2505.15245","repositories_listed":1,"syntology":null},{"url":"/paper/kerl-knowledge-enhanced-personalized-recipe","slug":"kerl-knowledge-enhanced-personalized-recipe","title":"KERL: Knowledge-Enhanced Personalized Recipe Recommendation using Large Language Models","date":"2025-05-20","arxiv_id":"2505.14629","repositories_listed":1,"syntology":null},{"url":"/paper/multihal-multilingual-dataset-for-knowledge","slug":"multihal-multilingual-dataset-for-knowledge","title":"MultiHal: Multilingual Dataset for Knowledge-Graph Grounded Evaluation of LLM Hallucinations","date":"2025-05-20","arxiv_id":"2505.14101","repositories_listed":1,"syntology":null},{"url":"/paper/txpert-leveraging-biochemical-relationships","slug":"txpert-leveraging-biochemical-relationships","title":"TxPert: Leveraging Biochemical Relationships for Out-of-Distribution Transcriptomic Perturbation Prediction","date":"2025-05-20","arxiv_id":"2505.14919","repositories_listed":1,"syntology":null},{"url":"/paper/know3-rag-a-knowledge-aware-rag-framework","slug":"know3-rag-a-knowledge-aware-rag-framework","title":"Know3-RAG: A Knowledge-aware RAG Framework with Adaptive Retrieval, Generation, and Filtering","date":"2025-05-19","arxiv_id":"2505.12662","repositories_listed":1,"syntology":null},{"url":"/paper/llm-kg-bench-3-0-a-compass-for","slug":"llm-kg-bench-3-0-a-compass-for","title":"LLM-KG-Bench 3.0: A Compass for SemanticTechnology Capabilities in the Ocean of LLMs","date":"2025-05-19","arxiv_id":"2505.13098","repositories_listed":1,"syntology":null},{"url":"/paper/self-reinforced-graph-contrastive-learning","slug":"self-reinforced-graph-contrastive-learning","title":"Self-Reinforced Graph Contrastive Learning","date":"2025-05-19","arxiv_id":"2505.13650","repositories_listed":1,"syntology":null},{"url":"/paper/interfeat-an-automated-pipeline-for-finding","slug":"interfeat-an-automated-pipeline-for-finding","title":"InterFeat: An Automated Pipeline for Finding Interesting Hypotheses in Structured Biomedical Data","date":"2025-05-18","arxiv_id":"2505.13534","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11140","slug":"2505-11140","title":"Scaling Reasoning can Improve Factuality in Large Language Models","date":"2025-05-16","arxiv_id":"2505.11140","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11180","slug":"2505-11180","title":"mmRAG: A Modular Benchmark for Retrieval-Augmented Generation over Text, Tables, and Knowledge Graphs","date":"2025-05-16","arxiv_id":"2505.11180","repositories_listed":1,"syntology":null},{"url":"/paper/do-rag-a-domain-specific-qa-framework-using","slug":"do-rag-a-domain-specific-qa-framework-using","title":"DO-RAG: A Domain-Specific QA Framework Using Knowledge Graph-Enhanced Retrieval-Augmented Generation","date":"2025-05-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/personalizing-large-language-models-using","slug":"personalizing-large-language-models-using","title":"Personalizing Large Language Models using Retrieval Augmented Generation and Knowledge Graph","date":"2025-05-15","arxiv_id":"2505.09945","repositories_listed":1,"syntology":null},{"url":"/paper/focus-merge-rank-improved-question-answering","slug":"focus-merge-rank-improved-question-answering","title":"Focus, Merge, Rank: Improved Question Answering Based on Semi-structured Knowledge Bases","date":"2025-05-14","arxiv_id":"2505.09246","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-contrastive-learning-with-model","slug":"hyperbolic-contrastive-learning-with-model","title":"Hyperbolic Contrastive Learning with Model-augmentation for Knowledge-aware Recommendation","date":"2025-05-13","arxiv_id":"2505.08157","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyperbolic-contrastive-learning-with-model#ran","syntology_url":"https://syntology.ai/paper/2505.08157","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.08157"}},"official":{"repos":["sunshy-1/HCMKR"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/halo-half-life-based-outdated-fact-filtering","slug":"halo-half-life-based-outdated-fact-filtering","title":"HALO: Half Life-Based Outdated Fact Filtering in Temporal Knowledge Graphs","date":"2025-05-12","arxiv_id":"2505.07509","repositories_listed":1,"syntology":null},{"url":"/paper/recdap-relation-based-conditional-diffusion","slug":"recdap-relation-based-conditional-diffusion","title":"ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion","date":"2025-05-12","arxiv_id":"2505.07171","repositories_listed":1,"syntology":null},{"url":"/paper/structural-entropy-guided-agent-for-detecting","slug":"structural-entropy-guided-agent-for-detecting","title":"Structural Entropy Guided Agent for Detecting and Repairing Knowledge Deficiencies in LLMs","date":"2025-05-12","arxiv_id":"2505.07184","repositories_listed":1,"syntology":null},{"url":"/paper/kg-htc-integrating-knowledge-graphs-into-llms","slug":"kg-htc-integrating-knowledge-graphs-into-llms","title":"KG-HTC: Integrating Knowledge Graphs into LLMs for Effective Zero-shot Hierarchical Text Classification","date":"2025-05-08","arxiv_id":"2505.05583","repositories_listed":1,"syntology":null},{"url":"/paper/social-biases-in-knowledge-representations-of","slug":"social-biases-in-knowledge-representations-of","title":"Social Biases in Knowledge Representations of Wikidata separates Global North from Global South","date":"2025-05-05","arxiv_id":"2505.02352","repositories_listed":1,"syntology":null},{"url":"/paper/using-knowledge-graphs-to-harvest-datasets","slug":"using-knowledge-graphs-to-harvest-datasets","title":"Using Knowledge Graphs to harvest datasets for efficient CLIP model training","date":"2025-05-05","arxiv_id":"2505.02746","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-legal-structure-in-retrieval","slug":"incorporating-legal-structure-in-retrieval","title":"Incorporating Legal Structure in Retrieval-Augmented Generation: A Case Study on Copyright Fair Use","date":"2025-05-04","arxiv_id":"2505.02164","repositories_listed":1,"syntology":null}],"record_sha256":"c485239365679d38f5aeda7497b44447d735457f05927a70e2443bb0758e1c78","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}