{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VI34AZTGAKOTGRN2DALI4VXLY4","short_pith_number":"pith:VI34AZTG","canonical_record":{"source":{"id":"1506.04138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T19:59:17Z","cross_cats_sorted":[],"title_canon_sha256":"fc6178ca92685363fbda5572b6b9e809ef3b3861e7b5ee7548b0d769d8349346","abstract_canon_sha256":"3125ce3fa5e66abf5350778c0f54b93b82c142b8ab4f2688361f1207d298d8a5"},"schema_version":"1.0"},"canonical_sha256":"aa37c06666029d3345ba18168e56ebc707726cee2a691996562284f381b83c8f","source":{"kind":"arxiv","id":"1506.04138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04138","created_at":"2026-05-18T01:51:18Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04138v1","created_at":"2026-05-18T01:51:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04138","created_at":"2026-05-18T01:51:18Z"},{"alias_kind":"pith_short_12","alias_value":"VI34AZTGAKOT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VI34AZTGAKOTGRN2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VI34AZTG","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VI34AZTGAKOTGRN2DALI4VXLY4","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T19:59:17Z","cross_cats_sorted":[],"title_canon_sha256":"fc6178ca92685363fbda5572b6b9e809ef3b3861e7b5ee7548b0d769d8349346","abstract_canon_sha256":"3125ce3fa5e66abf5350778c0f54b93b82c142b8ab4f2688361f1207d298d8a5"},"schema_version":"1.0"},"canonical_sha256":"aa37c06666029d3345ba18168e56ebc707726cee2a691996562284f381b83c8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:18.180238Z","signature_b64":"53z9eHU0SzjVprrNAvasnUZ3utC0K3F7gnI/G4GZz5AfxL/3QlengUrihB0R4E3HXQ9sEpA9cLesPhxRot7DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa37c06666029d3345ba18168e56ebc707726cee2a691996562284f381b83c8f","last_reissued_at":"2026-05-18T01:51:18.179739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:18.179739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04138","source_version":1,"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-18T01:51:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qUtv/PH20ikezFJ/IdpzeF0WwIpnlGyApkgFrMegof76kryqPD5eanJR2DfwsHKeWw1PtTRuwlu7AftvzDokDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:27:45.340199Z"},"content_sha256":"7bd3762cfcdb528c8a1d896780f16d90bea9cce3cf98683b8f998a57edb5286b","schema_version":"1.0","event_id":"sha256:7bd3762cfcdb528c8a1d896780f16d90bea9cce3cf98683b8f998a57edb5286b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VI34AZTGAKOTGRN2DALI4VXLY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact ICL maximization in a non-stationary time extension of the latent block model for dynamic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Fabrice Rossi (SAMM), Marco Corneli (SAMM), Pierre Latouche (SAMM)","submitted_at":"2015-06-12T19:59:17Z","abstract_excerpt":"The latent block model (LBM) is a flexible probabilistic tool to describe interactions between node sets in bipartite networks, but it does not account for interactions of time varying intensity between nodes in unknown classes. In this paper we propose a non stationary temporal extension of the LBM that clusters simultaneously the two node sets of a bipartite network and constructs classes of time intervals on which interactions are stationary. The number of clusters as well as the membership to classes are obtained by maximizing the exact complete-data integrated likelihood relying on a gree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04138","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"},"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-18T01:51:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3ZDSlTijmJAF59LFo5jD46yUFXB6vBDJyxyJ3UMqjrMsrEso8+lEYd1n3CrWJhoQRsNQ58A/bpVKcIPNpymDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:27:45.340904Z"},"content_sha256":"62ce97f9ddeb70a7b0077ad3bf8a3ead16767a2a08a00aa6a003b2963f60ca6f","schema_version":"1.0","event_id":"sha256:62ce97f9ddeb70a7b0077ad3bf8a3ead16767a2a08a00aa6a003b2963f60ca6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VI34AZTGAKOTGRN2DALI4VXLY4/bundle.json","state_url":"https://pith.science/pith/VI34AZTGAKOTGRN2DALI4VXLY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VI34AZTGAKOTGRN2DALI4VXLY4/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-05-26T01:27:45Z","links":{"resolver":"https://pith.science/pith/VI34AZTGAKOTGRN2DALI4VXLY4","bundle":"https://pith.science/pith/VI34AZTGAKOTGRN2DALI4VXLY4/bundle.json","state":"https://pith.science/pith/VI34AZTGAKOTGRN2DALI4VXLY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VI34AZTGAKOTGRN2DALI4VXLY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VI34AZTGAKOTGRN2DALI4VXLY4","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":"3125ce3fa5e66abf5350778c0f54b93b82c142b8ab4f2688361f1207d298d8a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T19:59:17Z","title_canon_sha256":"fc6178ca92685363fbda5572b6b9e809ef3b3861e7b5ee7548b0d769d8349346"},"schema_version":"1.0","source":{"id":"1506.04138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04138","created_at":"2026-05-18T01:51:18Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04138v1","created_at":"2026-05-18T01:51:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04138","created_at":"2026-05-18T01:51:18Z"},{"alias_kind":"pith_short_12","alias_value":"VI34AZTGAKOT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VI34AZTGAKOTGRN2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VI34AZTG","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:62ce97f9ddeb70a7b0077ad3bf8a3ead16767a2a08a00aa6a003b2963f60ca6f","target":"graph","created_at":"2026-05-18T01:51:18Z","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":"The latent block model (LBM) is a flexible probabilistic tool to describe interactions between node sets in bipartite networks, but it does not account for interactions of time varying intensity between nodes in unknown classes. In this paper we propose a non stationary temporal extension of the LBM that clusters simultaneously the two node sets of a bipartite network and constructs classes of time intervals on which interactions are stationary. The number of clusters as well as the membership to classes are obtained by maximizing the exact complete-data integrated likelihood relying on a gree","authors_text":"Fabrice Rossi (SAMM), Marco Corneli (SAMM), Pierre Latouche (SAMM)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T19:59:17Z","title":"Exact ICL maximization in a non-stationary time extension of the latent block model for dynamic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04138","kind":"arxiv","version":1},"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:7bd3762cfcdb528c8a1d896780f16d90bea9cce3cf98683b8f998a57edb5286b","target":"record","created_at":"2026-05-18T01:51:18Z","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":"3125ce3fa5e66abf5350778c0f54b93b82c142b8ab4f2688361f1207d298d8a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-12T19:59:17Z","title_canon_sha256":"fc6178ca92685363fbda5572b6b9e809ef3b3861e7b5ee7548b0d769d8349346"},"schema_version":"1.0","source":{"id":"1506.04138","kind":"arxiv","version":1}},"canonical_sha256":"aa37c06666029d3345ba18168e56ebc707726cee2a691996562284f381b83c8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa37c06666029d3345ba18168e56ebc707726cee2a691996562284f381b83c8f","first_computed_at":"2026-05-18T01:51:18.179739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:51:18.179739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"53z9eHU0SzjVprrNAvasnUZ3utC0K3F7gnI/G4GZz5AfxL/3QlengUrihB0R4E3HXQ9sEpA9cLesPhxRot7DAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:51:18.180238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bd3762cfcdb528c8a1d896780f16d90bea9cce3cf98683b8f998a57edb5286b","sha256:62ce97f9ddeb70a7b0077ad3bf8a3ead16767a2a08a00aa6a003b2963f60ca6f"],"state_sha256":"4de7f4950a1fd54d12c4f07aa12fc1d6221e0eadec451966ab1c4ba851bc7d37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZbUQEC48JHCM3hThA5a0wHSIiGwAalw+8QOwH8k+Iu6qzERPgwKBUzOxE8IYY0KU5229l4SxIqGkNZKiX+JAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:27:45.344625Z","bundle_sha256":"008dbbdeaa6e3f1b6678f9037c8aee2e2169a8dde525ac12388320146c2277ef"}}