{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YYQMHTUJM34PILBHO467XZFL6Z","short_pith_number":"pith:YYQMHTUJ","schema_version":"1.0","canonical_sha256":"c620c3ce8966f8f42c27773dfbe4abf67aaef4ba61502d7819101df7f45c0300","source":{"kind":"arxiv","id":"1201.1623","version":2},"attestation_state":"computed","paper":{"title":"MultiDendrograms: Variable-Group Agglomerative Hierarchical Clusterings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","physics.comp-ph","physics.data-an","q-fin.CP","stat.CO","stat.TH"],"primary_cat":"cs.IR","authors_text":"Alberto Fernandez, David Torres, Justo Montiel, Sergio Gomez","submitted_at":"2012-01-08T11:03:42Z","abstract_excerpt":"MultiDendrograms is a Java-written application that computes agglomerative hierarchical clusterings of data. Starting from a distances (or weights) matrix, MultiDendrograms is able to calculate its dendrograms using the most common agglomerative hierarchical clustering methods. The application implements a variable-group algorithm that solves the non-uniqueness problem found in the standard pair-group algorithm. This problem arises when two or more minimum distances between different clusters are equal during the agglomerative process, because then different output clusterings are possible dep"},"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":"1201.1623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-01-08T11:03:42Z","cross_cats_sorted":["math.ST","physics.comp-ph","physics.data-an","q-fin.CP","stat.CO","stat.TH"],"title_canon_sha256":"e2954f953d7a3f07aee4db584327653bd46a95a9d24a0504e785d49aacae362f","abstract_canon_sha256":"d053f780c6ea607245fcfed86c913cd773c266d7a27597aa56efd7ebfb7d73aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.746903Z","signature_b64":"hI/CxE8XsAwvJcggbhkE/m2jVvkbyWu2+HcBQAz2rCm9McADt2xiW/DxRBHaJj82U0d9lYGQsqVvmbxd4DfrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c620c3ce8966f8f42c27773dfbe4abf67aaef4ba61502d7819101df7f45c0300","last_reissued_at":"2026-05-18T02:21:18.746477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.746477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MultiDendrograms: Variable-Group Agglomerative Hierarchical Clusterings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","physics.comp-ph","physics.data-an","q-fin.CP","stat.CO","stat.TH"],"primary_cat":"cs.IR","authors_text":"Alberto Fernandez, David Torres, Justo Montiel, Sergio Gomez","submitted_at":"2012-01-08T11:03:42Z","abstract_excerpt":"MultiDendrograms is a Java-written application that computes agglomerative hierarchical clusterings of data. Starting from a distances (or weights) matrix, MultiDendrograms is able to calculate its dendrograms using the most common agglomerative hierarchical clustering methods. The application implements a variable-group algorithm that solves the non-uniqueness problem found in the standard pair-group algorithm. This problem arises when two or more minimum distances between different clusters are equal during the agglomerative process, because then different output clusterings are possible dep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1623","kind":"arxiv","version":2},"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":"1201.1623","created_at":"2026-05-18T02:21:18.746536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1623v2","created_at":"2026-05-18T02:21:18.746536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1623","created_at":"2026-05-18T02:21:18.746536+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYQMHTUJM34P","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYQMHTUJM34PILBH","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYQMHTUJ","created_at":"2026-05-18T12:27:30.460161+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/YYQMHTUJM34PILBHO467XZFL6Z","json":"https://pith.science/pith/YYQMHTUJM34PILBHO467XZFL6Z.json","graph_json":"https://pith.science/api/pith-number/YYQMHTUJM34PILBHO467XZFL6Z/graph.json","events_json":"https://pith.science/api/pith-number/YYQMHTUJM34PILBHO467XZFL6Z/events.json","paper":"https://pith.science/paper/YYQMHTUJ"},"agent_actions":{"view_html":"https://pith.science/pith/YYQMHTUJM34PILBHO467XZFL6Z","download_json":"https://pith.science/pith/YYQMHTUJM34PILBHO467XZFL6Z.json","view_paper":"https://pith.science/paper/YYQMHTUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1623&json=true","fetch_graph":"https://pith.science/api/pith-number/YYQMHTUJM34PILBHO467XZFL6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/YYQMHTUJM34PILBHO467XZFL6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYQMHTUJM34PILBHO467XZFL6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYQMHTUJM34PILBHO467XZFL6Z/action/storage_attestation","attest_author":"https://pith.science/pith/YYQMHTUJM34PILBHO467XZFL6Z/action/author_attestation","sign_citation":"https://pith.science/pith/YYQMHTUJM34PILBHO467XZFL6Z/action/citation_signature","submit_replication":"https://pith.science/pith/YYQMHTUJM34PILBHO467XZFL6Z/action/replication_record"}},"created_at":"2026-05-18T02:21:18.746536+00:00","updated_at":"2026-05-18T02:21:18.746536+00:00"}