{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZILN2NCXYLJY2HYM7RCWUFXPGU","short_pith_number":"pith:ZILN2NCX","canonical_record":{"source":{"id":"1702.03584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-12T22:38:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"169d1095441c1a063ce524bc4e2f4aa8240dfc0a46b78a32956eb6906da1a946","abstract_canon_sha256":"2f3232332546a6b286add4e4232fd12ead0a78723b7e324931b26f185600774d"},"schema_version":"1.0"},"canonical_sha256":"ca16dd3457c2d38d1f0cfc456a16ef350874af9eb9ffa58da74fc7cb4c4ed3e2","source":{"kind":"arxiv","id":"1702.03584","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03584","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03584v3","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03584","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZILN2NCXYLJY","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZILN2NCXYLJY2HYM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZILN2NCX","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZILN2NCXYLJY2HYM7RCWUFXPGU","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-12T22:38:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"169d1095441c1a063ce524bc4e2f4aa8240dfc0a46b78a32956eb6906da1a946","abstract_canon_sha256":"2f3232332546a6b286add4e4232fd12ead0a78723b7e324931b26f185600774d"},"schema_version":"1.0"},"canonical_sha256":"ca16dd3457c2d38d1f0cfc456a16ef350874af9eb9ffa58da74fc7cb4c4ed3e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:33.119947Z","signature_b64":"26DYdL5uy+RiUVuefTq4kwfUpzMI43zsO5ujy90uS35OSY25LhSg2AStg6FAghapgSDdnUXuTZpGBPFeOzx7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca16dd3457c2d38d1f0cfc456a16ef350874af9eb9ffa58da74fc7cb4c4ed3e2","last_reissued_at":"2026-05-17T23:44:33.119388Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:33.119388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03584","source_version":3,"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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXGJ/L3SL6SVVe6/BIr4Q9RCGCRIZD7f6tCLJRSzbcOFVbBTSNNsDw1ixOXnWQNg9nlBKeDHTvxl7xpWZqd5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:19:36.953526Z"},"content_sha256":"e4811a5b4e406c09813d5b7a232de621b809205fe7b1a05876348ee2d6f1376a","schema_version":"1.0","event_id":"sha256:e4811a5b4e406c09813d5b7a232de621b809205fe7b1a05876348ee2d6f1376a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZILN2NCXYLJY2HYM7RCWUFXPGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Similarity Preserving Representation Learning for Time Series Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Inderjit S. Dhillon, Jinfeng Yi, Lingfei Wu, Qi Lei, Roman Vaculin","submitted_at":"2017-02-12T22:38:42Z","abstract_excerpt":"A considerable amount of clustering algorithms take instance-feature matrices as their inputs. As such, they cannot directly analyze time series data due to its temporal nature, usually unequal lengths, and complex properties. This is a great pity since many of these algorithms are effective, robust, efficient, and easy to use. In this paper, we bridge this gap by proposing an efficient representation learning framework that is able to convert a set of time series with various lengths to an instance-feature matrix. In particular, we guarantee that the pairwise similarities between time series "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03584","kind":"arxiv","version":3},"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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/E+or8iEsPncwJ0/cQ/bn1SF1pfdmUTKxpEQPQLzQFlPqGAdYNqtibDp5xWrrooyXQ8pJtVyGqx372bxfvYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:19:36.953865Z"},"content_sha256":"21e2c4494344a455d3cd9f0eab50e663ecb220867460061e9a0f41ec4b160075","schema_version":"1.0","event_id":"sha256:21e2c4494344a455d3cd9f0eab50e663ecb220867460061e9a0f41ec4b160075"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZILN2NCXYLJY2HYM7RCWUFXPGU/bundle.json","state_url":"https://pith.science/pith/ZILN2NCXYLJY2HYM7RCWUFXPGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZILN2NCXYLJY2HYM7RCWUFXPGU/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-06-02T07:19:36Z","links":{"resolver":"https://pith.science/pith/ZILN2NCXYLJY2HYM7RCWUFXPGU","bundle":"https://pith.science/pith/ZILN2NCXYLJY2HYM7RCWUFXPGU/bundle.json","state":"https://pith.science/pith/ZILN2NCXYLJY2HYM7RCWUFXPGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZILN2NCXYLJY2HYM7RCWUFXPGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZILN2NCXYLJY2HYM7RCWUFXPGU","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":"2f3232332546a6b286add4e4232fd12ead0a78723b7e324931b26f185600774d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-12T22:38:42Z","title_canon_sha256":"169d1095441c1a063ce524bc4e2f4aa8240dfc0a46b78a32956eb6906da1a946"},"schema_version":"1.0","source":{"id":"1702.03584","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03584","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03584v3","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03584","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZILN2NCXYLJY","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZILN2NCXYLJY2HYM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZILN2NCX","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:21e2c4494344a455d3cd9f0eab50e663ecb220867460061e9a0f41ec4b160075","target":"graph","created_at":"2026-05-17T23:44:33Z","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":"A considerable amount of clustering algorithms take instance-feature matrices as their inputs. As such, they cannot directly analyze time series data due to its temporal nature, usually unequal lengths, and complex properties. This is a great pity since many of these algorithms are effective, robust, efficient, and easy to use. In this paper, we bridge this gap by proposing an efficient representation learning framework that is able to convert a set of time series with various lengths to an instance-feature matrix. In particular, we guarantee that the pairwise similarities between time series ","authors_text":"Inderjit S. Dhillon, Jinfeng Yi, Lingfei Wu, Qi Lei, Roman Vaculin","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-12T22:38:42Z","title":"Similarity Preserving Representation Learning for Time Series Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03584","kind":"arxiv","version":3},"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:e4811a5b4e406c09813d5b7a232de621b809205fe7b1a05876348ee2d6f1376a","target":"record","created_at":"2026-05-17T23:44:33Z","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":"2f3232332546a6b286add4e4232fd12ead0a78723b7e324931b26f185600774d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-12T22:38:42Z","title_canon_sha256":"169d1095441c1a063ce524bc4e2f4aa8240dfc0a46b78a32956eb6906da1a946"},"schema_version":"1.0","source":{"id":"1702.03584","kind":"arxiv","version":3}},"canonical_sha256":"ca16dd3457c2d38d1f0cfc456a16ef350874af9eb9ffa58da74fc7cb4c4ed3e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca16dd3457c2d38d1f0cfc456a16ef350874af9eb9ffa58da74fc7cb4c4ed3e2","first_computed_at":"2026-05-17T23:44:33.119388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:33.119388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"26DYdL5uy+RiUVuefTq4kwfUpzMI43zsO5ujy90uS35OSY25LhSg2AStg6FAghapgSDdnUXuTZpGBPFeOzx7Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:33.119947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03584","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4811a5b4e406c09813d5b7a232de621b809205fe7b1a05876348ee2d6f1376a","sha256:21e2c4494344a455d3cd9f0eab50e663ecb220867460061e9a0f41ec4b160075"],"state_sha256":"7653f5a736365bddcdbcc7315b287c5067506221ea5db66ae1d32e67f6bf51e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NA/0rKZ68H3IewlPNYQsLaae3j/hQzeR/wf0oqdkOfouA/cFpnUonmthJdt1bhYTjlsKOy9uRLqa61T0luz+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:19:36.955712Z","bundle_sha256":"9eec957eaa963873c5ef9b9717129c51bcf884ea33d86d9570347919be1fbf88"}}