{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/hpra-hyperedge-prediction-using-resource","title":"HPRA: Hyperedge Prediction using Resource Allocation","arxiv_id":"2006.11070","date":"2020-06-19","proceeding":null,"authors":["Tarun Kumar","K Darwin","Srinivasan Parthasarathy","Balaraman Ravindran"],"abstract":"Many real-world systems involve higher-order interactions and thus demand complex models such as hypergraphs. For instance, a research article could have multiple collaborating authors, and therefore the co-authorship network is best represented as a hypergraph. In this work, we focus on the problem of hyperedge prediction. This problem has immense applications in multiple domains, such as predicting new collaborations in social networks, discovering new chemical reactions in metabolic networks, etc. Despite having significant importance, the problem of hyperedge prediction hasn't received adequate attention, mainly because of its inherent complexity. In a graph with $n$ nodes the number of potential edges is $\\mathcal{O}(n^{2})$, whereas in a hypergraph, the number of potential hyperedges is $\\mathcal{O}(2^{n})$. To avoid searching through such a huge space, current methods restrain the original problem in the following two ways. One class of algorithms assume the hypergraphs to be $k$-uniform. However, many real-world systems are not confined only to have interactions involving $k$ components. Thus, these algorithms are not suitable for many real-world applications. The second class of algorithms requires a candidate set of hyperedges from which the potential hyperedges are chosen. In the absence of domain knowledge, the candidate set can have $\\mathcal{O}(2^{n})$ possible hyperedges, which makes this problem intractable. We propose HPRA - Hyperedge Prediction using Resource Allocation, the first of its kind algorithm, which overcomes these issues and predicts hyperedges of any cardinality without using any candidate hyperedge set. HPRA is a similarity-based method working on the principles of the resource allocation process. In addition to recovering missing hyperedges, we demonstrate that HPRA can predict future hyperedges in a wide range of hypergraphs.","url_abs":"http://arxiv.org/abs/2006.11070v1","url_pdf":"http://arxiv.org/pdf/2006.11070v1.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"hpra-hyperedge-prediction-using-resource","repo_url":"https://github.com/darwk/HyperedgePrediction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"hpra-hyperedge-prediction-using-resource","repo_url":"https://github.com/d-maurya/hypred_tensorEVD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2006.11070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11070"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","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/darwk/HyperedgePrediction","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/d-maurya/hypred_tensorEVD","reach":{"status":"ok","spdx":"GPL-3.0"}}],"summary":{"ran_draft_wrong":2,"ran_violates":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"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"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"c3d7702a2d6df895","entry":"compute_NHAS","repo":"darwk/HyperedgePrediction","repo_kind":"official","path":"hyperedge_prediction.py","file_url":"https://github.com/darwk/HyperedgePrediction/blob/HEAD/hyperedge_prediction.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c3d7702a2d6df895"}},{"code_sha256_prefix":"06071cc978a303d5","entry":"get_pref_node","repo":"darwk/HyperedgePrediction","repo_kind":"official","path":"hyperedge_prediction.py","file_url":"https://github.com/darwk/HyperedgePrediction/blob/HEAD/hyperedge_prediction.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"06071cc978a303d5"}},{"code_sha256_prefix":"b735e49766c87713","entry":"predict_hyperedge","repo":"darwk/HyperedgePrediction","repo_kind":"official","path":"hyperedge_prediction.py","file_url":"https://github.com/darwk/HyperedgePrediction/blob/HEAD/hyperedge_prediction.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b735e49766c87713"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}