{"url":"/task/link-property-prediction","name":"Link Property Prediction","slug":"link-property-prediction","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":13,"papers_with_code":12,"benchmarks":6,"benchmark_tables_in_archive":6,"benchmark_tables_shown":6,"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":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/link-property-prediction-on-ogbl-collab","slug":"link-property-prediction-on-ogbl-collab","dataset":"ogbl-collab","dataset_url":"/dataset/ogb","rows_in_archive":34,"metrics":["Test Hits@50","Ext. data","Validation Hits@50","Number of params"],"first_row_in_archive_order":{"model":"E2N","paper_title":"Edge2Node: Reducing Edge Prediction to Node Classification","paper_url":"/paper/edge2node-reducing-edge-prediction-to-node","paper_date":"2023-11-06","arxiv_id":"2311.02921","code_links":[],"syntology":null}},{"leaderboard":"/sota/link-property-prediction-on-ogbl-ddi","slug":"link-property-prediction-on-ogbl-ddi","dataset":"ogbl-ddi","dataset_url":"/dataset/ogb","rows_in_archive":31,"metrics":["Ext. data","Test Hits@20","Validation Hits@20","Number of params"],"first_row_in_archive_order":{"model":"HyperFusion","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/link-property-prediction-on-ogbl-wikikg2","slug":"link-property-prediction-on-ogbl-wikikg2","dataset":"ogbl-wikikg2","dataset_url":"/dataset/ogb","rows_in_archive":30,"metrics":["Test MRR","Ext. data","Validation MRR","Number of params"],"first_row_in_archive_order":{"model":"RelEns","paper_title":"Relation-aware Ensemble Learning for Knowledge Graph Embedding","paper_url":"/paper/relation-aware-ensemble-learning-for","paper_date":"2023-10-13","arxiv_id":"2310.08917","code_links":[{"title":"lars-research/relens","url":"https://github.com/lars-research/relens"},{"title":"LARS-research/RelEns","url":"https://github.com/LARS-research/RelEns"}],"syntology":null}},{"leaderboard":"/sota/link-property-prediction-on-ogbl-ppa","slug":"link-property-prediction-on-ogbl-ppa","dataset":"ogbl-ppa","dataset_url":"/dataset/ogb","rows_in_archive":26,"metrics":["Ext. data","Test Hits@100","Validation Hits@100","Number of params"],"first_row_in_archive_order":{"model":"** E2N**","paper_title":"Edge2Node: Reducing Edge Prediction to Node Classification","paper_url":"/paper/edge2node-reducing-edge-prediction-to-node","paper_date":"2023-11-06","arxiv_id":"2311.02921","code_links":[],"syntology":null}},{"leaderboard":"/sota/link-property-prediction-on-ogbl-citation2","slug":"link-property-prediction-on-ogbl-citation2","dataset":"ogbl-citation2","dataset_url":"/dataset/ogb","rows_in_archive":23,"metrics":["Ext. data","Test MRR","Validation MRR","Number of params"],"first_row_in_archive_order":{"model":"GraphGPT(d1n30)","paper_title":"GraphGPT: Graph Learning with Generative Pre-trained Transformers","paper_url":"/paper/graphgpt-graph-learning-with-generative-pre","paper_date":"2023-12-31","arxiv_id":"2401.00529","code_links":[{"title":"alibaba/graph-gpt","url":"https://github.com/alibaba/graph-gpt"}],"syntology":null}},{"leaderboard":"/sota/link-property-prediction-on-ogbl-biokg","slug":"link-property-prediction-on-ogbl-biokg","dataset":"ogbl-biokg","dataset_url":"/dataset/ogb","rows_in_archive":16,"metrics":["Test MRR","Ext. data","Validation MRR","Number of params"],"first_row_in_archive_order":{"model":"RelEns","paper_title":"Relation-aware Ensemble Learning for Knowledge Graph Embedding","paper_url":"/paper/relation-aware-ensemble-learning-for","paper_date":"2023-10-13","arxiv_id":"2310.08917","code_links":[{"title":"lars-research/relens","url":"https://github.com/lars-research/relens"},{"title":"LARS-research/RelEns","url":"https://github.com/LARS-research/RelEns"}],"syntology":null}}],"datasets":[{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","num_papers_in_archive":1000}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":12,"of":12,"tagged_in_all":13,"items":[{"url":"/paper/inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","repositories_listed":20,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":5}},{"url":"/paper/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","repositories_listed":3,"syntology":{"n":15,"n_ran":2,"n_unverified":13,"n_pointer_only":0}},{"url":"/paper/autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","arxiv_id":"1904.11682","repositories_listed":3,"syntology":null},{"url":"/paper/pairwise-learning-for-neural-link-prediction","title":"Pairwise Learning for Neural Link Prediction","date":"2021-12-06","arxiv_id":"2112.02936","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":3}},{"url":"/paper/revisiting-graph-neural-networks-for-link-1","title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","date":"2020-10-30","arxiv_id":"2010.16103","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":1}},{"url":"/paper/temporal-graph-models-fail-to-capture-global","title":"Temporal graph models fail to capture global temporal dynamics","date":"2023-09-27","arxiv_id":"2309.15730","repositories_listed":1,"syntology":null},{"url":"/paper/path-aware-siamese-graph-neural-network-for","title":"Path-aware Siamese Graph Neural Network for Link Prediction","date":"2022-08-10","arxiv_id":"2208.05781","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-neighborhood-modeling-and","title":"D-HYPR: Harnessing Neighborhood Modeling and Asymmetry Preservation for Digraph Representation Learning","date":"2021-12-22","arxiv_id":"2112.11734","repositories_listed":1,"syntology":null},{"url":"/paper/vq-gnn-a-universal-framework-to-scale-up","title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","date":"2021-10-27","arxiv_id":"2110.14363","repositories_listed":1,"syntology":null},{"url":"/paper/relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-knowledge-graphs-attentive-to","title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/distance-enhanced-graph-neural-network-for","title":"Distance-Enhanced Graph Neural Network for Link Prediction","date":"2021-05-20","arxiv_id":null,"repositories_listed":1,"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}