{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3JX3XNLKBXKECYIDINZTS326X4","short_pith_number":"pith:3JX3XNLK","canonical_record":{"source":{"id":"1810.11911","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T00:26:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2d573f222a54bf26629b27ab23308d71d7ad1d9f31404d03beba4633da0f3362","abstract_canon_sha256":"18369c25ec617e71c707c79bd1ca33bf8445eaa13f7758d7f3c4f04b039c60a0"},"schema_version":"1.0"},"canonical_sha256":"da6fbbb56a0dd44161034373396f5ebf32cd32296a1589d0968ce1b9b1fa5e09","source":{"kind":"arxiv","id":"1810.11911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11911","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11911v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11911","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"3JX3XNLKBXKE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JX3XNLKBXKECYID","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JX3XNLK","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3JX3XNLKBXKECYIDINZTS326X4","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11911","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T00:26:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2d573f222a54bf26629b27ab23308d71d7ad1d9f31404d03beba4633da0f3362","abstract_canon_sha256":"18369c25ec617e71c707c79bd1ca33bf8445eaa13f7758d7f3c4f04b039c60a0"},"schema_version":"1.0"},"canonical_sha256":"da6fbbb56a0dd44161034373396f5ebf32cd32296a1589d0968ce1b9b1fa5e09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:07.079022Z","signature_b64":"cJ/bDxlnZikRHENYBWdRrdOweeFmf+DJ6DiV8dYXlsPBOucAdSLjbuquRO8vprgTaHXhsGeYh7zTWPwrNTzvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da6fbbb56a0dd44161034373396f5ebf32cd32296a1589d0968ce1b9b1fa5e09","last_reissued_at":"2026-05-18T00:02:07.078284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:07.078284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11911","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-18T00:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84D9UT+qrkdctt0CJH1GboqhbC/cx/i+JU/GnTHfQzJXGSGAXFl8v1Gf1WahYnnthyIg6fHDBSJZS4Z1nQM4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:48:02.442627Z"},"content_sha256":"3e022e1ff49a319af733faf07908786fc522b9bf25e8e46bea7b17433bd092ff","schema_version":"1.0","event_id":"sha256:3e022e1ff49a319af733faf07908786fc522b9bf25e8e46bea7b17433bd092ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3JX3XNLKBXKECYIDINZTS326X4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Multilevel Clustering via Composite Transportation Distance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dinh Phung, Michael I. Jordan, Nhat Ho, Viet Huynh","submitted_at":"2018-10-29T00:26:29Z","abstract_excerpt":"We propose a novel probabilistic approach to multilevel clustering problems based on composite transportation distance, which is a variant of transportation distance where the underlying metric is Kullback-Leibler divergence. Our method involves solving a joint optimization problem over spaces of probability measures to simultaneously discover grouping structures within groups and among groups. By exploiting the connection of our method to the problem of finding composite transportation barycenters, we develop fast and efficient optimization algorithms even for potentially large-scale multilev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11911","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-18T00:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZnfoI+V84Et/hzt2cJyqz6FGb++4JFkeKdskI6PUWva4CQE+7uuFi6iWw5kZb8Hb/lfQzKT2o4PWxNyeoyBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:48:02.443257Z"},"content_sha256":"36f761097c9d49471599cf91461270454128964f0273e34ca707a1aed7126bb1","schema_version":"1.0","event_id":"sha256:36f761097c9d49471599cf91461270454128964f0273e34ca707a1aed7126bb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JX3XNLKBXKECYIDINZTS326X4/bundle.json","state_url":"https://pith.science/pith/3JX3XNLKBXKECYIDINZTS326X4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JX3XNLKBXKECYIDINZTS326X4/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-02T20:48:02Z","links":{"resolver":"https://pith.science/pith/3JX3XNLKBXKECYIDINZTS326X4","bundle":"https://pith.science/pith/3JX3XNLKBXKECYIDINZTS326X4/bundle.json","state":"https://pith.science/pith/3JX3XNLKBXKECYIDINZTS326X4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JX3XNLKBXKECYIDINZTS326X4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3JX3XNLKBXKECYIDINZTS326X4","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":"18369c25ec617e71c707c79bd1ca33bf8445eaa13f7758d7f3c4f04b039c60a0","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T00:26:29Z","title_canon_sha256":"2d573f222a54bf26629b27ab23308d71d7ad1d9f31404d03beba4633da0f3362"},"schema_version":"1.0","source":{"id":"1810.11911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11911","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11911v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11911","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"3JX3XNLKBXKE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JX3XNLKBXKECYID","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JX3XNLK","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:36f761097c9d49471599cf91461270454128964f0273e34ca707a1aed7126bb1","target":"graph","created_at":"2026-05-18T00:02: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"},"paper":{"abstract_excerpt":"We propose a novel probabilistic approach to multilevel clustering problems based on composite transportation distance, which is a variant of transportation distance where the underlying metric is Kullback-Leibler divergence. Our method involves solving a joint optimization problem over spaces of probability measures to simultaneously discover grouping structures within groups and among groups. By exploiting the connection of our method to the problem of finding composite transportation barycenters, we develop fast and efficient optimization algorithms even for potentially large-scale multilev","authors_text":"Dinh Phung, Michael I. Jordan, Nhat Ho, Viet Huynh","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T00:26:29Z","title":"Probabilistic Multilevel Clustering via Composite Transportation Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11911","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:3e022e1ff49a319af733faf07908786fc522b9bf25e8e46bea7b17433bd092ff","target":"record","created_at":"2026-05-18T00:02: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":"18369c25ec617e71c707c79bd1ca33bf8445eaa13f7758d7f3c4f04b039c60a0","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T00:26:29Z","title_canon_sha256":"2d573f222a54bf26629b27ab23308d71d7ad1d9f31404d03beba4633da0f3362"},"schema_version":"1.0","source":{"id":"1810.11911","kind":"arxiv","version":1}},"canonical_sha256":"da6fbbb56a0dd44161034373396f5ebf32cd32296a1589d0968ce1b9b1fa5e09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da6fbbb56a0dd44161034373396f5ebf32cd32296a1589d0968ce1b9b1fa5e09","first_computed_at":"2026-05-18T00:02:07.078284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:07.078284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cJ/bDxlnZikRHENYBWdRrdOweeFmf+DJ6DiV8dYXlsPBOucAdSLjbuquRO8vprgTaHXhsGeYh7zTWPwrNTzvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:07.079022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e022e1ff49a319af733faf07908786fc522b9bf25e8e46bea7b17433bd092ff","sha256:36f761097c9d49471599cf91461270454128964f0273e34ca707a1aed7126bb1"],"state_sha256":"dbf55b61eb191f3534247b89d508ce143e9721ac13eefe906e50b200480e37f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hh5HJSA4lVfWwCsbqsfvJzHe0LIkoe23jHLBGgP/uw+hL31Em4R8K6MYVsCXMSm7KktR84o5j/zoNUY2QPDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:48:02.445821Z","bundle_sha256":"02cfe0e6f170b4e885b7e37f80d7c4c95073aa3b89c2a962a815e132dd5affdc"}}