{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OB3L2JZRNZSL3HNVPWJE5A7W4U","short_pith_number":"pith:OB3L2JZR","schema_version":"1.0","canonical_sha256":"7076bd27316e64bd9db57d924e83f6e50f7dc007318f415a375ae4137add7ae7","source":{"kind":"arxiv","id":"1901.05708","version":1},"attestation_state":"computed","paper":{"title":"Efficient Matrix Profile Computation Using Different Distance Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bertrand Cloez, Reza Akbarinia","submitted_at":"2019-01-17T10:05:37Z","abstract_excerpt":"Matrix profile has been recently proposed as a promising technique to the problem of all-pairs-similarity search on time series. Efficient algorithms have been proposed for computing it, e.g., STAMP, STOMP and SCRIMP++. All these algorithms use the z-normalized Euclidean distance to measure the distance between subsequences. However, as we observed, for some datasets other Euclidean measurements are more useful for knowledge discovery from time series. In this paper, we propose efficient algorithms for computing matrix profile for a general class of Euclidean distances. We first propose a simp"},"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":"1901.05708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-17T10:05:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"942797fbc1e248a96b27acb2fcf2850c3b840076b46e90d7f8271ac48b1c3fad","abstract_canon_sha256":"10804faf7a19eab2ec2c35b93359dd581da590a19bf3cca04a92cd2d2eef3ded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:06.345192Z","signature_b64":"jWDrusD0wgiNMB4FaxKSvsPH3bkPrN/dbmyz5XxaEM1dAGhrV0R5A2CczbUId9EVVl0lxaKq3BWx7DsS17s7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7076bd27316e64bd9db57d924e83f6e50f7dc007318f415a375ae4137add7ae7","last_reissued_at":"2026-05-17T23:56:06.344483Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:06.344483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Matrix Profile Computation Using Different Distance Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bertrand Cloez, Reza Akbarinia","submitted_at":"2019-01-17T10:05:37Z","abstract_excerpt":"Matrix profile has been recently proposed as a promising technique to the problem of all-pairs-similarity search on time series. Efficient algorithms have been proposed for computing it, e.g., STAMP, STOMP and SCRIMP++. All these algorithms use the z-normalized Euclidean distance to measure the distance between subsequences. However, as we observed, for some datasets other Euclidean measurements are more useful for knowledge discovery from time series. In this paper, we propose efficient algorithms for computing matrix profile for a general class of Euclidean distances. We first propose a simp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05708","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":"1901.05708","created_at":"2026-05-17T23:56:06.344626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05708v1","created_at":"2026-05-17T23:56:06.344626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05708","created_at":"2026-05-17T23:56:06.344626+00:00"},{"alias_kind":"pith_short_12","alias_value":"OB3L2JZRNZSL","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OB3L2JZRNZSL3HNV","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OB3L2JZR","created_at":"2026-05-18T12:33:24.271573+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/OB3L2JZRNZSL3HNVPWJE5A7W4U","json":"https://pith.science/pith/OB3L2JZRNZSL3HNVPWJE5A7W4U.json","graph_json":"https://pith.science/api/pith-number/OB3L2JZRNZSL3HNVPWJE5A7W4U/graph.json","events_json":"https://pith.science/api/pith-number/OB3L2JZRNZSL3HNVPWJE5A7W4U/events.json","paper":"https://pith.science/paper/OB3L2JZR"},"agent_actions":{"view_html":"https://pith.science/pith/OB3L2JZRNZSL3HNVPWJE5A7W4U","download_json":"https://pith.science/pith/OB3L2JZRNZSL3HNVPWJE5A7W4U.json","view_paper":"https://pith.science/paper/OB3L2JZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05708&json=true","fetch_graph":"https://pith.science/api/pith-number/OB3L2JZRNZSL3HNVPWJE5A7W4U/graph.json","fetch_events":"https://pith.science/api/pith-number/OB3L2JZRNZSL3HNVPWJE5A7W4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OB3L2JZRNZSL3HNVPWJE5A7W4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OB3L2JZRNZSL3HNVPWJE5A7W4U/action/storage_attestation","attest_author":"https://pith.science/pith/OB3L2JZRNZSL3HNVPWJE5A7W4U/action/author_attestation","sign_citation":"https://pith.science/pith/OB3L2JZRNZSL3HNVPWJE5A7W4U/action/citation_signature","submit_replication":"https://pith.science/pith/OB3L2JZRNZSL3HNVPWJE5A7W4U/action/replication_record"}},"created_at":"2026-05-17T23:56:06.344626+00:00","updated_at":"2026-05-17T23:56:06.344626+00:00"}