{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZWB3ZQIFGLJJQSDCYLWVKRMQLD","short_pith_number":"pith:ZWB3ZQIF","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"},"canonical_sha256":"cd83bcc10532d2984862c2ed55459058f13f2319d5dbe187690a1970282751f9","source":{"kind":"arxiv","id":"1807.02884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02884","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02884v1","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02884","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZWB3ZQIFGLJJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZWB3ZQIFGLJJQSDC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZWB3ZQIF","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZWB3ZQIFGLJJQSDCYLWVKRMQLD","target":"record","payload":{"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"},"canonical_sha256":"cd83bcc10532d2984862c2ed55459058f13f2319d5dbe187690a1970282751f9","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"},"source_kind":"arxiv","source_id":"1807.02884","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UzrUqBJMgw80GrY1dQjpR+fhIgix05dtS11oATBA4eDyIkHyrZ4CcyQKZa/5NC2aGH+zISZw2An2ZWTobx/ADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:55:54.417067Z"},"content_sha256":"d94a129c71b22d31c9c809f74ed093e769cb2049487ee7118b7c28a0cee3165b","schema_version":"1.0","event_id":"sha256:d94a129c71b22d31c9c809f74ed093e769cb2049487ee7118b7c28a0cee3165b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZWB3ZQIFGLJJQSDCYLWVKRMQLD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWJn2DCKlGJeZDdWng44O9sxr2SDsvgY9KaCTyHxFg4vYwLUDYUth79sRv7UFvjLaHS/GkV5NVoHHjFsBxYDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:55:54.417434Z"},"content_sha256":"67c0cdf4a609a3d598e0373e20010dfafa0918a453c6c860ab170479a1614a2f","schema_version":"1.0","event_id":"sha256:67c0cdf4a609a3d598e0373e20010dfafa0918a453c6c860ab170479a1614a2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/bundle.json","state_url":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T14:55:54Z","links":{"resolver":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD","bundle":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/bundle.json","state":"https://pith.science/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWB3ZQIFGLJJQSDCYLWVKRMQLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZWB3ZQIFGLJJQSDCYLWVKRMQLD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"632f90bc1da0c7f00acfabd837d50d26941ec0d409e44f3ec6e0bc883a991e9f","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-08T21:06:21Z","title_canon_sha256":"ac78312b5a4b08562ccef396c18228457473990e0f5413d4a10f3c98e9a09cdc"},"schema_version":"1.0","source":{"id":"1807.02884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02884","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02884v1","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02884","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZWB3ZQIFGLJJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZWB3ZQIFGLJJQSDC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZWB3ZQIF","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:67c0cdf4a609a3d598e0373e20010dfafa0918a453c6c860ab170479a1614a2f","target":"graph","created_at":"2026-05-18T00:11:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Afonso S. Bandeira, Chiheon Kim, Michel X. Goemans","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-08T21:06:21Z","title":"Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02884","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d94a129c71b22d31c9c809f74ed093e769cb2049487ee7118b7c28a0cee3165b","target":"record","created_at":"2026-05-18T00:11:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"632f90bc1da0c7f00acfabd837d50d26941ec0d409e44f3ec6e0bc883a991e9f","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-08T21:06:21Z","title_canon_sha256":"ac78312b5a4b08562ccef396c18228457473990e0f5413d4a10f3c98e9a09cdc"},"schema_version":"1.0","source":{"id":"1807.02884","kind":"arxiv","version":1}},"canonical_sha256":"cd83bcc10532d2984862c2ed55459058f13f2319d5dbe187690a1970282751f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd83bcc10532d2984862c2ed55459058f13f2319d5dbe187690a1970282751f9","first_computed_at":"2026-05-18T00:11:13.456598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:13.456598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Th2PqglQ/6aeAZTGVLuqpR1torWyV1s/1rUOHy5EyeEyRzL1pNTreRvcuqsqTsEi52DeOKuAC9bhbVVsOYU0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:13.457195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d94a129c71b22d31c9c809f74ed093e769cb2049487ee7118b7c28a0cee3165b","sha256:67c0cdf4a609a3d598e0373e20010dfafa0918a453c6c860ab170479a1614a2f"],"state_sha256":"9b6b56cfe8ae70481f745c6508ac1bfa4fa5d6165f7727111e203cd665c5ea3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odQ6rgvpucnbEzCbQN7RWWr0hx2mRpothxQyhL28ca9thUfVmeZSr1Xb0AEcESM8LCpxTWCf3Mn1tSMsUwubCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:55:54.419398Z","bundle_sha256":"d2861caf1903a7f4fa907d0652654871b4d25083188e41a904880ecf0458a3e5"}}