{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BHLQTCJJTLTX7PDODMVPIP74OZ","short_pith_number":"pith:BHLQTCJJ","schema_version":"1.0","canonical_sha256":"09d70989299ae77fbc6e1b2af43ffc767d83935ab549663ad5507421e959a7f6","source":{"kind":"arxiv","id":"1612.00637","version":1},"attestation_state":"computed","paper":{"title":"A General Framework for Density Based Time Series Clustering Exploiting a Novel Admissible Pruning Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eamonn Keogh, Hoang Anh Dau, Jun Wang, Liudmila Ulanova, Nurjahan Begum","submitted_at":"2016-12-02T11:27:44Z","abstract_excerpt":"Time Series Clustering is an important subroutine in many higher-level data mining analyses, including data editing for classifiers, summarization, and outlier detection. It is well known that for similarity search the superiority of Dynamic Time Warping (DTW) over Euclidean distance gradually diminishes as we consider ever larger datasets. However, as we shall show, the same is not true for clustering. Clustering time series under DTW remains a computationally expensive operation. In this work, we address this issue in two ways. We propose a novel pruning strategy that exploits both the upper"},"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":"1612.00637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-02T11:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"abd21392596d9a420711e0cae05bc58d28c1d1e404036a72670770be6ae1d06c","abstract_canon_sha256":"e8776787ba69ef367ce69a2389d91e6212386b4ab5547bd0e73a33d3d2b871de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:59.441588Z","signature_b64":"joxGTtyB/h+yKEsv/bo4pXUKViVYxsqmeMaVT22xD7I6O5U9arQoW5H462v6sPQxdJyYBFzYgrjDmQbh6XoLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09d70989299ae77fbc6e1b2af43ffc767d83935ab549663ad5507421e959a7f6","last_reissued_at":"2026-05-18T00:55:59.440848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:59.440848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Framework for Density Based Time Series Clustering Exploiting a Novel Admissible Pruning Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eamonn Keogh, Hoang Anh Dau, Jun Wang, Liudmila Ulanova, Nurjahan Begum","submitted_at":"2016-12-02T11:27:44Z","abstract_excerpt":"Time Series Clustering is an important subroutine in many higher-level data mining analyses, including data editing for classifiers, summarization, and outlier detection. It is well known that for similarity search the superiority of Dynamic Time Warping (DTW) over Euclidean distance gradually diminishes as we consider ever larger datasets. However, as we shall show, the same is not true for clustering. Clustering time series under DTW remains a computationally expensive operation. In this work, we address this issue in two ways. We propose a novel pruning strategy that exploits both the upper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00637","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":"1612.00637","created_at":"2026-05-18T00:55:59.440965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00637v1","created_at":"2026-05-18T00:55:59.440965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00637","created_at":"2026-05-18T00:55:59.440965+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHLQTCJJTLTX","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHLQTCJJTLTX7PDO","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHLQTCJJ","created_at":"2026-05-18T12:30:07.202191+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/BHLQTCJJTLTX7PDODMVPIP74OZ","json":"https://pith.science/pith/BHLQTCJJTLTX7PDODMVPIP74OZ.json","graph_json":"https://pith.science/api/pith-number/BHLQTCJJTLTX7PDODMVPIP74OZ/graph.json","events_json":"https://pith.science/api/pith-number/BHLQTCJJTLTX7PDODMVPIP74OZ/events.json","paper":"https://pith.science/paper/BHLQTCJJ"},"agent_actions":{"view_html":"https://pith.science/pith/BHLQTCJJTLTX7PDODMVPIP74OZ","download_json":"https://pith.science/pith/BHLQTCJJTLTX7PDODMVPIP74OZ.json","view_paper":"https://pith.science/paper/BHLQTCJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00637&json=true","fetch_graph":"https://pith.science/api/pith-number/BHLQTCJJTLTX7PDODMVPIP74OZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BHLQTCJJTLTX7PDODMVPIP74OZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHLQTCJJTLTX7PDODMVPIP74OZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHLQTCJJTLTX7PDODMVPIP74OZ/action/storage_attestation","attest_author":"https://pith.science/pith/BHLQTCJJTLTX7PDODMVPIP74OZ/action/author_attestation","sign_citation":"https://pith.science/pith/BHLQTCJJTLTX7PDODMVPIP74OZ/action/citation_signature","submit_replication":"https://pith.science/pith/BHLQTCJJTLTX7PDODMVPIP74OZ/action/replication_record"}},"created_at":"2026-05-18T00:55:59.440965+00:00","updated_at":"2026-05-18T00:55:59.440965+00:00"}