{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FVC4DJBBW6AO56Y2W2DNAHKDHH","short_pith_number":"pith:FVC4DJBB","schema_version":"1.0","canonical_sha256":"2d45c1a421b780eefb1ab686d01d4339d2cd0aaeecac604d66d66fc1da4056a5","source":{"kind":"arxiv","id":"1909.06503","version":2},"attestation_state":"computed","paper":{"title":"Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Dong Xia, Feng Shi, Zheng Tracy Ke","submitted_at":"2019-09-14T01:50:19Z","abstract_excerpt":"To date, social network analysis has been largely focused on pairwise interactions. The study of higher-order interactions, via a hypergraph network, brings in new insights. We study community detection in a hypergraph network. A popular approach is to project the hypergraph to a graph and then apply community detection methods for graph networks, but we show that this approach may cause unwanted information loss. We propose a new method for community detection that operates directly on the hypergraph. At the heart of our method is a regularized higher-order orthogonal iteration (reg-HOOI) alg"},"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":"1909.06503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-09-14T01:50:19Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"933eee37b3412ccc1618093772982fed4a1dd957f00c3dcd3f43a20a5fa1791e","abstract_canon_sha256":"074c50963495168ac8f186ab15f395ab69d5a591e4b66414786c6d4a4911ce0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:20.596043Z","signature_b64":"4QzqSNKQZcgCIjskvDuT5Po9/CJp7aRwLcdloQUmHuRIcY7fmQkeAFHQKg0gigbfY9I6OlepmXQ5KhVpR1MADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d45c1a421b780eefb1ab686d01d4339d2cd0aaeecac604d66d66fc1da4056a5","last_reissued_at":"2026-07-05T00:29:20.595675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:20.595675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Dong Xia, Feng Shi, Zheng Tracy Ke","submitted_at":"2019-09-14T01:50:19Z","abstract_excerpt":"To date, social network analysis has been largely focused on pairwise interactions. The study of higher-order interactions, via a hypergraph network, brings in new insights. We study community detection in a hypergraph network. A popular approach is to project the hypergraph to a graph and then apply community detection methods for graph networks, but we show that this approach may cause unwanted information loss. We propose a new method for community detection that operates directly on the hypergraph. At the heart of our method is a regularized higher-order orthogonal iteration (reg-HOOI) alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06503","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/1909.06503/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":"1909.06503","created_at":"2026-07-05T00:29:20.595737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.06503v2","created_at":"2026-07-05T00:29:20.595737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06503","created_at":"2026-07-05T00:29:20.595737+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVC4DJBBW6AO","created_at":"2026-07-05T00:29:20.595737+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVC4DJBBW6AO56Y2","created_at":"2026-07-05T00:29:20.595737+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVC4DJBB","created_at":"2026-07-05T00:29:20.595737+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02537","citing_title":"A Guide to Higher-Order Homophily","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2512.21009","citing_title":"ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20907","citing_title":"Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH","json":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH.json","graph_json":"https://pith.science/api/pith-number/FVC4DJBBW6AO56Y2W2DNAHKDHH/graph.json","events_json":"https://pith.science/api/pith-number/FVC4DJBBW6AO56Y2W2DNAHKDHH/events.json","paper":"https://pith.science/paper/FVC4DJBB"},"agent_actions":{"view_html":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH","download_json":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH.json","view_paper":"https://pith.science/paper/FVC4DJBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.06503&json=true","fetch_graph":"https://pith.science/api/pith-number/FVC4DJBBW6AO56Y2W2DNAHKDHH/graph.json","fetch_events":"https://pith.science/api/pith-number/FVC4DJBBW6AO56Y2W2DNAHKDHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH/action/storage_attestation","attest_author":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH/action/author_attestation","sign_citation":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH/action/citation_signature","submit_replication":"https://pith.science/pith/FVC4DJBBW6AO56Y2W2DNAHKDHH/action/replication_record"}},"created_at":"2026-07-05T00:29:20.595737+00:00","updated_at":"2026-07-05T00:29:20.595737+00:00"}