{"paper":{"title":"$(k,q)$-core decomposition of hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.comp-ph","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"B. Kahng, Deok-Sun Lee, Jongshin Lee, Kwang-Il Goh","submitted_at":"2023-01-17T05:43:40Z","abstract_excerpt":"In complex networks, many elements interact with each other in different ways. A hypergraph is a network in which group interactions occur among more than two elements. In this study, first, we propose a method to identify influential subgroups in hypergraphs, named $(k,q)$-core decomposition. The $(k,q)$-core is defined as the maximal subgraph in which each vertex has at least $k$ hypergraph degrees \\textit{and} each hyperedge contains at least $q$ vertices. The method contains a repeated pruning process until reaching the $(k,q)$-core, which shares similarities with a widely used $k$-core de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.06712","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.06712/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}