{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3WO4VRIMQGOCG4YG4NK6YZCRGF","short_pith_number":"pith:3WO4VRIM","canonical_record":{"source":{"id":"1603.02745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-03-09T00:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"147aa7381d482e00bb669d05d8b93c75c3b8fc9180c804a3c0403db2f43ab2e2","abstract_canon_sha256":"e6083af764b6401d3dfc162f5e0f72f28b5949fd92a6d9544ceb86b6ce115b04"},"schema_version":"1.0"},"canonical_sha256":"dd9dcac50c819c237306e355ec6451316de9bf82d9ec3e87cd511f76177007f1","source":{"kind":"arxiv","id":"1603.02745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02745","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02745v1","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02745","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"3WO4VRIMQGOC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3WO4VRIMQGOCG4YG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3WO4VRIM","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3WO4VRIMQGOCG4YG4NK6YZCRGF","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-03-09T00:05:49Z","cross_cats_sorted":[],"title_canon_sha256":"147aa7381d482e00bb669d05d8b93c75c3b8fc9180c804a3c0403db2f43ab2e2","abstract_canon_sha256":"e6083af764b6401d3dfc162f5e0f72f28b5949fd92a6d9544ceb86b6ce115b04"},"schema_version":"1.0"},"canonical_sha256":"dd9dcac50c819c237306e355ec6451316de9bf82d9ec3e87cd511f76177007f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:19.926272Z","signature_b64":"mHbEmMMiDjlcQNthZQbf9pW1VFowDUVicYzZAAJbyMJw9kzQ4OJbFQ3weLjKx8EPTg4BmLmUpue5wjJL3x/fBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd9dcac50c819c237306e355ec6451316de9bf82d9ec3e87cd511f76177007f1","last_reissued_at":"2026-05-18T01:19:19.925869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:19.925869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02745","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:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n899/IAWneW5L/kBfS4Tn83rXupyv/p5I2rCc3YoeCO9foUq9DhglP/AJV/HVbosNXtVBI+2cej463WQWIxTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:57:24.211971Z"},"content_sha256":"ba13f8b1a6d5b1b5f89513dacfa018f2193717c98b0d02a59273e28646a918ea","schema_version":"1.0","event_id":"sha256:ba13f8b1a6d5b1b5f89513dacfa018f2193717c98b0d02a59273e28646a918ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3WO4VRIMQGOCG4YG4NK6YZCRGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-parametric latent modeling and network clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Fran\\c{c}ois Bavaud","submitted_at":"2016-03-09T00:05:49Z","abstract_excerpt":"The paper exposes a non-parametric approach to latent and co-latent modeling of bivariate data, based upon alternating minimization of the Kullback-Leibler divergence (EM algorithm) for complete log-linear models. For categorical data, the iterative algorithm generates a soft clustering of both rows and columns of the contingency table. Well-known results are systematically revisited, and some variants are presumably original. In particular, the consideration of square contingency tables induces a clustering algorithm for weighted networks, differing from spectral clustering or modularity maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02745","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:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yWn22v6hTo2hqIVAAeHD3tt3jmDFfd9ymE3n7vptXpmRg6fhe+TJXLs2XlqyBhlMOp70rJFYahum0S+6heWkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:57:24.212339Z"},"content_sha256":"5ae1d1d5b651ab4c5f3f56a300020e3dc95436ecb1c04245553ebc3debb88c83","schema_version":"1.0","event_id":"sha256:5ae1d1d5b651ab4c5f3f56a300020e3dc95436ecb1c04245553ebc3debb88c83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3WO4VRIMQGOCG4YG4NK6YZCRGF/bundle.json","state_url":"https://pith.science/pith/3WO4VRIMQGOCG4YG4NK6YZCRGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3WO4VRIMQGOCG4YG4NK6YZCRGF/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-27T08:57:24Z","links":{"resolver":"https://pith.science/pith/3WO4VRIMQGOCG4YG4NK6YZCRGF","bundle":"https://pith.science/pith/3WO4VRIMQGOCG4YG4NK6YZCRGF/bundle.json","state":"https://pith.science/pith/3WO4VRIMQGOCG4YG4NK6YZCRGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3WO4VRIMQGOCG4YG4NK6YZCRGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3WO4VRIMQGOCG4YG4NK6YZCRGF","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":"e6083af764b6401d3dfc162f5e0f72f28b5949fd92a6d9544ceb86b6ce115b04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-03-09T00:05:49Z","title_canon_sha256":"147aa7381d482e00bb669d05d8b93c75c3b8fc9180c804a3c0403db2f43ab2e2"},"schema_version":"1.0","source":{"id":"1603.02745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02745","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02745v1","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02745","created_at":"2026-05-18T01:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"3WO4VRIMQGOC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3WO4VRIMQGOCG4YG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3WO4VRIM","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:5ae1d1d5b651ab4c5f3f56a300020e3dc95436ecb1c04245553ebc3debb88c83","target":"graph","created_at":"2026-05-18T01:19:19Z","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 paper exposes a non-parametric approach to latent and co-latent modeling of bivariate data, based upon alternating minimization of the Kullback-Leibler divergence (EM algorithm) for complete log-linear models. For categorical data, the iterative algorithm generates a soft clustering of both rows and columns of the contingency table. Well-known results are systematically revisited, and some variants are presumably original. In particular, the consideration of square contingency tables induces a clustering algorithm for weighted networks, differing from spectral clustering or modularity maxi","authors_text":"Fran\\c{c}ois Bavaud","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-03-09T00:05:49Z","title":"Non-parametric latent modeling and network clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02745","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:ba13f8b1a6d5b1b5f89513dacfa018f2193717c98b0d02a59273e28646a918ea","target":"record","created_at":"2026-05-18T01:19:19Z","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":"e6083af764b6401d3dfc162f5e0f72f28b5949fd92a6d9544ceb86b6ce115b04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-03-09T00:05:49Z","title_canon_sha256":"147aa7381d482e00bb669d05d8b93c75c3b8fc9180c804a3c0403db2f43ab2e2"},"schema_version":"1.0","source":{"id":"1603.02745","kind":"arxiv","version":1}},"canonical_sha256":"dd9dcac50c819c237306e355ec6451316de9bf82d9ec3e87cd511f76177007f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd9dcac50c819c237306e355ec6451316de9bf82d9ec3e87cd511f76177007f1","first_computed_at":"2026-05-18T01:19:19.925869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:19.925869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mHbEmMMiDjlcQNthZQbf9pW1VFowDUVicYzZAAJbyMJw9kzQ4OJbFQ3weLjKx8EPTg4BmLmUpue5wjJL3x/fBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:19.926272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba13f8b1a6d5b1b5f89513dacfa018f2193717c98b0d02a59273e28646a918ea","sha256:5ae1d1d5b651ab4c5f3f56a300020e3dc95436ecb1c04245553ebc3debb88c83"],"state_sha256":"70f94632ab5c0bae860b8fe49ffa9a097cfba8410b6c5abc652b7816f3eb2ee6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jndQCoRQZuVj2awzemLzmAtUe1qq0+Zs13v5J1aEhpajwTe8TFwotdm9gOKwrqtnPdDSmSD1yN56xc1oyvigCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:57:24.214209Z","bundle_sha256":"4f094d6ba41408c4456826ff6ae1a0065b76c7136747801dc266184e26cb3e8b"}}