{"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":"/dataset/fb15k-237/papers/ran/1","list_of":"/dataset/fb15k-237","dataset":"FB15k-237","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_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'","samples_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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,25],"of":25,"counts":{"papers_with_a_benchmark_row":75,"with_a_code_link":65,"where_syntology_ran_a_sample":25,"not_listed_spam_title":0,"listed":75,"listed_where_code_ran":25,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":20,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":20,"listed_every_run_a_failure_of_syntologys_instrument":5,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/fb15k-237/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/answering-complex-logical-queries-on","slug":"answering-complex-logical-queries-on","title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","date":"2022-12-19","arxiv_id":"2212.09567","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":6,"pointer_only_for_licence":7,"official":{"repos":["bys0318/qto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/answering-complex-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2212.09567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09567"}}}},{"paper":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ibpa/kglm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}}}},{"paper":"/paper/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":7,"official":{"repos":["tranhungnghiep/meim-kge"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}}}},{"paper":"/paper/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["zjunlp/relphormer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}}}},{"paper":"/paper/neural-symbolic-models-for-logical-queries-on","slug":"neural-symbolic-models-for-logical-queries-on","title":"Neural-Symbolic Models for Logical Queries on Knowledge Graphs","date":"2022-05-16","arxiv_id":"2205.10128","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/GNN-QE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-symbolic-models-for-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2205.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10128"}}}},{"paper":"/paper/simkgc-simple-contrastive-knowledge-graph","slug":"simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","arxiv_id":"2203.02167","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["intfloat/simkgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simkgc-simple-contrastive-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2203.02167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02167"}}}},{"paper":"/paper/modeling-heterogeneous-hierarchies-with","slug":"modeling-heterogeneous-hierarchies-with","title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","date":"2021-10-28","arxiv_id":"2110.14923","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["snap-stanford/ConE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/modeling-heterogeneous-hierarchies-with#ran","syntology_url":"https://syntology.ai/paper/2110.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14923"}}}},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["DeepGraphLearning/NBFNet"],"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":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}}}},{"paper":"/paper/complex-query-answering-with-neural-link-1","slug":"complex-query-answering-with-neural-link-1","title":"Complex Query Answering with Neural Link Predictors","date":"2020-11-06","arxiv_id":"2011.03459","rows_on_this_dataset":3,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":2,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["uclnlp/cqd"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/complex-query-answering-with-neural-link-1#ran","syntology_url":"https://syntology.ai/paper/2011.03459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03459"}}}},{"paper":"/paper/beta-embeddings-for-multi-hop-logical","slug":"beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","arxiv_id":"2010.11465","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/beta-embeddings-for-multi-hop-logical#ran","syntology_url":"https://syntology.ai/paper/2010.11465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11465"}}}},{"paper":"/paper/hitter-hierarchical-transformers-for","slug":"hitter-hierarchical-transformers-for","title":"HittER: Hierarchical Transformers for Knowledge Graph Embeddings","date":"2020-08-28","arxiv_id":"2008.12813","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hitter-hierarchical-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2008.12813","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.12813"}}}},{"paper":"/paper/low-dimensional-hyperbolic-knowledge-graph-1","slug":"low-dimensional-hyperbolic-knowledge-graph-1","title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","date":"2020-05-01","arxiv_id":"2005.00545","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":4,"samples_unverified":7,"pointer_only_for_licence":8,"official":{"repos":["tensorflow/neural-structured-learning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/low-dimensional-hyperbolic-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2005.00545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00545"}}}},{"paper":"/paper/query2box-reasoning-over-knowledge-graphs-in-1","slug":"query2box-reasoning-over-knowledge-graphs-in-1","title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","date":"2020-02-14","arxiv_id":"2002.05969","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":41,"samples_ran":30,"samples_constructed":13,"samples_ran_checked":18,"samples_ran_instrument_failed":12,"samples_unverified":11,"pointer_only_for_licence":2,"official":{"repos":["hyren/query2box"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/query2box-reasoning-over-knowledge-graphs-in-1#ran","syntology_url":"https://syntology.ai/paper/2002.05969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05969"}}}},{"paper":"/paper/learning-hierarchy-aware-knowledge-graph","slug":"learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["MIRALab-USTC/KGE-HAKE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-hierarchy-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09419"}}}},{"paper":"/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","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/composition-based-multi-relational-graph","slug":"composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["malllabiisc/CompGCN"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/composition-based-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/1911.03082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03082"}}}},{"paper":"/paper/interacte-improving-convolution-based","slug":"interacte-improving-convolution-based","title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","date":"2019-11-01","arxiv_id":"1911.00219","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["malllabiisc/InteractE"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/interacte-improving-convolution-based#ran","syntology_url":"https://syntology.ai/paper/1911.00219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00219"}}}},{"paper":"/paper/kg-bert-bert-for-knowledge-graph-completion","slug":"kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["yao8839836/kg-bert"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}}}},{"paper":"/paper/augmenting-and-tuning-knowledge-graph","slug":"augmenting-and-tuning-knowledge-graph","title":"Augmenting and Tuning Knowledge Graph Embeddings","date":"2019-07-01","arxiv_id":"1907.01068","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["mandt-lab/knowledge-graph-tuning"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/augmenting-and-tuning-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1907.01068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01068"}}}},{"paper":"/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","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","slug":"graphvite-a-high-performance-cpu-gpu-hybrid","title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","date":"2019-03-02","arxiv_id":"1903.00757","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}}}},{"paper":"/paper/rotate-knowledge-graph-embedding-by","slug":"rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","rows_on_this_dataset":2,"code_links":10,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["DeepGraphLearning/KnowledgeGraphEmbedding"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rotate-knowledge-graph-embedding-by#ran","syntology_url":"https://syntology.ai/paper/1902.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10197"}}}},{"paper":"/paper/embedding-logical-queries-on-knowledge-graphs","slug":"embedding-logical-queries-on-knowledge-graphs","title":"Embedding Logical Queries on Knowledge Graphs","date":"2018-06-05","arxiv_id":"1806.01445","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["williamleif/graphqembed"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/embedding-logical-queries-on-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/1806.01445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01445"}}}},{"paper":"/paper/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/kbgan-adversarial-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1711.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04071"}}}}],"record_sha256":"435def72b36ad9f9cce9126deae4f55753f1f246bcd8fa9570b40056dac6f422","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}