{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:J7VYX2TDRW6METT7A47UHHCRF5","short_pith_number":"pith:J7VYX2TD","schema_version":"1.0","canonical_sha256":"4feb8bea638dbcc24e7f073f439c512f7921ef1e82662bf052c87668d68c943c","source":{"kind":"arxiv","id":"2112.06580","version":2},"attestation_state":"computed","paper":{"title":"How to Find a Good Explanation for Clustering?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Kirill Simonov, Nidhi Purohit, Petr A. Golovach, Sayan Bandyapadhyay, William Lochet","submitted_at":"2021-12-13T11:48:38Z","abstract_excerpt":"$k$-means and $k$-median clustering are powerful unsupervised machine learning techniques. However, due to complicated dependences on all the features, it is challenging to interpret the resulting cluster assignments. Moshkovitz, Dasgupta, Rashtchian, and Frost [ICML 2020] proposed an elegant model of explainable $k$-means and $k$-median clustering. In this model, a decision tree with $k$ leaves provides a straightforward characterization of the data set into clusters.\n  We study two natural algorithmic questions about explainable clustering. (1) For a given clustering, how to find the \"best e"},"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":"2112.06580","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-13T11:48:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"33da446712a23d9f2c0831b81a64c61059bcaf2e07c16606d6e8c942db9166e9","abstract_canon_sha256":"1bc2e39dcbdf54f176118cdc47abf664c4000a268ad2e092c55c133348d8f906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:28.491669Z","signature_b64":"T8x5WLP6wF2p8QVXhquA7QVLKXkzVQuH0lfS09L3VSFwwvUGSkS98XY3geAS8ZAZXRZfOEmQ8nPX72zFowbeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4feb8bea638dbcc24e7f073f439c512f7921ef1e82662bf052c87668d68c943c","last_reissued_at":"2026-07-05T03:41:28.491204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:28.491204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Find a Good Explanation for Clustering?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Kirill Simonov, Nidhi Purohit, Petr A. Golovach, Sayan Bandyapadhyay, William Lochet","submitted_at":"2021-12-13T11:48:38Z","abstract_excerpt":"$k$-means and $k$-median clustering are powerful unsupervised machine learning techniques. However, due to complicated dependences on all the features, it is challenging to interpret the resulting cluster assignments. Moshkovitz, Dasgupta, Rashtchian, and Frost [ICML 2020] proposed an elegant model of explainable $k$-means and $k$-median clustering. In this model, a decision tree with $k$ leaves provides a straightforward characterization of the data set into clusters.\n  We study two natural algorithmic questions about explainable clustering. (1) For a given clustering, how to find the \"best e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06580","kind":"arxiv","version":2},"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/2112.06580/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.06580","created_at":"2026-07-05T03:41:28.491258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.06580v2","created_at":"2026-07-05T03:41:28.491258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06580","created_at":"2026-07-05T03:41:28.491258+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7VYX2TDRW6M","created_at":"2026-07-05T03:41:28.491258+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7VYX2TDRW6METT7","created_at":"2026-07-05T03:41:28.491258+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7VYX2TD","created_at":"2026-07-05T03:41:28.491258+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/J7VYX2TDRW6METT7A47UHHCRF5","json":"https://pith.science/pith/J7VYX2TDRW6METT7A47UHHCRF5.json","graph_json":"https://pith.science/api/pith-number/J7VYX2TDRW6METT7A47UHHCRF5/graph.json","events_json":"https://pith.science/api/pith-number/J7VYX2TDRW6METT7A47UHHCRF5/events.json","paper":"https://pith.science/paper/J7VYX2TD"},"agent_actions":{"view_html":"https://pith.science/pith/J7VYX2TDRW6METT7A47UHHCRF5","download_json":"https://pith.science/pith/J7VYX2TDRW6METT7A47UHHCRF5.json","view_paper":"https://pith.science/paper/J7VYX2TD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.06580&json=true","fetch_graph":"https://pith.science/api/pith-number/J7VYX2TDRW6METT7A47UHHCRF5/graph.json","fetch_events":"https://pith.science/api/pith-number/J7VYX2TDRW6METT7A47UHHCRF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7VYX2TDRW6METT7A47UHHCRF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7VYX2TDRW6METT7A47UHHCRF5/action/storage_attestation","attest_author":"https://pith.science/pith/J7VYX2TDRW6METT7A47UHHCRF5/action/author_attestation","sign_citation":"https://pith.science/pith/J7VYX2TDRW6METT7A47UHHCRF5/action/citation_signature","submit_replication":"https://pith.science/pith/J7VYX2TDRW6METT7A47UHHCRF5/action/replication_record"}},"created_at":"2026-07-05T03:41:28.491258+00:00","updated_at":"2026-07-05T03:41:28.491258+00:00"}