{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GPJAHMK3PJXGIDVXM6MQFRCIO5","short_pith_number":"pith:GPJAHMK3","schema_version":"1.0","canonical_sha256":"33d203b15b7a6e640eb7679902c448775ad2ef0a280f3717a6a13007a6fc3317","source":{"kind":"arxiv","id":"1705.04518","version":1},"attestation_state":"computed","paper":{"title":"Consistency of adjacency spectral embedding for the mixed membership stochastic blockmodel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Carey E. Priebe, Minh Tang, Patrick Rubin-Delanchy","submitted_at":"2017-05-12T11:33:30Z","abstract_excerpt":"The mixed membership stochastic blockmodel is a statistical model for a graph, which extends the stochastic blockmodel by allowing every node to randomly choose a different community each time a decision of whether to form an edge is made. Whereas spectral analysis for the stochastic blockmodel is increasingly well established, theory for the mixed membership case is considerably less developed. Here we show that adjacency spectral embedding into $\\mathbb{R}^k$, followed by fitting the minimum volume enclosing convex $k$-polytope to the $k-1$ principal components, leads to a consistent estimat"},"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":"1705.04518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-12T11:33:30Z","cross_cats_sorted":[],"title_canon_sha256":"2bdbc622828ea0cc68cba90530869642448a8d7f661d66f4c8baafcb07bc3d3b","abstract_canon_sha256":"61049cbab66e2e8d6b76e58d22f7efc91a9d9c8a7eda43d42feac842fd1b111b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.886730Z","signature_b64":"Qy4B2qs1tnVU8taXCVZd3as310FRqXoUlDi2vIQCkPK5pNc47l22/vRe6elsYlmXz67X9UroC9wIWiu+OAWGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d203b15b7a6e640eb7679902c448775ad2ef0a280f3717a6a13007a6fc3317","last_reissued_at":"2026-05-18T00:44:37.886152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.886152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistency of adjacency spectral embedding for the mixed membership stochastic blockmodel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Carey E. Priebe, Minh Tang, Patrick Rubin-Delanchy","submitted_at":"2017-05-12T11:33:30Z","abstract_excerpt":"The mixed membership stochastic blockmodel is a statistical model for a graph, which extends the stochastic blockmodel by allowing every node to randomly choose a different community each time a decision of whether to form an edge is made. Whereas spectral analysis for the stochastic blockmodel is increasingly well established, theory for the mixed membership case is considerably less developed. Here we show that adjacency spectral embedding into $\\mathbb{R}^k$, followed by fitting the minimum volume enclosing convex $k$-polytope to the $k-1$ principal components, leads to a consistent estimat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04518","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":"1705.04518","created_at":"2026-05-18T00:44:37.886229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04518v1","created_at":"2026-05-18T00:44:37.886229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04518","created_at":"2026-05-18T00:44:37.886229+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPJAHMK3PJXG","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPJAHMK3PJXGIDVX","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPJAHMK3","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5","json":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5.json","graph_json":"https://pith.science/api/pith-number/GPJAHMK3PJXGIDVXM6MQFRCIO5/graph.json","events_json":"https://pith.science/api/pith-number/GPJAHMK3PJXGIDVXM6MQFRCIO5/events.json","paper":"https://pith.science/paper/GPJAHMK3"},"agent_actions":{"view_html":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5","download_json":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5.json","view_paper":"https://pith.science/paper/GPJAHMK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04518&json=true","fetch_graph":"https://pith.science/api/pith-number/GPJAHMK3PJXGIDVXM6MQFRCIO5/graph.json","fetch_events":"https://pith.science/api/pith-number/GPJAHMK3PJXGIDVXM6MQFRCIO5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5/action/storage_attestation","attest_author":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5/action/author_attestation","sign_citation":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5/action/citation_signature","submit_replication":"https://pith.science/pith/GPJAHMK3PJXGIDVXM6MQFRCIO5/action/replication_record"}},"created_at":"2026-05-18T00:44:37.886229+00:00","updated_at":"2026-05-18T00:44:37.886229+00:00"}