{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NVIDBXTCJLS6NVATASRB657SAK","short_pith_number":"pith:NVIDBXTC","schema_version":"1.0","canonical_sha256":"6d5030de624ae5e6d41304a21f77f202ac3f78b2e82efff65a77049d4221d7eb","source":{"kind":"arxiv","id":"2506.01145","version":1},"attestation_state":"computed","paper":{"title":"Slow Feature Analysis on Markov Chains from Goal-Directed Behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eddie Seabrook, Laurenz Wiskott, Merlin Sch\\\"uler","submitted_at":"2025-06-01T19:57:41Z","abstract_excerpt":"Slow Feature Analysis is a unsupervised representation learning method that extracts slowly varying features from temporal data and can be used as a basis for subsequent reinforcement learning. Often, the behavior that generates the data on which the representation is learned is assumed to be a uniform random walk. Less research has focused on using samples generated by goal-directed behavior, as commonly the case in a reinforcement learning setting, to learn a representation. In a spatial setting, goal-directed behavior typically leads to significant differences in state occupancy between sta"},"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":"2506.01145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-01T19:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"482cb6ed73dbf40d3f3b0670552299ee42ec0ca259ecd7d07131b551f88a2497","abstract_canon_sha256":"9c0d63314fc9fe1a8b4ed4e75865ad257229c49b4d3f6f8a0e9322e2f50c875b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:47.243850Z","signature_b64":"rmL3Hc6bnZl9r0NRRM/xZf6we86O/dFWNRG7vER+9B0It6Edctdjc1n8KWjfVSJGBJa9wK9igaR6dNkQ9eSLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d5030de624ae5e6d41304a21f77f202ac3f78b2e82efff65a77049d4221d7eb","last_reissued_at":"2026-07-05T11:13:47.243353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:47.243353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Slow Feature Analysis on Markov Chains from Goal-Directed Behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eddie Seabrook, Laurenz Wiskott, Merlin Sch\\\"uler","submitted_at":"2025-06-01T19:57:41Z","abstract_excerpt":"Slow Feature Analysis is a unsupervised representation learning method that extracts slowly varying features from temporal data and can be used as a basis for subsequent reinforcement learning. Often, the behavior that generates the data on which the representation is learned is assumed to be a uniform random walk. Less research has focused on using samples generated by goal-directed behavior, as commonly the case in a reinforcement learning setting, to learn a representation. In a spatial setting, goal-directed behavior typically leads to significant differences in state occupancy between sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01145","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01145/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.01145","created_at":"2026-07-05T11:13:47.243419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01145v1","created_at":"2026-07-05T11:13:47.243419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01145","created_at":"2026-07-05T11:13:47.243419+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVIDBXTCJLS6","created_at":"2026-07-05T11:13:47.243419+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVIDBXTCJLS6NVAT","created_at":"2026-07-05T11:13:47.243419+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVIDBXTC","created_at":"2026-07-05T11:13:47.243419+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/NVIDBXTCJLS6NVATASRB657SAK","json":"https://pith.science/pith/NVIDBXTCJLS6NVATASRB657SAK.json","graph_json":"https://pith.science/api/pith-number/NVIDBXTCJLS6NVATASRB657SAK/graph.json","events_json":"https://pith.science/api/pith-number/NVIDBXTCJLS6NVATASRB657SAK/events.json","paper":"https://pith.science/paper/NVIDBXTC"},"agent_actions":{"view_html":"https://pith.science/pith/NVIDBXTCJLS6NVATASRB657SAK","download_json":"https://pith.science/pith/NVIDBXTCJLS6NVATASRB657SAK.json","view_paper":"https://pith.science/paper/NVIDBXTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01145&json=true","fetch_graph":"https://pith.science/api/pith-number/NVIDBXTCJLS6NVATASRB657SAK/graph.json","fetch_events":"https://pith.science/api/pith-number/NVIDBXTCJLS6NVATASRB657SAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVIDBXTCJLS6NVATASRB657SAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVIDBXTCJLS6NVATASRB657SAK/action/storage_attestation","attest_author":"https://pith.science/pith/NVIDBXTCJLS6NVATASRB657SAK/action/author_attestation","sign_citation":"https://pith.science/pith/NVIDBXTCJLS6NVATASRB657SAK/action/citation_signature","submit_replication":"https://pith.science/pith/NVIDBXTCJLS6NVATASRB657SAK/action/replication_record"}},"created_at":"2026-07-05T11:13:47.243419+00:00","updated_at":"2026-07-05T11:13:47.243419+00:00"}