{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BY43VOKDXLOGFFCWMB6W7ABF6M","short_pith_number":"pith:BY43VOKD","schema_version":"1.0","canonical_sha256":"0e39bab943badc629456607d6f8025f32c4d8d7697c081b378ebe30c0762b503","source":{"kind":"arxiv","id":"1512.09080","version":4},"attestation_state":"computed","paper":{"title":"Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.LG","cs.SI","math.IT"],"primary_cat":"math.PR","authors_text":"Colin Sandon, Emmanuel Abbe","submitted_at":"2015-12-30T19:49:28Z","abstract_excerpt":"In a paper that initiated the modern study of the stochastic block model, Decelle et al., backed by Mossel et al., made the following conjecture: Denote by $k$ the number of balanced communities, $a/n$ the probability of connecting inside communities and $b/n$ across, and set $\\mathrm{SNR}=(a-b)^2/(k(a+(k-1)b)$; for any $k \\geq 2$, it is possible to detect communities efficiently whenever $\\mathrm{SNR}>1$ (the KS threshold), whereas for $k\\geq 4$, it is possible to detect communities information-theoretically for some $\\mathrm{SNR}<1$. Massouli\\'e, Mossel et al.\\ and Bordenave et al.\\ succeede"},"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":"1512.09080","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-30T19:49:28Z","cross_cats_sorted":["cs.CC","cs.IT","cs.LG","cs.SI","math.IT"],"title_canon_sha256":"f7ca50cebb4a60cdca190bc10c55979cab6f4da0f92b21520bdcf90dc3f04bce","abstract_canon_sha256":"01981eeacd724a2c1594edce02b59fc8522bea41c9c82cd15746cd73975009fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.661886Z","signature_b64":"Kzmg846rzjfDSMuYRML07PhXkCoVneJ/UMXT9uVLR4DqgR7a1LdwfGmdS5wXjdvP/EFDm/rRQhulzuycaAPCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e39bab943badc629456607d6f8025f32c4d8d7697c081b378ebe30c0762b503","last_reissued_at":"2026-05-18T01:04:37.661193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.661193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.LG","cs.SI","math.IT"],"primary_cat":"math.PR","authors_text":"Colin Sandon, Emmanuel Abbe","submitted_at":"2015-12-30T19:49:28Z","abstract_excerpt":"In a paper that initiated the modern study of the stochastic block model, Decelle et al., backed by Mossel et al., made the following conjecture: Denote by $k$ the number of balanced communities, $a/n$ the probability of connecting inside communities and $b/n$ across, and set $\\mathrm{SNR}=(a-b)^2/(k(a+(k-1)b)$; for any $k \\geq 2$, it is possible to detect communities efficiently whenever $\\mathrm{SNR}>1$ (the KS threshold), whereas for $k\\geq 4$, it is possible to detect communities information-theoretically for some $\\mathrm{SNR}<1$. Massouli\\'e, Mossel et al.\\ and Bordenave et al.\\ succeede"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09080","kind":"arxiv","version":4},"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":"1512.09080","created_at":"2026-05-18T01:04:37.661297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09080v4","created_at":"2026-05-18T01:04:37.661297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09080","created_at":"2026-05-18T01:04:37.661297+00:00"},{"alias_kind":"pith_short_12","alias_value":"BY43VOKDXLOG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BY43VOKDXLOGFFCW","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BY43VOKD","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18565","citing_title":"Detectability of minority communities in networks","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M","json":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M.json","graph_json":"https://pith.science/api/pith-number/BY43VOKDXLOGFFCWMB6W7ABF6M/graph.json","events_json":"https://pith.science/api/pith-number/BY43VOKDXLOGFFCWMB6W7ABF6M/events.json","paper":"https://pith.science/paper/BY43VOKD"},"agent_actions":{"view_html":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M","download_json":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M.json","view_paper":"https://pith.science/paper/BY43VOKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09080&json=true","fetch_graph":"https://pith.science/api/pith-number/BY43VOKDXLOGFFCWMB6W7ABF6M/graph.json","fetch_events":"https://pith.science/api/pith-number/BY43VOKDXLOGFFCWMB6W7ABF6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M/action/storage_attestation","attest_author":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M/action/author_attestation","sign_citation":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M/action/citation_signature","submit_replication":"https://pith.science/pith/BY43VOKDXLOGFFCWMB6W7ABF6M/action/replication_record"}},"created_at":"2026-05-18T01:04:37.661297+00:00","updated_at":"2026-05-18T01:04:37.661297+00:00"}