{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E7ZELRBVIDZOF6CM6XWEHOCSK5","short_pith_number":"pith:E7ZELRBV","schema_version":"1.0","canonical_sha256":"27f245c43540f2e2f84cf5ec43b852576273806bbc319869e44a7385c8c41e34","source":{"kind":"arxiv","id":"1704.02147","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Clustering: Objective Functions and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Frederik Mallmann-Trenn, Varun Kanade, Vincent Cohen-Addad","submitted_at":"2017-04-07T09:14:28Z","abstract_excerpt":"Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering was based on providing algorithms, rather than optimizing a specific objective, Dasgupta framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a `good' hierarchical clustering is one that minimizes some cost function. He showed that this cost function has certain desirable properties.\n  We take an axiomatic approach to defining `good' objective functions for both similarity a"},"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":"1704.02147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T09:14:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d9a48c92f60069d035bad1bfa10509aabaa0445aa83b18d2c7f75f1ce6b6fafd","abstract_canon_sha256":"f34440251b1612c04e9c485517fcd2fbf3d36fc219ca9ee2b67e8e3e34e433be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.595341Z","signature_b64":"fdPZGIL1tpFvXU262jivuTiWdNORZS6xN2omF7hOLjY6id4ZBAnazipUJ4TunC8KQnVmhY3sMZZyufMCNHGvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27f245c43540f2e2f84cf5ec43b852576273806bbc319869e44a7385c8c41e34","last_reissued_at":"2026-05-18T00:46:50.594773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.594773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Clustering: Objective Functions and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Frederik Mallmann-Trenn, Varun Kanade, Vincent Cohen-Addad","submitted_at":"2017-04-07T09:14:28Z","abstract_excerpt":"Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering was based on providing algorithms, rather than optimizing a specific objective, Dasgupta framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a `good' hierarchical clustering is one that minimizes some cost function. He showed that this cost function has certain desirable properties.\n  We take an axiomatic approach to defining `good' objective functions for both similarity a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02147","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":"1704.02147","created_at":"2026-05-18T00:46:50.594859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02147v1","created_at":"2026-05-18T00:46:50.594859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02147","created_at":"2026-05-18T00:46:50.594859+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7ZELRBVIDZO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7ZELRBVIDZOF6CM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7ZELRBV","created_at":"2026-05-18T12:31:12.930513+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/E7ZELRBVIDZOF6CM6XWEHOCSK5","json":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5.json","graph_json":"https://pith.science/api/pith-number/E7ZELRBVIDZOF6CM6XWEHOCSK5/graph.json","events_json":"https://pith.science/api/pith-number/E7ZELRBVIDZOF6CM6XWEHOCSK5/events.json","paper":"https://pith.science/paper/E7ZELRBV"},"agent_actions":{"view_html":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5","download_json":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5.json","view_paper":"https://pith.science/paper/E7ZELRBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02147&json=true","fetch_graph":"https://pith.science/api/pith-number/E7ZELRBVIDZOF6CM6XWEHOCSK5/graph.json","fetch_events":"https://pith.science/api/pith-number/E7ZELRBVIDZOF6CM6XWEHOCSK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/action/storage_attestation","attest_author":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/action/author_attestation","sign_citation":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/action/citation_signature","submit_replication":"https://pith.science/pith/E7ZELRBVIDZOF6CM6XWEHOCSK5/action/replication_record"}},"created_at":"2026-05-18T00:46:50.594859+00:00","updated_at":"2026-05-18T00:46:50.594859+00:00"}