{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:24ZKEYMYNTB3XYYQK4M5PBHUVX","short_pith_number":"pith:24ZKEYMY","canonical_record":{"source":{"id":"1702.01418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-05T15:43:17Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"0157fb15c1f88e32858da57f412d9c89c09f74d97ad9f0dcfc80edb03be41d49","abstract_canon_sha256":"a23adbd4dbbf714860015c678a9a16f6fa9104ecaf03f1b442ebd96c78e2e2e9"},"schema_version":"1.0"},"canonical_sha256":"d732a261986cc3bbe3105719d784f4adcc216aa22ded6f69877784682fb41b3f","source":{"kind":"arxiv","id":"1702.01418","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01418","created_at":"2026-05-18T00:48:09Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01418v2","created_at":"2026-05-18T00:48:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01418","created_at":"2026-05-18T00:48:09Z"},{"alias_kind":"pith_short_12","alias_value":"24ZKEYMYNTB3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"24ZKEYMYNTB3XYYQ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"24ZKEYMY","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:24ZKEYMYNTB3XYYQK4M5PBHUVX","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-05T15:43:17Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"0157fb15c1f88e32858da57f412d9c89c09f74d97ad9f0dcfc80edb03be41d49","abstract_canon_sha256":"a23adbd4dbbf714860015c678a9a16f6fa9104ecaf03f1b442ebd96c78e2e2e9"},"schema_version":"1.0"},"canonical_sha256":"d732a261986cc3bbe3105719d784f4adcc216aa22ded6f69877784682fb41b3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:09.245824Z","signature_b64":"xzeg1/FGqLM/Ecod/CGgjME2qQiNtShMokZLeWeOgh/FikXT0JvbSYZfT+VpnYtB6OesJhXBJ/AY9aimNIqtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d732a261986cc3bbe3105719d784f4adcc216aa22ded6f69877784682fb41b3f","last_reissued_at":"2026-05-18T00:48:09.245264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:09.245264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01418","source_version":2,"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-18T00:48:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2i8ks9O4u4/Da5ZsCcOhCsJdDVqYivieuEb+kYYk2Vwe3GNgWuLt0Nyz8pkX70EuXQnM/hPy2HkGNXN0EYHRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:05:48.942649Z"},"content_sha256":"e2e4bf92a10ad24c4347926ed5dad0f19028d7cfde61f79b71707993ac53b941","schema_version":"1.0","event_id":"sha256:e2e4bf92a10ad24c4347926ed5dad0f19028d7cfde61f79b71707993ac53b941"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:24ZKEYMYNTB3XYYQK4M5PBHUVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Choosing the number of groups in a latent stochastic block model for dynamic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Nial Friel, Pierre Latouche, Riccardo Rastelli","submitted_at":"2017-02-05T15:43:17Z","abstract_excerpt":"Latent stochastic block models are flexible statistical models that are widely used in social network analysis. In recent years, efforts have been made to extend these models to temporal dynamic networks, whereby the connections between nodes are observed at a number of different times. In this paper we extend the original stochastic block model by using a Markovian property to describe the evolution of nodes' cluster memberships over time. We recast the problem of clustering the nodes of the network into a model-based context, and show that the integrated completed likelihood can be evaluated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01418","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"},"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-18T00:48:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwWDW0imVnk8bmhDZlaWlPspYeR9aZ8qsotRll9I7jRBaKhA2bNjCtx4Q+jfPbryt6eIvdLMHlXMClAnyxp/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:05:48.942998Z"},"content_sha256":"8fb06faa34fbfa5f6e81220bc7c0e9fdbf0e30180510aaa14ab7a2324ec97fbc","schema_version":"1.0","event_id":"sha256:8fb06faa34fbfa5f6e81220bc7c0e9fdbf0e30180510aaa14ab7a2324ec97fbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24ZKEYMYNTB3XYYQK4M5PBHUVX/bundle.json","state_url":"https://pith.science/pith/24ZKEYMYNTB3XYYQK4M5PBHUVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24ZKEYMYNTB3XYYQK4M5PBHUVX/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-24T04:05:48Z","links":{"resolver":"https://pith.science/pith/24ZKEYMYNTB3XYYQK4M5PBHUVX","bundle":"https://pith.science/pith/24ZKEYMYNTB3XYYQK4M5PBHUVX/bundle.json","state":"https://pith.science/pith/24ZKEYMYNTB3XYYQK4M5PBHUVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24ZKEYMYNTB3XYYQK4M5PBHUVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:24ZKEYMYNTB3XYYQK4M5PBHUVX","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":"a23adbd4dbbf714860015c678a9a16f6fa9104ecaf03f1b442ebd96c78e2e2e9","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-05T15:43:17Z","title_canon_sha256":"0157fb15c1f88e32858da57f412d9c89c09f74d97ad9f0dcfc80edb03be41d49"},"schema_version":"1.0","source":{"id":"1702.01418","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01418","created_at":"2026-05-18T00:48:09Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01418v2","created_at":"2026-05-18T00:48:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01418","created_at":"2026-05-18T00:48:09Z"},{"alias_kind":"pith_short_12","alias_value":"24ZKEYMYNTB3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"24ZKEYMYNTB3XYYQ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"24ZKEYMY","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:8fb06faa34fbfa5f6e81220bc7c0e9fdbf0e30180510aaa14ab7a2324ec97fbc","target":"graph","created_at":"2026-05-18T00:48:09Z","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":"Latent stochastic block models are flexible statistical models that are widely used in social network analysis. In recent years, efforts have been made to extend these models to temporal dynamic networks, whereby the connections between nodes are observed at a number of different times. In this paper we extend the original stochastic block model by using a Markovian property to describe the evolution of nodes' cluster memberships over time. We recast the problem of clustering the nodes of the network into a model-based context, and show that the integrated completed likelihood can be evaluated","authors_text":"Nial Friel, Pierre Latouche, Riccardo Rastelli","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-05T15:43:17Z","title":"Choosing the number of groups in a latent stochastic block model for dynamic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01418","kind":"arxiv","version":2},"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:e2e4bf92a10ad24c4347926ed5dad0f19028d7cfde61f79b71707993ac53b941","target":"record","created_at":"2026-05-18T00:48:09Z","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":"a23adbd4dbbf714860015c678a9a16f6fa9104ecaf03f1b442ebd96c78e2e2e9","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-05T15:43:17Z","title_canon_sha256":"0157fb15c1f88e32858da57f412d9c89c09f74d97ad9f0dcfc80edb03be41d49"},"schema_version":"1.0","source":{"id":"1702.01418","kind":"arxiv","version":2}},"canonical_sha256":"d732a261986cc3bbe3105719d784f4adcc216aa22ded6f69877784682fb41b3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d732a261986cc3bbe3105719d784f4adcc216aa22ded6f69877784682fb41b3f","first_computed_at":"2026-05-18T00:48:09.245264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:09.245264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xzeg1/FGqLM/Ecod/CGgjME2qQiNtShMokZLeWeOgh/FikXT0JvbSYZfT+VpnYtB6OesJhXBJ/AY9aimNIqtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:09.245824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01418","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2e4bf92a10ad24c4347926ed5dad0f19028d7cfde61f79b71707993ac53b941","sha256:8fb06faa34fbfa5f6e81220bc7c0e9fdbf0e30180510aaa14ab7a2324ec97fbc"],"state_sha256":"b2f7b40b65acfb1e96f63fcd633c9ebc03d2a153acb1dac063d22ce8bab7c1e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2a6Gf67irvGIOs7ONTly+GtWPgH+9y6YNmntzBCixSlps8K9/b+INdE4eYTJgiOaHYjKswyvIecnNVhDFWrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:05:48.945100Z","bundle_sha256":"297cbb6f30e977f0bbbf1e8327d580f22a78d7b1ebe3641f4d43397931b854c0"}}