{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RNCNFPOJ42FVQ3KTSHQTLASKPQ","short_pith_number":"pith:RNCNFPOJ","schema_version":"1.0","canonical_sha256":"8b44d2bdc9e68b586d5391e135824a7c095f870c920c6da934d4566ffd5f38f4","source":{"kind":"arxiv","id":"1601.02213","version":1},"attestation_state":"computed","paper":{"title":"On Clustering Time Series Using Euclidean Distance and Pearson Correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Frank H\\\"oppner, Michael R. Berthold","submitted_at":"2016-01-10T13:17:46Z","abstract_excerpt":"For time series comparisons, it has often been observed that z-score normalized Euclidean distances far outperform the unnormalized variant. In this paper we show that a z-score normalized, squared Euclidean Distance is, in fact, equal to a distance based on Pearson Correlation. This has profound impact on many distance-based classification or clustering methods. In addition to this theoretically sound result we also show that the often used k-Means algorithm formally needs a mod ification to keep the interpretation as Pearson correlation strictly valid. Experimental results demonstrate that i"},"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":"1601.02213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-10T13:17:46Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"6c16299989639cb172008c14e58c3353835c8278bdc28ad5913d632e912255b1","abstract_canon_sha256":"0c15bee4eff2238cd6587e0660dc3788d7ca72b2844c125cbdfc1d9ae82e589f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:06.981456Z","signature_b64":"imjz9+93Z7jacXjObU0yAoopekSER+//6PqW5xkYgA0/60RaPvWtVkUz4xC3gkHLSg2BMMFCFx7V6UgDPn1+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b44d2bdc9e68b586d5391e135824a7c095f870c920c6da934d4566ffd5f38f4","last_reissued_at":"2026-05-18T01:23:06.980988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:06.980988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Clustering Time Series Using Euclidean Distance and Pearson Correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Frank H\\\"oppner, Michael R. Berthold","submitted_at":"2016-01-10T13:17:46Z","abstract_excerpt":"For time series comparisons, it has often been observed that z-score normalized Euclidean distances far outperform the unnormalized variant. In this paper we show that a z-score normalized, squared Euclidean Distance is, in fact, equal to a distance based on Pearson Correlation. This has profound impact on many distance-based classification or clustering methods. In addition to this theoretically sound result we also show that the often used k-Means algorithm formally needs a mod ification to keep the interpretation as Pearson correlation strictly valid. Experimental results demonstrate that i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02213","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":"1601.02213","created_at":"2026-05-18T01:23:06.981067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02213v1","created_at":"2026-05-18T01:23:06.981067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02213","created_at":"2026-05-18T01:23:06.981067+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNCNFPOJ42FV","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNCNFPOJ42FVQ3KT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNCNFPOJ","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22365","citing_title":"TimeGuard: Channel-wise Pool Training for Backdoor Defense in Time Series Forecasting","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ","json":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ.json","graph_json":"https://pith.science/api/pith-number/RNCNFPOJ42FVQ3KTSHQTLASKPQ/graph.json","events_json":"https://pith.science/api/pith-number/RNCNFPOJ42FVQ3KTSHQTLASKPQ/events.json","paper":"https://pith.science/paper/RNCNFPOJ"},"agent_actions":{"view_html":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ","download_json":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ.json","view_paper":"https://pith.science/paper/RNCNFPOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02213&json=true","fetch_graph":"https://pith.science/api/pith-number/RNCNFPOJ42FVQ3KTSHQTLASKPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RNCNFPOJ42FVQ3KTSHQTLASKPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ/action/storage_attestation","attest_author":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ/action/author_attestation","sign_citation":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ/action/citation_signature","submit_replication":"https://pith.science/pith/RNCNFPOJ42FVQ3KTSHQTLASKPQ/action/replication_record"}},"created_at":"2026-05-18T01:23:06.981067+00:00","updated_at":"2026-05-18T01:23:06.981067+00:00"}