{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R7FNF4HAA74RZGZRNNV22XHDJ7","short_pith_number":"pith:R7FNF4HA","schema_version":"1.0","canonical_sha256":"8fcad2f0e007f91c9b316b6bad5ce34fe4c43888149f8417c19edd35d6788e76","source":{"kind":"arxiv","id":"1601.03945","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.03945","created_at":"2026-05-18T01:22:49.608336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03945v1","created_at":"2026-05-18T01:22:49.608336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03945","created_at":"2026-05-18T01:22:49.608336+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7FNF4HAA74R","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7FNF4HAA74RZGZR","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7FNF4HA","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7","json":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7.json","graph_json":"https://pith.science/api/pith-number/R7FNF4HAA74RZGZRNNV22XHDJ7/graph.json","events_json":"https://pith.science/api/pith-number/R7FNF4HAA74RZGZRNNV22XHDJ7/events.json","paper":"https://pith.science/paper/R7FNF4HA"},"agent_actions":{"view_html":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7","download_json":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7.json","view_paper":"https://pith.science/paper/R7FNF4HA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03945&json=true","fetch_graph":"https://pith.science/api/pith-number/R7FNF4HAA74RZGZRNNV22XHDJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/R7FNF4HAA74RZGZRNNV22XHDJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/action/storage_attestation","attest_author":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/action/author_attestation","sign_citation":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/action/citation_signature","submit_replication":"https://pith.science/pith/R7FNF4HAA74RZGZRNNV22XHDJ7/action/replication_record"}},"created_at":"2026-05-18T01:22:49.608336+00:00","updated_at":"2026-05-18T01:22:49.608336+00:00"}