{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FKRI6HVCYOSSANVUGYW7IXSR56","short_pith_number":"pith:FKRI6HVC","canonical_record":{"source":{"id":"1903.03003","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-07T15:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"3617f3065446af448e5c68b4cdbef75c8796a664cefa8692e9808df8d969714f","abstract_canon_sha256":"b87784c28abd8376df98ae3b6dc9e46b1061733bc6661e27c00a4ec7e64e1bef"},"schema_version":"1.0"},"canonical_sha256":"2aa28f1ea2c3a52036b4362df45e51efbcad9510b40f3f7874179416042232a7","source":{"kind":"arxiv","id":"1903.03003","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03003","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03003v5","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03003","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"pith_short_12","alias_value":"FKRI6HVCYOSS","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"pith_short_16","alias_value":"FKRI6HVCYOSSANVU","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"pith_short_8","alias_value":"FKRI6HVC","created_at":"2026-07-05T00:55:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FKRI6HVCYOSSANVUGYW7IXSR56","target":"record","payload":{"canonical_record":{"source":{"id":"1903.03003","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-07T15:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"3617f3065446af448e5c68b4cdbef75c8796a664cefa8692e9808df8d969714f","abstract_canon_sha256":"b87784c28abd8376df98ae3b6dc9e46b1061733bc6661e27c00a4ec7e64e1bef"},"schema_version":"1.0"},"canonical_sha256":"2aa28f1ea2c3a52036b4362df45e51efbcad9510b40f3f7874179416042232a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:56.583952Z","signature_b64":"qVJKHIYgbr55JjZnz3mAat3wILEN/FQG+t3e6S8sLpM/ppx4LO3EYtH2b76L9bu1bUSno+h5rsV+lEPmcjUgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aa28f1ea2c3a52036b4362df45e51efbcad9510b40f3f7874179416042232a7","last_reissued_at":"2026-07-05T00:55:56.583486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:56.583486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.03003","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:55:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+llg43ca8K2qBwafdLBHLUNIZKPIQ5ocNEsedfoEUpuRK9pO2TII6V+AoWzSPqcjc1yOymN1mpwTN9/mV+rCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T14:18:34.284803Z"},"content_sha256":"4b7e7a66b95bb1d077160539b3a928167a6aba304c84ab4bf8edc7e55f0632d9","schema_version":"1.0","event_id":"sha256:4b7e7a66b95bb1d077160539b3a928167a6aba304c84ab4bf8edc7e55f0632d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FKRI6HVCYOSSANVUGYW7IXSR56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Brijnesh Jain, Maciej Rymar, Mathias Weller, Vincent Froese","submitted_at":"2019-03-07T15:46:20Z","abstract_excerpt":"Dynamic Time Warping (DTW) is a well-known similarity measure for time series. The standard dynamic programming approach to compute the DTW distance of two length-$n$ time series, however, requires~$O(n^2)$ time, which is often too slow for real-world applications. Therefore, many heuristics have been proposed to speed up the DTW computation. These are often based on lower bounding techniques, approximating the DTW distance, or considering special input data such as binary or piecewise constant time series. In this paper, we present a first exact algorithm to compute the DTW distance of two ru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03003","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.03003/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:55:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSDjSzMbCie0HhgHrz/KbnXvpzcDy9nxJtkiwlKwt1zS64FnCeBHBHwbmqL5Jk+geIMtirVCRb85hpMQ8oZXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T14:18:34.285172Z"},"content_sha256":"a14b66e31b51beb2dd3c55ff22c7f47e081fbd9625a0a54bc7ec324807a6c23e","schema_version":"1.0","event_id":"sha256:a14b66e31b51beb2dd3c55ff22c7f47e081fbd9625a0a54bc7ec324807a6c23e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKRI6HVCYOSSANVUGYW7IXSR56/bundle.json","state_url":"https://pith.science/pith/FKRI6HVCYOSSANVUGYW7IXSR56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKRI6HVCYOSSANVUGYW7IXSR56/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-10T14:18:34Z","links":{"resolver":"https://pith.science/pith/FKRI6HVCYOSSANVUGYW7IXSR56","bundle":"https://pith.science/pith/FKRI6HVCYOSSANVUGYW7IXSR56/bundle.json","state":"https://pith.science/pith/FKRI6HVCYOSSANVUGYW7IXSR56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKRI6HVCYOSSANVUGYW7IXSR56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FKRI6HVCYOSSANVUGYW7IXSR56","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b87784c28abd8376df98ae3b6dc9e46b1061733bc6661e27c00a4ec7e64e1bef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-07T15:46:20Z","title_canon_sha256":"3617f3065446af448e5c68b4cdbef75c8796a664cefa8692e9808df8d969714f"},"schema_version":"1.0","source":{"id":"1903.03003","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03003","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03003v5","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03003","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"pith_short_12","alias_value":"FKRI6HVCYOSS","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"pith_short_16","alias_value":"FKRI6HVCYOSSANVU","created_at":"2026-07-05T00:55:56Z"},{"alias_kind":"pith_short_8","alias_value":"FKRI6HVC","created_at":"2026-07-05T00:55:56Z"}],"graph_snapshots":[{"event_id":"sha256:a14b66e31b51beb2dd3c55ff22c7f47e081fbd9625a0a54bc7ec324807a6c23e","target":"graph","created_at":"2026-07-05T00:55:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.03003/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic Time Warping (DTW) is a well-known similarity measure for time series. The standard dynamic programming approach to compute the DTW distance of two length-$n$ time series, however, requires~$O(n^2)$ time, which is often too slow for real-world applications. Therefore, many heuristics have been proposed to speed up the DTW computation. These are often based on lower bounding techniques, approximating the DTW distance, or considering special input data such as binary or piecewise constant time series. In this paper, we present a first exact algorithm to compute the DTW distance of two ru","authors_text":"Brijnesh Jain, Maciej Rymar, Mathias Weller, Vincent Froese","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-07T15:46:20Z","title":"Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03003","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b7e7a66b95bb1d077160539b3a928167a6aba304c84ab4bf8edc7e55f0632d9","target":"record","created_at":"2026-07-05T00:55:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b87784c28abd8376df98ae3b6dc9e46b1061733bc6661e27c00a4ec7e64e1bef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-07T15:46:20Z","title_canon_sha256":"3617f3065446af448e5c68b4cdbef75c8796a664cefa8692e9808df8d969714f"},"schema_version":"1.0","source":{"id":"1903.03003","kind":"arxiv","version":5}},"canonical_sha256":"2aa28f1ea2c3a52036b4362df45e51efbcad9510b40f3f7874179416042232a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aa28f1ea2c3a52036b4362df45e51efbcad9510b40f3f7874179416042232a7","first_computed_at":"2026-07-05T00:55:56.583486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:55:56.583486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qVJKHIYgbr55JjZnz3mAat3wILEN/FQG+t3e6S8sLpM/ppx4LO3EYtH2b76L9bu1bUSno+h5rsV+lEPmcjUgDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:55:56.583952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03003","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b7e7a66b95bb1d077160539b3a928167a6aba304c84ab4bf8edc7e55f0632d9","sha256:a14b66e31b51beb2dd3c55ff22c7f47e081fbd9625a0a54bc7ec324807a6c23e"],"state_sha256":"d3426ce39d959f995ae0f30778080a62c7ff4a875023c765a3c419d1e614fcc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6ke1v4oOBUoAkgP0JcEgV61XwXbIv9TkjBey2Us10nZUNlcWh/TZXYkvGZVXvxMZpJz7KEQ8pu+qUKM2VjKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T14:18:34.287424Z","bundle_sha256":"e79eaab99e46dfe077261fc213656eee91667ea1534d0f48a75bb0b1f85c9868"}}