{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GE6TSWLNJJJXMM5AR7EPSBLOXX","short_pith_number":"pith:GE6TSWLN","canonical_record":{"source":{"id":"2507.09370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-12T18:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"dc4a377d55f951c45faf0bbf2631b356f6fa2d8035c1c3ab05020703e41d582d","abstract_canon_sha256":"fba8cea6d66007dc5b9bd335ece996f2c1a69dc3e9422ea8942fe8222364557d"},"schema_version":"1.0"},"canonical_sha256":"313d39596d4a537633a08fc8f9056ebdf5a2f50e3a03333d0f223247cb4d6ce2","source":{"kind":"arxiv","id":"2507.09370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09370","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09370v1","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09370","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"GE6TSWLNJJJX","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_16","alias_value":"GE6TSWLNJJJXMM5A","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_8","alias_value":"GE6TSWLN","created_at":"2026-07-05T11:36:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GE6TSWLNJJJXMM5AR7EPSBLOXX","target":"record","payload":{"canonical_record":{"source":{"id":"2507.09370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-12T18:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"dc4a377d55f951c45faf0bbf2631b356f6fa2d8035c1c3ab05020703e41d582d","abstract_canon_sha256":"fba8cea6d66007dc5b9bd335ece996f2c1a69dc3e9422ea8942fe8222364557d"},"schema_version":"1.0"},"canonical_sha256":"313d39596d4a537633a08fc8f9056ebdf5a2f50e3a03333d0f223247cb4d6ce2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:07.857736Z","signature_b64":"ehJASaIzmU/OagciAsBz4ETSfrpiB1qb330nkm4EB3r3eA2BRw/CDhe5K60f5nSxfk/nsGkL/y9fjNlfUGDZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"313d39596d4a537633a08fc8f9056ebdf5a2f50e3a03333d0f223247cb4d6ce2","last_reissued_at":"2026-07-05T11:36:07.857385Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:07.857385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.09370","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-07-05T11:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wialxclmvhJIGEcdZgJLCzM+99FE2r38ji+Fz9z7aWZF87q3522gnfceK1TCJ4ulBY9U0MOHZpPdCDrtpjm2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T00:43:24.119989Z"},"content_sha256":"6c6e44b0183c16c395d86b1367cdf1a30e99ba434c448d86263e912e869c94b0","schema_version":"1.0","event_id":"sha256:6c6e44b0183c16c395d86b1367cdf1a30e99ba434c448d86263e912e869c94b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GE6TSWLNJJJXMM5AR7EPSBLOXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Latent Position Co-Clustering Model for Multiplex Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"C.J. Clarke, Michael Fop","submitted_at":"2025-07-12T18:25:21Z","abstract_excerpt":"Multiplex networks are increasingly common across diverse domains, motivating the development of clustering methods that uncover patterns at multiple levels. Existing approaches typically focus on clustering either entire networks or nodes within a single network. We address the lack of a unified latent space framework for simultaneous network- and node-level clustering by proposing a latent position co-clustering model (LaPCoM), based on a hierarchical mixture-of-mixtures formulation. LaPCoM enables co-clustering of networks and their constituent nodes, providing joint dimension reduction and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09370","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.09370/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfGm7ZLN42lrtOshb0oGlDVkmPwVOCmirol2YYPjq0KjzgjbWn7JDdcUqrc1pei6AQcY8g6kv5RePHZQP0/iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T00:43:24.120491Z"},"content_sha256":"b174a2277407683f58c3a8d3d7d000e5a795be97f9174a83cbca8535743eb551","schema_version":"1.0","event_id":"sha256:b174a2277407683f58c3a8d3d7d000e5a795be97f9174a83cbca8535743eb551"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GE6TSWLNJJJXMM5AR7EPSBLOXX/bundle.json","state_url":"https://pith.science/pith/GE6TSWLNJJJXMM5AR7EPSBLOXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GE6TSWLNJJJXMM5AR7EPSBLOXX/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-08-21T00:43:24Z","links":{"resolver":"https://pith.science/pith/GE6TSWLNJJJXMM5AR7EPSBLOXX","bundle":"https://pith.science/pith/GE6TSWLNJJJXMM5AR7EPSBLOXX/bundle.json","state":"https://pith.science/pith/GE6TSWLNJJJXMM5AR7EPSBLOXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GE6TSWLNJJJXMM5AR7EPSBLOXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GE6TSWLNJJJXMM5AR7EPSBLOXX","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":"fba8cea6d66007dc5b9bd335ece996f2c1a69dc3e9422ea8942fe8222364557d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-12T18:25:21Z","title_canon_sha256":"dc4a377d55f951c45faf0bbf2631b356f6fa2d8035c1c3ab05020703e41d582d"},"schema_version":"1.0","source":{"id":"2507.09370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09370","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09370v1","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09370","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"GE6TSWLNJJJX","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_16","alias_value":"GE6TSWLNJJJXMM5A","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_8","alias_value":"GE6TSWLN","created_at":"2026-07-05T11:36:07Z"}],"graph_snapshots":[{"event_id":"sha256:b174a2277407683f58c3a8d3d7d000e5a795be97f9174a83cbca8535743eb551","target":"graph","created_at":"2026-07-05T11:36:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.09370/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multiplex networks are increasingly common across diverse domains, motivating the development of clustering methods that uncover patterns at multiple levels. Existing approaches typically focus on clustering either entire networks or nodes within a single network. We address the lack of a unified latent space framework for simultaneous network- and node-level clustering by proposing a latent position co-clustering model (LaPCoM), based on a hierarchical mixture-of-mixtures formulation. LaPCoM enables co-clustering of networks and their constituent nodes, providing joint dimension reduction and","authors_text":"C.J. Clarke, Michael Fop","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-12T18:25:21Z","title":"A Latent Position Co-Clustering Model for Multiplex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09370","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:6c6e44b0183c16c395d86b1367cdf1a30e99ba434c448d86263e912e869c94b0","target":"record","created_at":"2026-07-05T11:36:07Z","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":"fba8cea6d66007dc5b9bd335ece996f2c1a69dc3e9422ea8942fe8222364557d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-12T18:25:21Z","title_canon_sha256":"dc4a377d55f951c45faf0bbf2631b356f6fa2d8035c1c3ab05020703e41d582d"},"schema_version":"1.0","source":{"id":"2507.09370","kind":"arxiv","version":1}},"canonical_sha256":"313d39596d4a537633a08fc8f9056ebdf5a2f50e3a03333d0f223247cb4d6ce2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"313d39596d4a537633a08fc8f9056ebdf5a2f50e3a03333d0f223247cb4d6ce2","first_computed_at":"2026-07-05T11:36:07.857385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:07.857385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ehJASaIzmU/OagciAsBz4ETSfrpiB1qb330nkm4EB3r3eA2BRw/CDhe5K60f5nSxfk/nsGkL/y9fjNlfUGDZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:07.857736Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.09370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c6e44b0183c16c395d86b1367cdf1a30e99ba434c448d86263e912e869c94b0","sha256:b174a2277407683f58c3a8d3d7d000e5a795be97f9174a83cbca8535743eb551"],"state_sha256":"169c567f7ebd246993b61fe222bf34c39d7648ab7bdf2df4b3018aa4c0d5c0ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/IFL/tdiNv3eImPxHs7zvLolGeJ8gV0EStuEUsOhnl7NoptQtMr0Robkq+43MwWlZogQCvxxCKMhMge8SLtgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T00:43:24.124545Z","bundle_sha256":"af527a9261be84575dc05c77ee1109130f4553a788082b76ec2bafa8d72592bc"}}