{"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/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 (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":13,"of":13,"of_with_code":12,"tagged_in_all":13,"counts":{"archive_papers_tagged":13,"with_a_code_link":12,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":13,"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-representation-learning-on-large","slug":"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_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}},"official":{"repos":["williamleif/GraphSAGE"],"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/neural-bellman-ford-networks-a-general-graph","slug":"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":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}},"official":{"repos":["DeepGraphLearning/NBFNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/autokge-searching-scoring-functions-for","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/pairwise-learning-for-neural-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2112.02936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02936"}},"official":{"repos":["zhitao-wang/plnlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-graph-neural-networks-for-link-1","slug":"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":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/revisiting-graph-neural-networks-for-link-1#ran","syntology_url":"https://syntology.ai/paper/2010.16103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16103"}},"official":{"repos":["facebookresearch/SEAL_OGB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-graph-models-fail-to-capture-global","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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},{"url":"/paper/edge2node-reducing-edge-prediction-to-node","slug":"edge2node-reducing-edge-prediction-to-node","title":"Edge2Node: Reducing Edge Prediction to Node Classification","date":"2023-11-06","arxiv_id":"2311.02921","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/link-property-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/link-property-prediction/papers/ran/1","json":"/task/link-property-prediction/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":"fa89af038e123ca4d44ce9224914207be33267c138878c98dacf66e76779c513","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}