{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R7FNF4HAA74RZGZRNNV22XHDJ7","short_pith_number":"pith:R7FNF4HA","canonical_record":{"source":{"id":"1601.03945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-15T15:00:20Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"0bbe332e5f9863276ce67a4e533ae6f9dcf7ac61bbede8f74ec934296a02116d","abstract_canon_sha256":"6b12352ce305f5946ea65ec079f22434ca920fbed9553c249b81438546c7df1f"},"schema_version":"1.0"},"canonical_sha256":"8fcad2f0e007f91c9b316b6bad5ce34fe4c43888149f8417c19edd35d6788e76","source":{"kind":"arxiv","id":"1601.03945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03945","created_at":"2026-05-18T01:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03945v1","created_at":"2026-05-18T01:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03945","created_at":"2026-05-18T01:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"R7FNF4HAA74R","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7FNF4HAA74RZGZR","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7FNF4HA","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R7FNF4HAA74RZGZRNNV22XHDJ7","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-15T15:00:20Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"0bbe332e5f9863276ce67a4e533ae6f9dcf7ac61bbede8f74ec934296a02116d","abstract_canon_sha256":"6b12352ce305f5946ea65ec079f22434ca920fbed9553c249b81438546c7df1f"},"schema_version":"1.0"},"canonical_sha256":"8fcad2f0e007f91c9b316b6bad5ce34fe4c43888149f8417c19edd35d6788e76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:49.608841Z","signature_b64":"KZYDr2mH6WIzwYdCxgww4G8NjYvH3l1sljrA59VrnppB9UTXpyCICQFsUJHbIQN0uUzLY/PLjBuLrF2I05QHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fcad2f0e007f91c9b316b6bad5ce34fe4c43888149f8417c19edd35d6788e76","last_reissued_at":"2026-05-18T01:22:49.608223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:49.608223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03945","source_version":1,"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-18T01:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwgrLGgSXAVjNbckce/xcTsw2Ykl2BELzhUOdqw50w6+1cYDPIPbyxrUB6cFMuHFdoik722xbyDvqwFna0KqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:45:41.421339Z"},"content_sha256":"4ea8f875ddabac53c99d5d2d26dfdbf561c2cf5ec9b960de9bef0db3cf219921","schema_version":"1.0","event_id":"sha256:4ea8f875ddabac53c99d5d2d26dfdbf561c2cf5ec9b960de9bef0db3cf219921"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R7FNF4HAA74RZGZRNNV22XHDJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved graph-based SFA: Information preservation complements the slowness principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Alberto N. Escalante-B., Laurenz Wiskott","submitted_at":"2016-01-15T15:00:20Z","abstract_excerpt":"Slow feature analysis (SFA) is an unsupervised-learning algorithm that extracts slowly varying features from a multi-dimensional time series. A supervised extension to SFA for classification and regression is graph-based SFA (GSFA). GSFA is based on the preservation of similarities, which are specified by a graph structure derived from the labels. It has been shown that hierarchical GSFA (HGSFA) allows learning from images and other high-dimensional data. The feature space spanned by HGSFA is complex due to the composition of the nonlinearities of the nodes in the network. However, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03945","kind":"arxiv","version":1},"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-18T01:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7eGUeFb/DmKzpRcpG5UT3UuKZtw0EXueSypALrTzaaw1s7FBeekdg59Dm9TeufTm9+C1MTmDdOd2t0v2KKgRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:45:41.421998Z"},"content_sha256":"a5ec343e4385f2e4515aa36509678f28d8e2dbc08149624654a3011da5338bdc","schema_version":"1.0","event_id":"sha256:a5ec343e4385f2e4515aa36509678f28d8e2dbc08149624654a3011da5338bdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/bundle.json","state_url":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/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-11T11:45:41Z","links":{"resolver":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7","bundle":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/bundle.json","state":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R7FNF4HAA74RZGZRNNV22XHDJ7","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":"6b12352ce305f5946ea65ec079f22434ca920fbed9553c249b81438546c7df1f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-15T15:00:20Z","title_canon_sha256":"0bbe332e5f9863276ce67a4e533ae6f9dcf7ac61bbede8f74ec934296a02116d"},"schema_version":"1.0","source":{"id":"1601.03945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03945","created_at":"2026-05-18T01:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03945v1","created_at":"2026-05-18T01:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03945","created_at":"2026-05-18T01:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"R7FNF4HAA74R","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7FNF4HAA74RZGZR","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7FNF4HA","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:a5ec343e4385f2e4515aa36509678f28d8e2dbc08149624654a3011da5338bdc","target":"graph","created_at":"2026-05-18T01:22:49Z","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":"Slow feature analysis (SFA) is an unsupervised-learning algorithm that extracts slowly varying features from a multi-dimensional time series. A supervised extension to SFA for classification and regression is graph-based SFA (GSFA). GSFA is based on the preservation of similarities, which are specified by a graph structure derived from the labels. It has been shown that hierarchical GSFA (HGSFA) allows learning from images and other high-dimensional data. The feature space spanned by HGSFA is complex due to the composition of the nonlinearities of the nodes in the network. However, we show tha","authors_text":"Alberto N. Escalante-B., Laurenz Wiskott","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-15T15:00:20Z","title":"Improved graph-based SFA: Information preservation complements the slowness principle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03945","kind":"arxiv","version":1},"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:4ea8f875ddabac53c99d5d2d26dfdbf561c2cf5ec9b960de9bef0db3cf219921","target":"record","created_at":"2026-05-18T01:22:49Z","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":"6b12352ce305f5946ea65ec079f22434ca920fbed9553c249b81438546c7df1f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-15T15:00:20Z","title_canon_sha256":"0bbe332e5f9863276ce67a4e533ae6f9dcf7ac61bbede8f74ec934296a02116d"},"schema_version":"1.0","source":{"id":"1601.03945","kind":"arxiv","version":1}},"canonical_sha256":"8fcad2f0e007f91c9b316b6bad5ce34fe4c43888149f8417c19edd35d6788e76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fcad2f0e007f91c9b316b6bad5ce34fe4c43888149f8417c19edd35d6788e76","first_computed_at":"2026-05-18T01:22:49.608223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:49.608223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZYDr2mH6WIzwYdCxgww4G8NjYvH3l1sljrA59VrnppB9UTXpyCICQFsUJHbIQN0uUzLY/PLjBuLrF2I05QHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:49.608841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ea8f875ddabac53c99d5d2d26dfdbf561c2cf5ec9b960de9bef0db3cf219921","sha256:a5ec343e4385f2e4515aa36509678f28d8e2dbc08149624654a3011da5338bdc"],"state_sha256":"06dc8b4461fa69027d105632e74f5bcc9cd2d023e97512adc6523ebbd5858269"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EopPJ97YzxzTWfFjH3sd/C4mBsTziOvZCEqVfNp9sS2uhIru8w2P6Mh8d7jcgirMY3CtG9hYYOMa7f8ZDOZsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:45:41.425563Z","bundle_sha256":"c778dd643564f522214224fd615624b0610b67dd9385a358ed93bb52df71d1b0"}}