{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TWNLRM4ZC3UBYMTIICADFJQTZP","short_pith_number":"pith:TWNLRM4Z","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"},"canonical_sha256":"9d9ab8b39916e81c3268408032a613cbe476ce0caa9930e046c218af066d0707","source":{"kind":"arxiv","id":"1903.03520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03520","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03520v1","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03520","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"TWNLRM4ZC3UB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TWNLRM4ZC3UBYMTI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TWNLRM4Z","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TWNLRM4ZC3UBYMTIICADFJQTZP","target":"record","payload":{"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"},"canonical_sha256":"9d9ab8b39916e81c3268408032a613cbe476ce0caa9930e046c218af066d0707","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"},"source_kind":"arxiv","source_id":"1903.03520","source_version":1,"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:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WqwBwcHR8ynP9MWwLycMwesZMqmSEKwZ57lSeeKBCgzYyn2iK1p5c58dVSmjSlo3xWMuY09AthM29NtdsAlcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:00:35.168819Z"},"content_sha256":"4b014411cf5ad2c17ec13f62c0123d2490950ed5ef9360e8d563153c1a7aacc8","schema_version":"1.0","event_id":"sha256:4b014411cf5ad2c17ec13f62c0123d2490950ed5ef9360e8d563153c1a7aacc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TWNLRM4ZC3UBYMTIICADFJQTZP","target":"graph","payload":{"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"},"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:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skWhxDjeUGyJbP9LurVURSVhX3jwrfMu1aVRQbs6ErkRHDlKg4tizQIpEeFMPdtrM4GWX7/j0vXBtCEJF2osAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:00:35.169193Z"},"content_sha256":"83fc01652b4c958a8394708a9dd8098b1b90610378a99e74b1f97681ca09ab13","schema_version":"1.0","event_id":"sha256:83fc01652b4c958a8394708a9dd8098b1b90610378a99e74b1f97681ca09ab13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/bundle.json","state_url":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/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-25T12:00:35Z","links":{"resolver":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP","bundle":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/bundle.json","state":"https://pith.science/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWNLRM4ZC3UBYMTIICADFJQTZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TWNLRM4ZC3UBYMTIICADFJQTZP","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":"07ee785e835e24c014c8cf4b7c200df005b237275a6aab4d1b43a3f19673de9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T15:47:51Z","title_canon_sha256":"7c034030da65481e199adf000336d6cd6ba184d3329866cf2e3c13b1fdd4cffa"},"schema_version":"1.0","source":{"id":"1903.03520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03520","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03520v1","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03520","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"TWNLRM4ZC3UB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TWNLRM4ZC3UBYMTI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TWNLRM4Z","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:83fc01652b4c958a8394708a9dd8098b1b90610378a99e74b1f97681ca09ab13","target":"graph","created_at":"2026-05-17T23:51:45Z","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":"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 ","authors_text":"David P. Woodruff, Lin F. Yang, Moses Charikar, Vladimir Braverman, William Kuszmaul","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T15:47:51Z","title":"The One-Way Communication Complexity of Dynamic Time Warping Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03520","kind":"arxiv","version":1},"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:4b014411cf5ad2c17ec13f62c0123d2490950ed5ef9360e8d563153c1a7aacc8","target":"record","created_at":"2026-05-17T23:51:45Z","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":"07ee785e835e24c014c8cf4b7c200df005b237275a6aab4d1b43a3f19673de9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T15:47:51Z","title_canon_sha256":"7c034030da65481e199adf000336d6cd6ba184d3329866cf2e3c13b1fdd4cffa"},"schema_version":"1.0","source":{"id":"1903.03520","kind":"arxiv","version":1}},"canonical_sha256":"9d9ab8b39916e81c3268408032a613cbe476ce0caa9930e046c218af066d0707","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d9ab8b39916e81c3268408032a613cbe476ce0caa9930e046c218af066d0707","first_computed_at":"2026-05-17T23:51:45.258559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:45.258559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kMzwUtY85ejvySTAZQxX8zB1xBcjSWB2V7e+dN1QiEpOH0QNjZHm9CX99sgUkAH9FJW6jw9KEFsBSkwE6v6eBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:45.259141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b014411cf5ad2c17ec13f62c0123d2490950ed5ef9360e8d563153c1a7aacc8","sha256:83fc01652b4c958a8394708a9dd8098b1b90610378a99e74b1f97681ca09ab13"],"state_sha256":"d4aaf9e690bce5e7da31526c0f68b6228d2e934afe986e8cb33a14da2132973c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urssTX9BMi8cK0biRk3GMHkH/UnDfyK46I0lhVNxFhoS1lXTJKDDhHM3csRIb+vk0lcayQ68n34Q1QJ456pyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:00:35.171675Z","bundle_sha256":"d40fb9ed346e6e706e2b21751087dc9ee639c6f10d34c4768f91fc2c02bfe105"}}