{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:B3S44ACSTB33HCGJPXP3QJ35IA","short_pith_number":"pith:B3S44ACS","schema_version":"1.0","canonical_sha256":"0ee5ce00529877b388c97ddfb8277d4022e760303cfdba76e0fcadf89e132ced","source":{"kind":"arxiv","id":"0705.4485","version":1},"attestation_state":"computed","paper":{"title":"Mixed membership stochastic blockmodels","license":"","headline":"","cross_cats":["cs.LG","math.ST","physics.soc-ph","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"David M Blei, Edoardo M Airoldi, Eric P Xing, Stephen E Fienberg","submitted_at":"2007-05-30T23:22:59Z","abstract_excerpt":"Observations consisting of measurements on relationships for pairs of objects arise in many settings, such as protein interaction and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing such data with probabilisic models can be delicate because the simple exchangeability assumptions underlying many boilerplate models no longer hold. In this paper, we describe a latent variable model of such data called the mixed membership stochastic blockmodel. This model extends blockmodels for relational data to ones which capture mixed membership latent relationa"},"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":"0705.4485","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"stat.ME","submitted_at":"2007-05-30T23:22:59Z","cross_cats_sorted":["cs.LG","math.ST","physics.soc-ph","stat.ML","stat.TH"],"title_canon_sha256":"77d42f9770e23eff363415d8a5a0882222565fe11f11ed805698e58d05e39600","abstract_canon_sha256":"a8d1f03ea40c0c92d9f000fab82a8cf31b9b1b0d19a18117e9f9a91fb4f70b7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:22:09.604873Z","signature_b64":"7o73fERvydLubH9XsWuaIDvGapGIHhO91zjB0muCMGAfs/Zi8XFleyrLShhHcT8h/ZIuMZjmDc8WGeWE80UVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee5ce00529877b388c97ddfb8277d4022e760303cfdba76e0fcadf89e132ced","last_reissued_at":"2026-07-04T17:22:09.604438Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:22:09.604438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed membership stochastic blockmodels","license":"","headline":"","cross_cats":["cs.LG","math.ST","physics.soc-ph","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"David M Blei, Edoardo M Airoldi, Eric P Xing, Stephen E Fienberg","submitted_at":"2007-05-30T23:22:59Z","abstract_excerpt":"Observations consisting of measurements on relationships for pairs of objects arise in many settings, such as protein interaction and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing such data with probabilisic models can be delicate because the simple exchangeability assumptions underlying many boilerplate models no longer hold. In this paper, we describe a latent variable model of such data called the mixed membership stochastic blockmodel. This model extends blockmodels for relational data to ones which capture mixed membership latent relationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.4485","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0705.4485/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":"0705.4485","created_at":"2026-07-04T17:22:09.604506+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.4485v1","created_at":"2026-07-04T17:22:09.604506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.4485","created_at":"2026-07-04T17:22:09.604506+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3S44ACSTB33","created_at":"2026-07-04T17:22:09.604506+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3S44ACSTB33HCGJ","created_at":"2026-07-04T17:22:09.604506+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3S44ACS","created_at":"2026-07-04T17:22:09.604506+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.00716","citing_title":"Aitchison Embeddings for Learning Compositional Graph Representations","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11142","citing_title":"Rank Is Not Capacity: Spectral Occupancy for Latent Graph Models","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00716","citing_title":"Aitchison Embeddings for Learning Compositional Graph Representations","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA","json":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA.json","graph_json":"https://pith.science/api/pith-number/B3S44ACSTB33HCGJPXP3QJ35IA/graph.json","events_json":"https://pith.science/api/pith-number/B3S44ACSTB33HCGJPXP3QJ35IA/events.json","paper":"https://pith.science/paper/B3S44ACS"},"agent_actions":{"view_html":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA","download_json":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA.json","view_paper":"https://pith.science/paper/B3S44ACS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.4485&json=true","fetch_graph":"https://pith.science/api/pith-number/B3S44ACSTB33HCGJPXP3QJ35IA/graph.json","fetch_events":"https://pith.science/api/pith-number/B3S44ACSTB33HCGJPXP3QJ35IA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA/action/storage_attestation","attest_author":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA/action/author_attestation","sign_citation":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA/action/citation_signature","submit_replication":"https://pith.science/pith/B3S44ACSTB33HCGJPXP3QJ35IA/action/replication_record"}},"created_at":"2026-07-04T17:22:09.604506+00:00","updated_at":"2026-07-04T17:22:09.604506+00:00"}