{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RN7FGOWYA6ZYPVG7ZGWGRMO6MY","short_pith_number":"pith:RN7FGOWY","canonical_record":{"source":{"id":"1506.08278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-27T10:35:59Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"d6afad4aa4ecfcf82c1873d08c68d6c49a65258e1d808a49c83e7eb8e4fdd3e5","abstract_canon_sha256":"665f69827ad62c5b8e3163c9724d08c77feb8b8e8628dcff0e30e2a0413cf898"},"schema_version":"1.0"},"canonical_sha256":"8b7e533ad807b387d4dfc9ac68b1de6639e0ee979dc118d8b35060283062b160","source":{"kind":"arxiv","id":"1506.08278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08278","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08278v1","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08278","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"RN7FGOWYA6ZY","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RN7FGOWYA6ZYPVG7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RN7FGOWY","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RN7FGOWYA6ZYPVG7ZGWGRMO6MY","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-27T10:35:59Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"d6afad4aa4ecfcf82c1873d08c68d6c49a65258e1d808a49c83e7eb8e4fdd3e5","abstract_canon_sha256":"665f69827ad62c5b8e3163c9724d08c77feb8b8e8628dcff0e30e2a0413cf898"},"schema_version":"1.0"},"canonical_sha256":"8b7e533ad807b387d4dfc9ac68b1de6639e0ee979dc118d8b35060283062b160","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:01.445242Z","signature_b64":"dKsBp708uCa56NrFHl8yubtSN+25Bm3mRf/czVriA8dIjjbNjBzKf+RgMeI9oeSOWs1SujL4WenaWlFBZV/VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7e533ad807b387d4dfc9ac68b1de6639e0ee979dc118d8b35060283062b160","last_reissued_at":"2026-05-18T01:01:01.444453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:01.444453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08278","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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UO0uB5hXw/fVwLljuEO+z5IJgyUPZ3msPTa/LYhSy79E11DSNzull9wrTvo4scdMTbIAAGI2Dhz4PsEMn3R2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:43:05.254754Z"},"content_sha256":"39d3f58a559fc88aa37ac023680518f89e9b7de9289ed22127b3eeab37291dee","schema_version":"1.0","event_id":"sha256:39d3f58a559fc88aa37ac023680518f89e9b7de9289ed22127b3eeab37291dee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RN7FGOWYA6ZYPVG7ZGWGRMO6MY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Composite likelihood inference in a discrete latent variable model for two-way \"clustering-by-segmentation\" problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Bruce George Lindsay, Francesca Chiaromonte, Francesco Bartolucci, Prabhani Kuruppumullage Don","submitted_at":"2015-06-27T10:35:59Z","abstract_excerpt":"We consider a discrete latent variable model for two-way data arrays, which allows one to simultaneously produce clusters along one of the data dimensions (e.g. exchangeable observational units or features) and contiguous groups, or segments, along the other (e.g. consecutively ordered times or locations). The model relies on a hidden Markov structure but, given its complexity, cannot be estimated by full maximum likelihood. We therefore introduce composite likelihood methodology based on considering different subsets of the data. The proposed approach is illustrated by simulation, and with an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08278","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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMAdG1WoQDP+YTfx0SgnFFwHRrhcIAXGSdFecKHZbO12/0SDEtIYa5ObFhQRNQb9f0UlRUUMGTeSq6GtQZw8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:43:05.255481Z"},"content_sha256":"5c356b78a9795be5ed518ffde505224fe5baf9150e9a98125c348db9e806b0c7","schema_version":"1.0","event_id":"sha256:5c356b78a9795be5ed518ffde505224fe5baf9150e9a98125c348db9e806b0c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RN7FGOWYA6ZYPVG7ZGWGRMO6MY/bundle.json","state_url":"https://pith.science/pith/RN7FGOWYA6ZYPVG7ZGWGRMO6MY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RN7FGOWYA6ZYPVG7ZGWGRMO6MY/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-06T06:43:05Z","links":{"resolver":"https://pith.science/pith/RN7FGOWYA6ZYPVG7ZGWGRMO6MY","bundle":"https://pith.science/pith/RN7FGOWYA6ZYPVG7ZGWGRMO6MY/bundle.json","state":"https://pith.science/pith/RN7FGOWYA6ZYPVG7ZGWGRMO6MY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RN7FGOWYA6ZYPVG7ZGWGRMO6MY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RN7FGOWYA6ZYPVG7ZGWGRMO6MY","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":"665f69827ad62c5b8e3163c9724d08c77feb8b8e8628dcff0e30e2a0413cf898","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-27T10:35:59Z","title_canon_sha256":"d6afad4aa4ecfcf82c1873d08c68d6c49a65258e1d808a49c83e7eb8e4fdd3e5"},"schema_version":"1.0","source":{"id":"1506.08278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08278","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08278v1","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08278","created_at":"2026-05-18T01:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"RN7FGOWYA6ZY","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RN7FGOWYA6ZYPVG7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RN7FGOWY","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:5c356b78a9795be5ed518ffde505224fe5baf9150e9a98125c348db9e806b0c7","target":"graph","created_at":"2026-05-18T01:01:01Z","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":"We consider a discrete latent variable model for two-way data arrays, which allows one to simultaneously produce clusters along one of the data dimensions (e.g. exchangeable observational units or features) and contiguous groups, or segments, along the other (e.g. consecutively ordered times or locations). The model relies on a hidden Markov structure but, given its complexity, cannot be estimated by full maximum likelihood. We therefore introduce composite likelihood methodology based on considering different subsets of the data. The proposed approach is illustrated by simulation, and with an","authors_text":"Bruce George Lindsay, Francesca Chiaromonte, Francesco Bartolucci, Prabhani Kuruppumullage Don","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-27T10:35:59Z","title":"Composite likelihood inference in a discrete latent variable model for two-way \"clustering-by-segmentation\" problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08278","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:39d3f58a559fc88aa37ac023680518f89e9b7de9289ed22127b3eeab37291dee","target":"record","created_at":"2026-05-18T01:01:01Z","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":"665f69827ad62c5b8e3163c9724d08c77feb8b8e8628dcff0e30e2a0413cf898","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-27T10:35:59Z","title_canon_sha256":"d6afad4aa4ecfcf82c1873d08c68d6c49a65258e1d808a49c83e7eb8e4fdd3e5"},"schema_version":"1.0","source":{"id":"1506.08278","kind":"arxiv","version":1}},"canonical_sha256":"8b7e533ad807b387d4dfc9ac68b1de6639e0ee979dc118d8b35060283062b160","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b7e533ad807b387d4dfc9ac68b1de6639e0ee979dc118d8b35060283062b160","first_computed_at":"2026-05-18T01:01:01.444453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:01.444453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dKsBp708uCa56NrFHl8yubtSN+25Bm3mRf/czVriA8dIjjbNjBzKf+RgMeI9oeSOWs1SujL4WenaWlFBZV/VDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:01.445242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39d3f58a559fc88aa37ac023680518f89e9b7de9289ed22127b3eeab37291dee","sha256:5c356b78a9795be5ed518ffde505224fe5baf9150e9a98125c348db9e806b0c7"],"state_sha256":"1dda29bb2c6972e373ae5e0d10b43734c7e4630a6b60b484495ac5606d9fdf43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEE0nUhXMANrerOYGf/SwBx5cudhNj5qDg+OIbNv40SsevpTA9ZzK6zbFRadi5WLj+KNRw7NZx/saafJF+GXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:43:05.259256Z","bundle_sha256":"30a3e59fd81aa1ba580bfe97e58d51dbb085f7c1b4366ae5964b01ff023d66db"}}