{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:F5CGR7PJAQVHJKKOIA2NYERBGA","short_pith_number":"pith:F5CGR7PJ","schema_version":"1.0","canonical_sha256":"2f4468fde9042a74a94e4034dc12213032f8d9c1600813897815f9f6f371581c","source":{"kind":"arxiv","id":"2103.15035","version":2},"attestation_state":"computed","paper":{"title":"Community Detection in General Hypergraph via Graph Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Junhui Wang, Yaoming Zhen","submitted_at":"2021-03-28T03:23:03Z","abstract_excerpt":"Conventional network data has largely focused on pairwise interactions between two entities, yet multi-way interactions among multiple entities have been frequently observed in real-life hypergraph networks. In this article, we propose a novel method for detecting community structure in general hypergraph networks, uniform or non-uniform. The proposed method introduces a null vertex to augment a non-uniform hypergraph into a uniform multi-hypergraph, and then embeds the multi-hypergraph in a low-dimensional vector space such that vertices within the same community are close to each other. The "},"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":"2103.15035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-03-28T03:23:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5f68b24f34fe6c314bb2fcc8200420280313e20737fcb72670cf3a68b23af4a9","abstract_canon_sha256":"ebf769b6aadbd67a0393c04be06ecbbcdda9f116d652d3a34f00ced316200ae6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:12.217299Z","signature_b64":"/3G+wtMTJNlMYNKLLn+R0lbtJkZBmRuBuBxosC0s1HEZQfjvW63LNcDuDB9yQ1atJDL+hEHKKEKTwPhFlq4DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f4468fde9042a74a94e4034dc12213032f8d9c1600813897815f9f6f371581c","last_reissued_at":"2026-07-05T03:11:12.216885Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:12.216885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection in General Hypergraph via Graph Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Junhui Wang, Yaoming Zhen","submitted_at":"2021-03-28T03:23:03Z","abstract_excerpt":"Conventional network data has largely focused on pairwise interactions between two entities, yet multi-way interactions among multiple entities have been frequently observed in real-life hypergraph networks. In this article, we propose a novel method for detecting community structure in general hypergraph networks, uniform or non-uniform. The proposed method introduces a null vertex to augment a non-uniform hypergraph into a uniform multi-hypergraph, and then embeds the multi-hypergraph in a low-dimensional vector space such that vertices within the same community are close to each other. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15035","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/2103.15035/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":"2103.15035","created_at":"2026-07-05T03:11:12.216942+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.15035v2","created_at":"2026-07-05T03:11:12.216942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15035","created_at":"2026-07-05T03:11:12.216942+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5CGR7PJAQVH","created_at":"2026-07-05T03:11:12.216942+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5CGR7PJAQVHJKKO","created_at":"2026-07-05T03:11:12.216942+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5CGR7PJ","created_at":"2026-07-05T03:11:12.216942+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04251","citing_title":"Modeling Hypergraphs with Diversity and Heterogeneous Popularity","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA","json":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA.json","graph_json":"https://pith.science/api/pith-number/F5CGR7PJAQVHJKKOIA2NYERBGA/graph.json","events_json":"https://pith.science/api/pith-number/F5CGR7PJAQVHJKKOIA2NYERBGA/events.json","paper":"https://pith.science/paper/F5CGR7PJ"},"agent_actions":{"view_html":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA","download_json":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA.json","view_paper":"https://pith.science/paper/F5CGR7PJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.15035&json=true","fetch_graph":"https://pith.science/api/pith-number/F5CGR7PJAQVHJKKOIA2NYERBGA/graph.json","fetch_events":"https://pith.science/api/pith-number/F5CGR7PJAQVHJKKOIA2NYERBGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA/action/storage_attestation","attest_author":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA/action/author_attestation","sign_citation":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA/action/citation_signature","submit_replication":"https://pith.science/pith/F5CGR7PJAQVHJKKOIA2NYERBGA/action/replication_record"}},"created_at":"2026-07-05T03:11:12.216942+00:00","updated_at":"2026-07-05T03:11:12.216942+00:00"}