{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZC3GCNN5DQRESXXT7UJ5ZNTEFX","short_pith_number":"pith:ZC3GCNN5","schema_version":"1.0","canonical_sha256":"c8b66135bd1c22495ef3fd13dcb6642dc2fbc5689ae203bc3a75a21f0b72ae08","source":{"kind":"arxiv","id":"1812.10582","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Clustering for Euclidean Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigory Yaroslavtsev, Moses Charikar, Rad Niazadeh, Vaggos Chatziafratis","submitted_at":"2018-12-27T00:49:30Z","abstract_excerpt":"Recent works on Hierarchical Clustering (HC), a well-studied problem in exploratory data analysis, have focused on optimizing various objective functions for this problem under arbitrary similarity measures. In this paper we take the first step and give novel scalable algorithms for this problem tailored to Euclidean data in R^d and under vector-based similarity measures, a prevalent model in several typical machine learning applications. We focus primarily on the popular Gaussian kernel and other related measures, presenting our results through the lens of the objective introduced recently by"},"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.10582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-27T00:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"a4756f85e425c4f3a7502f6b9dc63bee9c0d13fb229a14b67814c0926d1d1d06","abstract_canon_sha256":"f091bde47ba6513ec93bcbc95527d3a242e23e65eb75814d13f373fc4e3e4e32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:20.590606Z","signature_b64":"wuz0eyeh4J34WJwovRZXKlc0k5HSgDm4BQu1sFswWi04mbCtYp2LH0Q7LhdC9CjEhyGkYb2pusnfQOgbNltnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b66135bd1c22495ef3fd13dcb6642dc2fbc5689ae203bc3a75a21f0b72ae08","last_reissued_at":"2026-05-17T23:57:20.589867Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:20.589867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Clustering for Euclidean Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigory Yaroslavtsev, Moses Charikar, Rad Niazadeh, Vaggos Chatziafratis","submitted_at":"2018-12-27T00:49:30Z","abstract_excerpt":"Recent works on Hierarchical Clustering (HC), a well-studied problem in exploratory data analysis, have focused on optimizing various objective functions for this problem under arbitrary similarity measures. In this paper we take the first step and give novel scalable algorithms for this problem tailored to Euclidean data in R^d and under vector-based similarity measures, a prevalent model in several typical machine learning applications. We focus primarily on the popular Gaussian kernel and other related measures, presenting our results through the lens of the objective introduced recently by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10582","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.10582","created_at":"2026-05-17T23:57:20.589999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10582v1","created_at":"2026-05-17T23:57:20.589999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10582","created_at":"2026-05-17T23:57:20.589999+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZC3GCNN5DQRE","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZC3GCNN5DQRESXXT","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZC3GCNN5","created_at":"2026-05-18T12:33:04.347982+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/ZC3GCNN5DQRESXXT7UJ5ZNTEFX","json":"https://pith.science/pith/ZC3GCNN5DQRESXXT7UJ5ZNTEFX.json","graph_json":"https://pith.science/api/pith-number/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/graph.json","events_json":"https://pith.science/api/pith-number/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/events.json","paper":"https://pith.science/paper/ZC3GCNN5"},"agent_actions":{"view_html":"https://pith.science/pith/ZC3GCNN5DQRESXXT7UJ5ZNTEFX","download_json":"https://pith.science/pith/ZC3GCNN5DQRESXXT7UJ5ZNTEFX.json","view_paper":"https://pith.science/paper/ZC3GCNN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10582&json=true","fetch_graph":"https://pith.science/api/pith-number/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/action/storage_attestation","attest_author":"https://pith.science/pith/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/action/author_attestation","sign_citation":"https://pith.science/pith/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/action/citation_signature","submit_replication":"https://pith.science/pith/ZC3GCNN5DQRESXXT7UJ5ZNTEFX/action/replication_record"}},"created_at":"2026-05-17T23:57:20.589999+00:00","updated_at":"2026-05-17T23:57:20.589999+00:00"}