{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ADAALLEQLXK5WLGEP56Y6CMFFS","short_pith_number":"pith:ADAALLEQ","schema_version":"1.0","canonical_sha256":"00c005ac905dd5db2cc47f7d8f09852cbea348dcecb0f96925e19e492335e188","source":{"kind":"arxiv","id":"1903.09245","version":1},"attestation_state":"computed","paper":{"title":"Trainable Time Warping: Aligning Time-Series in the Continuous-Time Domain","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Emily Mower Provost, Melvin G McInnis, Soheil Khorram","submitted_at":"2019-03-21T21:42:19Z","abstract_excerpt":"DTW calculates the similarity or alignment between two signals, subject to temporal warping. However, its computational complexity grows exponentially with the number of time-series. Although there have been algorithms developed that are linear in the number of time-series, they are generally quadratic in time-series length. The exception is generalized time warping (GTW), which has linear computational cost. Yet, it can only identify simple time warping functions. There is a need for a new fast, high-quality multisequence alignment algorithm. We introduce trainable time warping (TTW), whose c"},"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":"1903.09245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-03-21T21:42:19Z","cross_cats_sorted":["cs.AI","cs.CC","stat.ML"],"title_canon_sha256":"23b6213abad6d73705df29209fc24995d4a8ce284ecbd884b3a8936a16135593","abstract_canon_sha256":"17e41f5c84eb3d64e3ab05e7479cc9f54b53c4176f5273b29369366822aae81f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:40.218280Z","signature_b64":"dN2Uxod5fiPZV39M27YGT6sAGLyjEIGbmFWiRtDjuUsG/E65NIrZGHeT7G7Mfbp9GbofuzDZVNu22hXjWJ+xBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00c005ac905dd5db2cc47f7d8f09852cbea348dcecb0f96925e19e492335e188","last_reissued_at":"2026-05-17T23:50:40.217632Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:40.217632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trainable Time Warping: Aligning Time-Series in the Continuous-Time Domain","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Emily Mower Provost, Melvin G McInnis, Soheil Khorram","submitted_at":"2019-03-21T21:42:19Z","abstract_excerpt":"DTW calculates the similarity or alignment between two signals, subject to temporal warping. However, its computational complexity grows exponentially with the number of time-series. Although there have been algorithms developed that are linear in the number of time-series, they are generally quadratic in time-series length. The exception is generalized time warping (GTW), which has linear computational cost. Yet, it can only identify simple time warping functions. There is a need for a new fast, high-quality multisequence alignment algorithm. We introduce trainable time warping (TTW), whose c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09245","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":"1903.09245","created_at":"2026-05-17T23:50:40.217706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09245v1","created_at":"2026-05-17T23:50:40.217706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09245","created_at":"2026-05-17T23:50:40.217706+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADAALLEQLXK5","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADAALLEQLXK5WLGE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADAALLEQ","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03050","citing_title":"Jointly Aligning and Predicting Continuous Emotion Annotations","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS","json":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS.json","graph_json":"https://pith.science/api/pith-number/ADAALLEQLXK5WLGEP56Y6CMFFS/graph.json","events_json":"https://pith.science/api/pith-number/ADAALLEQLXK5WLGEP56Y6CMFFS/events.json","paper":"https://pith.science/paper/ADAALLEQ"},"agent_actions":{"view_html":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS","download_json":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS.json","view_paper":"https://pith.science/paper/ADAALLEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09245&json=true","fetch_graph":"https://pith.science/api/pith-number/ADAALLEQLXK5WLGEP56Y6CMFFS/graph.json","fetch_events":"https://pith.science/api/pith-number/ADAALLEQLXK5WLGEP56Y6CMFFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS/action/storage_attestation","attest_author":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS/action/author_attestation","sign_citation":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS/action/citation_signature","submit_replication":"https://pith.science/pith/ADAALLEQLXK5WLGEP56Y6CMFFS/action/replication_record"}},"created_at":"2026-05-17T23:50:40.217706+00:00","updated_at":"2026-05-17T23:50:40.217706+00:00"}