{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ELUQR6UFOOL2TRK6NC7ZIU7CMR","short_pith_number":"pith:ELUQR6UF","schema_version":"1.0","canonical_sha256":"22e908fa857397a9c55e68bf9453e2644526401c71a30f82281b8edaa456ce54","source":{"kind":"arxiv","id":"2503.03047","version":2},"attestation_state":"computed","paper":{"title":"Stochastic block models with many communities and the Kesten--Stigum bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Alexander S. Wein, Byron Chin, Elchanan Mossel, Youngtak Sohn","submitted_at":"2025-03-04T23:08:51Z","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 "},"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":"2503.03047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-03-04T23:08:51Z","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"title_canon_sha256":"a52b19d2cd3e7a4c87ec035294032e2d1498825145f7f9fe45f9eefd24b305fa","abstract_canon_sha256":"b644a5d4c6d0548879bc99552cab8f6cd5a853383a5f33bc4cd963835ebbcdb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:51.907445Z","signature_b64":"+B9/yRF2K39/HKJcLQpIwBUw8+a8uht6clS7xojwHQkd/VH6nb8CrR9ViDXU3tpEqyVmGyPZ/R/bFFWKpahsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22e908fa857397a9c55e68bf9453e2644526401c71a30f82281b8edaa456ce54","last_reissued_at":"2026-07-05T11:19:51.906991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:51.906991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic block models with many communities and the Kesten--Stigum bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Alexander S. Wein, Byron Chin, Elchanan Mossel, Youngtak Sohn","submitted_at":"2025-03-04T23:08:51Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03047","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/2503.03047/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":"2503.03047","created_at":"2026-07-05T11:19:51.907047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.03047v2","created_at":"2026-07-05T11:19:51.907047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03047","created_at":"2026-07-05T11:19:51.907047+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELUQR6UFOOL2","created_at":"2026-07-05T11:19:51.907047+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELUQR6UFOOL2TRK6","created_at":"2026-07-05T11:19:51.907047+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELUQR6UF","created_at":"2026-07-05T11:19:51.907047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30113","citing_title":"Low-degree estimation thresholds in planted hypergraphs and tensor PCA","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2502.14407","citing_title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18565","citing_title":"Detectability of minority communities in networks","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR","json":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR.json","graph_json":"https://pith.science/api/pith-number/ELUQR6UFOOL2TRK6NC7ZIU7CMR/graph.json","events_json":"https://pith.science/api/pith-number/ELUQR6UFOOL2TRK6NC7ZIU7CMR/events.json","paper":"https://pith.science/paper/ELUQR6UF"},"agent_actions":{"view_html":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR","download_json":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR.json","view_paper":"https://pith.science/paper/ELUQR6UF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.03047&json=true","fetch_graph":"https://pith.science/api/pith-number/ELUQR6UFOOL2TRK6NC7ZIU7CMR/graph.json","fetch_events":"https://pith.science/api/pith-number/ELUQR6UFOOL2TRK6NC7ZIU7CMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR/action/storage_attestation","attest_author":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR/action/author_attestation","sign_citation":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR/action/citation_signature","submit_replication":"https://pith.science/pith/ELUQR6UFOOL2TRK6NC7ZIU7CMR/action/replication_record"}},"created_at":"2026-07-05T11:19:51.907047+00:00","updated_at":"2026-07-05T11:19:51.907047+00:00"}