{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZWB3ZQIFGLJJQSDCYLWVKRMQLD","short_pith_number":"pith:ZWB3ZQIF","schema_version":"1.0","canonical_sha256":"cd83bcc10532d2984862c2ed55459058f13f2319d5dbe187690a1970282751f9","source":{"kind":"arxiv","id":"1807.02884","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"math.PR","authors_text":"Afonso S. Bandeira, Chiheon Kim, Michel X. Goemans","submitted_at":"2018-07-08T21:06:21Z","abstract_excerpt":"We study the problem of community detection in a random hypergraph model which we call the stochastic block model for $k$-uniform hypergraphs ($k$-SBM). We investigate the exact recovery problem in $k$-SBM and show that a sharp phase transition occurs around a threshold: below the threshold it is impossible to recover the communities with non-vanishing probability, yet above the threshold there is an estimator which recovers the communities almost asymptotically surely. We also consider a simple, efficient algorithm for the exact recovery problem which is based on a semidefinite relaxation tec"},"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":"1807.02884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-08T21:06:21Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"ac78312b5a4b08562ccef396c18228457473990e0f5413d4a10f3c98e9a09cdc","abstract_canon_sha256":"632f90bc1da0c7f00acfabd837d50d26941ec0d409e44f3ec6e0bc883a991e9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:13.457195Z","signature_b64":"Th2PqglQ/6aeAZTGVLuqpR1torWyV1s/1rUOHy5EyeEyRzL1pNTreRvcuqsqTsEi52DeOKuAC9bhbVVsOYU0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd83bcc10532d2984862c2ed55459058f13f2319d5dbe187690a1970282751f9","last_reissued_at":"2026-05-18T00:11:13.456598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:13.456598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"math.PR","authors_text":"Afonso S. Bandeira, Chiheon Kim, Michel X. Goemans","submitted_at":"2018-07-08T21:06:21Z","abstract_excerpt":"We study the problem of community detection in a random hypergraph model which we call the stochastic block model for $k$-uniform hypergraphs ($k$-SBM). We investigate the exact recovery problem in $k$-SBM and show that a sharp phase transition occurs around a threshold: below the threshold it is impossible to recover the communities with non-vanishing probability, yet above the threshold there is an estimator which recovers the communities almost asymptotically surely. We also consider a simple, efficient algorithm for the exact recovery problem which is based on a semidefinite relaxation tec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02884","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":""},"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":"1807.02884","created_at":"2026-05-18T00:11:13.456679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02884v1","created_at":"2026-05-18T00:11:13.456679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02884","created_at":"2026-05-18T00:11:13.456679+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWB3ZQIFGLJJ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWB3ZQIFGLJJQSDC","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWB3ZQIF","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20907","citing_title":"Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD","json":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD.json","graph_json":"https://pith.science/api/pith-number/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/graph.json","events_json":"https://pith.science/api/pith-number/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/events.json","paper":"https://pith.science/paper/ZWB3ZQIF"},"agent_actions":{"view_html":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD","download_json":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD.json","view_paper":"https://pith.science/paper/ZWB3ZQIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02884&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/action/storage_attestation","attest_author":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/action/author_attestation","sign_citation":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/action/citation_signature","submit_replication":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/action/replication_record"}},"created_at":"2026-05-18T00:11:13.456679+00:00","updated_at":"2026-05-18T00:11:13.456679+00:00"}