{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WPL7BEC35CUVX366GOPNR3F7N2","short_pith_number":"pith:WPL7BEC3","canonical_record":{"source":{"id":"1602.00554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T15:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"ab1008dc822a1113f3992ede4c83e27c45f3b1654c7bdea8bc81af0d21c56048","abstract_canon_sha256":"5dc1ee10b58ddce52979088a0bc4c2afa284910f6dd47dfafc8f507fc0c93b69"},"schema_version":"1.0"},"canonical_sha256":"b3d7f0905be8a95befde339ed8ecbf6e810c338e811ef58d1837bd1abe87ca2c","source":{"kind":"arxiv","id":"1602.00554","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00554","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00554v2","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00554","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"WPL7BEC35CUV","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WPL7BEC35CUVX366","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WPL7BEC3","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WPL7BEC35CUVX366GOPNR3F7N2","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T15:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"ab1008dc822a1113f3992ede4c83e27c45f3b1654c7bdea8bc81af0d21c56048","abstract_canon_sha256":"5dc1ee10b58ddce52979088a0bc4c2afa284910f6dd47dfafc8f507fc0c93b69"},"schema_version":"1.0"},"canonical_sha256":"b3d7f0905be8a95befde339ed8ecbf6e810c338e811ef58d1837bd1abe87ca2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:42.644407Z","signature_b64":"G6HGnoYVgXD4MqLcMC/bGYCnQ5rXyk8axqNn3xcltS+wHuJIGFJf04nrIZ7fb8KuZcszcZRjYGUVnfwY8sLJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d7f0905be8a95befde339ed8ecbf6e810c338e811ef58d1837bd1abe87ca2c","last_reissued_at":"2026-05-18T00:44:42.643968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:42.643968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00554","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-18T00:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iogngi5+qvOqfWxzYZtRjGrBG9376S3QhARvW4zB6Ze6iRmOefB3XAK/l4WFvYj7N47KuD/lSCZSe90zQNJMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:35:27.832693Z"},"content_sha256":"726f0041edf51f17c7342550c3be886ef5121fb771d103115bac0cd24cbd44d5","schema_version":"1.0","event_id":"sha256:726f0041edf51f17c7342550c3be886ef5121fb771d103115bac0cd24cbd44d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WPL7BEC35CUVX366GOPNR3F7N2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-based Predictable Feature Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Asja Fischer, Bj\\\"orn Weghenkel, Laurenz Wiskott","submitted_at":"2016-02-01T15:11:48Z","abstract_excerpt":"We propose graph-based predictable feature analysis (GPFA), a new method for unsupervised learning of predictable features from high-dimensional time series, where high predictability is understood very generically as low variance in the distribution of the next data point given the previous ones. We show how this measure of predictability can be understood in terms of graph embedding as well as how it relates to the information-theoretic measure of predictive information in special cases. We confirm the effectiveness of GPFA on different datasets, comparing it to three existing algorithms wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00554","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-18T00:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4OOuGm9zMOVoErybilg7igHJoVh9uQGu8XBIUwxq6/Fnl8lhsoZOJezP/f2Y1BV1EIKb/wAExmvQkPbOfZNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:35:27.833041Z"},"content_sha256":"6608b90de1d4fe65ec9a51abc4ef23ac45d2075205caf4d048a668816b47d744","schema_version":"1.0","event_id":"sha256:6608b90de1d4fe65ec9a51abc4ef23ac45d2075205caf4d048a668816b47d744"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPL7BEC35CUVX366GOPNR3F7N2/bundle.json","state_url":"https://pith.science/pith/WPL7BEC35CUVX366GOPNR3F7N2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPL7BEC35CUVX366GOPNR3F7N2/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-11T13:35:27Z","links":{"resolver":"https://pith.science/pith/WPL7BEC35CUVX366GOPNR3F7N2","bundle":"https://pith.science/pith/WPL7BEC35CUVX366GOPNR3F7N2/bundle.json","state":"https://pith.science/pith/WPL7BEC35CUVX366GOPNR3F7N2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPL7BEC35CUVX366GOPNR3F7N2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WPL7BEC35CUVX366GOPNR3F7N2","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":"5dc1ee10b58ddce52979088a0bc4c2afa284910f6dd47dfafc8f507fc0c93b69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T15:11:48Z","title_canon_sha256":"ab1008dc822a1113f3992ede4c83e27c45f3b1654c7bdea8bc81af0d21c56048"},"schema_version":"1.0","source":{"id":"1602.00554","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00554","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00554v2","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00554","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"WPL7BEC35CUV","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WPL7BEC35CUVX366","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WPL7BEC3","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:6608b90de1d4fe65ec9a51abc4ef23ac45d2075205caf4d048a668816b47d744","target":"graph","created_at":"2026-05-18T00:44:42Z","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":"We propose graph-based predictable feature analysis (GPFA), a new method for unsupervised learning of predictable features from high-dimensional time series, where high predictability is understood very generically as low variance in the distribution of the next data point given the previous ones. We show how this measure of predictability can be understood in terms of graph embedding as well as how it relates to the information-theoretic measure of predictive information in special cases. We confirm the effectiveness of GPFA on different datasets, comparing it to three existing algorithms wit","authors_text":"Asja Fischer, Bj\\\"orn Weghenkel, Laurenz Wiskott","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T15:11:48Z","title":"Graph-based Predictable Feature Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00554","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:726f0041edf51f17c7342550c3be886ef5121fb771d103115bac0cd24cbd44d5","target":"record","created_at":"2026-05-18T00:44:42Z","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":"5dc1ee10b58ddce52979088a0bc4c2afa284910f6dd47dfafc8f507fc0c93b69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-01T15:11:48Z","title_canon_sha256":"ab1008dc822a1113f3992ede4c83e27c45f3b1654c7bdea8bc81af0d21c56048"},"schema_version":"1.0","source":{"id":"1602.00554","kind":"arxiv","version":2}},"canonical_sha256":"b3d7f0905be8a95befde339ed8ecbf6e810c338e811ef58d1837bd1abe87ca2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3d7f0905be8a95befde339ed8ecbf6e810c338e811ef58d1837bd1abe87ca2c","first_computed_at":"2026-05-18T00:44:42.643968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:42.643968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G6HGnoYVgXD4MqLcMC/bGYCnQ5rXyk8axqNn3xcltS+wHuJIGFJf04nrIZ7fb8KuZcszcZRjYGUVnfwY8sLJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:42.644407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00554","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:726f0041edf51f17c7342550c3be886ef5121fb771d103115bac0cd24cbd44d5","sha256:6608b90de1d4fe65ec9a51abc4ef23ac45d2075205caf4d048a668816b47d744"],"state_sha256":"6964ab564fa195fd169d682f84e36948be4c990437664bde30e5242eeb658138"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bGP9V9AwPMh9tMmL4dirnB55FrXZnbulZr6kcjF1ZL4pYJLN0HChp9yafamip1HUAmhy3AcngrO+en9++HjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:35:27.835094Z","bundle_sha256":"0419f231395fb21820fad9c097d10541d0ca9d5f88b1c0a13fd60f276266ecfd"}}