{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LAN6PYWWKV33AUZ55NNHHX3AN7","short_pith_number":"pith:LAN6PYWW","canonical_record":{"source":{"id":"1203.3083","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.CO","submitted_at":"2012-03-14T13:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"beea15566a9863a825c81e08e736c031219933e2e52b7c87ed7109f57aa8585f","abstract_canon_sha256":"e776274b3b1edb3a020b56e1f08218c1a1282934b4fbc762cf716b1d32f5fed6"},"schema_version":"1.0"},"canonical_sha256":"581be7e2d65577b0533deb5a73df606fe884dc96e77552c851c71101218e984d","source":{"kind":"arxiv","id":"1203.3083","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3083","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3083v4","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3083","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"LAN6PYWWKV33","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LAN6PYWWKV33AUZ5","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LAN6PYWW","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LAN6PYWWKV33AUZ55NNHHX3AN7","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3083","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.CO","submitted_at":"2012-03-14T13:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"beea15566a9863a825c81e08e736c031219933e2e52b7c87ed7109f57aa8585f","abstract_canon_sha256":"e776274b3b1edb3a020b56e1f08218c1a1282934b4fbc762cf716b1d32f5fed6"},"schema_version":"1.0"},"canonical_sha256":"581be7e2d65577b0533deb5a73df606fe884dc96e77552c851c71101218e984d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:20.247761Z","signature_b64":"m3egvGYl42jwK16mvsXk/VJfm9JM50wvO3lI10BGE/v5i2fygp6J42zHi4XPwf7ElI9DdYLnR3Zg8P297ThVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"581be7e2d65577b0533deb5a73df606fe884dc96e77552c851c71101218e984d","last_reissued_at":"2026-05-18T03:41:20.247265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:20.247265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3083","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1X2u2Y5DwHVEQArobDsyJlCbqu9F4itjqEIxDDctigyjNmYB5Qm4hiJZNMqmlfJoLz5p99QlWA6LjaGk7LrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:58:17.962457Z"},"content_sha256":"e0eb5db9ef459953413a2abe4ab337110f2dc9f6a9a4d2cdb1f13450ba931753","schema_version":"1.0","event_id":"sha256:e0eb5db9ef459953413a2abe4ab337110f2dc9f6a9a4d2cdb1f13450ba931753"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LAN6PYWWKV33AUZ55NNHHX3AN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering in networks with the collapsed Stochastic Block Model","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Aaron F. McDaid, Neil J Hurley, Nial Friel, Thomas Brendan Murphy","submitted_at":"2012-03-14T13:44:00Z","abstract_excerpt":"An efficient MCMC algorithm is presented to cluster the nodes of a network such that nodes with similar role in the network are clustered together. This is known as block-modelling or block-clustering. The model is the stochastic blockmodel (SBM) with block parameters integrated out. The resulting marginal distribution defines a posterior over the number of clusters and cluster memberships. Sampling from this posterior is simpler than from the original SBM as transdimensional MCMC can be avoided. The algorithm is based on the allocation sampler. It requires a prior to be placed on the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3083","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"myssmAfYMknkilRf3nAiJxl85wqWIQeCHyu53bH8j7oV/Wni67c5cd9GrNHvb6qRCor/ZA45fKwpmJ5Ill9uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:58:17.962801Z"},"content_sha256":"6044c170f279ce821ffcbcab5b5b6946809daa0a880c5a5ea957aada3c9b52e9","schema_version":"1.0","event_id":"sha256:6044c170f279ce821ffcbcab5b5b6946809daa0a880c5a5ea957aada3c9b52e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAN6PYWWKV33AUZ55NNHHX3AN7/bundle.json","state_url":"https://pith.science/pith/LAN6PYWWKV33AUZ55NNHHX3AN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAN6PYWWKV33AUZ55NNHHX3AN7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T22:58:17Z","links":{"resolver":"https://pith.science/pith/LAN6PYWWKV33AUZ55NNHHX3AN7","bundle":"https://pith.science/pith/LAN6PYWWKV33AUZ55NNHHX3AN7/bundle.json","state":"https://pith.science/pith/LAN6PYWWKV33AUZ55NNHHX3AN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAN6PYWWKV33AUZ55NNHHX3AN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LAN6PYWWKV33AUZ55NNHHX3AN7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e776274b3b1edb3a020b56e1f08218c1a1282934b4fbc762cf716b1d32f5fed6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.CO","submitted_at":"2012-03-14T13:44:00Z","title_canon_sha256":"beea15566a9863a825c81e08e736c031219933e2e52b7c87ed7109f57aa8585f"},"schema_version":"1.0","source":{"id":"1203.3083","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3083","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3083v4","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3083","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"LAN6PYWWKV33","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LAN6PYWWKV33AUZ5","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LAN6PYWW","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:6044c170f279ce821ffcbcab5b5b6946809daa0a880c5a5ea957aada3c9b52e9","target":"graph","created_at":"2026-05-18T03:41:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An efficient MCMC algorithm is presented to cluster the nodes of a network such that nodes with similar role in the network are clustered together. This is known as block-modelling or block-clustering. The model is the stochastic blockmodel (SBM) with block parameters integrated out. The resulting marginal distribution defines a posterior over the number of clusters and cluster memberships. Sampling from this posterior is simpler than from the original SBM as transdimensional MCMC can be avoided. The algorithm is based on the allocation sampler. It requires a prior to be placed on the number o","authors_text":"Aaron F. McDaid, Neil J Hurley, Nial Friel, Thomas Brendan Murphy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.CO","submitted_at":"2012-03-14T13:44:00Z","title":"Clustering in networks with the collapsed Stochastic Block Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3083","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e0eb5db9ef459953413a2abe4ab337110f2dc9f6a9a4d2cdb1f13450ba931753","target":"record","created_at":"2026-05-18T03:41:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e776274b3b1edb3a020b56e1f08218c1a1282934b4fbc762cf716b1d32f5fed6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.CO","submitted_at":"2012-03-14T13:44:00Z","title_canon_sha256":"beea15566a9863a825c81e08e736c031219933e2e52b7c87ed7109f57aa8585f"},"schema_version":"1.0","source":{"id":"1203.3083","kind":"arxiv","version":4}},"canonical_sha256":"581be7e2d65577b0533deb5a73df606fe884dc96e77552c851c71101218e984d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"581be7e2d65577b0533deb5a73df606fe884dc96e77552c851c71101218e984d","first_computed_at":"2026-05-18T03:41:20.247265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:20.247265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3egvGYl42jwK16mvsXk/VJfm9JM50wvO3lI10BGE/v5i2fygp6J42zHi4XPwf7ElI9DdYLnR3Zg8P297ThVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:20.247761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3083","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0eb5db9ef459953413a2abe4ab337110f2dc9f6a9a4d2cdb1f13450ba931753","sha256:6044c170f279ce821ffcbcab5b5b6946809daa0a880c5a5ea957aada3c9b52e9"],"state_sha256":"631298f3ff55ba93b180fc702a95a5f4fa549810f17ff5fdd07aa6815f969079"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddbHHIzk5JfA2vCACUSf6+4g+Jj5cN5vEes5a5zdkVwyux8iYSSw9yDrR74Q8G8u56IqxET6OmFnCl6BR1eKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:58:17.964751Z","bundle_sha256":"cad9e1af64cf1686c0aa70e0068f39d247685d177832e9489fbfb84fc942c23e"}}