{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FPIVYG3JRFHRI63PUCR3OZBLWF","short_pith_number":"pith:FPIVYG3J","schema_version":"1.0","canonical_sha256":"2bd15c1b69894f147b6fa0a3b7642bb16285bb9929b0f920eae2beb43a967338","source":{"kind":"arxiv","id":"1110.0593","version":1},"attestation_state":"computed","paper":{"title":"Two Projection Pursuit Algorithms for Machine Learning under Non-Stationarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Duncan A. J. Blythe","submitted_at":"2011-10-04T07:34:13Z","abstract_excerpt":"This thesis derives, tests and applies two linear projection algorithms for machine learning under non-stationarity. The first finds a direction in a linear space upon which a data set is maximally non-stationary. The second aims to robustify two-way classification against non-stationarity. The algorithm is tested on a key application scenario, namely Brain Computer Interfacing."},"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":"1110.0593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-04T07:34:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9ce5bb4e1fda53cdd00424d3748d47be77e8c6dab729a85f35264410173da044","abstract_canon_sha256":"3008d52d3178a9a0580fec65511564b0c0f03bb1423b20637c79e61fc84b163c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:41.419159Z","signature_b64":"l9v0gjd2epTsbI2snDZYwQBzjn1wmMYmQKm2T1YPszfUkgWt7iFWBKGxt5Upnk75Wb+4dBp4SjOaN1/AOcZrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bd15c1b69894f147b6fa0a3b7642bb16285bb9929b0f920eae2beb43a967338","last_reissued_at":"2026-05-18T04:11:41.418750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:41.418750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Projection Pursuit Algorithms for Machine Learning under Non-Stationarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Duncan A. J. Blythe","submitted_at":"2011-10-04T07:34:13Z","abstract_excerpt":"This thesis derives, tests and applies two linear projection algorithms for machine learning under non-stationarity. The first finds a direction in a linear space upon which a data set is maximally non-stationary. The second aims to robustify two-way classification against non-stationarity. The algorithm is tested on a key application scenario, namely Brain Computer Interfacing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0593","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":"1110.0593","created_at":"2026-05-18T04:11:41.418815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0593v1","created_at":"2026-05-18T04:11:41.418815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0593","created_at":"2026-05-18T04:11:41.418815+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPIVYG3JRFHR","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPIVYG3JRFHRI63P","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPIVYG3J","created_at":"2026-05-18T12:26:28.662955+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/FPIVYG3JRFHRI63PUCR3OZBLWF","json":"https://pith.science/pith/FPIVYG3JRFHRI63PUCR3OZBLWF.json","graph_json":"https://pith.science/api/pith-number/FPIVYG3JRFHRI63PUCR3OZBLWF/graph.json","events_json":"https://pith.science/api/pith-number/FPIVYG3JRFHRI63PUCR3OZBLWF/events.json","paper":"https://pith.science/paper/FPIVYG3J"},"agent_actions":{"view_html":"https://pith.science/pith/FPIVYG3JRFHRI63PUCR3OZBLWF","download_json":"https://pith.science/pith/FPIVYG3JRFHRI63PUCR3OZBLWF.json","view_paper":"https://pith.science/paper/FPIVYG3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0593&json=true","fetch_graph":"https://pith.science/api/pith-number/FPIVYG3JRFHRI63PUCR3OZBLWF/graph.json","fetch_events":"https://pith.science/api/pith-number/FPIVYG3JRFHRI63PUCR3OZBLWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPIVYG3JRFHRI63PUCR3OZBLWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPIVYG3JRFHRI63PUCR3OZBLWF/action/storage_attestation","attest_author":"https://pith.science/pith/FPIVYG3JRFHRI63PUCR3OZBLWF/action/author_attestation","sign_citation":"https://pith.science/pith/FPIVYG3JRFHRI63PUCR3OZBLWF/action/citation_signature","submit_replication":"https://pith.science/pith/FPIVYG3JRFHRI63PUCR3OZBLWF/action/replication_record"}},"created_at":"2026-05-18T04:11:41.418815+00:00","updated_at":"2026-05-18T04:11:41.418815+00:00"}