{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:J7HUZR5WSK3S6KZQMOXUBAFJAP","short_pith_number":"pith:J7HUZR5W","canonical_record":{"source":{"id":"1509.08329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-28T14:19:59Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"d5093970cd8207129fe8746072f3cf09c047bd8958227452fcfd786b6b80c51c","abstract_canon_sha256":"43948606fa3b83f2e027fad42827f74ea8c4211d4013c0ec02c70cce3055d927"},"schema_version":"1.0"},"canonical_sha256":"4fcf4cc7b692b72f2b3063af4080a903df02d7db36919bf62a5373d656d1cb6e","source":{"kind":"arxiv","id":"1509.08329","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08329","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08329v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08329","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"J7HUZR5WSK3S","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J7HUZR5WSK3S6KZQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J7HUZR5W","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:J7HUZR5WSK3S6KZQMOXUBAFJAP","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-28T14:19:59Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"d5093970cd8207129fe8746072f3cf09c047bd8958227452fcfd786b6b80c51c","abstract_canon_sha256":"43948606fa3b83f2e027fad42827f74ea8c4211d4013c0ec02c70cce3055d927"},"schema_version":"1.0"},"canonical_sha256":"4fcf4cc7b692b72f2b3063af4080a903df02d7db36919bf62a5373d656d1cb6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:54.165081Z","signature_b64":"vyb50zmyV8w8Yj/ReAw0QHz60ZFlxHMyyE1zxew3RLYeVDHCCQr/wiFr6RBRLDdr/+jPDwTnW6iN+6QRMuLABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fcf4cc7b692b72f2b3063af4080a903df02d7db36919bf62a5373d656d1cb6e","last_reissued_at":"2026-05-18T01:31:54.164621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:54.164621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08329","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:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5hpobk1aflo3VtpXsDRmWv/rmiR6M4c5g3wwOpwMA2ZhOa6+GxkQ+IVRjBBNGZJqP4EN7DaMMTAU7VRNZ9oCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:47:40.992568Z"},"content_sha256":"b4995144a9772839569751f1bea4353cb6e569d1d7724e12f7116b6ea2d51c50","schema_version":"1.0","event_id":"sha256:b4995144a9772839569751f1bea4353cb6e569d1d7724e12f7116b6ea2d51c50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:J7HUZR5WSK3S6KZQMOXUBAFJAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Theoretical Analysis of the Optimal Free Responses of Graph-Based SFA for the Design of Training Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.AI","authors_text":"Alberto N. Escalante-B., Laurenz Wiskott","submitted_at":"2015-09-28T14:19:59Z","abstract_excerpt":"Slow feature analysis (SFA) is an unsupervised learning algorithm that extracts slowly varying features from a time series. Graph-based SFA (GSFA) is a supervised extension that can solve regression problems if followed by a post-processing regression algorithm. A training graph specifies arbitrary connections between the training samples. The connections in current graphs, however, only depend on the rank of the involved labels. Exploiting the exact label values makes further improvements in estimation accuracy possible.\n  In this article, we propose the exact label learning (ELL) method to c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08329","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:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a9v2KLRHJ6pLDi48WVeo0lLMLl13xRhA9agFIPYg11UaEN9GNDLt6uKj8IcfzNCCUdeY7xkV2B18YEneeYJyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:47:40.992944Z"},"content_sha256":"9b0c53d5472e2a6f3710f8d750cbd58a4bafbf36e058e212185664f85e3ffc68","schema_version":"1.0","event_id":"sha256:9b0c53d5472e2a6f3710f8d750cbd58a4bafbf36e058e212185664f85e3ffc68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7HUZR5WSK3S6KZQMOXUBAFJAP/bundle.json","state_url":"https://pith.science/pith/J7HUZR5WSK3S6KZQMOXUBAFJAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7HUZR5WSK3S6KZQMOXUBAFJAP/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-11T09:47:40Z","links":{"resolver":"https://pith.science/pith/J7HUZR5WSK3S6KZQMOXUBAFJAP","bundle":"https://pith.science/pith/J7HUZR5WSK3S6KZQMOXUBAFJAP/bundle.json","state":"https://pith.science/pith/J7HUZR5WSK3S6KZQMOXUBAFJAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7HUZR5WSK3S6KZQMOXUBAFJAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J7HUZR5WSK3S6KZQMOXUBAFJAP","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":"43948606fa3b83f2e027fad42827f74ea8c4211d4013c0ec02c70cce3055d927","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-28T14:19:59Z","title_canon_sha256":"d5093970cd8207129fe8746072f3cf09c047bd8958227452fcfd786b6b80c51c"},"schema_version":"1.0","source":{"id":"1509.08329","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08329","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08329v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08329","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"J7HUZR5WSK3S","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J7HUZR5WSK3S6KZQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J7HUZR5W","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:9b0c53d5472e2a6f3710f8d750cbd58a4bafbf36e058e212185664f85e3ffc68","target":"graph","created_at":"2026-05-18T01:31:54Z","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 time series. Graph-based SFA (GSFA) is a supervised extension that can solve regression problems if followed by a post-processing regression algorithm. A training graph specifies arbitrary connections between the training samples. The connections in current graphs, however, only depend on the rank of the involved labels. Exploiting the exact label values makes further improvements in estimation accuracy possible.\n  In this article, we propose the exact label learning (ELL) method to c","authors_text":"Alberto N. Escalante-B., Laurenz Wiskott","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-28T14:19:59Z","title":"Theoretical Analysis of the Optimal Free Responses of Graph-Based SFA for the Design of Training Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08329","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:b4995144a9772839569751f1bea4353cb6e569d1d7724e12f7116b6ea2d51c50","target":"record","created_at":"2026-05-18T01:31:54Z","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":"43948606fa3b83f2e027fad42827f74ea8c4211d4013c0ec02c70cce3055d927","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-28T14:19:59Z","title_canon_sha256":"d5093970cd8207129fe8746072f3cf09c047bd8958227452fcfd786b6b80c51c"},"schema_version":"1.0","source":{"id":"1509.08329","kind":"arxiv","version":1}},"canonical_sha256":"4fcf4cc7b692b72f2b3063af4080a903df02d7db36919bf62a5373d656d1cb6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fcf4cc7b692b72f2b3063af4080a903df02d7db36919bf62a5373d656d1cb6e","first_computed_at":"2026-05-18T01:31:54.164621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:54.164621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vyb50zmyV8w8Yj/ReAw0QHz60ZFlxHMyyE1zxew3RLYeVDHCCQr/wiFr6RBRLDdr/+jPDwTnW6iN+6QRMuLABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:54.165081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08329","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4995144a9772839569751f1bea4353cb6e569d1d7724e12f7116b6ea2d51c50","sha256:9b0c53d5472e2a6f3710f8d750cbd58a4bafbf36e058e212185664f85e3ffc68"],"state_sha256":"67b9c69c31308555ede6ee646768564018620ae9d93572b56107f4935c553849"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4PywjfH9Nzg9Y8VrIX+HcqW9EJMfTMsqDegeLa5tbV5sheSvb6/qwRDeRaCiXsGFjaFrmF/0ttRRYK22pgKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:47:40.994817Z","bundle_sha256":"a7279c784df1aa1afc685eae7d1b159b13a4ddbcc618bdbf4439f00b196bd449"}}