{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ELUQR6UFOOL2TRK6NC7ZIU7CMR","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":"b644a5d4c6d0548879bc99552cab8f6cd5a853383a5f33bc4cd963835ebbcdb5","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-03-04T23:08:51Z","title_canon_sha256":"a52b19d2cd3e7a4c87ec035294032e2d1498825145f7f9fe45f9eefd24b305fa"},"schema_version":"1.0","source":{"id":"2503.03047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.03047","created_at":"2026-07-05T11:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"2503.03047v2","created_at":"2026-07-05T11:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03047","created_at":"2026-07-05T11:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"ELUQR6UFOOL2","created_at":"2026-07-05T11:19:51Z"},{"alias_kind":"pith_short_16","alias_value":"ELUQR6UFOOL2TRK6","created_at":"2026-07-05T11:19:51Z"},{"alias_kind":"pith_short_8","alias_value":"ELUQR6UF","created_at":"2026-07-05T11:19:51Z"}],"graph_snapshots":[{"event_id":"sha256:980a4a5304458d0a80982f67edc28d5e5580f542c12ecdcfcf5d51d02d485b2a","target":"graph","created_at":"2026-07-05T11:19:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.03047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the inference of communities in stochastic block models with a growing number of communities. For block models with $n$ vertices and a fixed number of communities $q$, it was predicted in Decelle et al. (2011) that there are computationally efficient algorithms for recovering the communities above the Kesten--Stigum (KS) bound and that efficient recovery is impossible below the KS bound. This conjecture has since stimulated a lot of interest, with the achievability side proven in a line of research that culminated in the work of Abbe and Sandon (2018). Conversely, recent work by Sohn ","authors_text":"Alexander S. Wein, Byron Chin, Elchanan Mossel, Youngtak Sohn","cross_cats":["cs.SI","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-03-04T23:08:51Z","title":"Stochastic block models with many communities and the Kesten--Stigum bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03047","kind":"arxiv","version":2},"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:f69aca9275c16f5f7c2c031a2db3b62d9d717b6de8745735adc4da0a5e12da4c","target":"record","created_at":"2026-07-05T11:19:51Z","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":"b644a5d4c6d0548879bc99552cab8f6cd5a853383a5f33bc4cd963835ebbcdb5","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-03-04T23:08:51Z","title_canon_sha256":"a52b19d2cd3e7a4c87ec035294032e2d1498825145f7f9fe45f9eefd24b305fa"},"schema_version":"1.0","source":{"id":"2503.03047","kind":"arxiv","version":2}},"canonical_sha256":"22e908fa857397a9c55e68bf9453e2644526401c71a30f82281b8edaa456ce54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22e908fa857397a9c55e68bf9453e2644526401c71a30f82281b8edaa456ce54","first_computed_at":"2026-07-05T11:19:51.906991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:51.906991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+B9/yRF2K39/HKJcLQpIwBUw8+a8uht6clS7xojwHQkd/VH6nb8CrR9ViDXU3tpEqyVmGyPZ/R/bFFWKpahsCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:51.907445Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.03047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f69aca9275c16f5f7c2c031a2db3b62d9d717b6de8745735adc4da0a5e12da4c","sha256:980a4a5304458d0a80982f67edc28d5e5580f542c12ecdcfcf5d51d02d485b2a"],"state_sha256":"0402ced2032c4196569c23861ad5eff2382d27356235dc912f0a724d6ea2b185"}