{"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":"/paper/an-open-challenge-for-inductive-link","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","arxiv_id":"2203.01520","date":"2022-03-03","proceeding":null,"authors":["Mikhail Galkin","Max Berrendorf","Charles Tapley Hoyt"],"abstract":"An emerging trend in representation learning over knowledge graphs (KGs) moves beyond transductive link prediction tasks over a fixed set of known entities in favor of inductive tasks that imply training on one graph and performing inference over a new graph with unseen entities. In inductive setups, node features are often not available and training shallow entity embedding matrices is meaningless as they cannot be used at inference time with unseen entities. Despite the growing interest, there are not enough benchmarks for evaluating inductive representation learning methods. In this work, we introduce ILPC 2022, a novel open challenge on KG inductive link prediction. To this end, we constructed two new datasets based on Wikidata with various sizes of training and inference graphs that are much larger than existing inductive benchmarks. We also provide two strong baselines leveraging recently proposed inductive methods. We hope this challenge helps to streamline community efforts in the inductive graph representation learning area. ILPC 2022 follows best practices on evaluation fairness and reproducibility, and is available at https://github.com/pykeen/ilpc2022.","url_abs":"https://arxiv.org/abs/2203.01520v2","url_pdf":"https://arxiv.org/pdf/2203.01520v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"an-open-challenge-for-inductive-link","repo_url":"https://github.com/pykeen/ilpc2022","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"inductive-link-prediction","task_name":"Inductive Link Prediction"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[{"slug":"ilpc22-large","name":"ILPC22-Large","full_name":"ILPC22-Large"},{"slug":"ilpc22-small","name":"ILPC22-Small","full_name":"ILPC22-Small"}],"methods_introduced":[],"results":[{"leaderboard":"/sota/inductive-link-prediction-on-ilpc22-large","task":"Inductive Link Prediction","dataset":"ILPC22-Large","model":"Inductive NodePiece + GNN","rank_in_archive_order":1,"of":2,"metrics":{"AMRI":"0.682","Hits@1":"0.0319","Hits@10":"0.1458","Hits@100":"0.374","Hits@3":"0.073","Hits@5":"0.099","MRR":"0.0705"},"uses_additional_data":false},{"leaderboard":"/sota/inductive-link-prediction-on-ilpc22-large","task":"Inductive Link Prediction","dataset":"ILPC22-Large","model":"Inductive NodePiece","rank_in_archive_order":2,"of":2,"metrics":{"AMRI":"0.646","Hits@1":"0.0373","Hits@10":"0.1246","Hits@100":"0.287","Hits@3":"0.0542","Hits@5":"0.0809","MRR":"0.0651"},"uses_additional_data":false},{"leaderboard":"/sota/inductive-link-prediction-on-ilpc22-small","task":"Inductive Link Prediction","dataset":"ILPC22-Small","model":"Inductive NodePiece + GNN","rank_in_archive_order":1,"of":2,"metrics":{"AMRI":"0.730","Hits@1":"0.0763","Hits@10":"0.2509","Hits@100":"0.4705","Hits@3":"0.1396","Hits@5":"0.1899","MRR":"0.1326"},"uses_additional_data":false},{"leaderboard":"/sota/inductive-link-prediction-on-ilpc22-small","task":"Inductive Link Prediction","dataset":"ILPC22-Small","model":"Inductive NodePiece","rank_in_archive_order":2,"of":2,"metrics":{"AMRI":"0.666","Hits@1":"0.007","Hits@10":"0.0917","Hits@100":"0.4678","Hits@3":"0.0219","Hits@5":"0.0500","MRR":"0.0381"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.01520","atlas_url":"https://app.syntology.ai/?focus=2203.01520","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2203.01520"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2203.01520\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2203.01520"},"call":"get_concepts_for_paper(arxiv_id=\"2203.01520\")"}],"by_repo":[{"repo":"pykeen/ilpc2022","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"85dbc9788787c65662cdfeecc4237c6baa73d79b26ba7b7d8f6c337a66157f2b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}