{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QTGDEBC6K3NTXAAPEZL4WSWIQX","short_pith_number":"pith:QTGDEBC6","schema_version":"1.0","canonical_sha256":"84cc32045e56db3b800f2657cb4ac885fa32936577e19eface0a9de7b258783d","source":{"kind":"arxiv","id":"1502.02512","version":1},"attestation_state":"computed","paper":{"title":"The Adaptive Mean-Linkage Algorithm: A Bottom-Up Hierarchical Cluster Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP"],"primary_cat":"stat.ME","authors_text":"H.M. de Oliveira","submitted_at":"2015-02-09T14:57:58Z","abstract_excerpt":"In this paper a variant of the classical hierarchical cluster analysis is reported. This agglomerative (bottom-up) cluster technique is referred to as the Adaptive Mean-Linkage Algorithm. It can be interpreted as a linkage algorithm where the value of the threshold is conveniently up-dated at each interaction. The superiority of the adaptive clustering with respect to the average-linkage algorithm follows because it achieves a good compromise on threshold values: Thresholds based on the cut-off distance are sufficiently small to assure the homogeneity and also large enough to guarantee at leas"},"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":"1502.02512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-02-09T14:57:58Z","cross_cats_sorted":["cs.LG","stat.AP"],"title_canon_sha256":"1cc05c798d96b3597c31ac0511baf10d970fd77c2336862a2675ff602516a017","abstract_canon_sha256":"76686d1fa56d94b685892f65bf07e915f9c923ea6638e796f359ddd9cce46a15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.050977Z","signature_b64":"cYH69KQNMooMRwHsKLvHTJ/rVMlwb5K6cxw78Pbc1tvGxXkKesCShzMwXmZjh96iHOE+FIY+DIAiLPfTQH2hAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84cc32045e56db3b800f2657cb4ac885fa32936577e19eface0a9de7b258783d","last_reissued_at":"2026-05-18T02:27:42.050202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.050202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Adaptive Mean-Linkage Algorithm: A Bottom-Up Hierarchical Cluster Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP"],"primary_cat":"stat.ME","authors_text":"H.M. de Oliveira","submitted_at":"2015-02-09T14:57:58Z","abstract_excerpt":"In this paper a variant of the classical hierarchical cluster analysis is reported. This agglomerative (bottom-up) cluster technique is referred to as the Adaptive Mean-Linkage Algorithm. It can be interpreted as a linkage algorithm where the value of the threshold is conveniently up-dated at each interaction. The superiority of the adaptive clustering with respect to the average-linkage algorithm follows because it achieves a good compromise on threshold values: Thresholds based on the cut-off distance are sufficiently small to assure the homogeneity and also large enough to guarantee at leas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02512","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":"1502.02512","created_at":"2026-05-18T02:27:42.050339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02512v1","created_at":"2026-05-18T02:27:42.050339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02512","created_at":"2026-05-18T02:27:42.050339+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTGDEBC6K3NT","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTGDEBC6K3NTXAAP","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTGDEBC6","created_at":"2026-05-18T12:29:37.295048+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/QTGDEBC6K3NTXAAPEZL4WSWIQX","json":"https://pith.science/pith/QTGDEBC6K3NTXAAPEZL4WSWIQX.json","graph_json":"https://pith.science/api/pith-number/QTGDEBC6K3NTXAAPEZL4WSWIQX/graph.json","events_json":"https://pith.science/api/pith-number/QTGDEBC6K3NTXAAPEZL4WSWIQX/events.json","paper":"https://pith.science/paper/QTGDEBC6"},"agent_actions":{"view_html":"https://pith.science/pith/QTGDEBC6K3NTXAAPEZL4WSWIQX","download_json":"https://pith.science/pith/QTGDEBC6K3NTXAAPEZL4WSWIQX.json","view_paper":"https://pith.science/paper/QTGDEBC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02512&json=true","fetch_graph":"https://pith.science/api/pith-number/QTGDEBC6K3NTXAAPEZL4WSWIQX/graph.json","fetch_events":"https://pith.science/api/pith-number/QTGDEBC6K3NTXAAPEZL4WSWIQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTGDEBC6K3NTXAAPEZL4WSWIQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTGDEBC6K3NTXAAPEZL4WSWIQX/action/storage_attestation","attest_author":"https://pith.science/pith/QTGDEBC6K3NTXAAPEZL4WSWIQX/action/author_attestation","sign_citation":"https://pith.science/pith/QTGDEBC6K3NTXAAPEZL4WSWIQX/action/citation_signature","submit_replication":"https://pith.science/pith/QTGDEBC6K3NTXAAPEZL4WSWIQX/action/replication_record"}},"created_at":"2026-05-18T02:27:42.050339+00:00","updated_at":"2026-05-18T02:27:42.050339+00:00"}