{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C4F7DF5AO7JMBNIZAKRX34JYHZ","short_pith_number":"pith:C4F7DF5A","schema_version":"1.0","canonical_sha256":"170bf197a077d2c0b51902a37df1383e40f5359d51fed52cabdc1e0394675860","source":{"kind":"arxiv","id":"1907.05094","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Ward's Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.LG"],"primary_cat":"cs.DS","authors_text":"Anna Gro{\\ss}wendt, Heiko R\\\"oglin, Melanie Schmidt","submitted_at":"2019-07-11T10:35:03Z","abstract_excerpt":"We study Ward's method for the hierarchical $k$-means problem. This popular greedy heuristic is based on the \\emph{complete linkage} paradigm: Starting with all data points as singleton clusters, it successively merges two clusters to form a clustering with one cluster less. The pair of clusters is chosen to (locally) minimize the $k$-means cost of the clustering in the next step.\n  Complete linkage algorithms are very popular for hierarchical clustering problems, yet their theoretical properties have been studied relatively little. For the Euclidean $k$-center problem, Ackermann et al. show t"},"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":"1907.05094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T10:35:03Z","cross_cats_sorted":["cs.CG","cs.LG"],"title_canon_sha256":"af08700018cd26d53832eca7e7ea2272e1fb8fafe87ea6d24dcb3c830bde5f4b","abstract_canon_sha256":"ce7148ff00b18ad1e0fd662a255d270dc667974b815e1ff42fa1cba604c86b39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:53.957979Z","signature_b64":"XJle4SXqE9q3iO330QA5pUG1KpKWQ0ZdZA8y+CIBOcxDUQG8kyIR2I43+MnaYygkCnqeT5BS6mZNNbScJRvzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"170bf197a077d2c0b51902a37df1383e40f5359d51fed52cabdc1e0394675860","last_reissued_at":"2026-05-17T23:40:53.957230Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:53.957230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Ward's Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.LG"],"primary_cat":"cs.DS","authors_text":"Anna Gro{\\ss}wendt, Heiko R\\\"oglin, Melanie Schmidt","submitted_at":"2019-07-11T10:35:03Z","abstract_excerpt":"We study Ward's method for the hierarchical $k$-means problem. This popular greedy heuristic is based on the \\emph{complete linkage} paradigm: Starting with all data points as singleton clusters, it successively merges two clusters to form a clustering with one cluster less. The pair of clusters is chosen to (locally) minimize the $k$-means cost of the clustering in the next step.\n  Complete linkage algorithms are very popular for hierarchical clustering problems, yet their theoretical properties have been studied relatively little. For the Euclidean $k$-center problem, Ackermann et al. show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05094","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":"1907.05094","created_at":"2026-05-17T23:40:53.957342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05094v1","created_at":"2026-05-17T23:40:53.957342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05094","created_at":"2026-05-17T23:40:53.957342+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4F7DF5AO7JM","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4F7DF5AO7JMBNIZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4F7DF5A","created_at":"2026-05-18T12:33:12.712433+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/C4F7DF5AO7JMBNIZAKRX34JYHZ","json":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ.json","graph_json":"https://pith.science/api/pith-number/C4F7DF5AO7JMBNIZAKRX34JYHZ/graph.json","events_json":"https://pith.science/api/pith-number/C4F7DF5AO7JMBNIZAKRX34JYHZ/events.json","paper":"https://pith.science/paper/C4F7DF5A"},"agent_actions":{"view_html":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ","download_json":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ.json","view_paper":"https://pith.science/paper/C4F7DF5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05094&json=true","fetch_graph":"https://pith.science/api/pith-number/C4F7DF5AO7JMBNIZAKRX34JYHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/C4F7DF5AO7JMBNIZAKRX34JYHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/action/storage_attestation","attest_author":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/action/author_attestation","sign_citation":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/action/citation_signature","submit_replication":"https://pith.science/pith/C4F7DF5AO7JMBNIZAKRX34JYHZ/action/replication_record"}},"created_at":"2026-05-17T23:40:53.957342+00:00","updated_at":"2026-05-17T23:40:53.957342+00:00"}