{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KBZDXG2UU3LTYCJ2XSPSPBQLUM","short_pith_number":"pith:KBZDXG2U","schema_version":"1.0","canonical_sha256":"50723b9b54a6d73c093abc9f27860ba30928d340da76585276b3641872f504a5","source":{"kind":"arxiv","id":"1812.00539","version":1},"attestation_state":"computed","paper":{"title":"Interpretable Clustering via Optimal Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Agni Orfanoudaki, Dimitris Bertsimas, Holly Wiberg","submitted_at":"2018-12-03T03:22:42Z","abstract_excerpt":"State-of-the-art clustering algorithms use heuristics to partition the feature space and provide little insight into the rationale for cluster membership, limiting their interpretability. In healthcare applications, the latter poses a barrier to the adoption of these methods since medical researchers are required to provide detailed explanations of their decisions in order to gain patient trust and limit liability. We present a new unsupervised learning algorithm that leverages Mixed Integer Optimization techniques to generate interpretable tree-based clustering models. Utilizing the flexible "},"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":"1812.00539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-03T03:22:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ff7c5a05effe555cf8c6a4b57eb0164b5b034cc0d509e19218243234927e04fc","abstract_canon_sha256":"5fd31ac1c880b646c203297ba5519aec6ee66dad99233892fc5531dbaea37e79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:21.071998Z","signature_b64":"4lg/N3k16Tf3XODNX9Ihdi648SThB4YRXztwyqf4JZdCuxLSWf6sezRUQk9JxuKOX0tRyy1k82XcJdCD5SqEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50723b9b54a6d73c093abc9f27860ba30928d340da76585276b3641872f504a5","last_reissued_at":"2026-05-17T23:59:21.071609Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:21.071609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interpretable Clustering via Optimal Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Agni Orfanoudaki, Dimitris Bertsimas, Holly Wiberg","submitted_at":"2018-12-03T03:22:42Z","abstract_excerpt":"State-of-the-art clustering algorithms use heuristics to partition the feature space and provide little insight into the rationale for cluster membership, limiting their interpretability. In healthcare applications, the latter poses a barrier to the adoption of these methods since medical researchers are required to provide detailed explanations of their decisions in order to gain patient trust and limit liability. We present a new unsupervised learning algorithm that leverages Mixed Integer Optimization techniques to generate interpretable tree-based clustering models. Utilizing the flexible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00539","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":"1812.00539","created_at":"2026-05-17T23:59:21.071674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00539v1","created_at":"2026-05-17T23:59:21.071674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00539","created_at":"2026-05-17T23:59:21.071674+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBZDXG2UU3LT","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBZDXG2UU3LTYCJ2","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBZDXG2U","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.07598","citing_title":"Optimal Recourse Summaries via Bi-Objective Decision Tree Learning","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07598","citing_title":"Optimal Recourse Summaries via Bi-Objective Decision Tree Learning","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM","json":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM.json","graph_json":"https://pith.science/api/pith-number/KBZDXG2UU3LTYCJ2XSPSPBQLUM/graph.json","events_json":"https://pith.science/api/pith-number/KBZDXG2UU3LTYCJ2XSPSPBQLUM/events.json","paper":"https://pith.science/paper/KBZDXG2U"},"agent_actions":{"view_html":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM","download_json":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM.json","view_paper":"https://pith.science/paper/KBZDXG2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00539&json=true","fetch_graph":"https://pith.science/api/pith-number/KBZDXG2UU3LTYCJ2XSPSPBQLUM/graph.json","fetch_events":"https://pith.science/api/pith-number/KBZDXG2UU3LTYCJ2XSPSPBQLUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM/action/storage_attestation","attest_author":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM/action/author_attestation","sign_citation":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM/action/citation_signature","submit_replication":"https://pith.science/pith/KBZDXG2UU3LTYCJ2XSPSPBQLUM/action/replication_record"}},"created_at":"2026-05-17T23:59:21.071674+00:00","updated_at":"2026-05-17T23:59:21.071674+00:00"}