{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JI2GLRLQCVZW6DU3KMOVDPE5IQ","short_pith_number":"pith:JI2GLRLQ","canonical_record":{"source":{"id":"1901.10738","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-30T10:07:45Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"7ddf05a33a84512cb0a30040e8c23f25898fc7b4dc83a840a0cd7284b1a8d217","abstract_canon_sha256":"91d782a103bbc3158f5b60e85cf7188421f6a35a09ed869303d103f2f3095ca2"},"schema_version":"1.0"},"canonical_sha256":"4a3465c57015736f0e9b531d51bc9d44171c251ea07d2ad8e13a8fbb394db65e","source":{"kind":"arxiv","id":"1901.10738","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10738","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10738v4","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10738","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"pith_short_12","alias_value":"JI2GLRLQCVZW","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JI2GLRLQCVZW6DU3","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JI2GLRLQ","created_at":"2026-07-05T00:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JI2GLRLQCVZW6DU3KMOVDPE5IQ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10738","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-30T10:07:45Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"7ddf05a33a84512cb0a30040e8c23f25898fc7b4dc83a840a0cd7284b1a8d217","abstract_canon_sha256":"91d782a103bbc3158f5b60e85cf7188421f6a35a09ed869303d103f2f3095ca2"},"schema_version":"1.0"},"canonical_sha256":"4a3465c57015736f0e9b531d51bc9d44171c251ea07d2ad8e13a8fbb394db65e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:27.487177Z","signature_b64":"c9RxkC1qH7jJJO7dxOLdjks7sNjosCIZZQ7trB0GeqrpysHlei/DoQH9fGSYu6Imvt9KK+VQzfUuZb0xGF1pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3465c57015736f0e9b531d51bc9d44171c251ea07d2ad8e13a8fbb394db65e","last_reissued_at":"2026-07-05T00:29:27.486766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:27.486766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10738","source_version":4,"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-07-05T00:29:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrG/x6jLnroF6W7lD7Lz55dcVmsn8hLXjnGdJkcCtaU9vpfAuZXlZC53jDE3dTeISrsYRY1SY+9utA8J73moBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:13:28.934386Z"},"content_sha256":"43d4df388c78632256e7925b3695c294fd563f0bd97b0942a8a33273451ec4fa","schema_version":"1.0","event_id":"sha256:43d4df388c78632256e7925b3695c294fd563f0bd97b0942a8a33273451ec4fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JI2GLRLQCVZW6DU3KMOVDPE5IQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Scalable Representation Learning for Multivariate Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aymeric Dieuleveut (CMAP), Jean-Yves Franceschi (MLIA), Martin Jaggi","submitted_at":"2019-01-30T10:07:45Z","abstract_excerpt":"Time series constitute a challenging data type for machine learning algorithms, due to their highly variable lengths and sparse labeling in practice. In this paper, we tackle this challenge by proposing an unsupervised method to learn universal embeddings of time series. Unlike previous works, it is scalable with respect to their length and we demonstrate the quality, transferability and practicability of the learned representations with thorough experiments and comparisons. To this end, we combine an encoder based on causal dilated convolutions with a novel triplet loss employing time-based n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10738","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.10738/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:29:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVGTegDQbmwatpMiQRtOi5RBs6NP6AUzd8GQVD1fcnI4udnjec05tkMv418XVNfo5p8/x2qnpAr/LGWOJAaYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:13:28.934769Z"},"content_sha256":"d1e8ebde00ceed5885a5fcedafad336d3d980a0393e6ed10a6a1c7230f4885bd","schema_version":"1.0","event_id":"sha256:d1e8ebde00ceed5885a5fcedafad336d3d980a0393e6ed10a6a1c7230f4885bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JI2GLRLQCVZW6DU3KMOVDPE5IQ/bundle.json","state_url":"https://pith.science/pith/JI2GLRLQCVZW6DU3KMOVDPE5IQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JI2GLRLQCVZW6DU3KMOVDPE5IQ/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-07-06T18:13:28Z","links":{"resolver":"https://pith.science/pith/JI2GLRLQCVZW6DU3KMOVDPE5IQ","bundle":"https://pith.science/pith/JI2GLRLQCVZW6DU3KMOVDPE5IQ/bundle.json","state":"https://pith.science/pith/JI2GLRLQCVZW6DU3KMOVDPE5IQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JI2GLRLQCVZW6DU3KMOVDPE5IQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JI2GLRLQCVZW6DU3KMOVDPE5IQ","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":"91d782a103bbc3158f5b60e85cf7188421f6a35a09ed869303d103f2f3095ca2","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-30T10:07:45Z","title_canon_sha256":"7ddf05a33a84512cb0a30040e8c23f25898fc7b4dc83a840a0cd7284b1a8d217"},"schema_version":"1.0","source":{"id":"1901.10738","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10738","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10738v4","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10738","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"pith_short_12","alias_value":"JI2GLRLQCVZW","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JI2GLRLQCVZW6DU3","created_at":"2026-07-05T00:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JI2GLRLQ","created_at":"2026-07-05T00:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:d1e8ebde00ceed5885a5fcedafad336d3d980a0393e6ed10a6a1c7230f4885bd","target":"graph","created_at":"2026-07-05T00:29:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1901.10738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Time series constitute a challenging data type for machine learning algorithms, due to their highly variable lengths and sparse labeling in practice. In this paper, we tackle this challenge by proposing an unsupervised method to learn universal embeddings of time series. Unlike previous works, it is scalable with respect to their length and we demonstrate the quality, transferability and practicability of the learned representations with thorough experiments and comparisons. To this end, we combine an encoder based on causal dilated convolutions with a novel triplet loss employing time-based n","authors_text":"Aymeric Dieuleveut (CMAP), Jean-Yves Franceschi (MLIA), Martin Jaggi","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-30T10:07:45Z","title":"Unsupervised Scalable Representation Learning for Multivariate Time Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10738","kind":"arxiv","version":4},"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:43d4df388c78632256e7925b3695c294fd563f0bd97b0942a8a33273451ec4fa","target":"record","created_at":"2026-07-05T00:29:27Z","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":"91d782a103bbc3158f5b60e85cf7188421f6a35a09ed869303d103f2f3095ca2","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-30T10:07:45Z","title_canon_sha256":"7ddf05a33a84512cb0a30040e8c23f25898fc7b4dc83a840a0cd7284b1a8d217"},"schema_version":"1.0","source":{"id":"1901.10738","kind":"arxiv","version":4}},"canonical_sha256":"4a3465c57015736f0e9b531d51bc9d44171c251ea07d2ad8e13a8fbb394db65e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a3465c57015736f0e9b531d51bc9d44171c251ea07d2ad8e13a8fbb394db65e","first_computed_at":"2026-07-05T00:29:27.486766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:27.486766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c9RxkC1qH7jJJO7dxOLdjks7sNjosCIZZQ7trB0GeqrpysHlei/DoQH9fGSYu6Imvt9KK+VQzfUuZb0xGF1pDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:27.487177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10738","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43d4df388c78632256e7925b3695c294fd563f0bd97b0942a8a33273451ec4fa","sha256:d1e8ebde00ceed5885a5fcedafad336d3d980a0393e6ed10a6a1c7230f4885bd"],"state_sha256":"c5bc7bd89564efa6e9f812fcc19a857d30de511c312a0dd293210d2535c86100"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEY/AP0p8py1ATWpXWj30mAL6uqYu0p6WvQtXuy1RvkM1UmiOcmYDo/MpwGZwTLNhuSCxlgwpvKOeI9LW0opAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:13:28.936687Z","bundle_sha256":"11db32665954a2ab8fe1b646c66fb4e067ceb4d4f2b4bf91f71735ef61558b66"}}