{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TVXIDGXJMCWWBKJTVCAZZAWQB2","short_pith_number":"pith:TVXIDGXJ","schema_version":"1.0","canonical_sha256":"9d6e819ae960ad60a933a8819c82d00eb3777f2968e548cc8d50ecf5901c543c","source":{"kind":"arxiv","id":"1205.1997","version":2},"attestation_state":"computed","paper":{"title":"Model-based clustering in networks with Stochastic Community Finding","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.CO","authors_text":"Aaron F. McDaid, Brendan Thomas Murphy, Neil J. Hurley, Nial Friel","submitted_at":"2012-05-09T14:33:29Z","abstract_excerpt":"In the model-based clustering of networks, blockmodelling may be used to identify roles in the network. We identify a special case of the Stochastic Block Model (SBM) where we constrain the cluster-cluster interactions such that the density inside the clusters of nodes is expected to be greater than the density between clusters. This corresponds to the intuition behind community-finding methods, where nodes tend to clustered together if they link to each other. We call this model Stochastic Community Finding (SCF) and present an efficient MCMC algorithm which can cluster the nodes, given the n"},"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":"1205.1997","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"stat.CO","submitted_at":"2012-05-09T14:33:29Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"0c5c909d00fc288258673b65f0825783ff8ac3798ff47b54dfcb335bb493eae3","abstract_canon_sha256":"12b8176cd18c4fd84ac36daad80feba1f6f074eda2103534d69ec2389b7b68ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:11.395130Z","signature_b64":"LhdlzjSVI5CkV/cFDC3inTqlVHmWFq50gvIHDpw+EiSmL85TR8Cd4lJg1ZGeqLHn4dMyiK0Rsbt6PHq2TnqfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d6e819ae960ad60a933a8819c82d00eb3777f2968e548cc8d50ecf5901c543c","last_reissued_at":"2026-05-18T03:42:11.394375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:11.394375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-based clustering in networks with Stochastic Community Finding","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.CO","authors_text":"Aaron F. McDaid, Brendan Thomas Murphy, Neil J. Hurley, Nial Friel","submitted_at":"2012-05-09T14:33:29Z","abstract_excerpt":"In the model-based clustering of networks, blockmodelling may be used to identify roles in the network. We identify a special case of the Stochastic Block Model (SBM) where we constrain the cluster-cluster interactions such that the density inside the clusters of nodes is expected to be greater than the density between clusters. This corresponds to the intuition behind community-finding methods, where nodes tend to clustered together if they link to each other. We call this model Stochastic Community Finding (SCF) and present an efficient MCMC algorithm which can cluster the nodes, given the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1997","kind":"arxiv","version":2},"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":"1205.1997","created_at":"2026-05-18T03:42:11.394504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1997v2","created_at":"2026-05-18T03:42:11.394504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1997","created_at":"2026-05-18T03:42:11.394504+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVXIDGXJMCWW","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVXIDGXJMCWWBKJT","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVXIDGXJ","created_at":"2026-05-18T12:27:23.164592+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/TVXIDGXJMCWWBKJTVCAZZAWQB2","json":"https://pith.science/pith/TVXIDGXJMCWWBKJTVCAZZAWQB2.json","graph_json":"https://pith.science/api/pith-number/TVXIDGXJMCWWBKJTVCAZZAWQB2/graph.json","events_json":"https://pith.science/api/pith-number/TVXIDGXJMCWWBKJTVCAZZAWQB2/events.json","paper":"https://pith.science/paper/TVXIDGXJ"},"agent_actions":{"view_html":"https://pith.science/pith/TVXIDGXJMCWWBKJTVCAZZAWQB2","download_json":"https://pith.science/pith/TVXIDGXJMCWWBKJTVCAZZAWQB2.json","view_paper":"https://pith.science/paper/TVXIDGXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1997&json=true","fetch_graph":"https://pith.science/api/pith-number/TVXIDGXJMCWWBKJTVCAZZAWQB2/graph.json","fetch_events":"https://pith.science/api/pith-number/TVXIDGXJMCWWBKJTVCAZZAWQB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVXIDGXJMCWWBKJTVCAZZAWQB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVXIDGXJMCWWBKJTVCAZZAWQB2/action/storage_attestation","attest_author":"https://pith.science/pith/TVXIDGXJMCWWBKJTVCAZZAWQB2/action/author_attestation","sign_citation":"https://pith.science/pith/TVXIDGXJMCWWBKJTVCAZZAWQB2/action/citation_signature","submit_replication":"https://pith.science/pith/TVXIDGXJMCWWBKJTVCAZZAWQB2/action/replication_record"}},"created_at":"2026-05-18T03:42:11.394504+00:00","updated_at":"2026-05-18T03:42:11.394504+00:00"}