{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Q27CKVVFQGVNHVR35YC5R44NAZ","short_pith_number":"pith:Q27CKVVF","schema_version":"1.0","canonical_sha256":"86be2556a581aad3d63bee05d8f38d065224b320f56fbb47a3e4de6a1a58b417","source":{"kind":"arxiv","id":"2301.06712","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2301.06712","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2023-01-17T05:43:40Z","cross_cats_sorted":["physics.comp-ph","physics.soc-ph"],"title_canon_sha256":"774b72d23c83bd5ad2bea478ce604220cc34bbf0e16049587e2fcc7a1a558aa9","abstract_canon_sha256":"e7941e1e6ee22a00be41d9d1ef019800645f7717ab320c71a2a09c07bf5e3add"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:39.372803Z","signature_b64":"ZlyMGgwD+9ppLeZsYeElRjUrqK0xCh0atx9ymajC8n3HXy6BJqX8Lu973870J8W/ZSBs0ywqWpLvgBT6mh/EAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86be2556a581aad3d63bee05d8f38d065224b320f56fbb47a3e4de6a1a58b417","last_reissued_at":"2026-07-05T06:25:39.372291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:39.372291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2301.06712","created_at":"2026-07-05T06:25:39.372359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.06712v2","created_at":"2026-07-05T06:25:39.372359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.06712","created_at":"2026-07-05T06:25:39.372359+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q27CKVVFQGVN","created_at":"2026-07-05T06:25:39.372359+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q27CKVVFQGVNHVR3","created_at":"2026-07-05T06:25:39.372359+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q27CKVVF","created_at":"2026-07-05T06:25:39.372359+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ","json":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ.json","graph_json":"https://pith.science/api/pith-number/Q27CKVVFQGVNHVR35YC5R44NAZ/graph.json","events_json":"https://pith.science/api/pith-number/Q27CKVVFQGVNHVR35YC5R44NAZ/events.json","paper":"https://pith.science/paper/Q27CKVVF"},"agent_actions":{"view_html":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ","download_json":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ.json","view_paper":"https://pith.science/paper/Q27CKVVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.06712&json=true","fetch_graph":"https://pith.science/api/pith-number/Q27CKVVFQGVNHVR35YC5R44NAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q27CKVVFQGVNHVR35YC5R44NAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ/action/storage_attestation","attest_author":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ/action/author_attestation","sign_citation":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ/action/citation_signature","submit_replication":"https://pith.science/pith/Q27CKVVFQGVNHVR35YC5R44NAZ/action/replication_record"}},"created_at":"2026-07-05T06:25:39.372359+00:00","updated_at":"2026-07-05T06:25:39.372359+00:00"}