{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GF6EEI66Q4QA7IZNFEYXPZNDHT","short_pith_number":"pith:GF6EEI66","canonical_record":{"source":{"id":"1610.07717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-25T03:31:58Z","cross_cats_sorted":[],"title_canon_sha256":"391dd9f52b7b69cfcda786a39696126db8aa20c870db60d34f8fe2d619f6cf58","abstract_canon_sha256":"7b84d0f521bfada42acbf367407717452ab4d7ccd213aebadbd4b65a0c470fe9"},"schema_version":"1.0"},"canonical_sha256":"317c4223de87200fa32d293177e5a33cea98cddfbb8fe56aa3f813d64b56b463","source":{"kind":"arxiv","id":"1610.07717","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07717","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07717v3","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07717","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"GF6EEI66Q4QA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GF6EEI66Q4QA7IZN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GF6EEI66","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GF6EEI66Q4QA7IZNFEYXPZNDHT","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-25T03:31:58Z","cross_cats_sorted":[],"title_canon_sha256":"391dd9f52b7b69cfcda786a39696126db8aa20c870db60d34f8fe2d619f6cf58","abstract_canon_sha256":"7b84d0f521bfada42acbf367407717452ab4d7ccd213aebadbd4b65a0c470fe9"},"schema_version":"1.0"},"canonical_sha256":"317c4223de87200fa32d293177e5a33cea98cddfbb8fe56aa3f813d64b56b463","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:09.312584Z","signature_b64":"jF5ahSqEL40dh1iqyxPoFcvqlrVQr+QB+BPhkJLahl+0gvRM0dw/yct5TwGiT8rCpwqxq8vIpU54p67b7ioYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"317c4223de87200fa32d293177e5a33cea98cddfbb8fe56aa3f813d64b56b463","last_reissued_at":"2026-05-18T00:44:09.312045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:09.312045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07717","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-18T00:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkLw6ROLLc67asqkaxV6N1oAXUkZ9VWCZ+qEOxc1HhK9X2nCgZVb4H3tUz/Zd/b7NqdpsRvb39kxTsdfq2MEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:32:26.039731Z"},"content_sha256":"8d6273087c602e42bbafc90cbbfd74906c72d07c5ea23abf365b613e157457cc","schema_version":"1.0","event_id":"sha256:8d6273087c602e42bbafc90cbbfd74906c72d07c5ea23abf365b613e157457cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GF6EEI66Q4QA7IZNFEYXPZNDHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed and parallel time series feature extraction for industrial big data applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andreas W. Kempa-Liehr, Maximilian Christ, Michael Feindt","submitted_at":"2016-10-25T03:31:58Z","abstract_excerpt":"The all-relevant problem of feature selection is the identification of all strongly and weakly relevant attributes. This problem is especially hard to solve for time series classification and regression in industrial applications such as predictive maintenance or production line optimization, for which each label or regression target is associated with several time series and meta-information simultaneously. Here, we are proposing an efficient, scalable feature extraction algorithm for time series, which filters the available features in an early stage of the machine learning pipeline with res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07717","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-18T00:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFpo2iR7SjBk5H29C/aDBRzImvWJzKx3IHPNUKcQ3yfAtbj0ZStNX4DbRmDhYA2VqzKZHFqucMl/sbOj+ES9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:32:26.040424Z"},"content_sha256":"915d32d98b2c8539e8467a743b198fc5e074086c5c07a9fcc13fd976de8fd214","schema_version":"1.0","event_id":"sha256:915d32d98b2c8539e8467a743b198fc5e074086c5c07a9fcc13fd976de8fd214"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GF6EEI66Q4QA7IZNFEYXPZNDHT/bundle.json","state_url":"https://pith.science/pith/GF6EEI66Q4QA7IZNFEYXPZNDHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GF6EEI66Q4QA7IZNFEYXPZNDHT/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-30T22:32:26Z","links":{"resolver":"https://pith.science/pith/GF6EEI66Q4QA7IZNFEYXPZNDHT","bundle":"https://pith.science/pith/GF6EEI66Q4QA7IZNFEYXPZNDHT/bundle.json","state":"https://pith.science/pith/GF6EEI66Q4QA7IZNFEYXPZNDHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GF6EEI66Q4QA7IZNFEYXPZNDHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GF6EEI66Q4QA7IZNFEYXPZNDHT","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":"7b84d0f521bfada42acbf367407717452ab4d7ccd213aebadbd4b65a0c470fe9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-25T03:31:58Z","title_canon_sha256":"391dd9f52b7b69cfcda786a39696126db8aa20c870db60d34f8fe2d619f6cf58"},"schema_version":"1.0","source":{"id":"1610.07717","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07717","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07717v3","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07717","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"GF6EEI66Q4QA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GF6EEI66Q4QA7IZN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GF6EEI66","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:915d32d98b2c8539e8467a743b198fc5e074086c5c07a9fcc13fd976de8fd214","target":"graph","created_at":"2026-05-18T00:44:09Z","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":"The all-relevant problem of feature selection is the identification of all strongly and weakly relevant attributes. This problem is especially hard to solve for time series classification and regression in industrial applications such as predictive maintenance or production line optimization, for which each label or regression target is associated with several time series and meta-information simultaneously. Here, we are proposing an efficient, scalable feature extraction algorithm for time series, which filters the available features in an early stage of the machine learning pipeline with res","authors_text":"Andreas W. Kempa-Liehr, Maximilian Christ, Michael Feindt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-25T03:31:58Z","title":"Distributed and parallel time series feature extraction for industrial big data applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07717","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:8d6273087c602e42bbafc90cbbfd74906c72d07c5ea23abf365b613e157457cc","target":"record","created_at":"2026-05-18T00:44:09Z","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":"7b84d0f521bfada42acbf367407717452ab4d7ccd213aebadbd4b65a0c470fe9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-25T03:31:58Z","title_canon_sha256":"391dd9f52b7b69cfcda786a39696126db8aa20c870db60d34f8fe2d619f6cf58"},"schema_version":"1.0","source":{"id":"1610.07717","kind":"arxiv","version":3}},"canonical_sha256":"317c4223de87200fa32d293177e5a33cea98cddfbb8fe56aa3f813d64b56b463","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"317c4223de87200fa32d293177e5a33cea98cddfbb8fe56aa3f813d64b56b463","first_computed_at":"2026-05-18T00:44:09.312045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:09.312045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jF5ahSqEL40dh1iqyxPoFcvqlrVQr+QB+BPhkJLahl+0gvRM0dw/yct5TwGiT8rCpwqxq8vIpU54p67b7ioYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:09.312584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07717","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d6273087c602e42bbafc90cbbfd74906c72d07c5ea23abf365b613e157457cc","sha256:915d32d98b2c8539e8467a743b198fc5e074086c5c07a9fcc13fd976de8fd214"],"state_sha256":"a94de70a8980c264669dd43d912a5c7e4e8d2abc13e7d47c13520db59f437342"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6FsurHVOgqte1YPE0Xo/IKaSputhzreahDlsWLjrEfPYOnMzHq7caPVILndHMSTC3o6CqknTm+SmCmXotMvvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:32:26.043452Z","bundle_sha256":"12f7441b51b0e7b6be253d32bb8068cec2925317435ecc71771aab7c26501f56"}}