{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X4SLD7R3UAQUM7KRIRBDM3Q7EG","short_pith_number":"pith:X4SLD7R3","canonical_record":{"source":{"id":"1808.09617","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-08-29T03:22:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8aedb4d25a623617a49bcae45e429477621ff9b00493a7ed4b28042b5fa193d4","abstract_canon_sha256":"57ca7667b8ae9c3fa0d86998dc378592fb010381b11af383973131dad4a3457b"},"schema_version":"1.0"},"canonical_sha256":"bf24b1fe3ba021467d514442366e1f21af3d5abf8bf250e8e710dcfad9a13dab","source":{"kind":"arxiv","id":"1808.09617","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09617","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09617v3","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09617","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"X4SLD7R3UAQU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X4SLD7R3UAQUM7KR","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X4SLD7R3","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X4SLD7R3UAQUM7KRIRBDM3Q7EG","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09617","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-08-29T03:22:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8aedb4d25a623617a49bcae45e429477621ff9b00493a7ed4b28042b5fa193d4","abstract_canon_sha256":"57ca7667b8ae9c3fa0d86998dc378592fb010381b11af383973131dad4a3457b"},"schema_version":"1.0"},"canonical_sha256":"bf24b1fe3ba021467d514442366e1f21af3d5abf8bf250e8e710dcfad9a13dab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:02.654972Z","signature_b64":"YeGQqvBbRadjbdc6jmysSjIRAosV79ZtJSY3nLJ4TX1gt9aASU6mOtUli5KJhqVJuyDkJIIZuBMbLP/8tQShCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf24b1fe3ba021467d514442366e1f21af3d5abf8bf250e8e710dcfad9a13dab","last_reissued_at":"2026-05-17T23:54:02.654281Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:02.654281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09617","source_version":3,"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-05-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hyxcCKnRCshGvNkOrhUwh6tDiN69ArRNDPTOFBDypCHK/aH/4ik6rb0WD1dMI7bw1mlMxFJMVfldCrNdnIjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:46:19.401159Z"},"content_sha256":"11c49d83a185fe7a53ff0ad5a7718a86f0445b977ffd25127f5082ea8e1b14dd","schema_version":"1.0","event_id":"sha256:11c49d83a185fe7a53ff0ad5a7718a86f0445b977ffd25127f5082ea8e1b14dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X4SLD7R3UAQUM7KRIRBDM3Q7EG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Elastic bands across the path: A new framework and methods to lower bound DTW","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chang Wei Tan, Francois Petitjean, Geoffrey I. Webb","submitted_at":"2018-08-29T03:22:47Z","abstract_excerpt":"There has been renewed recent interest in developing effective lower bounds for Dynamic Time Warping (DTW) distance between time series. These have many applications in time series indexing, clustering, forecasting, regression and classification. One of the key time series classification algorithms, the nearest neighbor algorithm with DTW distance (NN-DTW) is very expensive to compute, due to the quadratic complexity of DTW. Lower bound search can speed up NN-DTW substantially. An effective and tight lower bound quickly prunes off unpromising nearest neighbor candidates from the search space a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09617","kind":"arxiv","version":3},"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"},"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-05-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oz5U2t2hMH8w7Ezb4PTjJ5a0ZEquAxgeOultmVcdgMRrhRSBVJsAiOTFvZKdzhqqWO+oYEa2oXHW6HqROMXvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:46:19.401817Z"},"content_sha256":"bdecb1643687f66f21136bc66b27cec5583af7771e6364b80cef0049ba46cb52","schema_version":"1.0","event_id":"sha256:bdecb1643687f66f21136bc66b27cec5583af7771e6364b80cef0049ba46cb52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4SLD7R3UAQUM7KRIRBDM3Q7EG/bundle.json","state_url":"https://pith.science/pith/X4SLD7R3UAQUM7KRIRBDM3Q7EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4SLD7R3UAQUM7KRIRBDM3Q7EG/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-05-28T18:46:19Z","links":{"resolver":"https://pith.science/pith/X4SLD7R3UAQUM7KRIRBDM3Q7EG","bundle":"https://pith.science/pith/X4SLD7R3UAQUM7KRIRBDM3Q7EG/bundle.json","state":"https://pith.science/pith/X4SLD7R3UAQUM7KRIRBDM3Q7EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4SLD7R3UAQUM7KRIRBDM3Q7EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X4SLD7R3UAQUM7KRIRBDM3Q7EG","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":"57ca7667b8ae9c3fa0d86998dc378592fb010381b11af383973131dad4a3457b","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-08-29T03:22:47Z","title_canon_sha256":"8aedb4d25a623617a49bcae45e429477621ff9b00493a7ed4b28042b5fa193d4"},"schema_version":"1.0","source":{"id":"1808.09617","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09617","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09617v3","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09617","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"X4SLD7R3UAQU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X4SLD7R3UAQUM7KR","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X4SLD7R3","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:bdecb1643687f66f21136bc66b27cec5583af7771e6364b80cef0049ba46cb52","target":"graph","created_at":"2026-05-17T23:54:02Z","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"},"paper":{"abstract_excerpt":"There has been renewed recent interest in developing effective lower bounds for Dynamic Time Warping (DTW) distance between time series. These have many applications in time series indexing, clustering, forecasting, regression and classification. One of the key time series classification algorithms, the nearest neighbor algorithm with DTW distance (NN-DTW) is very expensive to compute, due to the quadratic complexity of DTW. Lower bound search can speed up NN-DTW substantially. An effective and tight lower bound quickly prunes off unpromising nearest neighbor candidates from the search space a","authors_text":"Chang Wei Tan, Francois Petitjean, Geoffrey I. Webb","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-08-29T03:22:47Z","title":"Elastic bands across the path: A new framework and methods to lower bound DTW"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09617","kind":"arxiv","version":3},"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:11c49d83a185fe7a53ff0ad5a7718a86f0445b977ffd25127f5082ea8e1b14dd","target":"record","created_at":"2026-05-17T23:54:02Z","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":"57ca7667b8ae9c3fa0d86998dc378592fb010381b11af383973131dad4a3457b","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-08-29T03:22:47Z","title_canon_sha256":"8aedb4d25a623617a49bcae45e429477621ff9b00493a7ed4b28042b5fa193d4"},"schema_version":"1.0","source":{"id":"1808.09617","kind":"arxiv","version":3}},"canonical_sha256":"bf24b1fe3ba021467d514442366e1f21af3d5abf8bf250e8e710dcfad9a13dab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf24b1fe3ba021467d514442366e1f21af3d5abf8bf250e8e710dcfad9a13dab","first_computed_at":"2026-05-17T23:54:02.654281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:02.654281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YeGQqvBbRadjbdc6jmysSjIRAosV79ZtJSY3nLJ4TX1gt9aASU6mOtUli5KJhqVJuyDkJIIZuBMbLP/8tQShCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:02.654972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09617","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11c49d83a185fe7a53ff0ad5a7718a86f0445b977ffd25127f5082ea8e1b14dd","sha256:bdecb1643687f66f21136bc66b27cec5583af7771e6364b80cef0049ba46cb52"],"state_sha256":"cbc4e71c404f3429de63935d2151b5509863911c0f86b4165f2cb1d54e07ed23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xiXHKUPSeG0OMHFnWQkEuhmyAOOrwP/kfSCjTcBoNTtik2RYP2gzZ3qEbGyuA4arfa1sLHI4bQgltYYHYbhDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:46:19.405164Z","bundle_sha256":"664ae6869e628b6d2a8ac05118edeed4df51767e5270e8a1d8d95177394d58c0"}}