{"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/simplicial-closure-and-higher-order-link","title":"Simplicial Closure and higher-order link prediction","arxiv_id":"1802.06916","date":"2018-02-20","proceeding":null,"authors":["Austin R. Benson","Rediet Abebe","Michael T. Schaub","Ali Jadbabaie","Jon Kleinberg"],"abstract":"Networks provide a powerful formalism for modeling complex systems by using a\nmodel of pairwise interactions. But much of the structure within these systems\ninvolves interactions that take place among more than two nodes at once; for\nexample, communication within a group rather than person-to person,\ncollaboration among a team rather than a pair of coauthors, or biological\ninteraction between a set of molecules rather than just two. Such higher-order\ninteractions are ubiquitous, but their empirical study has received limited\nattention, and little is known about possible organizational principles of such\nstructures. Here we study the temporal evolution of 19 datasets with explicit\naccounting for higher-order interactions. We show that there is a rich variety\nof structure in our datasets but datasets from the same system types have\nconsistent patterns of higher-order structure. Furthermore, we find that tie\nstrength and edge density are competing positive indicators of higher-order\norganization, and these trends are consistent across interactions involving\ndiffering numbers of nodes. To systematically further the study of theories for\nsuch higher-order structures, we propose higher-order link prediction as a\nbenchmark problem to assess models and algorithms that predict higher-order\nstructure. We find a fundamental differences from traditional pairwise link\nprediction, with a greater role for local rather than long-range information in\npredicting the appearance of new interactions.","url_abs":"http://arxiv.org/abs/1802.06916v2","url_pdf":"http://arxiv.org/pdf/1802.06916v2.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":"simplicial-closure-and-higher-order-link","repo_url":"https://github.com/arbenson/ScHoLP-Tutorial","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"simplicial-closure-and-higher-order-link","repo_url":"https://github.com/ZerixU/CSNS","is_official":0,"mentioned_in_paper":0,"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/1802.06916","atlas_url":"https://app.syntology.ai/?focus=1802.06916","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":"1802.06916"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.06916\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.06916"},"call":"get_concepts_for_paper(arxiv_id=\"1802.06916\")"}],"by_repo":[{"repo":"arbenson/ScHoLP-Tutorial","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ZerixU/CSNS","kind":"listed","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":"9a0a2ad7ac2281c6497f420335923b065b1755b90799f8c210cd03be70456230","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}