{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WFIBZSIBWGBGNETDTD3V47S4JY","short_pith_number":"pith:WFIBZSIB","schema_version":"1.0","canonical_sha256":"b1501cc901b18266926398f75e7e5c4e35a621a4fc9c013a21c52cc478f806c2","source":{"kind":"arxiv","id":"1512.04349","version":1},"attestation_state":"computed","paper":{"title":"Clustering time series under the Fr\\'echet distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amer Krivo\\v{s}ija, Anne Driemel, Christian Sohler","submitted_at":"2015-12-14T14:56:37Z","abstract_excerpt":"The Fr\\'echet distance is a popular distance measure for curves. We study the problem of clustering time series under the Fr\\'echet distance. In particular, we give $(1+\\varepsilon)$-approximation algorithms for variations of the following problem with parameters $k$ and $\\ell$. Given $n$ univariate time series $P$, each of complexity at most $m$, we find $k$ time series, not necessarily from $P$, which we call \\emph{cluster centers} and which each have complexity at most $\\ell$, such that (a) the maximum distance of an element of $P$ to its nearest cluster center or (b) the sum of these dista"},"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":"1512.04349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T14:56:37Z","cross_cats_sorted":[],"title_canon_sha256":"17e82b839897953d2329951c1b6ed44757bfc9ed10c3107ee9c093b708663bbe","abstract_canon_sha256":"a33b4cb560ed0a8d79fa4b4149251a41cfaadd2494b70c969f32e26d7b27c3dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:22.426199Z","signature_b64":"bLMjvTDTUtp1eE4SMyBtTnp3XrGwu+DYsSnuoKpL8K/pBT/L1CZvp+Ju2/eQdGb/t2BSTmz6Th9gjMSEIhz9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1501cc901b18266926398f75e7e5c4e35a621a4fc9c013a21c52cc478f806c2","last_reissued_at":"2026-05-18T01:24:22.425632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:22.425632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering time series under the Fr\\'echet distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amer Krivo\\v{s}ija, Anne Driemel, Christian Sohler","submitted_at":"2015-12-14T14:56:37Z","abstract_excerpt":"The Fr\\'echet distance is a popular distance measure for curves. We study the problem of clustering time series under the Fr\\'echet distance. In particular, we give $(1+\\varepsilon)$-approximation algorithms for variations of the following problem with parameters $k$ and $\\ell$. Given $n$ univariate time series $P$, each of complexity at most $m$, we find $k$ time series, not necessarily from $P$, which we call \\emph{cluster centers} and which each have complexity at most $\\ell$, such that (a) the maximum distance of an element of $P$ to its nearest cluster center or (b) the sum of these dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04349","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":"1512.04349","created_at":"2026-05-18T01:24:22.425720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04349v1","created_at":"2026-05-18T01:24:22.425720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04349","created_at":"2026-05-18T01:24:22.425720+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFIBZSIBWGBG","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFIBZSIBWGBGNETD","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFIBZSIB","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY","json":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY.json","graph_json":"https://pith.science/api/pith-number/WFIBZSIBWGBGNETDTD3V47S4JY/graph.json","events_json":"https://pith.science/api/pith-number/WFIBZSIBWGBGNETDTD3V47S4JY/events.json","paper":"https://pith.science/paper/WFIBZSIB"},"agent_actions":{"view_html":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY","download_json":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY.json","view_paper":"https://pith.science/paper/WFIBZSIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04349&json=true","fetch_graph":"https://pith.science/api/pith-number/WFIBZSIBWGBGNETDTD3V47S4JY/graph.json","fetch_events":"https://pith.science/api/pith-number/WFIBZSIBWGBGNETDTD3V47S4JY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY/action/storage_attestation","attest_author":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY/action/author_attestation","sign_citation":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY/action/citation_signature","submit_replication":"https://pith.science/pith/WFIBZSIBWGBGNETDTD3V47S4JY/action/replication_record"}},"created_at":"2026-05-18T01:24:22.425720+00:00","updated_at":"2026-05-18T01:24:22.425720+00:00"}