{"url":"/sota/link-prediction-on-youtube","task":{"name":"Link Prediction","url":"/task/link-prediction","note":null},"dataset":{"name":"YouTube","url":null},"category":"Natural Language Processing","categories":["Graphs","Natural Language Processing"],"category_note":null,"description":"**Link Prediction** is a task in graph and network analysis where the goal is to predict missing or future connections between nodes in a network. Given a partially observed network, the goal of link prediction is to infer which links are most likely to be added or missing based on the observed connections and the structure of the network.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Inductive Representation Learning on Large Graphs](https://arxiv.org/pdf/1706.02216v4.pdf) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["F1-Score","Macro F1","Micro F1","PR AUC","ROC AUC"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"F1-Score":"higher","Macro F1":"higher","Micro F1":"higher","PR AUC":"higher","ROC AUC":"higher"}},"counts":{"rows":2,"rows_with_code":2,"rows_with_paper_page":2,"rows_dated":2,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GATNE-T","metrics":{"F1-Score":"76.83","PR AUC":"81.93","ROC AUC":"84.61"},"uses_additional_data":false,"paper_date":"2019-05-05","paper":"/paper/190501669","paper_url":"https://arxiv.org/abs/1905.01669v2","paper_title":"Representation Learning for Attributed Multiplex Heterogeneous Network","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/GATNE-T","n_code_links":4,"syntology":{"n_ran":0,"n_unverified":6,"n_samples":6,"n_pointer_only_licence":1}},{"rank_in_archive_order":2,"model":"PyTorch BigGraph","metrics":{"Macro F1":"40.9","Micro F1":"48"},"uses_additional_data":false,"paper_date":"2019-03-28","paper":"/paper/pytorch-biggraph-a-large-scale-graph","paper_url":"http://arxiv.org/abs/1903.12287v3","paper_title":"PyTorch-BigGraph: A Large-scale Graph Embedding System","code":"https://github.com/facebookresearch/PyTorch-BigGraph","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":1,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":1,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":6,"n_samples":6,"n_pointer_only_licence":1,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":6,"n_samples":6,"n_pointer_only_licence":1,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}