{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NUAWJMA2KR57ZTZVMSME6PHAPT","short_pith_number":"pith:NUAWJMA2","schema_version":"1.0","canonical_sha256":"6d0164b01a547bfccf3564984f3ce07cc043834360c65e3d61a3f32e0b2160f4","source":{"kind":"arxiv","id":"1507.08685","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Mutual Information for the Two-Groups Stochastic Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Andrea Montanari, Emmanuel Abbe, Yash Deshpande","submitted_at":"2015-07-30T20:56:38Z","abstract_excerpt":"We develop an information-theoretic view of the stochastic block model, a popular statistical model for the large-scale structure of complex networks. A graph $G$ from such a model is generated by first assigning vertex labels at random from a finite alphabet, and then connecting vertices with edge probabilities depending on the labels of the endpoints. In the case of the symmetric two-group model, we establish an explicit `single-letter' characterization of the per-vertex mutual information between the vertex labels and the graph.\n  The explicit expression of the mutual information is intimat"},"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":"1507.08685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-30T20:56:38Z","cross_cats_sorted":["cond-mat.stat-mech","math.IT","math.ST","stat.TH"],"title_canon_sha256":"f69aa6d90243cb458a30c11cc53288b5b5f2a9757b202c2bc2e06901947a1085","abstract_canon_sha256":"bde7a5994fe865398931dee696a14e446f591ee0192b8f448f4d6c94063af6ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:03.151298Z","signature_b64":"Afo+Wmq5z+5Up999K55hSDFqE10vRFTRuqxYq4M4mYMZuBCdkN7q9vJKYA+UnEwbP5Rn4qZDNuBg1AsfmEjJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0164b01a547bfccf3564984f3ce07cc043834360c65e3d61a3f32e0b2160f4","last_reissued_at":"2026-05-18T01:36:03.150813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:03.150813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Mutual Information for the Two-Groups Stochastic Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Andrea Montanari, Emmanuel Abbe, Yash Deshpande","submitted_at":"2015-07-30T20:56:38Z","abstract_excerpt":"We develop an information-theoretic view of the stochastic block model, a popular statistical model for the large-scale structure of complex networks. A graph $G$ from such a model is generated by first assigning vertex labels at random from a finite alphabet, and then connecting vertices with edge probabilities depending on the labels of the endpoints. In the case of the symmetric two-group model, we establish an explicit `single-letter' characterization of the per-vertex mutual information between the vertex labels and the graph.\n  The explicit expression of the mutual information is intimat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08685","kind":"arxiv","version":1},"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":"1507.08685","created_at":"2026-05-18T01:36:03.150890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08685v1","created_at":"2026-05-18T01:36:03.150890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08685","created_at":"2026-05-18T01:36:03.150890+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUAWJMA2KR57","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUAWJMA2KR57ZTZV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUAWJMA2","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11636","citing_title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT","json":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT.json","graph_json":"https://pith.science/api/pith-number/NUAWJMA2KR57ZTZVMSME6PHAPT/graph.json","events_json":"https://pith.science/api/pith-number/NUAWJMA2KR57ZTZVMSME6PHAPT/events.json","paper":"https://pith.science/paper/NUAWJMA2"},"agent_actions":{"view_html":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT","download_json":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT.json","view_paper":"https://pith.science/paper/NUAWJMA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08685&json=true","fetch_graph":"https://pith.science/api/pith-number/NUAWJMA2KR57ZTZVMSME6PHAPT/graph.json","fetch_events":"https://pith.science/api/pith-number/NUAWJMA2KR57ZTZVMSME6PHAPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT/action/storage_attestation","attest_author":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT/action/author_attestation","sign_citation":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT/action/citation_signature","submit_replication":"https://pith.science/pith/NUAWJMA2KR57ZTZVMSME6PHAPT/action/replication_record"}},"created_at":"2026-05-18T01:36:03.150890+00:00","updated_at":"2026-05-18T01:36:03.150890+00:00"}