{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LRYOXHPFKSQPTLT77ZIBEXKH2A","short_pith_number":"pith:LRYOXHPF","schema_version":"1.0","canonical_sha256":"5c70eb9de554a0f9ae7ffe50125d47d01180e65b8b475ba55ff525045a13be57","source":{"kind":"arxiv","id":"1703.10146","version":3},"attestation_state":"computed","paper":{"title":"Community Detection and Stochastic Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.SI","math.IT","stat.ML"],"primary_cat":"math.PR","authors_text":"Emmanuel Abbe","submitted_at":"2017-03-29T17:21:44Z","abstract_excerpt":"The stochastic block model (SBM) is a random graph model with different group of vertices connecting differently. It is widely employed as a canonical model to study clustering and community detection, and provides a fertile ground to study the information-theoretic and computational tradeoffs that arise in combinatorial statistics and more generally data science.\n  This monograph surveys the recent developments that establish the fundamental limits for community detection in the SBM, both with respect to information-theoretic and computational tradeoffs, and for various recovery requirements "},"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":"1703.10146","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-29T17:21:44Z","cross_cats_sorted":["cs.CC","cs.IT","cs.SI","math.IT","stat.ML"],"title_canon_sha256":"e331eaa05eaf6c73103e7a4c7bb2680e4e7bab1a2ede4d886439527e9dddcdd0","abstract_canon_sha256":"daba9855fc16f8d3f7e5fff572134aec03766d79a91e15b92145d6771f4091cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:04:39.586353Z","signature_b64":"gxMTdZ6o6RWQOfNN0/sEYnPw+NfNC4jk3tuoYjmz3xnV8PhFwekNteGoPPKUssXbfLa8cl/rTGCBtkDRWzx6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c70eb9de554a0f9ae7ffe50125d47d01180e65b8b475ba55ff525045a13be57","last_reissued_at":"2026-07-05T07:04:39.585995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:04:39.585995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection and Stochastic Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.SI","math.IT","stat.ML"],"primary_cat":"math.PR","authors_text":"Emmanuel Abbe","submitted_at":"2017-03-29T17:21:44Z","abstract_excerpt":"The stochastic block model (SBM) is a random graph model with different group of vertices connecting differently. It is widely employed as a canonical model to study clustering and community detection, and provides a fertile ground to study the information-theoretic and computational tradeoffs that arise in combinatorial statistics and more generally data science.\n  This monograph surveys the recent developments that establish the fundamental limits for community detection in the SBM, both with respect to information-theoretic and computational tradeoffs, and for various recovery requirements "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10146","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/1703.10146/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":"1703.10146","created_at":"2026-07-05T07:04:39.586050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10146v3","created_at":"2026-07-05T07:04:39.586050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10146","created_at":"2026-07-05T07:04:39.586050+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRYOXHPFKSQP","created_at":"2026-07-05T07:04:39.586050+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRYOXHPFKSQPTLT7","created_at":"2026-07-05T07:04:39.586050+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRYOXHPF","created_at":"2026-07-05T07:04:39.586050+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00897","citing_title":"Recovery of Planted Subgraphs","ref_index":286,"is_internal_anchor":false},{"citing_arxiv_id":"1907.02095","citing_title":"Understanding Phase Transitions via Mutual Information and MMSE","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2511.20376","citing_title":"Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09471","citing_title":"The Statistical Cost of Adaptation in Multi-Source Transfer Learning","ref_index":94,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19152","citing_title":"Transfer Learning for Degree-Corrected Mixed Membership Network Models","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A","json":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A.json","graph_json":"https://pith.science/api/pith-number/LRYOXHPFKSQPTLT77ZIBEXKH2A/graph.json","events_json":"https://pith.science/api/pith-number/LRYOXHPFKSQPTLT77ZIBEXKH2A/events.json","paper":"https://pith.science/paper/LRYOXHPF"},"agent_actions":{"view_html":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A","download_json":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A.json","view_paper":"https://pith.science/paper/LRYOXHPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10146&json=true","fetch_graph":"https://pith.science/api/pith-number/LRYOXHPFKSQPTLT77ZIBEXKH2A/graph.json","fetch_events":"https://pith.science/api/pith-number/LRYOXHPFKSQPTLT77ZIBEXKH2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A/action/storage_attestation","attest_author":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A/action/author_attestation","sign_citation":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A/action/citation_signature","submit_replication":"https://pith.science/pith/LRYOXHPFKSQPTLT77ZIBEXKH2A/action/replication_record"}},"created_at":"2026-07-05T07:04:39.586050+00:00","updated_at":"2026-07-05T07:04:39.586050+00:00"}