{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2DNTCPBRYEH7DYE4QJ4OJNDODV","short_pith_number":"pith:2DNTCPBR","schema_version":"1.0","canonical_sha256":"d0db313c31c10ff1e09c8278e4b46e1d6cfc677bcd187a9cfc77d65a5a028a1e","source":{"kind":"arxiv","id":"1105.0121","version":1},"attestation_state":"computed","paper":{"title":"Methods of Hierarchical Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IR","authors_text":"Fionn Murtagh, Pedro Contreras","submitted_at":"2011-04-30T21:29:08Z","abstract_excerpt":"We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we describe a recently developed very efficient (linear time) hierarchical clustering algorithm, which can also be viewed as a hierarchical grid-based algorithm."},"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":"1105.0121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-04-30T21:29:08Z","cross_cats_sorted":["cs.CV","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"2155761e93b0da022fa2686f8be7b3894aa2ab500d393eaf652d5df5dddbde77","abstract_canon_sha256":"0fd8e5464e1a51a1d7138bb3b9bb4ee0ac52e4bb25e868c8fbf441ebdbf6de63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:12.446462Z","signature_b64":"Hypg6ZuYRpmPOm0tiCYFqta7Ls6KvbEZKsb6SJliYVpZbuQMECNs2ExxDSHvwOgWI2SNl4iV5xn1hhViu99KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0db313c31c10ff1e09c8278e4b46e1d6cfc677bcd187a9cfc77d65a5a028a1e","last_reissued_at":"2026-05-18T04:23:12.445865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:12.445865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Methods of Hierarchical Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IR","authors_text":"Fionn Murtagh, Pedro Contreras","submitted_at":"2011-04-30T21:29:08Z","abstract_excerpt":"We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we describe a recently developed very efficient (linear time) hierarchical clustering algorithm, which can also be viewed as a hierarchical grid-based algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0121","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":"1105.0121","created_at":"2026-05-18T04:23:12.445956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0121v1","created_at":"2026-05-18T04:23:12.445956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0121","created_at":"2026-05-18T04:23:12.445956+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DNTCPBRYEH7","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DNTCPBRYEH7DYE4","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DNTCPBR","created_at":"2026-05-18T12:26:18.847500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03946","citing_title":"Automatic Multi-level Feature Tree Construction for Domain-Specific Reusable Artifacts Management","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV","json":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV.json","graph_json":"https://pith.science/api/pith-number/2DNTCPBRYEH7DYE4QJ4OJNDODV/graph.json","events_json":"https://pith.science/api/pith-number/2DNTCPBRYEH7DYE4QJ4OJNDODV/events.json","paper":"https://pith.science/paper/2DNTCPBR"},"agent_actions":{"view_html":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV","download_json":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV.json","view_paper":"https://pith.science/paper/2DNTCPBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0121&json=true","fetch_graph":"https://pith.science/api/pith-number/2DNTCPBRYEH7DYE4QJ4OJNDODV/graph.json","fetch_events":"https://pith.science/api/pith-number/2DNTCPBRYEH7DYE4QJ4OJNDODV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV/action/storage_attestation","attest_author":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV/action/author_attestation","sign_citation":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV/action/citation_signature","submit_replication":"https://pith.science/pith/2DNTCPBRYEH7DYE4QJ4OJNDODV/action/replication_record"}},"created_at":"2026-05-18T04:23:12.445956+00:00","updated_at":"2026-05-18T04:23:12.445956+00:00"}