{"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-in-networks-with-core-fringe","title":"Link Prediction in Networks with Core-Fringe Data","arxiv_id":"1811.11540","date":"2018-11-28","proceeding":null,"authors":["Austin R. Benson","Jon Kleinberg"],"abstract":"Data collection often involves the partial measurement of a larger system. A\ncommon example arises in collecting network data: we often obtain network\ndatasets by recording all of the interactions among a small set of core nodes,\nso that we end up with a measurement of the network consisting of these core\nnodes along with a potentially much larger set of fringe nodes that have links\nto the core. Given the ubiquity of this process for assembling network data, it\nis crucial to understand the role of such a `core-fringe' structure.\n  Here we study how the inclusion of fringe nodes affects the standard task of\nnetwork link prediction. One might initially think the inclusion of any\nadditional data is useful, and hence that it should be beneficial to include\nall fringe nodes that are available. However, we find that this is not true; in\nfact, there is substantial variability in the value of the fringe nodes for\nprediction. Once an algorithm is selected, in some datasets, including any\nadditional data from the fringe can actually hurt prediction performance; in\nother datasets, including some amount of fringe information is useful before\nprediction performance saturates or even declines; and in further cases,\nincluding the entire fringe leads to the best performance. While such variety\nmight seem surprising, we show that these behaviors are exhibited by simple\nrandom graph models.","url_abs":"http://arxiv.org/abs/1811.11540v2","url_pdf":"http://arxiv.org/pdf/1811.11540v2.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-in-networks-with-core-fringe","repo_url":"https://github.com/arbenson/cflp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.11540","atlas_url":"https://app.syntology.ai/?focus=1811.11540","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":"1811.11540"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.11540\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.11540"},"call":"get_concepts_for_paper(arxiv_id=\"1811.11540\")"}],"by_repo":[{"repo":"arbenson/cflp","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":"c574607097316208718578c32c5595c9bcbdc12ced2bffab5b6b12b126bca42b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}