{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LXAE7RX5YLAPCYG2MKYN2BBT24","short_pith_number":"pith:LXAE7RX5","schema_version":"1.0","canonical_sha256":"5dc04fc6fdc2c0f160da62b0dd0433d715c8a0d0245fe04bbe09e8fcf1d65078","source":{"kind":"arxiv","id":"2307.00210","version":1},"attestation_state":"computed","paper":{"title":"Projected Tensor Power Method for Hypergraph Community Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Jinxin Wang, Peng Wang, Xiaolu Wang, Yuen-Man Pun","submitted_at":"2023-07-01T03:25:46Z","abstract_excerpt":"This paper investigates the problem of exact community recovery in the symmetric $d$-uniform $(d \\geq 2)$ hypergraph stochastic block model ($d$-HSBM). In this model, a $d$-uniform hypergraph with $n$ nodes is generated by first partitioning the $n$ nodes into $K\\geq 2$ equal-sized disjoint communities and then generating hyperedges with a probability that depends on the community memberships of $d$ nodes. Despite the non-convex and discrete nature of the maximum likelihood estimation problem, we develop a simple yet efficient iterative method, called the \\emph{projected tensor power method}, "},"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":"2307.00210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-07-01T03:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"a338fc89f2ddbcb48d11034b7574dcbc8fe9169a063f8d905a253865961ac309","abstract_canon_sha256":"e84480fcddd87cab779846c13846119893111f21a571b20a377ea6523d647860"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:26:53.073813Z","signature_b64":"VjReaKBfnCKnzuBcT4za2HCCfIe2NUqrG1bI827Xn7rQcL5HxF8C+YCApmQ7c4+jJldPYomLqaUalWYAoTD+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dc04fc6fdc2c0f160da62b0dd0433d715c8a0d0245fe04bbe09e8fcf1d65078","last_reissued_at":"2026-07-05T06:26:53.073348Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:26:53.073348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projected Tensor Power Method for Hypergraph Community Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Jinxin Wang, Peng Wang, Xiaolu Wang, Yuen-Man Pun","submitted_at":"2023-07-01T03:25:46Z","abstract_excerpt":"This paper investigates the problem of exact community recovery in the symmetric $d$-uniform $(d \\geq 2)$ hypergraph stochastic block model ($d$-HSBM). In this model, a $d$-uniform hypergraph with $n$ nodes is generated by first partitioning the $n$ nodes into $K\\geq 2$ equal-sized disjoint communities and then generating hyperedges with a probability that depends on the community memberships of $d$ nodes. Despite the non-convex and discrete nature of the maximum likelihood estimation problem, we develop a simple yet efficient iterative method, called the \\emph{projected tensor power method}, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.00210","kind":"arxiv","version":1},"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/2307.00210/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":"2307.00210","created_at":"2026-07-05T06:26:53.073414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.00210v1","created_at":"2026-07-05T06:26:53.073414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.00210","created_at":"2026-07-05T06:26:53.073414+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXAE7RX5YLAP","created_at":"2026-07-05T06:26:53.073414+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXAE7RX5YLAPCYG2","created_at":"2026-07-05T06:26:53.073414+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXAE7RX5","created_at":"2026-07-05T06:26:53.073414+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/LXAE7RX5YLAPCYG2MKYN2BBT24","json":"https://pith.science/pith/LXAE7RX5YLAPCYG2MKYN2BBT24.json","graph_json":"https://pith.science/api/pith-number/LXAE7RX5YLAPCYG2MKYN2BBT24/graph.json","events_json":"https://pith.science/api/pith-number/LXAE7RX5YLAPCYG2MKYN2BBT24/events.json","paper":"https://pith.science/paper/LXAE7RX5"},"agent_actions":{"view_html":"https://pith.science/pith/LXAE7RX5YLAPCYG2MKYN2BBT24","download_json":"https://pith.science/pith/LXAE7RX5YLAPCYG2MKYN2BBT24.json","view_paper":"https://pith.science/paper/LXAE7RX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.00210&json=true","fetch_graph":"https://pith.science/api/pith-number/LXAE7RX5YLAPCYG2MKYN2BBT24/graph.json","fetch_events":"https://pith.science/api/pith-number/LXAE7RX5YLAPCYG2MKYN2BBT24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXAE7RX5YLAPCYG2MKYN2BBT24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXAE7RX5YLAPCYG2MKYN2BBT24/action/storage_attestation","attest_author":"https://pith.science/pith/LXAE7RX5YLAPCYG2MKYN2BBT24/action/author_attestation","sign_citation":"https://pith.science/pith/LXAE7RX5YLAPCYG2MKYN2BBT24/action/citation_signature","submit_replication":"https://pith.science/pith/LXAE7RX5YLAPCYG2MKYN2BBT24/action/replication_record"}},"created_at":"2026-07-05T06:26:53.073414+00:00","updated_at":"2026-07-05T06:26:53.073414+00:00"}