{"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/link-prediction-based-on-graph-neural","title":"Link Prediction Based on Graph Neural Networks","arxiv_id":"1802.09691","date":"2018-02-27","proceeding":"NeurIPS 2018 12","authors":["Muhan Zhang","Yixin Chen"],"abstract":"Link prediction is a key problem for network-structured data. Link prediction\nheuristics use some score functions, such as common neighbors and Katz index,\nto measure the likelihood of links. They have obtained wide practical uses due\nto their simplicity, interpretability, and for some of them, scalability.\nHowever, every heuristic has a strong assumption on when two nodes are likely\nto link, which limits their effectiveness on networks where these assumptions\nfail. In this regard, a more reasonable way should be learning a suitable\nheuristic from a given network instead of using predefined ones. By extracting\na local subgraph around each target link, we aim to learn a function mapping\nthe subgraph patterns to link existence, thus automatically learning a\n`heuristic' that suits the current network. In this paper, we study this\nheuristic learning paradigm for link prediction. First, we develop a novel\n$\\gamma$-decaying heuristic theory. The theory unifies a wide range of\nheuristics in a single framework, and proves that all these heuristics can be\nwell approximated from local subgraphs. Our results show that local subgraphs\nreserve rich information related to link existence. Second, based on the\n$\\gamma$-decaying theory, we propose a new algorithm to learn heuristics from\nlocal subgraphs using a graph neural network (GNN). Its experimental results\nshow unprecedented performance, working consistently well on a wide range of\nproblems.","url_abs":"http://arxiv.org/abs/1802.09691v3","url_pdf":"http://arxiv.org/pdf/1802.09691v3.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":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/muhanzhang/SEAL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/arianemarandon/linkpredconf","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/facebookresearch/SEAL_OGB","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/fs302/EasyLink","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/fs302/EasyLink/blob/main/example/ogbl_ppa_ra.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/sreycodes/YLR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/venomouscyanide/S3GRL_OGB","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/venomouscyanide/s3grl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/venomouscyanide/s3grl_ogb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"link-prediction-based-on-graph-neural","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/seal","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-usair","task":"Link Prediction","dataset":"USAir","model":"SEAL","rank_in_archive_order":1,"of":2,"metrics":{"AUC":"97.09"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.09691","atlas_url":"https://app.syntology.ai/?focus=1802.09691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09691"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.09691"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.09691"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.09691\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1802.09691"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.09691\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.09691"},"call":"get_concepts_for_paper(arxiv_id=\"1802.09691\")"}],"by_repo":[{"repo":"muhanzhang/SEAL","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"arianemarandon/linkpredconf","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2306.14693"],"harvested_for_calls":[{"arxiv_id":"2306.14693","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.14693"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.14693\")"}]},{"repo":"facebookresearch/SEAL_OGB","kind":"listed","samples":2,"ran":0,"instrument":0,"unverified":2,"placed_by_identical_code":2},{"repo":"fs302/EasyLink","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2106.06935"],"harvested_for_calls":[{"arxiv_id":"2106.06935","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.06935"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.06935\")"}]},{"repo":"sreycodes/YLR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"venomouscyanide/S3GRL_OGB","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1603.08861"],"harvested_for_calls":[{"arxiv_id":"1603.08861","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1603.08861"},"call":"get_harvested_code_for_paper(arxiv_id=\"1603.08861\")"}]},{"repo":"venomouscyanide/s3grl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dmlc/dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1802.09691.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1802.09691.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/facebookresearch/SEAL_OGB","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/venomouscyanide/S3GRL_OGB","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/venomouscyanide/s3grl","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/muhanzhang/SEAL","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/fs302/EasyLink/blob/main/example/ogbl_ppa_ra.py","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/seal","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/arianemarandon/linkpredconf","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/fs302/EasyLink","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sreycodes/YLR","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/venomouscyanide/s3grl_ogb","reach":{"status":"ok"}}],"summary":{"unverified":2},"n_samples":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"listed":{"samples":2,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"official_not_harvested":{"repositories":["muhanzhang/SEAL"],"harvested_for_other_papers":[0],"samples_from_other_repositories":2,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"samples":[{"code_sha256":"ab8f4436bf3f8fc9","code_sha256_prefix":"ab8f4436bf3f8fc9","entry":"evaluate_hits","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"placed_by_identical_code":{"repo":"facebookresearch/SEAL_OGB","path":"seal_link_pred.py","file_url":"https://github.com/facebookresearch/seal_ogb/blob/HEAD/seal_link_pred.py","papers":["2010.16103"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"ab8f4436bf3f8fc9"}},{"code_sha256":"c0086a518214536a","code_sha256_prefix":"c0086a518214536a","entry":"evaluate_mrr","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"placed_by_identical_code":{"repo":"facebookresearch/SEAL_OGB","path":"seal_link_pred.py","file_url":"https://github.com/facebookresearch/seal_ogb/blob/HEAD/seal_link_pred.py","papers":["2010.16103"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"c0086a518214536a"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"40b9ce004ffc9b5832f447e5795616ecd101ed607c931d36631b4e7a1b73826b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}