{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KTMKXLIULK6TQWWA7FWYSSV3XU","short_pith_number":"pith:KTMKXLIU","canonical_record":{"source":{"id":"1903.12235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-28T19:41:05Z","cross_cats_sorted":["cs.HC","cs.IT","eess.SP","math.IT","stat.ML"],"title_canon_sha256":"0bdcf1ccbcf853311c282a3f1286fba4c8687e7893f0984e9eebbb138ff8ecda","abstract_canon_sha256":"f51703bf1709937eeaa2df3d13b316d24b3fd8c50dd27ed429b0f1b17e5240b3"},"schema_version":"1.0"},"canonical_sha256":"54d8abad145abd385ac0f96d894abbbd19d505fca84f23efe8c62465bc92d255","source":{"kind":"arxiv","id":"1903.12235","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12235","created_at":"2026-05-17T23:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12235v2","created_at":"2026-05-17T23:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12235","created_at":"2026-05-17T23:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"KTMKXLIULK6T","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KTMKXLIULK6TQWWA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KTMKXLIU","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KTMKXLIULK6TQWWA7FWYSSV3XU","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-28T19:41:05Z","cross_cats_sorted":["cs.HC","cs.IT","eess.SP","math.IT","stat.ML"],"title_canon_sha256":"0bdcf1ccbcf853311c282a3f1286fba4c8687e7893f0984e9eebbb138ff8ecda","abstract_canon_sha256":"f51703bf1709937eeaa2df3d13b316d24b3fd8c50dd27ed429b0f1b17e5240b3"},"schema_version":"1.0"},"canonical_sha256":"54d8abad145abd385ac0f96d894abbbd19d505fca84f23efe8c62465bc92d255","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:20.117296Z","signature_b64":"QCNrKVCZnOgyKwtkSyVoEInhgmnbi34ZhpcIqms/Ugck9+XDIKi/oDCLcJu39PO5vHsNh++aQkiDj0yMSq9TAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54d8abad145abd385ac0f96d894abbbd19d505fca84f23efe8c62465bc92d255","last_reissued_at":"2026-05-17T23:49:20.116782Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:20.116782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12235","source_version":2,"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-17T23:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPLKfFqgm4DEcjLau8D7TmJZ1mjJCEKvz/Sk/xuKJEfP2U4uBSTfFUFtgzKNEo/+jgerxofydonyrj+MVUeUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:16:27.395525Z"},"content_sha256":"cde9619a526e802dd642317e380c8feee870868317f28887cae27cb217533cf1","schema_version":"1.0","event_id":"sha256:cde9619a526e802dd642317e380c8feee870868317f28887cae27cb217533cf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KTMKXLIULK6TQWWA7FWYSSV3XU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Theoretic Feature Transformation Learning for Brain Interfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC","cs.IT","eess.SP","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Deniz Erdogmus, Ozan Ozdenizci","submitted_at":"2019-03-28T19:41:05Z","abstract_excerpt":"Objective: A variety of pattern analysis techniques for model training in brain interfaces exploit neural feature dimensionality reduction based on feature ranking and selection heuristics. In the light of broad evidence demonstrating the potential sub-optimality of ranking based feature selection by any criterion, we propose to extend this focus with an information theoretic learning driven feature transformation concept. Methods: We present a maximum mutual information linear transformation (MMI-LinT), and a nonlinear transformation (MMI-NonLinT) framework derived by a general definition of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12235","kind":"arxiv","version":2},"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-17T23:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9kxIvcesZ93gT1u3ScdESCtH/TIolyApJ2qxVJNiAsZ8EoFNAdWG/RgEOAYrq0FuAfxyOI0IKEkU/pvPxpUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:16:27.396196Z"},"content_sha256":"536cbbd2fc23bb0e815f716b4ae674c528a24246e69ed5f997ffd7be98defff2","schema_version":"1.0","event_id":"sha256:536cbbd2fc23bb0e815f716b4ae674c528a24246e69ed5f997ffd7be98defff2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTMKXLIULK6TQWWA7FWYSSV3XU/bundle.json","state_url":"https://pith.science/pith/KTMKXLIULK6TQWWA7FWYSSV3XU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTMKXLIULK6TQWWA7FWYSSV3XU/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-05-26T11:16:27Z","links":{"resolver":"https://pith.science/pith/KTMKXLIULK6TQWWA7FWYSSV3XU","bundle":"https://pith.science/pith/KTMKXLIULK6TQWWA7FWYSSV3XU/bundle.json","state":"https://pith.science/pith/KTMKXLIULK6TQWWA7FWYSSV3XU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTMKXLIULK6TQWWA7FWYSSV3XU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KTMKXLIULK6TQWWA7FWYSSV3XU","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":"f51703bf1709937eeaa2df3d13b316d24b3fd8c50dd27ed429b0f1b17e5240b3","cross_cats_sorted":["cs.HC","cs.IT","eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-28T19:41:05Z","title_canon_sha256":"0bdcf1ccbcf853311c282a3f1286fba4c8687e7893f0984e9eebbb138ff8ecda"},"schema_version":"1.0","source":{"id":"1903.12235","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12235","created_at":"2026-05-17T23:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12235v2","created_at":"2026-05-17T23:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12235","created_at":"2026-05-17T23:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"KTMKXLIULK6T","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KTMKXLIULK6TQWWA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KTMKXLIU","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:536cbbd2fc23bb0e815f716b4ae674c528a24246e69ed5f997ffd7be98defff2","target":"graph","created_at":"2026-05-17T23:49:20Z","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":"Objective: A variety of pattern analysis techniques for model training in brain interfaces exploit neural feature dimensionality reduction based on feature ranking and selection heuristics. In the light of broad evidence demonstrating the potential sub-optimality of ranking based feature selection by any criterion, we propose to extend this focus with an information theoretic learning driven feature transformation concept. Methods: We present a maximum mutual information linear transformation (MMI-LinT), and a nonlinear transformation (MMI-NonLinT) framework derived by a general definition of ","authors_text":"Deniz Erdogmus, Ozan Ozdenizci","cross_cats":["cs.HC","cs.IT","eess.SP","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-28T19:41:05Z","title":"Information Theoretic Feature Transformation Learning for Brain Interfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12235","kind":"arxiv","version":2},"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:cde9619a526e802dd642317e380c8feee870868317f28887cae27cb217533cf1","target":"record","created_at":"2026-05-17T23:49:20Z","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":"f51703bf1709937eeaa2df3d13b316d24b3fd8c50dd27ed429b0f1b17e5240b3","cross_cats_sorted":["cs.HC","cs.IT","eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-28T19:41:05Z","title_canon_sha256":"0bdcf1ccbcf853311c282a3f1286fba4c8687e7893f0984e9eebbb138ff8ecda"},"schema_version":"1.0","source":{"id":"1903.12235","kind":"arxiv","version":2}},"canonical_sha256":"54d8abad145abd385ac0f96d894abbbd19d505fca84f23efe8c62465bc92d255","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54d8abad145abd385ac0f96d894abbbd19d505fca84f23efe8c62465bc92d255","first_computed_at":"2026-05-17T23:49:20.116782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:20.116782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QCNrKVCZnOgyKwtkSyVoEInhgmnbi34ZhpcIqms/Ugck9+XDIKi/oDCLcJu39PO5vHsNh++aQkiDj0yMSq9TAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:20.117296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12235","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cde9619a526e802dd642317e380c8feee870868317f28887cae27cb217533cf1","sha256:536cbbd2fc23bb0e815f716b4ae674c528a24246e69ed5f997ffd7be98defff2"],"state_sha256":"da9f9d1a3611d8b2b0bd78dd8aa170c5e8f9d3e2eb834a8e5740f655a38693ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OE7p7RiDQhijVz6OW42H1h7EVKsZdtmi5HtGbNu2aWI0NA/UDSyOju+EnUsAW4xUm90QzaKtWL3i8ZRyzzRjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:16:27.399835Z","bundle_sha256":"216b01229aa2ba4546daf1f0115291a7cb2d5a04d6ef32220dcf290b2df48a48"}}