{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZU2FFZX5QK4U4WYHLW33ZAJ2QB","short_pith_number":"pith:ZU2FFZX5","canonical_record":{"source":{"id":"1502.01063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-03T23:27:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c743cb94f8bf4a2a5cea42edce08c1c77d0c3bde9dd91bf1478626d5b5a50f8e","abstract_canon_sha256":"340580ce1dd254e88d0471344dd415cbf2317b7ff5e92931e4a2fdc9779a3613"},"schema_version":"1.0"},"canonical_sha256":"cd3452e6fd82b94e5b075db7bc813a8068612ae5cf7c77f2ccc7ebbfb2134025","source":{"kind":"arxiv","id":"1502.01063","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01063","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01063v2","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01063","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZU2FFZX5QK4U","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZU2FFZX5QK4U4WYH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZU2FFZX5","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZU2FFZX5QK4U4WYHLW33ZAJ2QB","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-03T23:27:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c743cb94f8bf4a2a5cea42edce08c1c77d0c3bde9dd91bf1478626d5b5a50f8e","abstract_canon_sha256":"340580ce1dd254e88d0471344dd415cbf2317b7ff5e92931e4a2fdc9779a3613"},"schema_version":"1.0"},"canonical_sha256":"cd3452e6fd82b94e5b075db7bc813a8068612ae5cf7c77f2ccc7ebbfb2134025","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:42.257479Z","signature_b64":"lrHISSoh0bgx+wYKT97jkgn8ZU+RE4cHcWFDXq68gTjDoE+Jv/w1CkCZ/UifchxXNIz3Ubtt8Mn2b/DQENpXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd3452e6fd82b94e5b075db7bc813a8068612ae5cf7c77f2ccc7ebbfb2134025","last_reissued_at":"2026-05-18T02:19:42.257031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:42.257031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01063","source_version":2,"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-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QeiUIhSe1uwmmStl0G1vR378YoSgd3PSIXOYcYCh3o+/WTfigW0YRNsdzUGryIg7BLFxjXmNfSuW+lEWQ3TBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:45:30.755514Z"},"content_sha256":"eff7b6bd6e30cef814cdfd4ba09365318ad802449470f1d1a5ae1ca768d164df","schema_version":"1.0","event_id":"sha256:eff7b6bd6e30cef814cdfd4ba09365318ad802449470f1d1a5ae1ca768d164df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZU2FFZX5QK4U4WYHLW33ZAJ2QB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Karl Bringmann, Marvin K\\\"unnemann","submitted_at":"2015-02-03T23:27:26Z","abstract_excerpt":"Classic similarity measures of strings are longest common subsequence and Levenshtein distance (i.e., the classic edit distance). A classic similarity measure of curves is dynamic time warping. These measures can be computed by simple $O(n^2)$ dynamic programming algorithms, and despite much effort no algorithms with significantly better running time are known.\n  We prove that, even restricted to binary strings or one-dimensional curves, respectively, these measures do not have strongly subquadratic time algorithms, i.e., no algorithms with running time $O(n^{2-\\varepsilon})$ for any $\\varepsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01063","kind":"arxiv","version":2},"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-18T02:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wGjYSD/aK4qPyyWtLlWijlLvPZcWNJyHsgEQ/MuruDI6tjW3qYu+6nvE2UD1K1axEBCX7BRMTD6gHHNHDLcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:45:30.756168Z"},"content_sha256":"37d9cd8c7fac32c0e9f97f68aa296bf3cbb7a65504660404c4acd303e9addefc","schema_version":"1.0","event_id":"sha256:37d9cd8c7fac32c0e9f97f68aa296bf3cbb7a65504660404c4acd303e9addefc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZU2FFZX5QK4U4WYHLW33ZAJ2QB/bundle.json","state_url":"https://pith.science/pith/ZU2FFZX5QK4U4WYHLW33ZAJ2QB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZU2FFZX5QK4U4WYHLW33ZAJ2QB/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-26T10:45:30Z","links":{"resolver":"https://pith.science/pith/ZU2FFZX5QK4U4WYHLW33ZAJ2QB","bundle":"https://pith.science/pith/ZU2FFZX5QK4U4WYHLW33ZAJ2QB/bundle.json","state":"https://pith.science/pith/ZU2FFZX5QK4U4WYHLW33ZAJ2QB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZU2FFZX5QK4U4WYHLW33ZAJ2QB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZU2FFZX5QK4U4WYHLW33ZAJ2QB","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":"340580ce1dd254e88d0471344dd415cbf2317b7ff5e92931e4a2fdc9779a3613","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-03T23:27:26Z","title_canon_sha256":"c743cb94f8bf4a2a5cea42edce08c1c77d0c3bde9dd91bf1478626d5b5a50f8e"},"schema_version":"1.0","source":{"id":"1502.01063","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01063","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01063v2","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01063","created_at":"2026-05-18T02:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZU2FFZX5QK4U","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZU2FFZX5QK4U4WYH","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZU2FFZX5","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:37d9cd8c7fac32c0e9f97f68aa296bf3cbb7a65504660404c4acd303e9addefc","target":"graph","created_at":"2026-05-18T02:19:42Z","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":"Classic similarity measures of strings are longest common subsequence and Levenshtein distance (i.e., the classic edit distance). A classic similarity measure of curves is dynamic time warping. These measures can be computed by simple $O(n^2)$ dynamic programming algorithms, and despite much effort no algorithms with significantly better running time are known.\n  We prove that, even restricted to binary strings or one-dimensional curves, respectively, these measures do not have strongly subquadratic time algorithms, i.e., no algorithms with running time $O(n^{2-\\varepsilon})$ for any $\\varepsi","authors_text":"Karl Bringmann, Marvin K\\\"unnemann","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-03T23:27:26Z","title":"Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01063","kind":"arxiv","version":2},"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:eff7b6bd6e30cef814cdfd4ba09365318ad802449470f1d1a5ae1ca768d164df","target":"record","created_at":"2026-05-18T02:19:42Z","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":"340580ce1dd254e88d0471344dd415cbf2317b7ff5e92931e4a2fdc9779a3613","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-03T23:27:26Z","title_canon_sha256":"c743cb94f8bf4a2a5cea42edce08c1c77d0c3bde9dd91bf1478626d5b5a50f8e"},"schema_version":"1.0","source":{"id":"1502.01063","kind":"arxiv","version":2}},"canonical_sha256":"cd3452e6fd82b94e5b075db7bc813a8068612ae5cf7c77f2ccc7ebbfb2134025","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd3452e6fd82b94e5b075db7bc813a8068612ae5cf7c77f2ccc7ebbfb2134025","first_computed_at":"2026-05-18T02:19:42.257031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:42.257031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lrHISSoh0bgx+wYKT97jkgn8ZU+RE4cHcWFDXq68gTjDoE+Jv/w1CkCZ/UifchxXNIz3Ubtt8Mn2b/DQENpXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:42.257479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01063","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eff7b6bd6e30cef814cdfd4ba09365318ad802449470f1d1a5ae1ca768d164df","sha256:37d9cd8c7fac32c0e9f97f68aa296bf3cbb7a65504660404c4acd303e9addefc"],"state_sha256":"7d9d511fa4bcd1bbcf3e24bebb4be82647916b75a1570b618e8c860bf144a003"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVEJJhI9/ClhZin8LWsed7voeEmsFUuKyPAJHKkRV0uTsvBEMZR+sG8mRucX5J4Ei7hrEFirWKh1DLDrED2gAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:45:30.759704Z","bundle_sha256":"58281bf99fb3bf8ea51d5f6ab345208e727c51a5a8e6756959c6666fe790b376"}}