{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BDPHVHPBHIQQ6O3N5YRS37SRBC","short_pith_number":"pith:BDPHVHPB","schema_version":"1.0","canonical_sha256":"08de7a9de13a210f3b6dee232dfe5108bf3b3bd5df4c8a5c4ab2cb44b475dc41","source":{"kind":"arxiv","id":"2509.15822","version":3},"attestation_state":"computed","paper":{"title":"Phase Transition for Stochastic Block Model with more than $\\sqrt{n}$ Communities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.PR","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alexandra Carpentier, Christophe Giraud, Nicolas Verzelen","submitted_at":"2025-09-19T09:53:56Z","abstract_excerpt":"Predictions from statistical physics postulate that recovery of the communities in the Stochastic Block Model (SBM) with a fixed number $K$ of communities is possible in polynomial time above, and only above, the Kesten-Stigum (KS) threshold. This conjecture has given rise to a rich literature, proving that non-trivial community recovery is indeed possible in SBM above the KS threshold. Failure of low-degree polynomials (LDP) below the KS threshold was also proven, as long as $K\\ll \\sqrt{n}$, where $n$ is the number of nodes in the observed graph.\n  When $K\\geq \\sqrt{n}$, Chin et al.(2025) rec"},"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":"2509.15822","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-09-19T09:53:56Z","cross_cats_sorted":["cs.LG","math.PR","math.ST","stat.TH"],"title_canon_sha256":"4c21eb7cdb81e5aeb1fda298eeddbf6d29d30d61d2c31f63994b017ca9cd8c6d","abstract_canon_sha256":"876f5f691138238a294a238b31e79ddf8b5f3dd95824556d0ea3442c8614af6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:47.934935Z","signature_b64":"1XroHb8Vlt+1pYmcUgr97wfB+8v3yxl+BB0S1pIg/jt+1ZWnDWVT7l0EziClKL3vsBnEMT0Df6znUqVPbBShCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08de7a9de13a210f3b6dee232dfe5108bf3b3bd5df4c8a5c4ab2cb44b475dc41","last_reissued_at":"2026-06-19T16:12:47.934436Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:47.934436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Transition for Stochastic Block Model with more than $\\sqrt{n}$ Communities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.PR","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alexandra Carpentier, Christophe Giraud, Nicolas Verzelen","submitted_at":"2025-09-19T09:53:56Z","abstract_excerpt":"Predictions from statistical physics postulate that recovery of the communities in the Stochastic Block Model (SBM) with a fixed number $K$ of communities is possible in polynomial time above, and only above, the Kesten-Stigum (KS) threshold. This conjecture has given rise to a rich literature, proving that non-trivial community recovery is indeed possible in SBM above the KS threshold. Failure of low-degree polynomials (LDP) below the KS threshold was also proven, as long as $K\\ll \\sqrt{n}$, where $n$ is the number of nodes in the observed graph.\n  When $K\\geq \\sqrt{n}$, Chin et al.(2025) rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.15822","kind":"arxiv","version":3},"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/2509.15822/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":"2509.15822","created_at":"2026-06-19T16:12:47.934490+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.15822v3","created_at":"2026-06-19T16:12:47.934490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.15822","created_at":"2026-06-19T16:12:47.934490+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDPHVHPBHIQQ","created_at":"2026-06-19T16:12:47.934490+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDPHVHPBHIQQ6O3N","created_at":"2026-06-19T16:12:47.934490+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDPHVHPB","created_at":"2026-06-19T16:12:47.934490+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.30113","citing_title":"Low-degree estimation thresholds in planted hypergraphs and tensor PCA","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC","json":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC.json","graph_json":"https://pith.science/api/pith-number/BDPHVHPBHIQQ6O3N5YRS37SRBC/graph.json","events_json":"https://pith.science/api/pith-number/BDPHVHPBHIQQ6O3N5YRS37SRBC/events.json","paper":"https://pith.science/paper/BDPHVHPB"},"agent_actions":{"view_html":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC","download_json":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC.json","view_paper":"https://pith.science/paper/BDPHVHPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.15822&json=true","fetch_graph":"https://pith.science/api/pith-number/BDPHVHPBHIQQ6O3N5YRS37SRBC/graph.json","fetch_events":"https://pith.science/api/pith-number/BDPHVHPBHIQQ6O3N5YRS37SRBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC/action/storage_attestation","attest_author":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC/action/author_attestation","sign_citation":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC/action/citation_signature","submit_replication":"https://pith.science/pith/BDPHVHPBHIQQ6O3N5YRS37SRBC/action/replication_record"}},"created_at":"2026-06-19T16:12:47.934490+00:00","updated_at":"2026-06-19T16:12:47.934490+00:00"}