{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SL2AO3ABBVXKE3GNAD7547DEEA","short_pith_number":"pith:SL2AO3AB","canonical_record":{"source":{"id":"1208.0275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T16:49:49Z","cross_cats_sorted":[],"title_canon_sha256":"9c4476cde50358970f24b372c4b46ddd08444d2d5de7aa0bb6f8a252225f3e6f","abstract_canon_sha256":"942e82f1f490be1bbe5e3cf99e95009ab8142f964eb0801e99b3ae353d2817e4"},"schema_version":"1.0"},"canonical_sha256":"92f4076c010d6ea26ccd00ffde7c64201a364e5d9bde78ef34a4cccafc69ec23","source":{"kind":"arxiv","id":"1208.0275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0275","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0275v1","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0275","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"SL2AO3ABBVXK","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SL2AO3ABBVXKE3GN","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SL2AO3AB","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SL2AO3ABBVXKE3GNAD7547DEEA","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T16:49:49Z","cross_cats_sorted":[],"title_canon_sha256":"9c4476cde50358970f24b372c4b46ddd08444d2d5de7aa0bb6f8a252225f3e6f","abstract_canon_sha256":"942e82f1f490be1bbe5e3cf99e95009ab8142f964eb0801e99b3ae353d2817e4"},"schema_version":"1.0"},"canonical_sha256":"92f4076c010d6ea26ccd00ffde7c64201a364e5d9bde78ef34a4cccafc69ec23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:35.563658Z","signature_b64":"h9NbjvDwNURVx0/PcRu7T5F8Q2UCQMCI5QoNxP/SYDUiVRJi2miqEgYGyqhE9ZmDzw6gbbjOXmPSBmqApcdOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92f4076c010d6ea26ccd00ffde7c64201a364e5d9bde78ef34a4cccafc69ec23","last_reissued_at":"2026-05-18T03:49:35.562954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:35.562954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0275","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-18T03:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqGdfgCMd2jI8uJwW1aNoGG3IdgbSadTAeVxXVokb2GEese2zYwrSCybbls6THThWdfocyCIRcZPC28ukT4DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:27:00.978695Z"},"content_sha256":"aab72b48d8be2685c26b7b41863bf6dc94afefd725230b994c5ac9d7bb9092bd","schema_version":"1.0","event_id":"sha256:aab72b48d8be2685c26b7b41863bf6dc94afefd725230b994c5ac9d7bb9092bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SL2AO3ABBVXKE3GNAD7547DEEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"sDTW: Computing DTW Distances using Locally Relevant Constraints based on Salient Feature Alignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"K. Sel\\c{c}uk Candan, Maria Luisa Sapino, Rosaria Rossini, Xiaolan Wang","submitted_at":"2012-08-01T16:49:49Z","abstract_excerpt":"Many applications generate and consume temporal data and retrieval of time series is a key processing step in many application domains. Dynamic time warping (DTW) distance between time series of size N and M is computed relying on a dynamic programming approach which creates and fills an NxM grid to search for an optimal warp path. Since this can be costly, various heuristics have been proposed to cut away the potentially unproductive portions of the DTW grid. In this paper, we argue that time series often carry structural features that can be used for identifying locally relevant constraints "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0275","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-18T03:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uibMcd5jBbfQpoKeEiFHNtWYWS1R/QBN5oWYHavhT7i1fYFMxes7K1r4kn35akLrokvbSuNoHxFZF4jmyrZmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:27:00.979219Z"},"content_sha256":"1f30298e99ba06c504a912842a71fa83722f6abb3cb5709f3c045504cfd34bdc","schema_version":"1.0","event_id":"sha256:1f30298e99ba06c504a912842a71fa83722f6abb3cb5709f3c045504cfd34bdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SL2AO3ABBVXKE3GNAD7547DEEA/bundle.json","state_url":"https://pith.science/pith/SL2AO3ABBVXKE3GNAD7547DEEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SL2AO3ABBVXKE3GNAD7547DEEA/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-21T18:27:00Z","links":{"resolver":"https://pith.science/pith/SL2AO3ABBVXKE3GNAD7547DEEA","bundle":"https://pith.science/pith/SL2AO3ABBVXKE3GNAD7547DEEA/bundle.json","state":"https://pith.science/pith/SL2AO3ABBVXKE3GNAD7547DEEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SL2AO3ABBVXKE3GNAD7547DEEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SL2AO3ABBVXKE3GNAD7547DEEA","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":"942e82f1f490be1bbe5e3cf99e95009ab8142f964eb0801e99b3ae353d2817e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T16:49:49Z","title_canon_sha256":"9c4476cde50358970f24b372c4b46ddd08444d2d5de7aa0bb6f8a252225f3e6f"},"schema_version":"1.0","source":{"id":"1208.0275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0275","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0275v1","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0275","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"SL2AO3ABBVXK","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SL2AO3ABBVXKE3GN","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SL2AO3AB","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:1f30298e99ba06c504a912842a71fa83722f6abb3cb5709f3c045504cfd34bdc","target":"graph","created_at":"2026-05-18T03:49:35Z","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":"Many applications generate and consume temporal data and retrieval of time series is a key processing step in many application domains. Dynamic time warping (DTW) distance between time series of size N and M is computed relying on a dynamic programming approach which creates and fills an NxM grid to search for an optimal warp path. Since this can be costly, various heuristics have been proposed to cut away the potentially unproductive portions of the DTW grid. In this paper, we argue that time series often carry structural features that can be used for identifying locally relevant constraints ","authors_text":"K. Sel\\c{c}uk Candan, Maria Luisa Sapino, Rosaria Rossini, Xiaolan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T16:49:49Z","title":"sDTW: Computing DTW Distances using Locally Relevant Constraints based on Salient Feature Alignments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0275","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:aab72b48d8be2685c26b7b41863bf6dc94afefd725230b994c5ac9d7bb9092bd","target":"record","created_at":"2026-05-18T03:49:35Z","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":"942e82f1f490be1bbe5e3cf99e95009ab8142f964eb0801e99b3ae353d2817e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T16:49:49Z","title_canon_sha256":"9c4476cde50358970f24b372c4b46ddd08444d2d5de7aa0bb6f8a252225f3e6f"},"schema_version":"1.0","source":{"id":"1208.0275","kind":"arxiv","version":1}},"canonical_sha256":"92f4076c010d6ea26ccd00ffde7c64201a364e5d9bde78ef34a4cccafc69ec23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92f4076c010d6ea26ccd00ffde7c64201a364e5d9bde78ef34a4cccafc69ec23","first_computed_at":"2026-05-18T03:49:35.562954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:35.562954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h9NbjvDwNURVx0/PcRu7T5F8Q2UCQMCI5QoNxP/SYDUiVRJi2miqEgYGyqhE9ZmDzw6gbbjOXmPSBmqApcdOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:35.563658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aab72b48d8be2685c26b7b41863bf6dc94afefd725230b994c5ac9d7bb9092bd","sha256:1f30298e99ba06c504a912842a71fa83722f6abb3cb5709f3c045504cfd34bdc"],"state_sha256":"9e919bca1b04bef2c8ebd22623de3254294433d1cbf835d8ac8662570ab38eab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ynRSsKC9j5tJSXnTiI9DzeDZeQcSqBMZSfJSyGfUTa+sIC/iHQgcaW8LJfaoiGnfSeb0Dih69cVnpen0eCwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:27:00.981786Z","bundle_sha256":"fe17f590759b4a45640aeedaffa751bf380a6fb67c5fea8e1c9c8829fa28bed4"}}