{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IN32TYQMKODXLAZWNAKVINEHB4","short_pith_number":"pith:IN32TYQM","schema_version":"1.0","canonical_sha256":"4377a9e20c538775833668155434870f378165a822c97a28bb0306332bd6afd4","source":{"kind":"arxiv","id":"1706.03883","version":1},"attestation_state":"computed","paper":{"title":"Multilevel Clustering via Wasserstein Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Dinh Phung, Hung Hai Bui, Mikhail Yurochkin, Nhat Ho, Viet Huynh, XuanLong Nguyen","submitted_at":"2017-06-13T01:15:04Z","abstract_excerpt":"We propose a novel approach to the problem of multilevel clustering, which aims to simultaneously partition data in each group and discover grouping patterns among groups in a potentially large hierarchically structured corpus of data. Our method involves a joint optimization formulation over several spaces of discrete probability measures, which are endowed with Wasserstein distance metrics. We propose a number of variants of this problem, which admit fast optimization algorithms, by exploiting the connection to the problem of finding Wasserstein barycenters. Consistency properties are establ"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.03883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-13T01:15:04Z","cross_cats_sorted":["stat.CO","stat.ME"],"title_canon_sha256":"a1e555887cdb8a09186d7216cc9ff62512b67ac867a3427c6b3dbb22227ca1a3","abstract_canon_sha256":"0fd2c7cd749920996666bdc9b44605beb292184b5a5a4fb802efd747de9ddefd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:28.104242Z","signature_b64":"O/PiJQl47ZAFqPKKjcSGeDNz4IMvV3pL/fAopvH6NevyckFaGRuQ4DpRWjly1weYndHqS6eZUv/+AkWQDoLpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4377a9e20c538775833668155434870f378165a822c97a28bb0306332bd6afd4","last_reissued_at":"2026-05-18T00:42:28.103239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:28.103239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multilevel Clustering via Wasserstein Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Dinh Phung, Hung Hai Bui, Mikhail Yurochkin, Nhat Ho, Viet Huynh, XuanLong Nguyen","submitted_at":"2017-06-13T01:15:04Z","abstract_excerpt":"We propose a novel approach to the problem of multilevel clustering, which aims to simultaneously partition data in each group and discover grouping patterns among groups in a potentially large hierarchically structured corpus of data. Our method involves a joint optimization formulation over several spaces of discrete probability measures, which are endowed with Wasserstein distance metrics. We propose a number of variants of this problem, which admit fast optimization algorithms, by exploiting the connection to the problem of finding Wasserstein barycenters. Consistency properties are establ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03883","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.03883","created_at":"2026-05-18T00:42:28.103333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03883v1","created_at":"2026-05-18T00:42:28.103333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03883","created_at":"2026-05-18T00:42:28.103333+00:00"},{"alias_kind":"pith_short_12","alias_value":"IN32TYQMKODX","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IN32TYQMKODXLAZW","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IN32TYQM","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4","json":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4.json","graph_json":"https://pith.science/api/pith-number/IN32TYQMKODXLAZWNAKVINEHB4/graph.json","events_json":"https://pith.science/api/pith-number/IN32TYQMKODXLAZWNAKVINEHB4/events.json","paper":"https://pith.science/paper/IN32TYQM"},"agent_actions":{"view_html":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4","download_json":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4.json","view_paper":"https://pith.science/paper/IN32TYQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03883&json=true","fetch_graph":"https://pith.science/api/pith-number/IN32TYQMKODXLAZWNAKVINEHB4/graph.json","fetch_events":"https://pith.science/api/pith-number/IN32TYQMKODXLAZWNAKVINEHB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4/action/storage_attestation","attest_author":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4/action/author_attestation","sign_citation":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4/action/citation_signature","submit_replication":"https://pith.science/pith/IN32TYQMKODXLAZWNAKVINEHB4/action/replication_record"}},"created_at":"2026-05-18T00:42:28.103333+00:00","updated_at":"2026-05-18T00:42:28.103333+00:00"}