{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TWNLRM4ZC3UBYMTIICADFJQTZP","short_pith_number":"pith:TWNLRM4Z","schema_version":"1.0","canonical_sha256":"9d9ab8b39916e81c3268408032a613cbe476ce0caa9930e046c218af066d0707","source":{"kind":"arxiv","id":"1903.03520","version":1},"attestation_state":"computed","paper":{"title":"The One-Way Communication Complexity of Dynamic Time Warping Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Lin F. Yang, Moses Charikar, Vladimir Braverman, William Kuszmaul","submitted_at":"2019-03-08T15:47:51Z","abstract_excerpt":"We resolve the randomized one-way communication complexity of Dynamic Time Warping (DTW) distance. We show that there is an efficient one-way communication protocol using $\\widetilde{O}(n/\\alpha)$ bits for the problem of computing an $\\alpha$-approximation for DTW between strings $x$ and $y$ of length $n$, and we prove a lower bound of $\\Omega(n / \\alpha)$ bits for the same problem. Our communication protocol works for strings over an arbitrary metric of polynomial size and aspect ratio, and we optimize the logarithmic factors depending on properties of the underlying metric, such as when the "},"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.03520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T15:47:51Z","cross_cats_sorted":[],"title_canon_sha256":"7c034030da65481e199adf000336d6cd6ba184d3329866cf2e3c13b1fdd4cffa","abstract_canon_sha256":"07ee785e835e24c014c8cf4b7c200df005b237275a6aab4d1b43a3f19673de9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:45.259141Z","signature_b64":"kMzwUtY85ejvySTAZQxX8zB1xBcjSWB2V7e+dN1QiEpOH0QNjZHm9CX99sgUkAH9FJW6jw9KEFsBSkwE6v6eBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d9ab8b39916e81c3268408032a613cbe476ce0caa9930e046c218af066d0707","last_reissued_at":"2026-05-17T23:51:45.258559Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:45.258559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The One-Way Communication Complexity of Dynamic Time Warping Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Lin F. Yang, Moses Charikar, Vladimir Braverman, William Kuszmaul","submitted_at":"2019-03-08T15:47:51Z","abstract_excerpt":"We resolve the randomized one-way communication complexity of Dynamic Time Warping (DTW) distance. We show that there is an efficient one-way communication protocol using $\\widetilde{O}(n/\\alpha)$ bits for the problem of computing an $\\alpha$-approximation for DTW between strings $x$ and $y$ of length $n$, and we prove a lower bound of $\\Omega(n / \\alpha)$ bits for the same problem. Our communication protocol works for strings over an arbitrary metric of polynomial size and aspect ratio, and we optimize the logarithmic factors depending on properties of the underlying metric, such as when the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03520","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.03520","created_at":"2026-05-17T23:51:45.258635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03520v1","created_at":"2026-05-17T23:51:45.258635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03520","created_at":"2026-05-17T23:51:45.258635+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWNLRM4ZC3UB","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWNLRM4ZC3UBYMTI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWNLRM4Z","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04420","citing_title":"Sublinear data structures for short Fr\\'echet queries","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP","json":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP.json","graph_json":"https://pith.science/api/pith-number/TWNLRM4ZC3UBYMTIICADFJQTZP/graph.json","events_json":"https://pith.science/api/pith-number/TWNLRM4ZC3UBYMTIICADFJQTZP/events.json","paper":"https://pith.science/paper/TWNLRM4Z"},"agent_actions":{"view_html":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP","download_json":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP.json","view_paper":"https://pith.science/paper/TWNLRM4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03520&json=true","fetch_graph":"https://pith.science/api/pith-number/TWNLRM4ZC3UBYMTIICADFJQTZP/graph.json","fetch_events":"https://pith.science/api/pith-number/TWNLRM4ZC3UBYMTIICADFJQTZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/action/storage_attestation","attest_author":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/action/author_attestation","sign_citation":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/action/citation_signature","submit_replication":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/action/replication_record"}},"created_at":"2026-05-17T23:51:45.258635+00:00","updated_at":"2026-05-17T23:51:45.258635+00:00"}