{"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-link-prediction","name":"Inductive Link Prediction","slug":"inductive-link-prediction","description_markdown":"In inductive link prediction inference is performed on a new, unseen graph whereas classical transductive link prediction performs both training and inference on the same graph.","categories":[{"name":"Graphs","url":"/area/graphs"},{"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":32,"papers_with_code":23,"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":3,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/inductive-link-prediction-on-wikidata5m-si","slug":"inductive-link-prediction-on-wikidata5m-si","dataset":"Wikidata5M-SI","dataset_url":"/dataset/wikidata5m-si","rows_in_archive":12,"metrics":["0-shot MRR","1-shot MRR","10-shot MRR"],"first_row_in_archive_order":{"model":"KGT5 (descriptions)","paper_title":"A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs","paper_url":"/paper/a-benchmark-for-semi-inductive-link","paper_date":"2023-10-18","arxiv_id":"2310.11917","code_links":[{"title":"uma-pi1/wikidata5m-si","url":"https://github.com/uma-pi1/wikidata5m-si"}],"syntology":null}},{"leaderboard":"/sota/inductive-link-prediction-on-ilpc22-large","slug":"inductive-link-prediction-on-ilpc22-large","dataset":"ILPC22-Large","dataset_url":"/dataset/ilpc22-large","rows_in_archive":2,"metrics":["MRR","Hits@100","Hits@10","Hits@5","Hits@3","Hits@1","AMRI"],"first_row_in_archive_order":{"model":"Inductive NodePiece + GNN","paper_title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","paper_url":"/paper/an-open-challenge-for-inductive-link","paper_date":"2022-03-03","arxiv_id":"2203.01520","code_links":[{"title":"pykeen/ilpc2022","url":"https://github.com/pykeen/ilpc2022"}],"syntology":null}},{"leaderboard":"/sota/inductive-link-prediction-on-ilpc22-small","slug":"inductive-link-prediction-on-ilpc22-small","dataset":"ILPC22-Small","dataset_url":"/dataset/ilpc22-small","rows_in_archive":2,"metrics":["MRR","Hits@100","Hits@10","Hits@5","Hits@3","Hits@1","AMRI"],"first_row_in_archive_order":{"model":"Inductive NodePiece + GNN","paper_title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","paper_url":"/paper/an-open-challenge-for-inductive-link","paper_date":"2022-03-03","arxiv_id":"2203.01520","code_links":[{"title":"pykeen/ilpc2022","url":"https://github.com/pykeen/ilpc2022"}],"syntology":null}}],"datasets":[{"url":"/dataset/ilpc22-large","name":"ILPC22-Large","full_name":"ILPC22-Large","num_papers_in_archive":1},{"url":"/dataset/ilpc22-small","name":"ILPC22-Small","full_name":"ILPC22-Small","num_papers_in_archive":1},{"url":"/dataset/wikidata5m-si","name":"Wikidata5M-SI","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/link-prediction","name":"Link Prediction"}],"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":32,"of":32,"of_with_code":23,"tagged_in_all":32,"counts":{"archive_papers_tagged":32,"with_a_code_link":23,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":32,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/neighborhood-aware-scalable-temporal-network","slug":"neighborhood-aware-scalable-temporal-network","title":"Neighborhood-aware Scalable Temporal Network Representation Learning","date":"2022-09-02","arxiv_id":"2209.01084","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/neighborhood-aware-scalable-temporal-network#ran","syntology_url":"https://syntology.ai/paper/2209.01084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.01084"}},"official":{"repos":["graph-com/neighborhood-aware-temporal-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/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/inductive-link-prediction-on-n-ary-relational","slug":"inductive-link-prediction-on-n-ary-relational","title":"Inductive Link Prediction on N-ary Relational Facts via Semantic Hypergraph Reasoning","date":"2025-03-26","arxiv_id":"2503.20676","repositories_listed":1,"syntology":null},{"url":"/paper/leap-inductive-link-prediction-via-learnable","slug":"leap-inductive-link-prediction-via-learnable","title":"Leap: Inductive Link Prediction via Learnable TopologyAugmentation","date":"2025-03-05","arxiv_id":"2503.03331","repositories_listed":1,"syntology":null},{"url":"/paper/reevaluation-of-inductive-link-prediction","slug":"reevaluation-of-inductive-link-prediction","title":"Reevaluation of Inductive Link Prediction","date":"2024-09-30","arxiv_id":"2409.20130","repositories_listed":1,"syntology":null},{"url":"/paper/moti-mathcal-ve-a-drug-target-interaction","slug":"moti-mathcal-ve-a-drug-target-interaction","title":"MOTIVE: A Drug-Target Interaction Graph For Inductive Link Prediction","date":"2024-06-12","arxiv_id":"2406.08649","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-zero-shot-product-attribute-value","slug":"multi-label-zero-shot-product-attribute-value","title":"Multi-Label Zero-Shot Product Attribute-Value Extraction","date":"2024-02-13","arxiv_id":"2402.08802","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-link-prediction-in-knowledge-graphs","slug":"inductive-link-prediction-in-knowledge-graphs","title":"Inductive Link Prediction in Knowledge Graphs using Path-based Neural Networks","date":"2023-12-16","arxiv_id":"2312.10293","repositories_listed":1,"syntology":null},{"url":"/paper/towards-enhancing-relational-rules-for","slug":"towards-enhancing-relational-rules-for","title":"Towards Enhancing Relational Rules for Knowledge Graph Link Prediction","date":"2023-10-20","arxiv_id":"2310.13411","repositories_listed":1,"syntology":null},{"url":"/paper/a-benchmark-for-semi-inductive-link","slug":"a-benchmark-for-semi-inductive-link","title":"A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs","date":"2023-10-18","arxiv_id":"2310.11917","repositories_listed":1,"syntology":null},{"url":"/paper/event-prediction-using-case-based-reasoning","slug":"event-prediction-using-case-based-reasoning","title":"Event Prediction using Case-Based Reasoning over Knowledge Graphs","date":"2023-09-21","arxiv_id":"2309.12423","repositories_listed":1,"syntology":null},{"url":"/paper/towards-few-shot-inductive-link-prediction-on","slug":"towards-few-shot-inductive-link-prediction-on","title":"Towards Few-shot Inductive Link Prediction on Knowledge Graphs: A Relational Anonymous Walk-guided Neural Process Approach","date":"2023-06-26","arxiv_id":"2307.01204","repositories_listed":1,"syntology":null},{"url":"/paper/double-permutation-equivariance-for-knowledge","slug":"double-permutation-equivariance-for-knowledge","title":"Double Equivariance for Inductive Link Prediction for Both New Nodes and New Relation Types","date":"2023-02-02","arxiv_id":"2302.01313","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 6 unverified","sample_list":"/paper/double-permutation-equivariance-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2302.01313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01313"}},"official":{"repos":["purdueminds/isdea"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":[]}}},{"url":"/paper/irt2-inductive-linking-and-ranking-in","slug":"irt2-inductive-linking-and-ranking-in","title":"IRT2: Inductive Linking and Ranking in Knowledge Graphs of Varying Scale","date":"2023-01-02","arxiv_id":"2301.00716","repositories_listed":1,"syntology":null},{"url":"/paper/raild-towards-leveraging-relation-features","slug":"raild-towards-leveraging-relation-features","title":"RAILD: Towards Leveraging Relation Features for Inductive Link Prediction In Knowledge Graphs","date":"2022-11-21","arxiv_id":"2211.11407","repositories_listed":1,"syntology":null},{"url":"/paper/disconnected-emerging-knowledge-graph","slug":"disconnected-emerging-knowledge-graph","title":"Disconnected Emerging Knowledge Graph Oriented Inductive Link Prediction","date":"2022-09-03","arxiv_id":"2209.01397","repositories_listed":1,"syntology":null},{"url":"/paper/subgraph-neighboring-relations-infomax-for","slug":"subgraph-neighboring-relations-infomax-for","title":"Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs","date":"2022-07-28","arxiv_id":"2208.00850","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":7,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"7 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 7 samples that ran constructed an object rather than computing a result","sample_list":"/paper/subgraph-neighboring-relations-infomax-for#ran","syntology_url":"https://syntology.ai/paper/2208.00850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.00850"}},"official":{"repos":["Tebmer/SNRI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/an-open-challenge-for-inductive-link","slug":"an-open-challenge-for-inductive-link","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","date":"2022-03-03","arxiv_id":"2203.01520","repositories_listed":1,"syntology":null},{"url":"/paper/how-neural-processes-improve-graph-link","slug":"how-neural-processes-improve-graph-link","title":"How Neural Processes Improve Graph Link Prediction","date":"2021-09-30","arxiv_id":"2109.14894","repositories_listed":1,"syntology":null},{"url":"/paper/topology-aware-correlations-between-relations","slug":"topology-aware-correlations-between-relations","title":"Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs","date":"2021-03-05","arxiv_id":"2103.03642","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 4 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) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/topology-aware-correlations-between-relations#ran","syntology_url":"https://syntology.ai/paper/2103.03642","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03642"}},"official":{"repos":["MIRALab-USTC/KG-TACT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-link-prediction-for-nodes-having","slug":"inductive-link-prediction-for-nodes-having","title":"Inductive Link Prediction for Nodes Having Only Attribute Information","date":"2020-07-16","arxiv_id":"2007.08053","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/inductive-link-prediction-for-nodes-having#ran","syntology_url":"https://syntology.ai/paper/2007.08053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08053"}},"official":{"repos":["working-yuhao/DEAL"],"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":["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":null,"slug":"fast-and-frugal-text-graph-transformers-are","title":"Fast-and-Frugal Text-Graph Transformers are Effective Link Predictors","date":"2024-08-13","arxiv_id":"2408.06778","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-relational-hypergraphs","title":"Link Prediction with Relational Hypergraphs","date":"2024-02-06","arxiv_id":"2402.04062","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-complete-topology-aware-correlations","title":"Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction","date":"2023-09-20","arxiv_id":"2309.11528","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-semantically-enriched-embeddings-for","title":"Towards Semantically Enriched Embeddings for Knowledge Graph Completion","date":"2023-07-31","arxiv_id":"2308.00081","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-node-attributes-from-graph","title":"Disentangling Node Attributes from Graph Topology for Improved Generalizability in Link Prediction","date":"2023-07-17","arxiv_id":"2307.08877","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-ood-multi-task-perspective-for-link","title":"A Multi-Task Perspective for Link Prediction with New Relation Types and Nodes","date":"2023-07-12","arxiv_id":"2307.06046","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-contextualized-self","title":"Link Prediction with Contextualized Self-Supervision","date":"2022-01-25","arxiv_id":"2201.10069","repositories_listed":0,"syntology":null},{"url":null,"slug":"barlow-graph-auto-encoder-for-unsupervised","title":"Barlow Graph Auto-Encoder for Unsupervised Network Embedding","date":"2021-10-29","arxiv_id":"2110.15742","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgraph-aware-few-shot-inductive-link","title":"Subgraph-aware Few-Shot Inductive Link Prediction via Meta-Learning","date":"2021-07-26","arxiv_id":"2108.00954","repositories_listed":0,"syntology":null}],"syntology_records":6,"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":5,"papers_where_code_ran_first_page":"/task/inductive-link-prediction/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-link-prediction/papers/ran/1","json":"/task/inductive-link-prediction/papers/ran/1.json","rows":5}],"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":"b41ff4b5099207f162bf848f2372584b40ceeb5573540e42655d1d0b2475f4f2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}