{"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/inductive-knowledge-graph-completion","name":"Inductive knowledge graph completion","slug":"inductive-knowledge-graph-completion","description_markdown":null,"categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":20,"papers_with_code":14,"benchmarks":3,"benchmark_tables_in_archive":3,"benchmark_tables_shown":3,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":1,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/inductive-knowledge-graph-completion-on-1","slug":"inductive-knowledge-graph-completion-on-1","dataset":"Wikidata5m-ind","dataset_url":null,"rows_in_archive":3,"metrics":["Hits@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"BLP-SimplE","paper_title":"Inductive Entity Representations from Text via Link Prediction","paper_url":"/paper/inductive-entity-representations-from-text","paper_date":"2020-10-07","arxiv_id":"2010.03496","code_links":[{"title":"raphaelsty/mkb","url":"https://github.com/raphaelsty/mkb"},{"title":"dfdazac/blp","url":"https://github.com/dfdazac/blp"}],"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"]}}}},{"leaderboard":"/sota/inductive-knowledge-graph-completion-on","slug":"inductive-knowledge-graph-completion-on","dataset":"WN18RR-ind","dataset_url":null,"rows_in_archive":2,"metrics":["Hit@10","Hits@1","Hits@3","MRR"],"first_row_in_archive_order":{"model":"BLP-TransE","paper_title":"Inductive Entity Representations from Text via Link Prediction","paper_url":"/paper/inductive-entity-representations-from-text","paper_date":"2020-10-07","arxiv_id":"2010.03496","code_links":[{"title":"raphaelsty/mkb","url":"https://github.com/raphaelsty/mkb"},{"title":"dfdazac/blp","url":"https://github.com/dfdazac/blp"}],"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"]}}}},{"leaderboard":"/sota/inductive-knowledge-graph-completion-on-fb15k","slug":"inductive-knowledge-graph-completion-on-fb15k","dataset":"FB15k-237-ind","dataset_url":null,"rows_in_archive":1,"metrics":["Hit@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"BLP-TransE","paper_title":"Inductive Entity Representations from Text via Link Prediction","paper_url":"/paper/inductive-entity-representations-from-text","paper_date":"2020-10-07","arxiv_id":"2010.03496","code_links":[{"title":"raphaelsty/mkb","url":"https://github.com/raphaelsty/mkb"},{"title":"dfdazac/blp","url":"https://github.com/dfdazac/blp"}],"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"]}}}}],"datasets":[{"url":"/dataset/financial-dynamic-knowledge-graph","name":"Financial Dynamic Knowledge Graph","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/large-language-model","name":"Large Language Model"}],"parent_tasks":[{"url":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":20,"of":20,"of_with_code":14,"tagged_in_all":20,"counts":{"archive_papers_tagged":20,"with_a_code_link":14,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":20,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"items":[{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"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/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"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/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/s-2-dn-learning-to-denoise-unconvincing","slug":"s-2-dn-learning-to-denoise-unconvincing","title":"S$^2$DN: Learning to Denoise Unconvincing Knowledge for Inductive Knowledge Graph Completion","date":"2024-12-20","arxiv_id":"2412.15822","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-inductive-knowledge-graph","slug":"context-aware-inductive-knowledge-graph","title":"Context-aware Inductive Knowledge Graph Completion with Latent Type Constraints and Subgraph Reasoning","date":"2024-10-22","arxiv_id":"2410.16803","repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-benchmark-datasets-for","slug":"towards-better-benchmark-datasets-for","title":"Towards Better Benchmark Datasets for Inductive Knowledge Graph Completion","date":"2024-06-14","arxiv_id":"2406.11898","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-knowledge-graph-completion-with","slug":"inductive-knowledge-graph-completion-with","title":"Inductive Knowledge Graph Completion with GNNs and Rules: An Analysis","date":"2023-08-14","arxiv_id":"2308.07942","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/relational-message-passing-for-fully","slug":"relational-message-passing-for-fully","title":"Relational Message Passing for Fully Inductive Knowledge Graph Completion","date":"2022-10-08","arxiv_id":"2210.03994","repositories_listed":1,"syntology":null},{"url":"/paper/statik-structure-and-text-for-inductive","slug":"statik-structure-and-text-for-inductive","title":"StATIK: Structure and Text for Inductive Knowledge Graph Completion","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/building-rule-hierarchies-for-efficient","slug":"building-rule-hierarchies-for-efficient","title":"Building Rule Hierarchies for Efficient Logical Rule Learning from Knowledge Graphs","date":"2020-06-29","arxiv_id":"2006.16171","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-rule-learning-with-template","slug":"efficient-rule-learning-with-template","title":"Towards Learning Instantiated Logical Rules from Knowledge Graphs","date":"2020-03-13","arxiv_id":"2003.06071","repositories_listed":1,"syntology":null},{"url":"/paper/kepler-a-unified-model-for-knowledge","slug":"kepler-a-unified-model-for-knowledge","title":"KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation","date":"2019-11-13","arxiv_id":"1911.06136","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/kepler-a-unified-model-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06136"}},"official":{"repos":["THU-KEG/KEPLER"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/drum-end-to-end-differentiable-rule-mining-on","slug":"drum-end-to-end-differentiable-rule-mining-on","title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","date":"2019-10-31","arxiv_id":"1911.00055","repositories_listed":1,"syntology":null},{"url":"/paper/rudas-synthetic-datasets-for-rule-learning","slug":"rudas-synthetic-datasets-for-rule-learning","title":"RuDaS: Synthetic Datasets for Rule Learning and Evaluation Tools","date":"2019-09-16","arxiv_id":"1909.07095","repositories_listed":1,"syntology":null},{"url":null,"slug":"query-enhanced-adaptive-semantic-path","title":"Query-Enhanced Adaptive Semantic Path Reasoning for Inductive Knowledge Graph Completion","date":"2024-06-04","arxiv_id":"2406.02205","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-reasoning-with-relation-network-for","title":"Logical Reasoning with Relation Network for Inductive Knowledge Graph Completion","date":"2024-06-03","arxiv_id":"2406.01140","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-from-a-different-perspective-in-re","title":"Predicting from a Different Perspective: A Re-ranking Model for Inductive Knowledge Graph Completion","date":"2024-05-27","arxiv_id":"2405.16902","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-subgraph-for-all-efficient-reasoning-on","title":"One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion","date":"2024-04-24","arxiv_id":"2404.15807","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-link-bridging-inductive-link-predictions","title":"Bi-Link: Bridging Inductive Link Predictions from Text via Contrastive Learning of Transformers and Prompts","date":"2022-10-26","arxiv_id":"2210.14463","repositories_listed":0,"syntology":null},{"url":null,"slug":"indigo-gnn-based-inductive-knowledge-graph","title":"INDIGO: GNN-Based Inductive Knowledge Graph Completion Using Pair-Wise Encoding","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":4,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/task/inductive-knowledge-graph-completion/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/inductive-knowledge-graph-completion/papers/ran/1","json":"/task/inductive-knowledge-graph-completion/papers/ran/1.json","rows":4}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"2502f462554f2dc908c7c16443ed3a53c94e8dc7f9f32d495d4706ff905c757a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}