{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZINWSB63GLTEZ4KLCGHFYELGDL","short_pith_number":"pith:ZINWSB63","canonical_record":{"source":{"id":"1805.03473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-09T12:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"a020c3ae9f9ffc542b3c9dabcfdcc78036bbc456004d68af6f8c1b908a010e59","abstract_canon_sha256":"c0af1669dab97f46d63007b8d5c90a7b710dc623f4e1b4d6dec48b60397f5d1f"},"schema_version":"1.0"},"canonical_sha256":"ca1b6907db32e64cf14b118e5c11661adcfc31557f3e1875b283c02b5c3e38ba","source":{"kind":"arxiv","id":"1805.03473","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03473","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03473v2","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03473","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZINWSB63GLTE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZINWSB63GLTEZ4KL","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZINWSB63","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZINWSB63GLTEZ4KLCGHFYELGDL","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-09T12:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"a020c3ae9f9ffc542b3c9dabcfdcc78036bbc456004d68af6f8c1b908a010e59","abstract_canon_sha256":"c0af1669dab97f46d63007b8d5c90a7b710dc623f4e1b4d6dec48b60397f5d1f"},"schema_version":"1.0"},"canonical_sha256":"ca1b6907db32e64cf14b118e5c11661adcfc31557f3e1875b283c02b5c3e38ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:36.483055Z","signature_b64":"EUbmWgVb2xYwhCn/wE3AYXMotBmijPdhJF7sQ+4pzfOI+StSSK9xGwQRON8D7NEElJLsEZXlSHE+xTwFFTKcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca1b6907db32e64cf14b118e5c11661adcfc31557f3e1875b283c02b5c3e38ba","last_reissued_at":"2026-05-17T23:40:36.482648Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:36.482648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03473","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-17T23:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4N6TmaoypSLY6ALxHSjU2Wub46KUAmI3Urny0/1TAK2twl0SlOVc3PrGVqECljCmswXEfIIuOZmMwC5Osmg6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:22:40.530652Z"},"content_sha256":"24decf6b8fc041ecf9f494fb1d960d54178d296d7cc74683c29bc3f88beb3a9b","schema_version":"1.0","event_id":"sha256:24decf6b8fc041ecf9f494fb1d960d54178d296d7cc74683c29bc3f88beb3a9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZINWSB63GLTEZ4KLCGHFYELGDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning representations for multivariate time series with missing data using Temporal Kernelized Autoencoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Filippo Maria Bianchi, Karl {\\O}yvind Mikalsen, Lorenzo Livi, Michael Kampffmeyer, Robert Jenssen","submitted_at":"2018-05-09T12:18:54Z","abstract_excerpt":"Learning compressed representations of multivariate time series (MTS) facilitates data analysis in the presence of noise and redundant information, and for a large number of variates and time steps. However, classical dimensionality reduction approaches are designed for vectorial data and cannot deal explicitly with missing values. In this work, we propose a novel autoencoder architecture based on recurrent neural networks to generate compressed representations of MTS. The proposed model can process inputs characterized by variable lengths and it is specifically designed to handle missing data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03473","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-17T23:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cXDj0i2vcVX1eUr2Iioqg1FQulqnQ9iiIJqxRA6rwfbR7U5tDGfi0684t5ObQUHs2pCj6CwkIttHCGj1PoFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:22:40.531293Z"},"content_sha256":"7da4cdc860b4662c00302bac77c432f2c663407a6a8fc0fe5e2c3073f8e116cb","schema_version":"1.0","event_id":"sha256:7da4cdc860b4662c00302bac77c432f2c663407a6a8fc0fe5e2c3073f8e116cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZINWSB63GLTEZ4KLCGHFYELGDL/bundle.json","state_url":"https://pith.science/pith/ZINWSB63GLTEZ4KLCGHFYELGDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZINWSB63GLTEZ4KLCGHFYELGDL/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-25T17:22:40Z","links":{"resolver":"https://pith.science/pith/ZINWSB63GLTEZ4KLCGHFYELGDL","bundle":"https://pith.science/pith/ZINWSB63GLTEZ4KLCGHFYELGDL/bundle.json","state":"https://pith.science/pith/ZINWSB63GLTEZ4KLCGHFYELGDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZINWSB63GLTEZ4KLCGHFYELGDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZINWSB63GLTEZ4KLCGHFYELGDL","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":"c0af1669dab97f46d63007b8d5c90a7b710dc623f4e1b4d6dec48b60397f5d1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-09T12:18:54Z","title_canon_sha256":"a020c3ae9f9ffc542b3c9dabcfdcc78036bbc456004d68af6f8c1b908a010e59"},"schema_version":"1.0","source":{"id":"1805.03473","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03473","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03473v2","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03473","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZINWSB63GLTE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZINWSB63GLTEZ4KL","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZINWSB63","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:7da4cdc860b4662c00302bac77c432f2c663407a6a8fc0fe5e2c3073f8e116cb","target":"graph","created_at":"2026-05-17T23:40:36Z","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":"Learning compressed representations of multivariate time series (MTS) facilitates data analysis in the presence of noise and redundant information, and for a large number of variates and time steps. However, classical dimensionality reduction approaches are designed for vectorial data and cannot deal explicitly with missing values. In this work, we propose a novel autoencoder architecture based on recurrent neural networks to generate compressed representations of MTS. The proposed model can process inputs characterized by variable lengths and it is specifically designed to handle missing data","authors_text":"Filippo Maria Bianchi, Karl {\\O}yvind Mikalsen, Lorenzo Livi, Michael Kampffmeyer, Robert Jenssen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-09T12:18:54Z","title":"Learning representations for multivariate time series with missing data using Temporal Kernelized Autoencoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03473","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:24decf6b8fc041ecf9f494fb1d960d54178d296d7cc74683c29bc3f88beb3a9b","target":"record","created_at":"2026-05-17T23:40:36Z","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":"c0af1669dab97f46d63007b8d5c90a7b710dc623f4e1b4d6dec48b60397f5d1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-05-09T12:18:54Z","title_canon_sha256":"a020c3ae9f9ffc542b3c9dabcfdcc78036bbc456004d68af6f8c1b908a010e59"},"schema_version":"1.0","source":{"id":"1805.03473","kind":"arxiv","version":2}},"canonical_sha256":"ca1b6907db32e64cf14b118e5c11661adcfc31557f3e1875b283c02b5c3e38ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca1b6907db32e64cf14b118e5c11661adcfc31557f3e1875b283c02b5c3e38ba","first_computed_at":"2026-05-17T23:40:36.482648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:36.482648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EUbmWgVb2xYwhCn/wE3AYXMotBmijPdhJF7sQ+4pzfOI+StSSK9xGwQRON8D7NEElJLsEZXlSHE+xTwFFTKcCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:36.483055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03473","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24decf6b8fc041ecf9f494fb1d960d54178d296d7cc74683c29bc3f88beb3a9b","sha256:7da4cdc860b4662c00302bac77c432f2c663407a6a8fc0fe5e2c3073f8e116cb"],"state_sha256":"30a120b53c8f88a1d2de98c5715afbba9dfed98b0c55f9a3710b3641bcc2c907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3kzvuC3T9offSxvczc2ZpsMzvKPrZ2p4UrXDii8wv1t7u49WfWeJOtER6fRGWvErDML0Wjslb+FVFX/4a3oHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:22:40.534863Z","bundle_sha256":"42425a27259a569c38aee858f45f10fb9021b1cc2a5a05d5d1ba8bce50e40c1b"}}